/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-fb4f59a-m [2022-04-28 03:01:45,953 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:01:45,955 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:01:45,986 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:01:45,986 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:01:45,989 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:01:45,990 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:01:45,991 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:01:45,992 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:01:45,993 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:01:45,994 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:01:45,995 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:01:45,995 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:01:45,996 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:01:45,997 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:01:45,998 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:01:45,998 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:01:45,999 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:01:46,000 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:01:46,001 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:01:46,003 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:01:46,003 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:01:46,004 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:01:46,005 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:01:46,005 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:01:46,008 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:01:46,008 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:01:46,008 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:01:46,009 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:01:46,009 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:01:46,010 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:01:46,010 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:01:46,010 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:01:46,011 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:01:46,012 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:01:46,012 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:01:46,013 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:01:46,013 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:01:46,013 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:01:46,014 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:01:46,014 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:01:46,015 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:01:46,016 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 03:01:46,023 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:01:46,023 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:01:46,024 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:01:46,024 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:01:46,024 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:01:46,025 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:01:46,025 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:01:46,025 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:01:46,025 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:01:46,025 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:01:46,025 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:01:46,025 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:01:46,026 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:01:46,026 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:01:46,026 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:01:46,026 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:01:46,026 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:01:46,026 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:01:46,026 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:01:46,026 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:01:46,027 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:01:46,027 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:01:46,027 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:01:46,027 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:01:46,027 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:01:46,027 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 03:01:46,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:01:46,228 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:01:46,229 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:01:46,230 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:01:46,230 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:01:46,231 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-28 03:01:46,282 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5f63db9b/905b84bbc5ff4d6ebc91a539e8470649/FLAG3b80c8800 [2022-04-28 03:01:46,611 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:01:46,611 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_4-1.c [2022-04-28 03:01:46,615 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5f63db9b/905b84bbc5ff4d6ebc91a539e8470649/FLAG3b80c8800 [2022-04-28 03:01:47,048 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d5f63db9b/905b84bbc5ff4d6ebc91a539e8470649 [2022-04-28 03:01:47,050 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:01:47,051 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:01:47,054 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:01:47,054 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:01:47,059 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:01:47,060 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:01:47" (1/1) ... [2022-04-28 03:01:47,061 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53f201bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:47, skipping insertion in model container [2022-04-28 03:01:47,061 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:01:47" (1/1) ... [2022-04-28 03:01:47,066 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:01:47,076 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:01:47,234 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-28 03:01:47,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:01:47,266 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:01:47,281 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-28 03:01:47,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:01:47,299 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:01:47,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:47 WrapperNode [2022-04-28 03:01:47,300 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:01:47,301 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:01:47,301 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:01:47,301 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:01:47,310 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:47" (1/1) ... [2022-04-28 03:01:47,310 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:47" (1/1) ... [2022-04-28 03:01:47,317 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:47" (1/1) ... [2022-04-28 03:01:47,317 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:47" (1/1) ... [2022-04-28 03:01:47,327 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:47" (1/1) ... [2022-04-28 03:01:47,331 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:47" (1/1) ... [2022-04-28 03:01:47,334 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:47" (1/1) ... [2022-04-28 03:01:47,337 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:01:47,338 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:01:47,338 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:01:47,338 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:01:47,339 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:47" (1/1) ... [2022-04-28 03:01:47,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:01:47,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:01:47,369 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 03:01:47,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 03:01:47,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:01:47,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:01:47,404 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:01:47,404 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 03:01:47,404 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:01:47,404 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:01:47,405 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:01:47,405 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:01:47,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:01:47,405 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:01:47,405 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:01:47,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:01:47,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:01:47,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:01:47,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:01:47,406 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:01:47,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:01:47,454 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:01:47,456 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:01:47,529 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:01:47,535 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:01:47,535 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 03:01:47,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:01:47 BoogieIcfgContainer [2022-04-28 03:01:47,537 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:01:47,538 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:01:47,538 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:01:47,542 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:01:47,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:01:47" (1/3) ... [2022-04-28 03:01:47,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17cf0f5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:01:47, skipping insertion in model container [2022-04-28 03:01:47,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:01:47" (2/3) ... [2022-04-28 03:01:47,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17cf0f5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:01:47, skipping insertion in model container [2022-04-28 03:01:47,543 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:01:47" (3/3) ... [2022-04-28 03:01:47,548 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_4-1.c [2022-04-28 03:01:47,561 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:01:47,561 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 03:01:47,598 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:01:47,604 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@57ff9a36, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@41844f73 [2022-04-28 03:01:47,604 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 03:01:47,611 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 03:01:47,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 03:01:47,617 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:01:47,617 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:01:47,618 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:01:47,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:01:47,622 INFO L85 PathProgramCache]: Analyzing trace with hash -219174432, now seen corresponding path program 1 times [2022-04-28 03:01:47,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:47,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1190442079] [2022-04-28 03:01:47,638 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:01:47,638 INFO L85 PathProgramCache]: Analyzing trace with hash -219174432, now seen corresponding path program 2 times [2022-04-28 03:01:47,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:47,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609082234] [2022-04-28 03:01:47,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:47,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:47,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:47,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:01:47,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:47,813 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-28 03:01:47,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-28 03:01:47,813 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #34#return; {21#true} is VALID [2022-04-28 03:01:47,816 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:01:47,816 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-28 03:01:47,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-28 03:01:47,818 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #34#return; {21#true} is VALID [2022-04-28 03:01:47,818 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret4 := main(); {21#true} is VALID [2022-04-28 03:01:47,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} ~x~0 := 268435441; {21#true} is VALID [2022-04-28 03:01:47,819 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#true} assume !true; {22#false} is VALID [2022-04-28 03:01:47,819 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-28 03:01:47,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2022-04-28 03:01:47,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {22#false} assume 0 == ~cond; {22#false} is VALID [2022-04-28 03:01:47,820 INFO L290 TraceCheckUtils]: 10: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-04-28 03:01:47,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:01:47,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:01:47,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609082234] [2022-04-28 03:01:47,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609082234] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:01:47,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:01:47,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:01:47,828 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:01:47,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1190442079] [2022-04-28 03:01:47,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1190442079] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:01:47,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:01:47,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:01:47,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110361536] [2022-04-28 03:01:47,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:01:47,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 03:01:47,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:01:47,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:47,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:47,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 03:01:47,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:47,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 03:01:47,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 03:01:47,906 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:47,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:47,993 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-28 03:01:47,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 03:01:47,994 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 03:01:47,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:01:47,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:48,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-28 03:01:48,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:48,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-28 03:01:48,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2022-04-28 03:01:48,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:48,060 INFO L225 Difference]: With dead ends: 29 [2022-04-28 03:01:48,061 INFO L226 Difference]: Without dead ends: 12 [2022-04-28 03:01:48,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 03:01:48,066 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:01:48,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 20 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:01:48,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-04-28 03:01:48,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-04-28 03:01:48,094 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:01:48,094 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:48,095 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:48,095 INFO L87 Difference]: Start difference. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:48,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:48,098 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-28 03:01:48,099 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-28 03:01:48,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:48,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:48,099 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12 states. [2022-04-28 03:01:48,100 INFO L87 Difference]: Start difference. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12 states. [2022-04-28 03:01:48,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:48,102 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-28 03:01:48,102 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-28 03:01:48,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:48,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:48,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:01:48,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:01:48,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:48,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-04-28 03:01:48,105 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 11 [2022-04-28 03:01:48,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:01:48,106 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-04-28 03:01:48,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:48,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 12 transitions. [2022-04-28 03:01:48,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:48,120 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-28 03:01:48,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 03:01:48,120 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:01:48,121 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:01:48,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 03:01:48,121 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:01:48,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:01:48,122 INFO L85 PathProgramCache]: Analyzing trace with hash -222868516, now seen corresponding path program 1 times [2022-04-28 03:01:48,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:48,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [878045672] [2022-04-28 03:01:48,123 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:01:48,123 INFO L85 PathProgramCache]: Analyzing trace with hash -222868516, now seen corresponding path program 2 times [2022-04-28 03:01:48,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:48,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605673619] [2022-04-28 03:01:48,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:48,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:48,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:01:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:48,229 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-28 03:01:48,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {135#true} assume true; {135#true} is VALID [2022-04-28 03:01:48,230 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {135#true} {135#true} #34#return; {135#true} is VALID [2022-04-28 03:01:48,231 INFO L272 TraceCheckUtils]: 0: Hoare triple {135#true} call ULTIMATE.init(); {141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:01:48,231 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-28 03:01:48,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {135#true} assume true; {135#true} is VALID [2022-04-28 03:01:48,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {135#true} {135#true} #34#return; {135#true} is VALID [2022-04-28 03:01:48,231 INFO L272 TraceCheckUtils]: 4: Hoare triple {135#true} call #t~ret4 := main(); {135#true} is VALID [2022-04-28 03:01:48,232 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-28 03:01:48,233 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-28 03:01:48,233 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-28 03:01:48,233 INFO L290 TraceCheckUtils]: 8: Hoare triple {136#false} ~cond := #in~cond; {136#false} is VALID [2022-04-28 03:01:48,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {136#false} assume 0 == ~cond; {136#false} is VALID [2022-04-28 03:01:48,234 INFO L290 TraceCheckUtils]: 10: Hoare triple {136#false} assume !false; {136#false} is VALID [2022-04-28 03:01:48,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:01:48,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:01:48,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605673619] [2022-04-28 03:01:48,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605673619] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:01:48,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:01:48,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:01:48,235 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:01:48,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [878045672] [2022-04-28 03:01:48,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [878045672] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:01:48,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:01:48,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:01:48,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355906946] [2022-04-28 03:01:48,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:01:48,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 03:01:48,237 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:01:48,237 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:48,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:48,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 03:01:48,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:48,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 03:01:48,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 03:01:48,250 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:48,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:48,314 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-28 03:01:48,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 03:01:48,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 03:01:48,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:01:48,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:48,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-28 03:01:48,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:48,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-28 03:01:48,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 18 transitions. [2022-04-28 03:01:48,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:48,347 INFO L225 Difference]: With dead ends: 18 [2022-04-28 03:01:48,347 INFO L226 Difference]: Without dead ends: 13 [2022-04-28 03:01:48,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 03:01:48,349 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:01:48,350 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:01:48,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-28 03:01:48,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-28 03:01:48,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:01:48,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:48,356 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:48,356 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:48,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:48,357 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-28 03:01:48,358 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-28 03:01:48,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:48,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:48,358 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-28 03:01:48,358 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-28 03:01:48,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:48,360 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-28 03:01:48,360 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-28 03:01:48,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:48,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:48,360 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:01:48,360 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:01:48,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:48,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-28 03:01:48,362 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-28 03:01:48,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:01:48,362 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-28 03:01:48,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:48,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 13 transitions. [2022-04-28 03:01:48,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:48,377 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-28 03:01:48,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 03:01:48,379 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:01:48,379 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:01:48,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 03:01:48,383 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:01:48,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:01:48,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1717471862, now seen corresponding path program 1 times [2022-04-28 03:01:48,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:48,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [984894373] [2022-04-28 03:01:51,235 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:01:51,238 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:01:51,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1867307785, now seen corresponding path program 1 times [2022-04-28 03:01:51,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:51,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043309471] [2022-04-28 03:01:51,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:51,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:51,255 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-28 03:01:51,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:01:51,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1571096103] [2022-04-28 03:01:51,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:51,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:51,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:01:51,300 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:01:51,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 03:01:51,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:01:51,376 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:01:51,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:01:51,406 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:01:51,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1717471862, now seen corresponding path program 2 times [2022-04-28 03:01:51,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:51,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049897411] [2022-04-28 03:01:51,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:51,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:51,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:51,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:01:51,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:51,508 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-28 03:01:51,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-28 03:01:51,508 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-28 03:01:51,510 INFO L272 TraceCheckUtils]: 0: Hoare triple {234#true} call ULTIMATE.init(); {241#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:01:51,510 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-28 03:01:51,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-28 03:01:51,510 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-28 03:01:51,510 INFO L272 TraceCheckUtils]: 4: Hoare triple {234#true} call #t~ret4 := main(); {234#true} is VALID [2022-04-28 03:01:51,511 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-28 03:01:51,512 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-28 03:01:51,512 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-28 03:01:51,513 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-28 03:01:51,513 INFO L290 TraceCheckUtils]: 9: Hoare triple {235#false} ~cond := #in~cond; {235#false} is VALID [2022-04-28 03:01:51,514 INFO L290 TraceCheckUtils]: 10: Hoare triple {235#false} assume 0 == ~cond; {235#false} is VALID [2022-04-28 03:01:51,514 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#false} assume !false; {235#false} is VALID [2022-04-28 03:01:51,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:01:51,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:01:51,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049897411] [2022-04-28 03:01:51,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049897411] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:01:51,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641373842] [2022-04-28 03:01:51,515 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:01:51,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:51,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:01:51,523 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:01:51,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 03:01:51,615 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:01:51,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:01:51,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:01:51,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:51,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:01:51,728 INFO L272 TraceCheckUtils]: 0: Hoare triple {234#true} call ULTIMATE.init(); {234#true} is VALID [2022-04-28 03:01:51,729 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-28 03:01:51,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-28 03:01:51,729 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-28 03:01:51,729 INFO L272 TraceCheckUtils]: 4: Hoare triple {234#true} call #t~ret4 := main(); {234#true} is VALID [2022-04-28 03:01:51,730 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-28 03:01:51,731 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-28 03:01:51,731 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-28 03:01:51,732 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-28 03:01:51,732 INFO L290 TraceCheckUtils]: 9: Hoare triple {235#false} ~cond := #in~cond; {235#false} is VALID [2022-04-28 03:01:51,732 INFO L290 TraceCheckUtils]: 10: Hoare triple {235#false} assume 0 == ~cond; {235#false} is VALID [2022-04-28 03:01:51,732 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#false} assume !false; {235#false} is VALID [2022-04-28 03:01:51,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:01:51,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:01:51,936 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#false} assume !false; {235#false} is VALID [2022-04-28 03:01:51,937 INFO L290 TraceCheckUtils]: 10: Hoare triple {282#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {235#false} is VALID [2022-04-28 03:01:51,937 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-28 03:01:51,938 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-28 03:01:51,939 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-28 03:01:51,942 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-28 03:01:51,943 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-28 03:01:51,943 INFO L272 TraceCheckUtils]: 4: Hoare triple {234#true} call #t~ret4 := main(); {234#true} is VALID [2022-04-28 03:01:51,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-28 03:01:51,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-28 03:01:51,944 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-28 03:01:51,944 INFO L272 TraceCheckUtils]: 0: Hoare triple {234#true} call ULTIMATE.init(); {234#true} is VALID [2022-04-28 03:01:51,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:01:51,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641373842] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:01:51,945 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:01:51,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 7] total 11 [2022-04-28 03:01:51,947 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:01:51,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [984894373] [2022-04-28 03:01:51,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [984894373] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:01:51,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:01:51,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:01:51,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412923684] [2022-04-28 03:01:51,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:01:51,949 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 03:01:51,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:01:51,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:51,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:51,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 03:01:51,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:51,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 03:01:51,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-28 03:01:51,964 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:52,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:52,058 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-28 03:01:52,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 03:01:52,059 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 03:01:52,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:01:52,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:52,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-28 03:01:52,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:52,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-28 03:01:52,062 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2022-04-28 03:01:52,079 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:52,080 INFO L225 Difference]: With dead ends: 19 [2022-04-28 03:01:52,080 INFO L226 Difference]: Without dead ends: 14 [2022-04-28 03:01:52,080 INFO L412 NwaCegarLoop]: 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-28 03:01:52,081 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:01:52,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:01:52,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-28 03:01:52,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-28 03:01:52,093 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:01:52,095 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:52,095 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:52,096 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:52,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:52,097 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-28 03:01:52,097 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 03:01:52,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:52,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:52,098 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-28 03:01:52,098 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-28 03:01:52,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:52,099 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-28 03:01:52,099 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 03:01:52,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:52,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:52,099 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:01:52,100 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:01:52,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:52,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-28 03:01:52,101 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-28 03:01:52,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:01:52,101 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-28 03:01:52,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:52,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-28 03:01:52,118 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:52,119 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 03:01:52,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 03:01:52,123 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:01:52,123 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:01:52,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 03:01:52,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 03:01:52,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:52,540 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:01:52,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:01:52,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1738481436, now seen corresponding path program 3 times [2022-04-28 03:01:52,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:52,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [998827162] [2022-04-28 03:01:52,738 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-28 03:01:52,740 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:01:52,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1808202441, now seen corresponding path program 1 times [2022-04-28 03:01:52,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:52,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881158560] [2022-04-28 03:01:52,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:52,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:52,756 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-28 03:01:52,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:01:52,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1398572882] [2022-04-28 03:01:52,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:52,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:52,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:01:52,774 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:01:52,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 03:01:52,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:01:52,840 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:01:52,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:01:52,855 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:01:52,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1738481436, now seen corresponding path program 4 times [2022-04-28 03:01:52,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:52,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020258952] [2022-04-28 03:01:52,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:52,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:52,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:52,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:01:52,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:52,978 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-28 03:01:52,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {417#true} assume true; {417#true} is VALID [2022-04-28 03:01:52,979 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {417#true} {417#true} #34#return; {417#true} is VALID [2022-04-28 03:01:52,987 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-28 03:01:52,987 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-28 03:01:52,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {417#true} assume true; {417#true} is VALID [2022-04-28 03:01:52,988 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {417#true} {417#true} #34#return; {417#true} is VALID [2022-04-28 03:01:52,988 INFO L272 TraceCheckUtils]: 4: Hoare triple {417#true} call #t~ret4 := main(); {417#true} is VALID [2022-04-28 03:01:52,989 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-28 03:01:52,989 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-28 03:01:52,990 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-28 03:01:52,991 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-28 03:01:52,991 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-28 03:01:52,991 INFO L290 TraceCheckUtils]: 10: Hoare triple {418#false} ~cond := #in~cond; {418#false} is VALID [2022-04-28 03:01:52,991 INFO L290 TraceCheckUtils]: 11: Hoare triple {418#false} assume 0 == ~cond; {418#false} is VALID [2022-04-28 03:01:52,992 INFO L290 TraceCheckUtils]: 12: Hoare triple {418#false} assume !false; {418#false} is VALID [2022-04-28 03:01:52,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:01:52,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:01:52,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020258952] [2022-04-28 03:01:52,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020258952] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:01:52,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [208433644] [2022-04-28 03:01:52,993 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:01:52,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:52,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:01:52,994 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:01:52,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 03:01:53,023 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:01:53,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:01:53,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 03:01:53,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:53,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:01:53,238 INFO L272 TraceCheckUtils]: 0: Hoare triple {417#true} call ULTIMATE.init(); {417#true} is VALID [2022-04-28 03:01:53,238 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-28 03:01:53,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {417#true} assume true; {417#true} is VALID [2022-04-28 03:01:53,238 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {417#true} {417#true} #34#return; {417#true} is VALID [2022-04-28 03:01:53,239 INFO L272 TraceCheckUtils]: 4: Hoare triple {417#true} call #t~ret4 := main(); {417#true} is VALID [2022-04-28 03:01:53,239 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-28 03:01:53,240 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-28 03:01:53,241 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-28 03:01:53,242 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-28 03:01:53,242 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-28 03:01:53,243 INFO L290 TraceCheckUtils]: 10: Hoare triple {418#false} ~cond := #in~cond; {418#false} is VALID [2022-04-28 03:01:53,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {418#false} assume 0 == ~cond; {418#false} is VALID [2022-04-28 03:01:53,243 INFO L290 TraceCheckUtils]: 12: Hoare triple {418#false} assume !false; {418#false} is VALID [2022-04-28 03:01:53,243 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:01:53,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:01:53,337 INFO L290 TraceCheckUtils]: 12: Hoare triple {418#false} assume !false; {418#false} is VALID [2022-04-28 03:01:53,337 INFO L290 TraceCheckUtils]: 11: Hoare triple {418#false} assume 0 == ~cond; {418#false} is VALID [2022-04-28 03:01:53,338 INFO L290 TraceCheckUtils]: 10: Hoare triple {418#false} ~cond := #in~cond; {418#false} is VALID [2022-04-28 03:01:53,338 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-28 03:01:53,338 INFO L290 TraceCheckUtils]: 8: Hoare triple {478#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {418#false} is VALID [2022-04-28 03:01:53,340 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-28 03:01:53,343 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-28 03:01:53,344 INFO L290 TraceCheckUtils]: 5: Hoare triple {417#true} ~x~0 := 268435441; {486#(< 1 (mod (+ 4294967292 main_~x~0) 4294967296))} is VALID [2022-04-28 03:01:53,344 INFO L272 TraceCheckUtils]: 4: Hoare triple {417#true} call #t~ret4 := main(); {417#true} is VALID [2022-04-28 03:01:53,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {417#true} {417#true} #34#return; {417#true} is VALID [2022-04-28 03:01:53,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {417#true} assume true; {417#true} is VALID [2022-04-28 03:01:53,345 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-28 03:01:53,345 INFO L272 TraceCheckUtils]: 0: Hoare triple {417#true} call ULTIMATE.init(); {417#true} is VALID [2022-04-28 03:01:53,345 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:01:53,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [208433644] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:01:53,346 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:01:53,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-28 03:01:53,346 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:01:53,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [998827162] [2022-04-28 03:01:53,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [998827162] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:01:53,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:01:53,346 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:01:53,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319539196] [2022-04-28 03:01:53,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:01:53,347 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 03:01:53,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:01:53,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:53,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:53,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:01:53,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:53,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:01:53,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-28 03:01:53,362 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:53,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:53,472 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 03:01:53,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:01:53,472 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 03:01:53,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:01:53,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:53,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-28 03:01:53,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:53,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-28 03:01:53,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 20 transitions. [2022-04-28 03:01:53,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:53,507 INFO L225 Difference]: With dead ends: 20 [2022-04-28 03:01:53,507 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 03:01:53,508 INFO L412 NwaCegarLoop]: 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-28 03:01:53,510 INFO L413 NwaCegarLoop]: 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-28 03:01:53,511 INFO L414 NwaCegarLoop]: 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-28 03:01:53,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 03:01:53,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-28 03:01:53,521 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:01:53,522 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:53,522 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:53,522 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:53,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:53,524 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 03:01:53,524 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 03:01:53,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:53,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:53,525 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 03:01:53,525 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 03:01:53,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:53,526 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 03:01:53,526 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 03:01:53,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:53,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:53,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:01:53,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:01:53,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:53,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-28 03:01:53,533 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-28 03:01:53,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:01:53,533 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-28 03:01:53,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:53,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-28 03:01:53,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:53,547 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 03:01:53,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 03:01:53,548 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:01:53,548 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:01:53,571 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 03:01:53,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 03:01:53,963 WARN L477 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-28 03:01:53,964 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:01:53,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:01:53,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1905189066, now seen corresponding path program 5 times [2022-04-28 03:01:53,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:53,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1394465637] [2022-04-28 03:01:54,146 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-28 03:01:54,148 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:01:54,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1749097097, now seen corresponding path program 1 times [2022-04-28 03:01:54,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:54,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762958552] [2022-04-28 03:01:54,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:54,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:54,163 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-28 03:01:54,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:01:54,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [956808604] [2022-04-28 03:01:54,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:54,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:54,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:01:54,178 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:01:54,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 03:01:54,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:01:54,222 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:01:54,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:01:54,253 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:01:54,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1905189066, now seen corresponding path program 6 times [2022-04-28 03:01:54,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:54,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668820628] [2022-04-28 03:01:54,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:54,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:54,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:54,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:01:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:54,353 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-28 03:01:54,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {613#true} assume true; {613#true} is VALID [2022-04-28 03:01:54,353 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {613#true} {613#true} #34#return; {613#true} is VALID [2022-04-28 03:01:54,354 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-28 03:01:54,354 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-28 03:01:54,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {613#true} assume true; {613#true} is VALID [2022-04-28 03:01:54,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {613#true} {613#true} #34#return; {613#true} is VALID [2022-04-28 03:01:54,356 INFO L272 TraceCheckUtils]: 4: Hoare triple {613#true} call #t~ret4 := main(); {613#true} is VALID [2022-04-28 03:01:54,357 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-28 03:01:54,358 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-28 03:01:54,366 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-28 03:01:54,367 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-28 03:01:54,370 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-28 03:01:54,370 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-28 03:01:54,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {614#false} ~cond := #in~cond; {614#false} is VALID [2022-04-28 03:01:54,370 INFO L290 TraceCheckUtils]: 12: Hoare triple {614#false} assume 0 == ~cond; {614#false} is VALID [2022-04-28 03:01:54,370 INFO L290 TraceCheckUtils]: 13: Hoare triple {614#false} assume !false; {614#false} is VALID [2022-04-28 03:01:54,370 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:01:54,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:01:54,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668820628] [2022-04-28 03:01:54,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668820628] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:01:54,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473159684] [2022-04-28 03:01:54,371 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:01:54,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:54,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:01:54,376 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:01:54,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 03:01:54,413 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 03:01:54,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:01:54,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 03:01:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:54,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:01:54,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {613#true} call ULTIMATE.init(); {613#true} is VALID [2022-04-28 03:01:54,502 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-28 03:01:54,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {613#true} assume true; {613#true} is VALID [2022-04-28 03:01:54,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {613#true} {613#true} #34#return; {613#true} is VALID [2022-04-28 03:01:54,503 INFO L272 TraceCheckUtils]: 4: Hoare triple {613#true} call #t~ret4 := main(); {613#true} is VALID [2022-04-28 03:01:54,503 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-28 03:01:54,504 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-28 03:01:54,505 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-28 03:01:54,505 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-28 03:01:54,506 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-28 03:01:54,506 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-28 03:01:54,506 INFO L290 TraceCheckUtils]: 11: Hoare triple {614#false} ~cond := #in~cond; {614#false} is VALID [2022-04-28 03:01:54,506 INFO L290 TraceCheckUtils]: 12: Hoare triple {614#false} assume 0 == ~cond; {614#false} is VALID [2022-04-28 03:01:54,506 INFO L290 TraceCheckUtils]: 13: Hoare triple {614#false} assume !false; {614#false} is VALID [2022-04-28 03:01:54,507 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:01:54,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:01:54,718 INFO L290 TraceCheckUtils]: 13: Hoare triple {614#false} assume !false; {614#false} is VALID [2022-04-28 03:01:54,719 INFO L290 TraceCheckUtils]: 12: Hoare triple {669#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {614#false} is VALID [2022-04-28 03:01:54,719 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-28 03:01:54,720 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-28 03:01:54,720 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-28 03:01:54,722 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-28 03:01:54,724 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-28 03:01:54,725 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-28 03:01:54,725 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-28 03:01:54,726 INFO L272 TraceCheckUtils]: 4: Hoare triple {613#true} call #t~ret4 := main(); {613#true} is VALID [2022-04-28 03:01:54,726 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {613#true} {613#true} #34#return; {613#true} is VALID [2022-04-28 03:01:54,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {613#true} assume true; {613#true} is VALID [2022-04-28 03:01:54,726 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-28 03:01:54,726 INFO L272 TraceCheckUtils]: 0: Hoare triple {613#true} call ULTIMATE.init(); {613#true} is VALID [2022-04-28 03:01:54,726 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:01:54,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473159684] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:01:54,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:01:54,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 9] total 15 [2022-04-28 03:01:54,727 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:01:54,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1394465637] [2022-04-28 03:01:54,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1394465637] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:01:54,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:01:54,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:01:54,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95069885] [2022-04-28 03:01:54,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:01:54,728 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 03:01:54,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:01:54,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:54,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:54,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 03:01:54,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:54,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 03:01:54,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-04-28 03:01:54,744 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:54,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:54,876 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-28 03:01:54,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:01:54,877 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 03:01:54,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:01:54,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:54,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-28 03:01:54,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:54,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-28 03:01:54,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 21 transitions. [2022-04-28 03:01:54,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:54,903 INFO L225 Difference]: With dead ends: 21 [2022-04-28 03:01:54,903 INFO L226 Difference]: Without dead ends: 16 [2022-04-28 03:01:54,904 INFO L412 NwaCegarLoop]: 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-28 03:01:54,904 INFO L413 NwaCegarLoop]: 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-28 03:01:54,904 INFO L414 NwaCegarLoop]: 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-28 03:01:54,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-28 03:01:54,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-28 03:01:54,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:01:54,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:54,920 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:54,921 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:54,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:54,923 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-28 03:01:54,923 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 03:01:54,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:54,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:54,923 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-28 03:01:54,924 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-28 03:01:54,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:54,926 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-28 03:01:54,926 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 03:01:54,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:54,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:54,927 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:01:54,927 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:01:54,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:54,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-28 03:01:54,930 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2022-04-28 03:01:54,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:01:54,930 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-28 03:01:54,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:54,930 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 16 transitions. [2022-04-28 03:01:54,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:54,947 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 03:01:54,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 03:01:54,947 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:01:54,948 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:01:54,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 03:01:55,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 03:01:55,357 WARN L477 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-28 03:01:55,357 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:01:55,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:01:55,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1105142364, now seen corresponding path program 7 times [2022-04-28 03:01:55,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:55,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [399396831] [2022-04-28 03:01:55,570 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:01:55,572 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:01:55,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1689991753, now seen corresponding path program 1 times [2022-04-28 03:01:55,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:55,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318475231] [2022-04-28 03:01:55,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:55,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:55,583 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-28 03:01:55,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:01:55,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1972708704] [2022-04-28 03:01:55,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:55,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:55,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:01:55,597 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:01:55,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 03:01:55,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:01:55,639 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:01:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:01:55,671 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:01:55,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1105142364, now seen corresponding path program 8 times [2022-04-28 03:01:55,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:55,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142436340] [2022-04-28 03:01:55,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:55,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:55,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:55,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:01:55,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:55,794 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-28 03:01:55,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {828#true} assume true; {828#true} is VALID [2022-04-28 03:01:55,794 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {828#true} {828#true} #34#return; {828#true} is VALID [2022-04-28 03:01:55,795 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-28 03:01:55,795 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-28 03:01:55,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {828#true} assume true; {828#true} is VALID [2022-04-28 03:01:55,796 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {828#true} {828#true} #34#return; {828#true} is VALID [2022-04-28 03:01:55,796 INFO L272 TraceCheckUtils]: 4: Hoare triple {828#true} call #t~ret4 := main(); {828#true} is VALID [2022-04-28 03:01:55,796 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-28 03:01:55,797 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-28 03:01:55,798 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-28 03:01:55,798 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-28 03:01:55,799 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-28 03:01:55,800 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-28 03:01:55,800 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-28 03:01:55,800 INFO L290 TraceCheckUtils]: 12: Hoare triple {829#false} ~cond := #in~cond; {829#false} is VALID [2022-04-28 03:01:55,800 INFO L290 TraceCheckUtils]: 13: Hoare triple {829#false} assume 0 == ~cond; {829#false} is VALID [2022-04-28 03:01:55,800 INFO L290 TraceCheckUtils]: 14: Hoare triple {829#false} assume !false; {829#false} is VALID [2022-04-28 03:01:55,800 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:01:55,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:01:55,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142436340] [2022-04-28 03:01:55,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142436340] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:01:55,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562903268] [2022-04-28 03:01:55,801 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:01:55,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:55,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:01:55,802 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:01:55,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 03:01:55,832 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:01:55,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:01:55,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 03:01:55,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:55,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:01:55,956 INFO L272 TraceCheckUtils]: 0: Hoare triple {828#true} call ULTIMATE.init(); {828#true} is VALID [2022-04-28 03:01:55,956 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-28 03:01:55,956 INFO L290 TraceCheckUtils]: 2: Hoare triple {828#true} assume true; {828#true} is VALID [2022-04-28 03:01:55,956 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {828#true} {828#true} #34#return; {828#true} is VALID [2022-04-28 03:01:55,957 INFO L272 TraceCheckUtils]: 4: Hoare triple {828#true} call #t~ret4 := main(); {828#true} is VALID [2022-04-28 03:01:55,957 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-28 03:01:55,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-28 03:01:55,958 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-28 03:01:55,959 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-28 03:01:55,959 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-28 03:01:55,961 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-28 03:01:55,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-28 03:01:55,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {829#false} ~cond := #in~cond; {829#false} is VALID [2022-04-28 03:01:55,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {829#false} assume 0 == ~cond; {829#false} is VALID [2022-04-28 03:01:55,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {829#false} assume !false; {829#false} is VALID [2022-04-28 03:01:55,962 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:01:55,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:01:56,217 INFO L290 TraceCheckUtils]: 14: Hoare triple {829#false} assume !false; {829#false} is VALID [2022-04-28 03:01:56,218 INFO L290 TraceCheckUtils]: 13: Hoare triple {888#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {829#false} is VALID [2022-04-28 03:01:56,218 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-28 03:01:56,219 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-28 03:01:56,219 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-28 03:01:56,222 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-28 03:01:56,223 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-28 03:01:56,224 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-28 03:01:56,225 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-28 03:01:56,226 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-28 03:01:56,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {828#true} call #t~ret4 := main(); {828#true} is VALID [2022-04-28 03:01:56,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {828#true} {828#true} #34#return; {828#true} is VALID [2022-04-28 03:01:56,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {828#true} assume true; {828#true} is VALID [2022-04-28 03:01:56,226 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-28 03:01:56,226 INFO L272 TraceCheckUtils]: 0: Hoare triple {828#true} call ULTIMATE.init(); {828#true} is VALID [2022-04-28 03:01:56,227 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:01:56,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562903268] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:01:56,227 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:01:56,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 10] total 17 [2022-04-28 03:01:56,227 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:01:56,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [399396831] [2022-04-28 03:01:56,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [399396831] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:01:56,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:01:56,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:01:56,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743165472] [2022-04-28 03:01:56,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:01:56,228 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 03:01:56,228 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:01:56,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:56,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:56,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:01:56,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:56,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:01:56,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2022-04-28 03:01:56,245 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:56,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:56,412 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 03:01:56,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:01:56,412 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 03:01:56,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:01:56,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:56,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-28 03:01:56,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:56,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-28 03:01:56,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 22 transitions. [2022-04-28 03:01:56,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:56,441 INFO L225 Difference]: With dead ends: 22 [2022-04-28 03:01:56,441 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 03:01:56,442 INFO L412 NwaCegarLoop]: 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-28 03:01:56,442 INFO L413 NwaCegarLoop]: 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-28 03:01:56,442 INFO L414 NwaCegarLoop]: 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-28 03:01:56,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 03:01:56,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 03:01:56,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:01:56,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:56,452 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:56,452 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:56,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:56,453 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-28 03:01:56,453 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 03:01:56,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:56,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:56,453 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 03:01:56,453 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 03:01:56,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:56,454 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-28 03:01:56,454 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 03:01:56,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:56,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:56,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:01:56,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:01:56,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:56,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-28 03:01:56,455 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2022-04-28 03:01:56,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:01:56,456 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-28 03:01:56,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:56,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2022-04-28 03:01:56,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:56,474 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 03:01:56,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 03:01:56,475 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:01:56,475 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:01:56,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 03:01:56,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 03:01:56,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8,SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:56,884 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:01:56,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:01:56,884 INFO L85 PathProgramCache]: Analyzing trace with hash -63863818, now seen corresponding path program 9 times [2022-04-28 03:01:56,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:56,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1587907460] [2022-04-28 03:01:57,035 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-28 03:01:57,037 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:01:57,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1630886409, now seen corresponding path program 1 times [2022-04-28 03:01:57,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:57,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892962989] [2022-04-28 03:01:57,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:57,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:57,048 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-28 03:01:57,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:01:57,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [593210029] [2022-04-28 03:01:57,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:57,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:57,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:01:57,060 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:01:57,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 03:01:57,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:01:57,123 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:01:57,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:01:57,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:01:57,139 INFO L85 PathProgramCache]: Analyzing trace with hash -63863818, now seen corresponding path program 10 times [2022-04-28 03:01:57,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:57,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075987645] [2022-04-28 03:01:57,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:57,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:57,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:57,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:01:57,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:57,264 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-28 03:01:57,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {1059#true} assume true; {1059#true} is VALID [2022-04-28 03:01:57,264 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1059#true} {1059#true} #34#return; {1059#true} is VALID [2022-04-28 03:01:57,264 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-28 03:01:57,264 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-28 03:01:57,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {1059#true} assume true; {1059#true} is VALID [2022-04-28 03:01:57,265 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1059#true} {1059#true} #34#return; {1059#true} is VALID [2022-04-28 03:01:57,265 INFO L272 TraceCheckUtils]: 4: Hoare triple {1059#true} call #t~ret4 := main(); {1059#true} is VALID [2022-04-28 03:01:57,265 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-28 03:01:57,266 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-28 03:01:57,267 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-28 03:01:57,268 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-28 03:01:57,268 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-28 03:01:57,269 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-28 03:01:57,269 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-28 03:01:57,269 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-28 03:01:57,269 INFO L290 TraceCheckUtils]: 13: Hoare triple {1060#false} ~cond := #in~cond; {1060#false} is VALID [2022-04-28 03:01:57,269 INFO L290 TraceCheckUtils]: 14: Hoare triple {1060#false} assume 0 == ~cond; {1060#false} is VALID [2022-04-28 03:01:57,270 INFO L290 TraceCheckUtils]: 15: Hoare triple {1060#false} assume !false; {1060#false} is VALID [2022-04-28 03:01:57,270 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:01:57,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:01:57,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075987645] [2022-04-28 03:01:57,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075987645] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:01:57,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497899823] [2022-04-28 03:01:57,270 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:01:57,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:57,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:01:57,271 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:01:57,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 03:01:57,299 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:01:57,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:01:57,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 03:01:57,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:57,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:01:57,507 INFO L272 TraceCheckUtils]: 0: Hoare triple {1059#true} call ULTIMATE.init(); {1059#true} is VALID [2022-04-28 03:01:57,507 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-28 03:01:57,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {1059#true} assume true; {1059#true} is VALID [2022-04-28 03:01:57,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1059#true} {1059#true} #34#return; {1059#true} is VALID [2022-04-28 03:01:57,508 INFO L272 TraceCheckUtils]: 4: Hoare triple {1059#true} call #t~ret4 := main(); {1059#true} is VALID [2022-04-28 03:01:57,508 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-28 03:01:57,509 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-28 03:01:57,510 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-28 03:01:57,510 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-28 03:01:57,511 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-28 03:01:57,512 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-28 03:01:57,512 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-28 03:01:57,513 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-28 03:01:57,513 INFO L290 TraceCheckUtils]: 13: Hoare triple {1060#false} ~cond := #in~cond; {1060#false} is VALID [2022-04-28 03:01:57,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {1060#false} assume 0 == ~cond; {1060#false} is VALID [2022-04-28 03:01:57,513 INFO L290 TraceCheckUtils]: 15: Hoare triple {1060#false} assume !false; {1060#false} is VALID [2022-04-28 03:01:57,513 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:01:57,513 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:01:57,661 INFO L290 TraceCheckUtils]: 15: Hoare triple {1060#false} assume !false; {1060#false} is VALID [2022-04-28 03:01:57,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {1060#false} assume 0 == ~cond; {1060#false} is VALID [2022-04-28 03:01:57,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {1060#false} ~cond := #in~cond; {1060#false} is VALID [2022-04-28 03:01:57,662 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-28 03:01:57,662 INFO L290 TraceCheckUtils]: 11: Hoare triple {1132#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {1060#false} is VALID [2022-04-28 03:01:57,663 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-28 03:01:57,665 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-28 03:01:57,666 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-28 03:01:57,667 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-28 03:01:57,668 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-28 03:01:57,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {1059#true} ~x~0 := 268435441; {1152#(< 1 (mod (+ main_~x~0 4294967286) 4294967296))} is VALID [2022-04-28 03:01:57,669 INFO L272 TraceCheckUtils]: 4: Hoare triple {1059#true} call #t~ret4 := main(); {1059#true} is VALID [2022-04-28 03:01:57,670 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1059#true} {1059#true} #34#return; {1059#true} is VALID [2022-04-28 03:01:57,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {1059#true} assume true; {1059#true} is VALID [2022-04-28 03:01:57,670 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-28 03:01:57,670 INFO L272 TraceCheckUtils]: 0: Hoare triple {1059#true} call ULTIMATE.init(); {1059#true} is VALID [2022-04-28 03:01:57,670 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:01:57,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497899823] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:01:57,671 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:01:57,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-28 03:01:57,671 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:01:57,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1587907460] [2022-04-28 03:01:57,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1587907460] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:01:57,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:01:57,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:01:57,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701039150] [2022-04-28 03:01:57,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:01:57,672 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 03:01:57,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:01:57,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:57,684 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:57,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 03:01:57,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:57,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 03:01:57,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-04-28 03:01:57,685 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:57,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:57,921 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-28 03:01:57,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 03:01:57,922 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 03:01:57,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:01:57,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:57,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-28 03:01:57,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:57,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-28 03:01:57,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 23 transitions. [2022-04-28 03:01:57,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:57,946 INFO L225 Difference]: With dead ends: 23 [2022-04-28 03:01:57,947 INFO L226 Difference]: Without dead ends: 18 [2022-04-28 03:01:57,947 INFO L412 NwaCegarLoop]: 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-28 03:01:57,948 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:01:57,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 43 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:01:57,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-28 03:01:57,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-28 03:01:57,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:01:57,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:57,961 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:57,961 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:57,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:57,962 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-28 03:01:57,962 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-28 03:01:57,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:57,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:57,962 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-28 03:01:57,962 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-28 03:01:57,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:57,963 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-28 03:01:57,963 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-28 03:01:57,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:57,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:57,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:01:57,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:01:57,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:57,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-28 03:01:57,964 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2022-04-28 03:01:57,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:01:57,965 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-28 03:01:57,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:57,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 18 transitions. [2022-04-28 03:01:57,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:57,986 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-28 03:01:57,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 03:01:57,987 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:01:57,987 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:01:58,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 03:01:58,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 03:01:58,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 03:01:58,388 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:01:58,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:01:58,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1943317092, now seen corresponding path program 11 times [2022-04-28 03:01:58,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:58,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [856826951] [2022-04-28 03:01:58,574 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-28 03:01:58,576 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:01:58,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1571781065, now seen corresponding path program 1 times [2022-04-28 03:01:58,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:58,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447077988] [2022-04-28 03:01:58,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:58,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:58,587 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-28 03:01:58,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:01:58,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [298618182] [2022-04-28 03:01:58,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:58,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:58,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:01:58,603 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:01:58,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 03:01:58,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:01:58,633 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:01:58,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:01:58,658 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:01:58,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1943317092, now seen corresponding path program 12 times [2022-04-28 03:01:58,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:58,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903752272] [2022-04-28 03:01:58,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:58,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:58,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:58,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:01:58,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:58,822 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-28 03:01:58,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {1303#true} assume true; {1303#true} is VALID [2022-04-28 03:01:58,823 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1303#true} {1303#true} #34#return; {1303#true} is VALID [2022-04-28 03:01:58,826 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-28 03:01:58,826 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-28 03:01:58,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {1303#true} assume true; {1303#true} is VALID [2022-04-28 03:01:58,826 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1303#true} {1303#true} #34#return; {1303#true} is VALID [2022-04-28 03:01:58,826 INFO L272 TraceCheckUtils]: 4: Hoare triple {1303#true} call #t~ret4 := main(); {1303#true} is VALID [2022-04-28 03:01:58,827 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-28 03:01:58,828 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-28 03:01:58,829 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-28 03:01:58,830 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-28 03:01:58,830 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-28 03:01:58,831 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-28 03:01:58,832 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-28 03:01:58,832 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-28 03:01:58,833 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-28 03:01:58,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {1304#false} ~cond := #in~cond; {1304#false} is VALID [2022-04-28 03:01:58,833 INFO L290 TraceCheckUtils]: 15: Hoare triple {1304#false} assume 0 == ~cond; {1304#false} is VALID [2022-04-28 03:01:58,833 INFO L290 TraceCheckUtils]: 16: Hoare triple {1304#false} assume !false; {1304#false} is VALID [2022-04-28 03:01:58,833 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:01:58,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:01:58,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903752272] [2022-04-28 03:01:58,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903752272] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:01:58,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882368815] [2022-04-28 03:01:58,834 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:01:58,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:58,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:01:58,836 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:01:58,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 03:01:58,892 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 03:01:58,893 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:01:58,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 03:01:58,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:58,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:01:58,999 INFO L272 TraceCheckUtils]: 0: Hoare triple {1303#true} call ULTIMATE.init(); {1303#true} is VALID [2022-04-28 03:01:58,999 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-28 03:01:58,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {1303#true} assume true; {1303#true} is VALID [2022-04-28 03:01:58,999 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1303#true} {1303#true} #34#return; {1303#true} is VALID [2022-04-28 03:01:58,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {1303#true} call #t~ret4 := main(); {1303#true} is VALID [2022-04-28 03:01:59,000 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-28 03:01:59,000 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-28 03:01:59,001 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-28 03:01:59,002 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-28 03:01:59,002 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-28 03:01:59,003 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-28 03:01:59,003 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-28 03:01:59,004 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-28 03:01:59,004 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-28 03:01:59,004 INFO L290 TraceCheckUtils]: 14: Hoare triple {1304#false} ~cond := #in~cond; {1304#false} is VALID [2022-04-28 03:01:59,004 INFO L290 TraceCheckUtils]: 15: Hoare triple {1304#false} assume 0 == ~cond; {1304#false} is VALID [2022-04-28 03:01:59,005 INFO L290 TraceCheckUtils]: 16: Hoare triple {1304#false} assume !false; {1304#false} is VALID [2022-04-28 03:01:59,005 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:01:59,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:01:59,334 INFO L290 TraceCheckUtils]: 16: Hoare triple {1304#false} assume !false; {1304#false} is VALID [2022-04-28 03:01:59,338 INFO L290 TraceCheckUtils]: 15: Hoare triple {1371#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1304#false} is VALID [2022-04-28 03:01:59,339 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-28 03:01:59,339 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-28 03:01:59,340 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-28 03:01:59,345 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-28 03:01:59,346 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-28 03:01:59,347 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-28 03:01:59,347 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-28 03:01:59,348 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-28 03:01:59,349 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-28 03:01:59,350 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-28 03:01:59,350 INFO L272 TraceCheckUtils]: 4: Hoare triple {1303#true} call #t~ret4 := main(); {1303#true} is VALID [2022-04-28 03:01:59,350 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1303#true} {1303#true} #34#return; {1303#true} is VALID [2022-04-28 03:01:59,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {1303#true} assume true; {1303#true} is VALID [2022-04-28 03:01:59,350 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-28 03:01:59,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {1303#true} call ULTIMATE.init(); {1303#true} is VALID [2022-04-28 03:01:59,351 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:01:59,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882368815] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:01:59,351 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:01:59,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 12] total 21 [2022-04-28 03:01:59,351 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:01:59,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [856826951] [2022-04-28 03:01:59,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [856826951] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:01:59,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:01:59,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:01:59,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216573429] [2022-04-28 03:01:59,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:01:59,352 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 03:01:59,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:01:59,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:59,367 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:59,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 03:01:59,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:59,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 03:01:59,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2022-04-28 03:01:59,369 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:59,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:59,627 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 03:01:59,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 03:01:59,628 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 03:01:59,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:01:59,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:59,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2022-04-28 03:01:59,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:59,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2022-04-28 03:01:59,630 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 24 transitions. [2022-04-28 03:01:59,649 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:59,650 INFO L225 Difference]: With dead ends: 24 [2022-04-28 03:01:59,650 INFO L226 Difference]: Without dead ends: 19 [2022-04-28 03:01:59,650 INFO L412 NwaCegarLoop]: 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-28 03:01:59,651 INFO L413 NwaCegarLoop]: 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-28 03:01:59,651 INFO L414 NwaCegarLoop]: 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-28 03:01:59,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-28 03:01:59,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-28 03:01:59,665 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:01:59,665 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:59,666 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:59,666 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:59,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:59,667 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-28 03:01:59,667 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-28 03:01:59,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:59,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:59,667 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-28 03:01:59,667 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-28 03:01:59,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:59,668 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-28 03:01:59,668 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-28 03:01:59,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:59,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:59,669 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:01:59,669 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:01:59,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:59,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2022-04-28 03:01:59,669 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2022-04-28 03:01:59,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:01:59,670 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2022-04-28 03:01:59,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.3) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:01:59,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 19 transitions. [2022-04-28 03:01:59,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:01:59,687 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-28 03:01:59,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 03:01:59,687 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:01:59,687 INFO L195 NwaCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:01:59,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-28 03:01:59,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 03:02:00,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12,SelfDestructingSolverStorable13 [2022-04-28 03:02:00,093 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:02:00,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:02:00,093 INFO L85 PathProgramCache]: Analyzing trace with hash -76826442, now seen corresponding path program 13 times [2022-04-28 03:02:00,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:00,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [667621033] [2022-04-28 03:02:00,270 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-28 03:02:00,272 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:02:00,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1512675721, now seen corresponding path program 1 times [2022-04-28 03:02:00,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:00,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873448289] [2022-04-28 03:02:00,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:00,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:00,281 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-28 03:02:00,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:02:00,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1188050281] [2022-04-28 03:02:00,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:00,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:00,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:00,290 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:02:00,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 03:02:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:00,333 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:02:00,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:00,361 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:02:00,361 INFO L85 PathProgramCache]: Analyzing trace with hash -76826442, now seen corresponding path program 14 times [2022-04-28 03:02:00,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:00,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948922735] [2022-04-28 03:02:00,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:00,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:00,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:00,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:02:00,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:00,498 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-28 03:02:00,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-28 03:02:00,498 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1566#true} {1566#true} #34#return; {1566#true} is VALID [2022-04-28 03:02:00,499 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-28 03:02:00,500 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-28 03:02:00,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-28 03:02:00,500 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1566#true} {1566#true} #34#return; {1566#true} is VALID [2022-04-28 03:02:00,500 INFO L272 TraceCheckUtils]: 4: Hoare triple {1566#true} call #t~ret4 := main(); {1566#true} is VALID [2022-04-28 03:02:00,500 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-28 03:02:00,501 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-28 03:02:00,502 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-28 03:02:00,502 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-28 03:02:00,503 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-28 03:02:00,504 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-28 03:02:00,504 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-28 03:02:00,505 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-28 03:02:00,506 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-28 03:02:00,506 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-28 03:02:00,506 INFO L290 TraceCheckUtils]: 15: Hoare triple {1567#false} ~cond := #in~cond; {1567#false} is VALID [2022-04-28 03:02:00,506 INFO L290 TraceCheckUtils]: 16: Hoare triple {1567#false} assume 0 == ~cond; {1567#false} is VALID [2022-04-28 03:02:00,506 INFO L290 TraceCheckUtils]: 17: Hoare triple {1567#false} assume !false; {1567#false} is VALID [2022-04-28 03:02:00,506 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:00,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:02:00,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948922735] [2022-04-28 03:02:00,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948922735] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:02:00,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791996237] [2022-04-28 03:02:00,507 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:02:00,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:00,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:00,509 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:02:00,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-28 03:02:00,539 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:02:00,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:02:00,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 03:02:00,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:00,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:02:00,668 INFO L272 TraceCheckUtils]: 0: Hoare triple {1566#true} call ULTIMATE.init(); {1566#true} is VALID [2022-04-28 03:02:00,668 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-28 03:02:00,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-28 03:02:00,669 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1566#true} {1566#true} #34#return; {1566#true} is VALID [2022-04-28 03:02:00,674 INFO L272 TraceCheckUtils]: 4: Hoare triple {1566#true} call #t~ret4 := main(); {1566#true} is VALID [2022-04-28 03:02:00,674 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-28 03:02:00,675 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-28 03:02:00,676 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-28 03:02:00,676 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-28 03:02:00,677 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-28 03:02:00,678 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-28 03:02:00,679 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-28 03:02:00,680 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-28 03:02:00,680 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-28 03:02:00,681 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-28 03:02:00,681 INFO L290 TraceCheckUtils]: 15: Hoare triple {1567#false} ~cond := #in~cond; {1567#false} is VALID [2022-04-28 03:02:00,681 INFO L290 TraceCheckUtils]: 16: Hoare triple {1567#false} assume 0 == ~cond; {1567#false} is VALID [2022-04-28 03:02:00,681 INFO L290 TraceCheckUtils]: 17: Hoare triple {1567#false} assume !false; {1567#false} is VALID [2022-04-28 03:02:00,681 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:00,682 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:02:01,050 INFO L290 TraceCheckUtils]: 17: Hoare triple {1567#false} assume !false; {1567#false} is VALID [2022-04-28 03:02:01,051 INFO L290 TraceCheckUtils]: 16: Hoare triple {1638#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1567#false} is VALID [2022-04-28 03:02:01,051 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-28 03:02:01,052 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-28 03:02:01,053 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-28 03:02:01,054 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-28 03:02:01,055 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-28 03:02:01,057 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-28 03:02:01,058 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-28 03:02:01,060 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-28 03:02:01,061 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-28 03:02:01,062 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-28 03:02:01,062 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-28 03:02:01,062 INFO L272 TraceCheckUtils]: 4: Hoare triple {1566#true} call #t~ret4 := main(); {1566#true} is VALID [2022-04-28 03:02:01,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1566#true} {1566#true} #34#return; {1566#true} is VALID [2022-04-28 03:02:01,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {1566#true} assume true; {1566#true} is VALID [2022-04-28 03:02:01,062 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-28 03:02:01,063 INFO L272 TraceCheckUtils]: 0: Hoare triple {1566#true} call ULTIMATE.init(); {1566#true} is VALID [2022-04-28 03:02:01,063 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:01,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791996237] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:02:01,063 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:02:01,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 23 [2022-04-28 03:02:01,063 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:02:01,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [667621033] [2022-04-28 03:02:01,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [667621033] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:02:01,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:02:01,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 03:02:01,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907625783] [2022-04-28 03:02:01,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:02:01,065 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 03:02:01,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:02:01,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:01,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:01,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 03:02:01,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:01,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 03:02:01,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2022-04-28 03:02:01,082 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:01,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:01,364 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-28 03:02:01,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 03:02:01,365 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 03:02:01,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:02:01,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:01,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 25 transitions. [2022-04-28 03:02:01,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:01,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 25 transitions. [2022-04-28 03:02:01,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 25 transitions. [2022-04-28 03:02:01,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:01,390 INFO L225 Difference]: With dead ends: 25 [2022-04-28 03:02:01,390 INFO L226 Difference]: Without dead ends: 20 [2022-04-28 03:02:01,391 INFO L412 NwaCegarLoop]: 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-28 03:02:01,392 INFO L413 NwaCegarLoop]: 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-28 03:02:01,392 INFO L414 NwaCegarLoop]: 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-28 03:02:01,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-28 03:02:01,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-28 03:02:01,405 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:02:01,405 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:01,405 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:01,406 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:01,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:01,406 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 03:02:01,406 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-28 03:02:01,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:01,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:01,407 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-28 03:02:01,407 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-28 03:02:01,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:01,408 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 03:02:01,408 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-28 03:02:01,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:01,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:01,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:02:01,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:02:01,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:01,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-04-28 03:02:01,409 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2022-04-28 03:02:01,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:02:01,409 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-04-28 03:02:01,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:01,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 20 transitions. [2022-04-28 03:02:01,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:01,427 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-28 03:02:01,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 03:02:01,427 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:02:01,427 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:02:01,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-28 03:02:01,657 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-28 03:02:01,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:01,832 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:02:01,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:02:01,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1949808860, now seen corresponding path program 15 times [2022-04-28 03:02:01,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:01,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [184011359] [2022-04-28 03:02:01,981 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-28 03:02:01,983 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:02:01,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1453570377, now seen corresponding path program 1 times [2022-04-28 03:02:01,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:01,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120220681] [2022-04-28 03:02:01,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:01,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:01,993 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-28 03:02:01,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:02:02,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [72407660] [2022-04-28 03:02:02,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:02,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:02,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:02,002 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:02:02,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-28 03:02:02,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:02,052 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:02:02,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:02,064 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:02:02,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1949808860, now seen corresponding path program 16 times [2022-04-28 03:02:02,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:02,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567209575] [2022-04-28 03:02:02,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:02,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:02,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:02,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:02:02,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:02,214 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-28 03:02:02,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {1845#true} assume true; {1845#true} is VALID [2022-04-28 03:02:02,214 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1845#true} {1845#true} #34#return; {1845#true} is VALID [2022-04-28 03:02:02,214 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-28 03:02:02,215 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-28 03:02:02,215 INFO L290 TraceCheckUtils]: 2: Hoare triple {1845#true} assume true; {1845#true} is VALID [2022-04-28 03:02:02,215 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1845#true} {1845#true} #34#return; {1845#true} is VALID [2022-04-28 03:02:02,215 INFO L272 TraceCheckUtils]: 4: Hoare triple {1845#true} call #t~ret4 := main(); {1845#true} is VALID [2022-04-28 03:02:02,215 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-28 03:02:02,216 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-28 03:02:02,217 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-28 03:02:02,221 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-28 03:02:02,221 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-28 03:02:02,228 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-28 03:02:02,229 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-28 03:02:02,230 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-28 03:02:02,230 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-28 03:02:02,231 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-28 03:02:02,231 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-28 03:02:02,231 INFO L290 TraceCheckUtils]: 16: Hoare triple {1846#false} ~cond := #in~cond; {1846#false} is VALID [2022-04-28 03:02:02,231 INFO L290 TraceCheckUtils]: 17: Hoare triple {1846#false} assume 0 == ~cond; {1846#false} is VALID [2022-04-28 03:02:02,231 INFO L290 TraceCheckUtils]: 18: Hoare triple {1846#false} assume !false; {1846#false} is VALID [2022-04-28 03:02:02,232 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:02,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:02:02,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567209575] [2022-04-28 03:02:02,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567209575] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:02:02,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368147023] [2022-04-28 03:02:02,232 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:02:02,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:02,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:02,233 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:02:02,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-28 03:02:02,273 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:02:02,273 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:02:02,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 03:02:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:02,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:02:02,495 INFO L272 TraceCheckUtils]: 0: Hoare triple {1845#true} call ULTIMATE.init(); {1845#true} is VALID [2022-04-28 03:02:02,495 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-28 03:02:02,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {1845#true} assume true; {1845#true} is VALID [2022-04-28 03:02:02,496 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1845#true} {1845#true} #34#return; {1845#true} is VALID [2022-04-28 03:02:02,496 INFO L272 TraceCheckUtils]: 4: Hoare triple {1845#true} call #t~ret4 := main(); {1845#true} is VALID [2022-04-28 03:02:02,496 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-28 03:02:02,497 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-28 03:02:02,497 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-28 03:02:02,498 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-28 03:02:02,499 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-28 03:02:02,499 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-28 03:02:02,500 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-28 03:02:02,501 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-28 03:02:02,501 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-28 03:02:02,502 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-28 03:02:02,502 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-28 03:02:02,502 INFO L290 TraceCheckUtils]: 16: Hoare triple {1846#false} ~cond := #in~cond; {1846#false} is VALID [2022-04-28 03:02:02,502 INFO L290 TraceCheckUtils]: 17: Hoare triple {1846#false} assume 0 == ~cond; {1846#false} is VALID [2022-04-28 03:02:02,502 INFO L290 TraceCheckUtils]: 18: Hoare triple {1846#false} assume !false; {1846#false} is VALID [2022-04-28 03:02:02,503 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:02,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:02:02,737 INFO L290 TraceCheckUtils]: 18: Hoare triple {1846#false} assume !false; {1846#false} is VALID [2022-04-28 03:02:02,737 INFO L290 TraceCheckUtils]: 17: Hoare triple {1846#false} assume 0 == ~cond; {1846#false} is VALID [2022-04-28 03:02:02,737 INFO L290 TraceCheckUtils]: 16: Hoare triple {1846#false} ~cond := #in~cond; {1846#false} is VALID [2022-04-28 03:02:02,737 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-28 03:02:02,738 INFO L290 TraceCheckUtils]: 14: Hoare triple {1930#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {1846#false} is VALID [2022-04-28 03:02:02,739 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-28 03:02:02,740 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-28 03:02:02,745 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-28 03:02:02,745 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-28 03:02:02,746 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-28 03:02:02,747 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-28 03:02:02,748 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-28 03:02:02,749 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-28 03:02:02,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {1845#true} ~x~0 := 268435441; {1962#(< 1 (mod (+ main_~x~0 4294967280) 4294967296))} is VALID [2022-04-28 03:02:02,749 INFO L272 TraceCheckUtils]: 4: Hoare triple {1845#true} call #t~ret4 := main(); {1845#true} is VALID [2022-04-28 03:02:02,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1845#true} {1845#true} #34#return; {1845#true} is VALID [2022-04-28 03:02:02,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {1845#true} assume true; {1845#true} is VALID [2022-04-28 03:02:02,750 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-28 03:02:02,750 INFO L272 TraceCheckUtils]: 0: Hoare triple {1845#true} call ULTIMATE.init(); {1845#true} is VALID [2022-04-28 03:02:02,750 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:02,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368147023] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:02:02,750 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:02:02,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-28 03:02:02,751 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:02:02,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [184011359] [2022-04-28 03:02:02,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [184011359] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:02:02,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:02:02,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 03:02:02,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950006164] [2022-04-28 03:02:02,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:02:02,752 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 03:02:02,752 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:02:02,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:02,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:02,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 03:02:02,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:02,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 03:02:02,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2022-04-28 03:02:02,768 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:03,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:03,109 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-28 03:02:03,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 03:02:03,109 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 03:02:03,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:02:03,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:03,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 26 transitions. [2022-04-28 03:02:03,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:03,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 26 transitions. [2022-04-28 03:02:03,114 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 26 transitions. [2022-04-28 03:02:03,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:03,136 INFO L225 Difference]: With dead ends: 26 [2022-04-28 03:02:03,136 INFO L226 Difference]: Without dead ends: 21 [2022-04-28 03:02:03,137 INFO L412 NwaCegarLoop]: 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-28 03:02:03,138 INFO L413 NwaCegarLoop]: 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-28 03:02:03,138 INFO L414 NwaCegarLoop]: 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-28 03:02:03,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-28 03:02:03,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-28 03:02:03,157 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:02:03,158 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:03,158 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:03,159 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:03,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:03,160 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-28 03:02:03,160 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-28 03:02:03,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:03,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:03,161 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-28 03:02:03,161 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-28 03:02:03,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:03,162 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-28 03:02:03,162 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-28 03:02:03,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:03,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:03,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:02:03,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:02:03,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:03,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-04-28 03:02:03,163 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2022-04-28 03:02:03,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:02:03,164 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-04-28 03:02:03,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.25) internal successors, (15), 11 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:03,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 21 transitions. [2022-04-28 03:02:03,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:03,184 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-28 03:02:03,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 03:02:03,184 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:02:03,184 INFO L195 NwaCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:02:03,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-28 03:02:03,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-04-28 03:02:03,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2022-04-28 03:02:03,592 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:02:03,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:02:03,592 INFO L85 PathProgramCache]: Analyzing trace with hash 350993782, now seen corresponding path program 17 times [2022-04-28 03:02:03,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:03,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [393775506] [2022-04-28 03:02:03,749 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-28 03:02:03,750 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:02:03,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1394465033, now seen corresponding path program 1 times [2022-04-28 03:02:03,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:03,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676492355] [2022-04-28 03:02:03,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:03,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:03,758 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-28 03:02:03,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:02:03,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1466403241] [2022-04-28 03:02:03,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:03,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:03,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:03,768 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:02:03,769 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-28 03:02:03,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:03,820 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:02:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:03,832 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:02:03,832 INFO L85 PathProgramCache]: Analyzing trace with hash 350993782, now seen corresponding path program 18 times [2022-04-28 03:02:03,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:03,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656141665] [2022-04-28 03:02:03,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:03,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:04,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:02:04,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:04,020 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-28 03:02:04,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {2137#true} assume true; {2137#true} is VALID [2022-04-28 03:02:04,021 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2137#true} {2137#true} #34#return; {2137#true} is VALID [2022-04-28 03:02:04,021 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-28 03:02:04,021 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-28 03:02:04,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {2137#true} assume true; {2137#true} is VALID [2022-04-28 03:02:04,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2137#true} {2137#true} #34#return; {2137#true} is VALID [2022-04-28 03:02:04,021 INFO L272 TraceCheckUtils]: 4: Hoare triple {2137#true} call #t~ret4 := main(); {2137#true} is VALID [2022-04-28 03:02:04,022 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-28 03:02:04,022 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-28 03:02:04,023 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-28 03:02:04,023 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-28 03:02:04,024 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-28 03:02:04,025 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-28 03:02:04,025 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-28 03:02:04,026 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-28 03:02:04,026 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-28 03:02:04,027 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-28 03:02:04,028 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-28 03:02:04,028 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-28 03:02:04,028 INFO L290 TraceCheckUtils]: 17: Hoare triple {2138#false} ~cond := #in~cond; {2138#false} is VALID [2022-04-28 03:02:04,028 INFO L290 TraceCheckUtils]: 18: Hoare triple {2138#false} assume 0 == ~cond; {2138#false} is VALID [2022-04-28 03:02:04,028 INFO L290 TraceCheckUtils]: 19: Hoare triple {2138#false} assume !false; {2138#false} is VALID [2022-04-28 03:02:04,028 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:04,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:02:04,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656141665] [2022-04-28 03:02:04,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656141665] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:02:04,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320521430] [2022-04-28 03:02:04,028 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:02:04,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:04,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:04,029 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:02:04,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-28 03:02:04,086 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 03:02:04,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:02:04,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 03:02:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:04,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:02:04,233 INFO L272 TraceCheckUtils]: 0: Hoare triple {2137#true} call ULTIMATE.init(); {2137#true} is VALID [2022-04-28 03:02:04,233 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-28 03:02:04,233 INFO L290 TraceCheckUtils]: 2: Hoare triple {2137#true} assume true; {2137#true} is VALID [2022-04-28 03:02:04,233 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2137#true} {2137#true} #34#return; {2137#true} is VALID [2022-04-28 03:02:04,234 INFO L272 TraceCheckUtils]: 4: Hoare triple {2137#true} call #t~ret4 := main(); {2137#true} is VALID [2022-04-28 03:02:04,234 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-28 03:02:04,234 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-28 03:02:04,235 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-28 03:02:04,235 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-28 03:02:04,236 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-28 03:02:04,236 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-28 03:02:04,237 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-28 03:02:04,237 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-28 03:02:04,238 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-28 03:02:04,238 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-28 03:02:04,239 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-28 03:02:04,239 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-28 03:02:04,239 INFO L290 TraceCheckUtils]: 17: Hoare triple {2138#false} ~cond := #in~cond; {2138#false} is VALID [2022-04-28 03:02:04,239 INFO L290 TraceCheckUtils]: 18: Hoare triple {2138#false} assume 0 == ~cond; {2138#false} is VALID [2022-04-28 03:02:04,239 INFO L290 TraceCheckUtils]: 19: Hoare triple {2138#false} assume !false; {2138#false} is VALID [2022-04-28 03:02:04,239 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:04,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:02:04,713 INFO L290 TraceCheckUtils]: 19: Hoare triple {2138#false} assume !false; {2138#false} is VALID [2022-04-28 03:02:04,713 INFO L290 TraceCheckUtils]: 18: Hoare triple {2217#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2138#false} is VALID [2022-04-28 03:02:04,723 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-28 03:02:04,724 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-28 03:02:04,725 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-28 03:02:04,726 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-28 03:02:04,727 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-28 03:02:04,728 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-28 03:02:04,729 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-28 03:02:04,729 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-28 03:02:04,730 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-28 03:02:04,731 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-28 03:02:04,732 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-28 03:02:04,733 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-28 03:02:04,733 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-28 03:02:04,733 INFO L272 TraceCheckUtils]: 4: Hoare triple {2137#true} call #t~ret4 := main(); {2137#true} is VALID [2022-04-28 03:02:04,733 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2137#true} {2137#true} #34#return; {2137#true} is VALID [2022-04-28 03:02:04,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {2137#true} assume true; {2137#true} is VALID [2022-04-28 03:02:04,733 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-28 03:02:04,733 INFO L272 TraceCheckUtils]: 0: Hoare triple {2137#true} call ULTIMATE.init(); {2137#true} is VALID [2022-04-28 03:02:04,734 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:04,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320521430] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:02:04,734 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:02:04,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 15] total 27 [2022-04-28 03:02:04,734 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:02:04,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [393775506] [2022-04-28 03:02:04,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [393775506] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:02:04,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:02:04,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 03:02:04,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662095375] [2022-04-28 03:02:04,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:02:04,735 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 03:02:04,735 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:02:04,735 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:04,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:04,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 03:02:04,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:04,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 03:02:04,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=521, Unknown=0, NotChecked=0, Total=702 [2022-04-28 03:02:04,750 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:05,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:05,102 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-28 03:02:05,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 03:02:05,102 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 03:02:05,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:02:05,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:05,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 27 transitions. [2022-04-28 03:02:05,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:05,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 27 transitions. [2022-04-28 03:02:05,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 27 transitions. [2022-04-28 03:02:05,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:05,141 INFO L225 Difference]: With dead ends: 27 [2022-04-28 03:02:05,141 INFO L226 Difference]: Without dead ends: 22 [2022-04-28 03:02:05,142 INFO L412 NwaCegarLoop]: 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-28 03:02:05,143 INFO L413 NwaCegarLoop]: 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-28 03:02:05,143 INFO L414 NwaCegarLoop]: 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-28 03:02:05,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-28 03:02:05,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-28 03:02:05,165 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:02:05,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:05,165 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:05,165 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:05,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:05,166 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 03:02:05,166 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-28 03:02:05,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:05,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:05,167 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-28 03:02:05,167 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-28 03:02:05,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:05,168 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 03:02:05,168 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-28 03:02:05,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:05,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:05,168 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:02:05,168 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:02:05,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:05,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-04-28 03:02:05,169 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2022-04-28 03:02:05,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:02:05,169 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-04-28 03:02:05,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 12 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:05,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 22 transitions. [2022-04-28 03:02:05,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:05,188 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-28 03:02:05,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 03:02:05,188 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:02:05,188 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:02:05,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-28 03:02:05,394 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-28 03:02:05,591 WARN L477 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-28 03:02:05,591 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:02:05,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:02:05,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1967633380, now seen corresponding path program 19 times [2022-04-28 03:02:05,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:05,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [224708326] [2022-04-28 03:02:05,755 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-28 03:02:05,757 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:02:05,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1335359689, now seen corresponding path program 1 times [2022-04-28 03:02:05,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:05,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205390870] [2022-04-28 03:02:05,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:05,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:05,764 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-28 03:02:05,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:02:05,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1744407910] [2022-04-28 03:02:05,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:05,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:05,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:05,778 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:02:05,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-28 03:02:05,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:05,834 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:02:05,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:05,844 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:02:05,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1967633380, now seen corresponding path program 20 times [2022-04-28 03:02:05,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:05,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160960504] [2022-04-28 03:02:05,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:05,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:06,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:02:06,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:06,026 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-28 03:02:06,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 03:02:06,026 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2448#true} {2448#true} #34#return; {2448#true} is VALID [2022-04-28 03:02:06,027 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-28 03:02:06,027 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-28 03:02:06,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 03:02:06,027 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2448#true} {2448#true} #34#return; {2448#true} is VALID [2022-04-28 03:02:06,027 INFO L272 TraceCheckUtils]: 4: Hoare triple {2448#true} call #t~ret4 := main(); {2448#true} is VALID [2022-04-28 03:02:06,027 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-28 03:02:06,028 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-28 03:02:06,029 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-28 03:02:06,029 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-28 03:02:06,030 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-28 03:02:06,031 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-28 03:02:06,031 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-28 03:02:06,032 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-28 03:02:06,033 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-28 03:02:06,033 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-28 03:02:06,034 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-28 03:02:06,034 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-28 03:02:06,035 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-28 03:02:06,035 INFO L290 TraceCheckUtils]: 18: Hoare triple {2449#false} ~cond := #in~cond; {2449#false} is VALID [2022-04-28 03:02:06,035 INFO L290 TraceCheckUtils]: 19: Hoare triple {2449#false} assume 0 == ~cond; {2449#false} is VALID [2022-04-28 03:02:06,035 INFO L290 TraceCheckUtils]: 20: Hoare triple {2449#false} assume !false; {2449#false} is VALID [2022-04-28 03:02:06,035 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:06,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:02:06,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160960504] [2022-04-28 03:02:06,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160960504] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:02:06,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [337608590] [2022-04-28 03:02:06,036 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:02:06,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:06,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:06,040 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:02:06,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-28 03:02:06,070 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:02:06,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:02:06,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 03:02:06,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:06,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:02:06,249 INFO L272 TraceCheckUtils]: 0: Hoare triple {2448#true} call ULTIMATE.init(); {2448#true} is VALID [2022-04-28 03:02:06,249 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-28 03:02:06,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 03:02:06,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2448#true} {2448#true} #34#return; {2448#true} is VALID [2022-04-28 03:02:06,249 INFO L272 TraceCheckUtils]: 4: Hoare triple {2448#true} call #t~ret4 := main(); {2448#true} is VALID [2022-04-28 03:02:06,250 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-28 03:02:06,250 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-28 03:02:06,251 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-28 03:02:06,251 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-28 03:02:06,252 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-28 03:02:06,253 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-28 03:02:06,253 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-28 03:02:06,254 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-28 03:02:06,255 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-28 03:02:06,255 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-28 03:02:06,256 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-28 03:02:06,256 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-28 03:02:06,256 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-28 03:02:06,257 INFO L290 TraceCheckUtils]: 18: Hoare triple {2449#false} ~cond := #in~cond; {2449#false} is VALID [2022-04-28 03:02:06,257 INFO L290 TraceCheckUtils]: 19: Hoare triple {2449#false} assume 0 == ~cond; {2449#false} is VALID [2022-04-28 03:02:06,257 INFO L290 TraceCheckUtils]: 20: Hoare triple {2449#false} assume !false; {2449#false} is VALID [2022-04-28 03:02:06,257 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:06,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:02:06,758 INFO L290 TraceCheckUtils]: 20: Hoare triple {2449#false} assume !false; {2449#false} is VALID [2022-04-28 03:02:06,759 INFO L290 TraceCheckUtils]: 19: Hoare triple {2532#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2449#false} is VALID [2022-04-28 03:02:06,759 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-28 03:02:06,759 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-28 03:02:06,760 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-28 03:02:06,762 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-28 03:02:06,763 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-28 03:02:06,764 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-28 03:02:06,765 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-28 03:02:06,766 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-28 03:02:06,767 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-28 03:02:06,768 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-28 03:02:06,770 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-28 03:02:06,770 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-28 03:02:06,771 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-28 03:02:06,772 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-28 03:02:06,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {2448#true} call #t~ret4 := main(); {2448#true} is VALID [2022-04-28 03:02:06,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2448#true} {2448#true} #34#return; {2448#true} is VALID [2022-04-28 03:02:06,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {2448#true} assume true; {2448#true} is VALID [2022-04-28 03:02:06,772 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-28 03:02:06,772 INFO L272 TraceCheckUtils]: 0: Hoare triple {2448#true} call ULTIMATE.init(); {2448#true} is VALID [2022-04-28 03:02:06,772 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:06,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [337608590] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:02:06,772 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:02:06,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 16] total 29 [2022-04-28 03:02:06,773 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:02:06,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [224708326] [2022-04-28 03:02:06,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [224708326] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:02:06,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:02:06,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 03:02:06,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883154521] [2022-04-28 03:02:06,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:02:06,773 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 03:02:06,773 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:02:06,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:06,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:06,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 03:02:06,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:06,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 03:02:06,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=603, Unknown=0, NotChecked=0, Total=812 [2022-04-28 03:02:06,787 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:07,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:07,209 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-28 03:02:07,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 03:02:07,209 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 03:02:07,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:02:07,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:07,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2022-04-28 03:02:07,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:07,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2022-04-28 03:02:07,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 28 transitions. [2022-04-28 03:02:07,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:07,235 INFO L225 Difference]: With dead ends: 28 [2022-04-28 03:02:07,235 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 03:02:07,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=394, Invalid=1166, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 03:02:07,236 INFO L413 NwaCegarLoop]: 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-28 03:02:07,237 INFO L414 NwaCegarLoop]: 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-28 03:02:07,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 03:02:07,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 03:02:07,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:02:07,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:07,262 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:07,262 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:07,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:07,263 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-28 03:02:07,263 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-28 03:02:07,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:07,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:07,263 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-28 03:02:07,263 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-28 03:02:07,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:07,264 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-28 03:02:07,264 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-28 03:02:07,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:07,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:07,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:02:07,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:02:07,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:07,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2022-04-28 03:02:07,265 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2022-04-28 03:02:07,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:02:07,265 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2022-04-28 03:02:07,265 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 13 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:07,265 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 23 transitions. [2022-04-28 03:02:07,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:07,287 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-28 03:02:07,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 03:02:07,287 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:02:07,287 INFO L195 NwaCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:02:07,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-28 03:02:07,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-28 03:02:07,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20,SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:07,706 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:02:07,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:02:07,706 INFO L85 PathProgramCache]: Analyzing trace with hash -830631370, now seen corresponding path program 21 times [2022-04-28 03:02:07,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:07,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1681545177] [2022-04-28 03:02:07,840 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:02:07,842 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:02:07,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1276254345, now seen corresponding path program 1 times [2022-04-28 03:02:07,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:07,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188588962] [2022-04-28 03:02:07,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:07,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:07,849 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-28 03:02:07,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:02:07,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1306706584] [2022-04-28 03:02:07,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:07,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:07,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:07,857 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:02:07,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-28 03:02:07,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:07,903 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:02:07,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:07,912 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:02:07,912 INFO L85 PathProgramCache]: Analyzing trace with hash -830631370, now seen corresponding path program 22 times [2022-04-28 03:02:07,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:07,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140793522] [2022-04-28 03:02:07,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:07,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:07,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:08,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:02:08,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:08,129 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-28 03:02:08,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {2775#true} assume true; {2775#true} is VALID [2022-04-28 03:02:08,130 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2775#true} {2775#true} #34#return; {2775#true} is VALID [2022-04-28 03:02:08,130 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-28 03:02:08,130 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-28 03:02:08,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {2775#true} assume true; {2775#true} is VALID [2022-04-28 03:02:08,131 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2775#true} {2775#true} #34#return; {2775#true} is VALID [2022-04-28 03:02:08,131 INFO L272 TraceCheckUtils]: 4: Hoare triple {2775#true} call #t~ret4 := main(); {2775#true} is VALID [2022-04-28 03:02:08,131 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-28 03:02:08,132 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-28 03:02:08,133 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-28 03:02:08,133 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-28 03:02:08,134 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-28 03:02:08,135 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-28 03:02:08,135 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-28 03:02:08,136 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-28 03:02:08,136 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-28 03:02:08,137 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-28 03:02:08,138 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-28 03:02:08,138 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-28 03:02:08,139 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-28 03:02:08,139 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-28 03:02:08,139 INFO L290 TraceCheckUtils]: 19: Hoare triple {2776#false} ~cond := #in~cond; {2776#false} is VALID [2022-04-28 03:02:08,139 INFO L290 TraceCheckUtils]: 20: Hoare triple {2776#false} assume 0 == ~cond; {2776#false} is VALID [2022-04-28 03:02:08,139 INFO L290 TraceCheckUtils]: 21: Hoare triple {2776#false} assume !false; {2776#false} is VALID [2022-04-28 03:02:08,140 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:08,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:02:08,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140793522] [2022-04-28 03:02:08,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140793522] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:02:08,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4568272] [2022-04-28 03:02:08,140 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:02:08,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:08,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:08,144 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:02:08,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-28 03:02:08,185 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:02:08,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:02:08,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 03:02:08,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:08,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:02:08,449 INFO L272 TraceCheckUtils]: 0: Hoare triple {2775#true} call ULTIMATE.init(); {2775#true} is VALID [2022-04-28 03:02:08,449 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-28 03:02:08,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {2775#true} assume true; {2775#true} is VALID [2022-04-28 03:02:08,449 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2775#true} {2775#true} #34#return; {2775#true} is VALID [2022-04-28 03:02:08,449 INFO L272 TraceCheckUtils]: 4: Hoare triple {2775#true} call #t~ret4 := main(); {2775#true} is VALID [2022-04-28 03:02:08,450 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-28 03:02:08,450 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-28 03:02:08,451 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-28 03:02:08,452 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-28 03:02:08,453 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-28 03:02:08,453 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-28 03:02:08,454 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-28 03:02:08,455 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-28 03:02:08,455 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-28 03:02:08,456 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-28 03:02:08,457 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-28 03:02:08,457 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-28 03:02:08,458 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-28 03:02:08,458 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-28 03:02:08,458 INFO L290 TraceCheckUtils]: 19: Hoare triple {2776#false} ~cond := #in~cond; {2776#false} is VALID [2022-04-28 03:02:08,458 INFO L290 TraceCheckUtils]: 20: Hoare triple {2776#false} assume 0 == ~cond; {2776#false} is VALID [2022-04-28 03:02:08,458 INFO L290 TraceCheckUtils]: 21: Hoare triple {2776#false} assume !false; {2776#false} is VALID [2022-04-28 03:02:08,459 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:08,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:02:08,776 INFO L290 TraceCheckUtils]: 21: Hoare triple {2776#false} assume !false; {2776#false} is VALID [2022-04-28 03:02:08,776 INFO L290 TraceCheckUtils]: 20: Hoare triple {2776#false} assume 0 == ~cond; {2776#false} is VALID [2022-04-28 03:02:08,776 INFO L290 TraceCheckUtils]: 19: Hoare triple {2776#false} ~cond := #in~cond; {2776#false} is VALID [2022-04-28 03:02:08,776 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-28 03:02:08,776 INFO L290 TraceCheckUtils]: 17: Hoare triple {2872#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {2776#false} is VALID [2022-04-28 03:02:08,778 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-28 03:02:08,778 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-28 03:02:08,779 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-28 03:02:08,780 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-28 03:02:08,780 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-28 03:02:08,781 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-28 03:02:08,782 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-28 03:02:08,782 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-28 03:02:08,783 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-28 03:02:08,783 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-28 03:02:08,785 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-28 03:02:08,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {2775#true} ~x~0 := 268435441; {2916#(< 1 (mod (+ 4294967274 main_~x~0) 4294967296))} is VALID [2022-04-28 03:02:08,785 INFO L272 TraceCheckUtils]: 4: Hoare triple {2775#true} call #t~ret4 := main(); {2775#true} is VALID [2022-04-28 03:02:08,785 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2775#true} {2775#true} #34#return; {2775#true} is VALID [2022-04-28 03:02:08,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {2775#true} assume true; {2775#true} is VALID [2022-04-28 03:02:08,785 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-28 03:02:08,785 INFO L272 TraceCheckUtils]: 0: Hoare triple {2775#true} call ULTIMATE.init(); {2775#true} is VALID [2022-04-28 03:02:08,786 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:08,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4568272] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:02:08,786 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:02:08,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-28 03:02:08,786 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:02:08,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1681545177] [2022-04-28 03:02:08,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1681545177] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:02:08,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:02:08,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 03:02:08,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175781173] [2022-04-28 03:02:08,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:02:08,787 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 03:02:08,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:02:08,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:08,801 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:08,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 03:02:08,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:08,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 03:02:08,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=535, Unknown=0, NotChecked=0, Total=756 [2022-04-28 03:02:08,802 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:09,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:09,254 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-28 03:02:09,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 03:02:09,254 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 03:02:09,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:02:09,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:09,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 29 transitions. [2022-04-28 03:02:09,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:09,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 29 transitions. [2022-04-28 03:02:09,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 29 transitions. [2022-04-28 03:02:09,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:09,278 INFO L225 Difference]: With dead ends: 29 [2022-04-28 03:02:09,278 INFO L226 Difference]: Without dead ends: 24 [2022-04-28 03:02:09,279 INFO L412 NwaCegarLoop]: 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-28 03:02:09,279 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:02:09,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 43 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:02:09,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-28 03:02:09,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-28 03:02:09,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:02:09,301 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:09,301 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:09,302 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:09,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:09,302 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 03:02:09,302 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-28 03:02:09,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:09,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:09,302 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-28 03:02:09,303 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-28 03:02:09,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:09,303 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 03:02:09,303 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-28 03:02:09,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:09,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:09,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:02:09,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:02:09,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:09,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-04-28 03:02:09,304 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2022-04-28 03:02:09,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:02:09,304 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-04-28 03:02:09,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:09,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 24 transitions. [2022-04-28 03:02:09,326 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:09,326 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-28 03:02:09,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 03:02:09,326 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:02:09,326 INFO L195 NwaCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:02:09,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-28 03:02:09,542 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-28 03:02:09,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22,SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:09,728 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:02:09,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:02:09,729 INFO L85 PathProgramCache]: Analyzing trace with hash 56692572, now seen corresponding path program 23 times [2022-04-28 03:02:09,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:09,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [964495383] [2022-04-28 03:02:09,879 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-28 03:02:09,881 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:02:09,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1217149001, now seen corresponding path program 1 times [2022-04-28 03:02:09,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:09,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240580707] [2022-04-28 03:02:09,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:09,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:09,889 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-28 03:02:09,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:02:09,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1400443567] [2022-04-28 03:02:09,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:09,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:09,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:09,896 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:02:09,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-28 03:02:09,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:09,942 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:02:09,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:09,952 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:02:09,952 INFO L85 PathProgramCache]: Analyzing trace with hash 56692572, now seen corresponding path program 24 times [2022-04-28 03:02:09,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:09,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517475057] [2022-04-28 03:02:09,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:09,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:10,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:02:10,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:10,178 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-28 03:02:10,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {3115#true} assume true; {3115#true} is VALID [2022-04-28 03:02:10,178 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3115#true} {3115#true} #34#return; {3115#true} is VALID [2022-04-28 03:02:10,179 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-28 03:02:10,179 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-28 03:02:10,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {3115#true} assume true; {3115#true} is VALID [2022-04-28 03:02:10,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3115#true} {3115#true} #34#return; {3115#true} is VALID [2022-04-28 03:02:10,179 INFO L272 TraceCheckUtils]: 4: Hoare triple {3115#true} call #t~ret4 := main(); {3115#true} is VALID [2022-04-28 03:02:10,179 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-28 03:02:10,180 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-28 03:02:10,181 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-28 03:02:10,181 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-28 03:02:10,182 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-28 03:02:10,183 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-28 03:02:10,183 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-28 03:02:10,184 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-28 03:02:10,185 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-28 03:02:10,185 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-28 03:02:10,186 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-28 03:02:10,186 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-28 03:02:10,187 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-28 03:02:10,187 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-28 03:02:10,187 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-28 03:02:10,188 INFO L290 TraceCheckUtils]: 20: Hoare triple {3116#false} ~cond := #in~cond; {3116#false} is VALID [2022-04-28 03:02:10,188 INFO L290 TraceCheckUtils]: 21: Hoare triple {3116#false} assume 0 == ~cond; {3116#false} is VALID [2022-04-28 03:02:10,188 INFO L290 TraceCheckUtils]: 22: Hoare triple {3116#false} assume !false; {3116#false} is VALID [2022-04-28 03:02:10,188 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:10,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:02:10,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517475057] [2022-04-28 03:02:10,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517475057] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:02:10,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674077565] [2022-04-28 03:02:10,189 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:02:10,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:10,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:10,191 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:02:10,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-28 03:02:10,268 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 03:02:10,268 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:02:10,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 03:02:10,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:10,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:02:10,541 INFO L272 TraceCheckUtils]: 0: Hoare triple {3115#true} call ULTIMATE.init(); {3115#true} is VALID [2022-04-28 03:02:10,542 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-28 03:02:10,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {3115#true} assume true; {3115#true} is VALID [2022-04-28 03:02:10,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3115#true} {3115#true} #34#return; {3115#true} is VALID [2022-04-28 03:02:10,542 INFO L272 TraceCheckUtils]: 4: Hoare triple {3115#true} call #t~ret4 := main(); {3115#true} is VALID [2022-04-28 03:02:10,542 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-28 03:02:10,543 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-28 03:02:10,543 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-28 03:02:10,544 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-28 03:02:10,544 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-28 03:02:10,545 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-28 03:02:10,545 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-28 03:02:10,546 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-28 03:02:10,546 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-28 03:02:10,547 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-28 03:02:10,547 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-28 03:02:10,548 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-28 03:02:10,548 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-28 03:02:10,549 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-28 03:02:10,549 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-28 03:02:10,549 INFO L290 TraceCheckUtils]: 20: Hoare triple {3116#false} ~cond := #in~cond; {3116#false} is VALID [2022-04-28 03:02:10,549 INFO L290 TraceCheckUtils]: 21: Hoare triple {3116#false} assume 0 == ~cond; {3116#false} is VALID [2022-04-28 03:02:10,549 INFO L290 TraceCheckUtils]: 22: Hoare triple {3116#false} assume !false; {3116#false} is VALID [2022-04-28 03:02:10,549 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:10,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:02:10,904 INFO L290 TraceCheckUtils]: 22: Hoare triple {3116#false} assume !false; {3116#false} is VALID [2022-04-28 03:02:10,904 INFO L290 TraceCheckUtils]: 21: Hoare triple {3116#false} assume 0 == ~cond; {3116#false} is VALID [2022-04-28 03:02:10,904 INFO L290 TraceCheckUtils]: 20: Hoare triple {3116#false} ~cond := #in~cond; {3116#false} is VALID [2022-04-28 03:02:10,904 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-28 03:02:10,904 INFO L290 TraceCheckUtils]: 18: Hoare triple {3216#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {3116#false} is VALID [2022-04-28 03:02:10,905 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-28 03:02:10,906 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-28 03:02:10,910 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-28 03:02:10,911 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-28 03:02:10,911 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-28 03:02:10,912 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-28 03:02:10,913 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-28 03:02:10,913 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-28 03:02:10,914 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-28 03:02:10,915 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-28 03:02:10,916 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-28 03:02:10,916 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-28 03:02:10,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {3115#true} ~x~0 := 268435441; {3264#(< 1 (mod (+ 4294967272 main_~x~0) 4294967296))} is VALID [2022-04-28 03:02:10,917 INFO L272 TraceCheckUtils]: 4: Hoare triple {3115#true} call #t~ret4 := main(); {3115#true} is VALID [2022-04-28 03:02:10,917 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3115#true} {3115#true} #34#return; {3115#true} is VALID [2022-04-28 03:02:10,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {3115#true} assume true; {3115#true} is VALID [2022-04-28 03:02:10,917 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-28 03:02:10,917 INFO L272 TraceCheckUtils]: 0: Hoare triple {3115#true} call ULTIMATE.init(); {3115#true} is VALID [2022-04-28 03:02:10,918 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:10,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674077565] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:02:10,918 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:02:10,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-28 03:02:10,918 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:02:10,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [964495383] [2022-04-28 03:02:10,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [964495383] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:02:10,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:02:10,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 03:02:10,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967444845] [2022-04-28 03:02:10,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:02:10,920 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 03:02:10,920 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:02:10,920 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:10,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:10,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 03:02:10,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:10,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 03:02:10,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=618, Unknown=0, NotChecked=0, Total=870 [2022-04-28 03:02:10,948 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:11,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:11,478 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-28 03:02:11,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 03:02:11,479 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 03:02:11,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:02:11,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:11,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 30 transitions. [2022-04-28 03:02:11,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:11,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 30 transitions. [2022-04-28 03:02:11,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 30 transitions. [2022-04-28 03:02:11,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:11,504 INFO L225 Difference]: With dead ends: 30 [2022-04-28 03:02:11,505 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 03:02:11,506 INFO L412 NwaCegarLoop]: 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-28 03:02:11,506 INFO L413 NwaCegarLoop]: 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-28 03:02:11,506 INFO L414 NwaCegarLoop]: 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-28 03:02:11,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 03:02:11,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-28 03:02:11,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:02:11,530 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:11,530 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:11,530 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:11,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:11,531 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-28 03:02:11,531 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-28 03:02:11,531 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:11,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:11,531 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-28 03:02:11,532 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-28 03:02:11,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:11,532 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-28 03:02:11,532 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-28 03:02:11,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:11,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:11,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:02:11,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:02:11,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:11,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-04-28 03:02:11,533 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2022-04-28 03:02:11,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:02:11,533 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-04-28 03:02:11,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.1875) internal successors, (19), 15 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:11,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 25 transitions. [2022-04-28 03:02:11,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:11,558 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-28 03:02:11,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 03:02:11,559 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:02:11,559 INFO L195 NwaCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:02:11,562 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-28 03:02:11,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-28 03:02:11,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24,SelfDestructingSolverStorable25,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:11,967 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:02:11,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:02:11,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1793930998, now seen corresponding path program 25 times [2022-04-28 03:02:11,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:11,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [300648522] [2022-04-28 03:02:12,100 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-28 03:02:12,102 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:02:12,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1158043657, now seen corresponding path program 1 times [2022-04-28 03:02:12,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:12,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843003129] [2022-04-28 03:02:12,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:12,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:12,110 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-28 03:02:12,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:02:12,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1115073977] [2022-04-28 03:02:12,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:12,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:12,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:12,117 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:02:12,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-28 03:02:12,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:12,171 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:02:12,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:12,181 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:02:12,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1793930998, now seen corresponding path program 26 times [2022-04-28 03:02:12,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:12,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596127261] [2022-04-28 03:02:12,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:12,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:12,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:12,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:02:12,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:12,454 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-28 03:02:12,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {3471#true} assume true; {3471#true} is VALID [2022-04-28 03:02:12,454 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3471#true} {3471#true} #34#return; {3471#true} is VALID [2022-04-28 03:02:12,455 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-28 03:02:12,455 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-28 03:02:12,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {3471#true} assume true; {3471#true} is VALID [2022-04-28 03:02:12,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3471#true} {3471#true} #34#return; {3471#true} is VALID [2022-04-28 03:02:12,455 INFO L272 TraceCheckUtils]: 4: Hoare triple {3471#true} call #t~ret4 := main(); {3471#true} is VALID [2022-04-28 03:02:12,455 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-28 03:02:12,456 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-28 03:02:12,457 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-28 03:02:12,457 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-28 03:02:12,471 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-28 03:02:12,472 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-28 03:02:12,473 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-28 03:02:12,473 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-28 03:02:12,474 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-28 03:02:12,474 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-28 03:02:12,475 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-28 03:02:12,476 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-28 03:02:12,476 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-28 03:02:12,477 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-28 03:02:12,478 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-28 03:02:12,478 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-28 03:02:12,478 INFO L290 TraceCheckUtils]: 21: Hoare triple {3472#false} ~cond := #in~cond; {3472#false} is VALID [2022-04-28 03:02:12,478 INFO L290 TraceCheckUtils]: 22: Hoare triple {3472#false} assume 0 == ~cond; {3472#false} is VALID [2022-04-28 03:02:12,478 INFO L290 TraceCheckUtils]: 23: Hoare triple {3472#false} assume !false; {3472#false} is VALID [2022-04-28 03:02:12,478 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:12,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:02:12,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596127261] [2022-04-28 03:02:12,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596127261] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:02:12,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279930744] [2022-04-28 03:02:12,479 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:02:12,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:12,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:12,484 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:02:12,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-28 03:02:12,517 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:02:12,517 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:02:12,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 03:02:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:12,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:02:12,813 INFO L272 TraceCheckUtils]: 0: Hoare triple {3471#true} call ULTIMATE.init(); {3471#true} is VALID [2022-04-28 03:02:12,813 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-28 03:02:12,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {3471#true} assume true; {3471#true} is VALID [2022-04-28 03:02:12,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3471#true} {3471#true} #34#return; {3471#true} is VALID [2022-04-28 03:02:12,813 INFO L272 TraceCheckUtils]: 4: Hoare triple {3471#true} call #t~ret4 := main(); {3471#true} is VALID [2022-04-28 03:02:12,814 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-28 03:02:12,814 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-28 03:02:12,815 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-28 03:02:12,815 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-28 03:02:12,816 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-28 03:02:12,816 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-28 03:02:12,817 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-28 03:02:12,818 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-28 03:02:12,818 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-28 03:02:12,819 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-28 03:02:12,819 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-28 03:02:12,820 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-28 03:02:12,820 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-28 03:02:12,821 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-28 03:02:12,821 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-28 03:02:12,822 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-28 03:02:12,822 INFO L290 TraceCheckUtils]: 21: Hoare triple {3472#false} ~cond := #in~cond; {3472#false} is VALID [2022-04-28 03:02:12,822 INFO L290 TraceCheckUtils]: 22: Hoare triple {3472#false} assume 0 == ~cond; {3472#false} is VALID [2022-04-28 03:02:12,822 INFO L290 TraceCheckUtils]: 23: Hoare triple {3472#false} assume !false; {3472#false} is VALID [2022-04-28 03:02:12,822 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:12,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:02:13,226 INFO L290 TraceCheckUtils]: 23: Hoare triple {3472#false} assume !false; {3472#false} is VALID [2022-04-28 03:02:13,226 INFO L290 TraceCheckUtils]: 22: Hoare triple {3472#false} assume 0 == ~cond; {3472#false} is VALID [2022-04-28 03:02:13,226 INFO L290 TraceCheckUtils]: 21: Hoare triple {3472#false} ~cond := #in~cond; {3472#false} is VALID [2022-04-28 03:02:13,226 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-28 03:02:13,227 INFO L290 TraceCheckUtils]: 19: Hoare triple {3576#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {3472#false} is VALID [2022-04-28 03:02:13,227 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-28 03:02:13,228 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-28 03:02:13,229 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-28 03:02:13,229 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-28 03:02:13,230 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-28 03:02:13,231 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-28 03:02:13,231 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-28 03:02:13,232 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-28 03:02:13,235 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-28 03:02:13,235 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-28 03:02:13,236 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-28 03:02:13,236 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-28 03:02:13,237 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-28 03:02:13,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {3471#true} ~x~0 := 268435441; {3628#(< 1 (mod (+ main_~x~0 4294967270) 4294967296))} is VALID [2022-04-28 03:02:13,237 INFO L272 TraceCheckUtils]: 4: Hoare triple {3471#true} call #t~ret4 := main(); {3471#true} is VALID [2022-04-28 03:02:13,238 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3471#true} {3471#true} #34#return; {3471#true} is VALID [2022-04-28 03:02:13,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {3471#true} assume true; {3471#true} is VALID [2022-04-28 03:02:13,238 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-28 03:02:13,238 INFO L272 TraceCheckUtils]: 0: Hoare triple {3471#true} call ULTIMATE.init(); {3471#true} is VALID [2022-04-28 03:02:13,238 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:13,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279930744] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:02:13,238 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:02:13,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-28 03:02:13,239 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:02:13,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [300648522] [2022-04-28 03:02:13,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [300648522] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:02:13,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:02:13,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 03:02:13,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809465359] [2022-04-28 03:02:13,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:02:13,240 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 03:02:13,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:02:13,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:13,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:13,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 03:02:13,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:13,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 03:02:13,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=707, Unknown=0, NotChecked=0, Total=992 [2022-04-28 03:02:13,257 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:13,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:13,767 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-28 03:02:13,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 03:02:13,767 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 03:02:13,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:02:13,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:13,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2022-04-28 03:02:13,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:13,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2022-04-28 03:02:13,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 31 transitions. [2022-04-28 03:02:13,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:13,793 INFO L225 Difference]: With dead ends: 31 [2022-04-28 03:02:13,793 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 03:02:13,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=563, Invalid=1507, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 03:02:13,795 INFO L413 NwaCegarLoop]: 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-28 03:02:13,795 INFO L414 NwaCegarLoop]: 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-28 03:02:13,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 03:02:13,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-28 03:02:13,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:02:13,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:13,820 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:13,820 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:13,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:13,820 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-28 03:02:13,820 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-28 03:02:13,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:13,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:13,821 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-28 03:02:13,821 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-28 03:02:13,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:13,822 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-28 03:02:13,822 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-28 03:02:13,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:13,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:13,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:02:13,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:02:13,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:13,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2022-04-28 03:02:13,823 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2022-04-28 03:02:13,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:02:13,823 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2022-04-28 03:02:13,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:13,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 26 transitions. [2022-04-28 03:02:13,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:13,847 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-28 03:02:13,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 03:02:13,848 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:02:13,848 INFO L195 NwaCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:02:13,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-04-28 03:02:14,051 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-28 03:02:14,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26,SelfDestructingSolverStorable27 [2022-04-28 03:02:14,248 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:02:14,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:02:14,249 INFO L85 PathProgramCache]: Analyzing trace with hash -186252644, now seen corresponding path program 27 times [2022-04-28 03:02:14,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:14,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1174620751] [2022-04-28 03:02:14,378 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-28 03:02:14,380 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:02:14,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1098938313, now seen corresponding path program 1 times [2022-04-28 03:02:14,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:14,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789628430] [2022-04-28 03:02:14,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:14,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:14,402 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-28 03:02:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:02:14,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1768108029] [2022-04-28 03:02:14,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:14,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:14,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:14,409 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:02:14,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-28 03:02:14,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:14,464 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:02:14,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:14,472 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:02:14,472 INFO L85 PathProgramCache]: Analyzing trace with hash -186252644, now seen corresponding path program 28 times [2022-04-28 03:02:14,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:14,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750993234] [2022-04-28 03:02:14,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:14,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:14,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:02:14,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:14,761 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-28 03:02:14,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {3843#true} assume true; {3843#true} is VALID [2022-04-28 03:02:14,761 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3843#true} {3843#true} #34#return; {3843#true} is VALID [2022-04-28 03:02:14,762 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-28 03:02:14,762 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-28 03:02:14,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {3843#true} assume true; {3843#true} is VALID [2022-04-28 03:02:14,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3843#true} {3843#true} #34#return; {3843#true} is VALID [2022-04-28 03:02:14,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {3843#true} call #t~ret4 := main(); {3843#true} is VALID [2022-04-28 03:02:14,763 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-28 03:02:14,763 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-28 03:02:14,764 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-28 03:02:14,765 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-28 03:02:14,765 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-28 03:02:14,766 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-28 03:02:14,766 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-28 03:02:14,767 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-28 03:02:14,768 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-28 03:02:14,768 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-28 03:02:14,769 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-28 03:02:14,769 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-28 03:02:14,770 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-28 03:02:14,771 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-28 03:02:14,771 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-28 03:02:14,772 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-28 03:02:14,772 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-28 03:02:14,772 INFO L290 TraceCheckUtils]: 22: Hoare triple {3844#false} ~cond := #in~cond; {3844#false} is VALID [2022-04-28 03:02:14,772 INFO L290 TraceCheckUtils]: 23: Hoare triple {3844#false} assume 0 == ~cond; {3844#false} is VALID [2022-04-28 03:02:14,772 INFO L290 TraceCheckUtils]: 24: Hoare triple {3844#false} assume !false; {3844#false} is VALID [2022-04-28 03:02:14,773 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:14,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:02:14,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750993234] [2022-04-28 03:02:14,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750993234] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:02:14,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128946395] [2022-04-28 03:02:14,773 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:02:14,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:14,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:14,776 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:02:14,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-28 03:02:14,818 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:02:14,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:02:14,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 03:02:14,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:14,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:02:15,106 INFO L272 TraceCheckUtils]: 0: Hoare triple {3843#true} call ULTIMATE.init(); {3843#true} is VALID [2022-04-28 03:02:15,106 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-28 03:02:15,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {3843#true} assume true; {3843#true} is VALID [2022-04-28 03:02:15,107 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3843#true} {3843#true} #34#return; {3843#true} is VALID [2022-04-28 03:02:15,107 INFO L272 TraceCheckUtils]: 4: Hoare triple {3843#true} call #t~ret4 := main(); {3843#true} is VALID [2022-04-28 03:02:15,107 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-28 03:02:15,108 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-28 03:02:15,108 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-28 03:02:15,109 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-28 03:02:15,109 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-28 03:02:15,110 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-28 03:02:15,110 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-28 03:02:15,111 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-28 03:02:15,111 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-28 03:02:15,112 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-28 03:02:15,112 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-28 03:02:15,113 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-28 03:02:15,113 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-28 03:02:15,114 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-28 03:02:15,114 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-28 03:02:15,115 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-28 03:02:15,115 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-28 03:02:15,115 INFO L290 TraceCheckUtils]: 22: Hoare triple {3844#false} ~cond := #in~cond; {3844#false} is VALID [2022-04-28 03:02:15,115 INFO L290 TraceCheckUtils]: 23: Hoare triple {3844#false} assume 0 == ~cond; {3844#false} is VALID [2022-04-28 03:02:15,115 INFO L290 TraceCheckUtils]: 24: Hoare triple {3844#false} assume !false; {3844#false} is VALID [2022-04-28 03:02:15,115 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:15,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:02:15,550 INFO L290 TraceCheckUtils]: 24: Hoare triple {3844#false} assume !false; {3844#false} is VALID [2022-04-28 03:02:15,550 INFO L290 TraceCheckUtils]: 23: Hoare triple {3844#false} assume 0 == ~cond; {3844#false} is VALID [2022-04-28 03:02:15,550 INFO L290 TraceCheckUtils]: 22: Hoare triple {3844#false} ~cond := #in~cond; {3844#false} is VALID [2022-04-28 03:02:15,550 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-28 03:02:15,550 INFO L290 TraceCheckUtils]: 20: Hoare triple {3952#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {3844#false} is VALID [2022-04-28 03:02:15,551 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-28 03:02:15,552 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-28 03:02:15,553 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-28 03:02:15,553 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-28 03:02:15,554 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-28 03:02:15,554 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-28 03:02:15,555 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-28 03:02:15,556 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-28 03:02:15,557 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-28 03:02:15,558 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-28 03:02:15,558 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-28 03:02:15,559 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-28 03:02:15,560 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-28 03:02:15,560 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-28 03:02:15,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {3843#true} ~x~0 := 268435441; {4008#(< 1 (mod (+ main_~x~0 4294967268) 4294967296))} is VALID [2022-04-28 03:02:15,561 INFO L272 TraceCheckUtils]: 4: Hoare triple {3843#true} call #t~ret4 := main(); {3843#true} is VALID [2022-04-28 03:02:15,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3843#true} {3843#true} #34#return; {3843#true} is VALID [2022-04-28 03:02:15,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {3843#true} assume true; {3843#true} is VALID [2022-04-28 03:02:15,561 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-28 03:02:15,561 INFO L272 TraceCheckUtils]: 0: Hoare triple {3843#true} call ULTIMATE.init(); {3843#true} is VALID [2022-04-28 03:02:15,561 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:15,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128946395] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:02:15,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:02:15,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-28 03:02:15,562 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:02:15,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1174620751] [2022-04-28 03:02:15,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1174620751] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:02:15,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:02:15,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 03:02:15,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89077797] [2022-04-28 03:02:15,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:02:15,562 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 03:02:15,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:02:15,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:15,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:15,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 03:02:15,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:15,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 03:02:15,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=802, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 03:02:15,578 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:16,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:16,135 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-28 03:02:16,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 03:02:16,135 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 03:02:16,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:02:16,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:16,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. [2022-04-28 03:02:16,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:16,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. [2022-04-28 03:02:16,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 32 transitions. [2022-04-28 03:02:16,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:16,158 INFO L225 Difference]: With dead ends: 32 [2022-04-28 03:02:16,158 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 03:02:16,159 INFO L412 NwaCegarLoop]: 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-28 03:02:16,160 INFO L413 NwaCegarLoop]: 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-28 03:02:16,160 INFO L414 NwaCegarLoop]: 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-28 03:02:16,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 03:02:16,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-28 03:02:16,181 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:02:16,181 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:16,181 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:16,181 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:16,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:16,182 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-28 03:02:16,182 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-28 03:02:16,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:16,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:16,182 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-28 03:02:16,182 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-28 03:02:16,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:16,183 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-28 03:02:16,183 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-28 03:02:16,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:16,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:16,183 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:02:16,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:02:16,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:16,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-04-28 03:02:16,184 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2022-04-28 03:02:16,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:02:16,184 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-04-28 03:02:16,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:16,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 27 transitions. [2022-04-28 03:02:16,205 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:16,205 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-28 03:02:16,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 03:02:16,206 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:02:16,206 INFO L195 NwaCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:02:16,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-28 03:02:16,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-04-28 03:02:16,606 WARN L477 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-28 03:02:16,607 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:02:16,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:02:16,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1442403402, now seen corresponding path program 29 times [2022-04-28 03:02:16,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:16,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [149573651] [2022-04-28 03:02:16,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-28 03:02:16,749 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:02:16,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1039832969, now seen corresponding path program 1 times [2022-04-28 03:02:16,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:16,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690848394] [2022-04-28 03:02:16,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:16,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:16,758 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-28 03:02:16,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:02:16,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1552341031] [2022-04-28 03:02:16,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:16,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:16,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:16,768 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:02:16,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-28 03:02:16,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:16,813 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:02:16,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:16,822 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:02:16,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1442403402, now seen corresponding path program 30 times [2022-04-28 03:02:16,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:16,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136070940] [2022-04-28 03:02:16,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:16,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:16,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:17,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:02:17,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:17,103 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-28 03:02:17,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {4231#true} assume true; {4231#true} is VALID [2022-04-28 03:02:17,103 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4231#true} {4231#true} #34#return; {4231#true} is VALID [2022-04-28 03:02:17,103 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-28 03:02:17,104 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-28 03:02:17,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {4231#true} assume true; {4231#true} is VALID [2022-04-28 03:02:17,104 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4231#true} {4231#true} #34#return; {4231#true} is VALID [2022-04-28 03:02:17,104 INFO L272 TraceCheckUtils]: 4: Hoare triple {4231#true} call #t~ret4 := main(); {4231#true} is VALID [2022-04-28 03:02:17,104 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-28 03:02:17,105 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-28 03:02:17,106 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-28 03:02:17,106 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-28 03:02:17,107 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-28 03:02:17,108 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-28 03:02:17,108 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-28 03:02:17,109 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-28 03:02:17,109 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-28 03:02:17,110 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-28 03:02:17,111 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-28 03:02:17,111 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-28 03:02:17,112 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-28 03:02:17,113 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-28 03:02:17,113 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-28 03:02:17,114 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-28 03:02:17,115 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-28 03:02:17,115 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-28 03:02:17,115 INFO L290 TraceCheckUtils]: 23: Hoare triple {4232#false} ~cond := #in~cond; {4232#false} is VALID [2022-04-28 03:02:17,115 INFO L290 TraceCheckUtils]: 24: Hoare triple {4232#false} assume 0 == ~cond; {4232#false} is VALID [2022-04-28 03:02:17,115 INFO L290 TraceCheckUtils]: 25: Hoare triple {4232#false} assume !false; {4232#false} is VALID [2022-04-28 03:02:17,115 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:17,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:02:17,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136070940] [2022-04-28 03:02:17,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136070940] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:02:17,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018609611] [2022-04-28 03:02:17,116 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:02:17,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:17,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:17,117 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:02:17,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-28 03:02:17,317 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-28 03:02:17,317 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:02:17,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 03:02:17,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:17,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:02:17,506 INFO L272 TraceCheckUtils]: 0: Hoare triple {4231#true} call ULTIMATE.init(); {4231#true} is VALID [2022-04-28 03:02:17,506 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-28 03:02:17,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {4231#true} assume true; {4231#true} is VALID [2022-04-28 03:02:17,506 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4231#true} {4231#true} #34#return; {4231#true} is VALID [2022-04-28 03:02:17,507 INFO L272 TraceCheckUtils]: 4: Hoare triple {4231#true} call #t~ret4 := main(); {4231#true} is VALID [2022-04-28 03:02:17,507 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-28 03:02:17,507 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-28 03:02:17,508 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-28 03:02:17,508 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-28 03:02:17,509 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-28 03:02:17,509 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-28 03:02:17,510 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-28 03:02:17,510 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-28 03:02:17,511 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-28 03:02:17,511 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-28 03:02:17,512 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-28 03:02:17,512 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-28 03:02:17,513 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-28 03:02:17,513 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-28 03:02:17,514 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-28 03:02:17,514 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-28 03:02:17,515 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-28 03:02:17,515 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-28 03:02:17,515 INFO L290 TraceCheckUtils]: 23: Hoare triple {4232#false} ~cond := #in~cond; {4232#false} is VALID [2022-04-28 03:02:17,515 INFO L290 TraceCheckUtils]: 24: Hoare triple {4232#false} assume 0 == ~cond; {4232#false} is VALID [2022-04-28 03:02:17,515 INFO L290 TraceCheckUtils]: 25: Hoare triple {4232#false} assume !false; {4232#false} is VALID [2022-04-28 03:02:17,515 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:17,515 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:02:18,289 INFO L290 TraceCheckUtils]: 25: Hoare triple {4232#false} assume !false; {4232#false} is VALID [2022-04-28 03:02:18,290 INFO L290 TraceCheckUtils]: 24: Hoare triple {4335#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4232#false} is VALID [2022-04-28 03:02:18,290 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-28 03:02:18,291 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-28 03:02:18,291 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-28 03:02:18,293 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-28 03:02:18,295 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-28 03:02:18,295 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-28 03:02:18,297 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-28 03:02:18,299 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-28 03:02:18,300 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-28 03:02:18,301 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-28 03:02:18,302 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-28 03:02:18,303 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-28 03:02:18,303 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-28 03:02:18,304 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-28 03:02:18,305 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-28 03:02:18,308 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-28 03:02:18,310 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-28 03:02:18,311 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-28 03:02:18,311 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-28 03:02:18,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {4231#true} call #t~ret4 := main(); {4231#true} is VALID [2022-04-28 03:02:18,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4231#true} {4231#true} #34#return; {4231#true} is VALID [2022-04-28 03:02:18,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {4231#true} assume true; {4231#true} is VALID [2022-04-28 03:02:18,311 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-28 03:02:18,311 INFO L272 TraceCheckUtils]: 0: Hoare triple {4231#true} call ULTIMATE.init(); {4231#true} is VALID [2022-04-28 03:02:18,312 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:18,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018609611] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:02:18,312 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:02:18,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 21] total 39 [2022-04-28 03:02:18,312 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:02:18,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [149573651] [2022-04-28 03:02:18,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [149573651] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:02:18,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:02:18,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 03:02:18,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910623620] [2022-04-28 03:02:18,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:02:18,313 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 03:02:18,313 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:02:18,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:18,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:18,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 03:02:18,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:18,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 03:02:18,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1103, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 03:02:18,330 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:19,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:19,066 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-28 03:02:19,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 03:02:19,066 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 03:02:19,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:02:19,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:19,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 33 transitions. [2022-04-28 03:02:19,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:19,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 33 transitions. [2022-04-28 03:02:19,068 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 33 transitions. [2022-04-28 03:02:19,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:19,092 INFO L225 Difference]: With dead ends: 33 [2022-04-28 03:02:19,092 INFO L226 Difference]: Without dead ends: 28 [2022-04-28 03:02:19,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=729, Invalid=2241, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 03:02:19,093 INFO L413 NwaCegarLoop]: 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-28 03:02:19,093 INFO L414 NwaCegarLoop]: 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-28 03:02:19,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-28 03:02:19,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-28 03:02:19,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:02:19,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:19,115 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:19,115 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:19,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:19,116 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-28 03:02:19,116 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-28 03:02:19,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:19,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:19,117 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-28 03:02:19,117 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-28 03:02:19,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:19,118 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-28 03:02:19,118 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-28 03:02:19,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:19,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:19,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:02:19,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:02:19,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:19,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2022-04-28 03:02:19,119 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2022-04-28 03:02:19,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:02:19,119 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2022-04-28 03:02:19,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 18 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:19,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 28 transitions. [2022-04-28 03:02:19,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:19,142 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-28 03:02:19,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 03:02:19,142 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:02:19,142 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:02:19,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-28 03:02:19,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-04-28 03:02:19,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30,SelfDestructingSolverStorable31,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:19,543 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:02:19,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:02:19,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1728371236, now seen corresponding path program 31 times [2022-04-28 03:02:19,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:19,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [313475664] [2022-04-28 03:02:19,686 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-28 03:02:19,688 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:02:19,690 INFO L85 PathProgramCache]: Analyzing trace with hash -980727625, now seen corresponding path program 1 times [2022-04-28 03:02:19,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:19,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101547918] [2022-04-28 03:02:19,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:19,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:19,697 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-28 03:02:19,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:02:19,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1906969998] [2022-04-28 03:02:19,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:19,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:19,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:19,704 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:02:19,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-28 03:02:19,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:19,750 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:02:19,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:19,759 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:02:19,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1728371236, now seen corresponding path program 32 times [2022-04-28 03:02:19,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:19,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514066839] [2022-04-28 03:02:19,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:19,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:19,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:20,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:02:20,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:20,048 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-28 03:02:20,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {4638#true} assume true; {4638#true} is VALID [2022-04-28 03:02:20,049 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4638#true} {4638#true} #34#return; {4638#true} is VALID [2022-04-28 03:02:20,049 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-28 03:02:20,049 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-28 03:02:20,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {4638#true} assume true; {4638#true} is VALID [2022-04-28 03:02:20,049 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4638#true} {4638#true} #34#return; {4638#true} is VALID [2022-04-28 03:02:20,049 INFO L272 TraceCheckUtils]: 4: Hoare triple {4638#true} call #t~ret4 := main(); {4638#true} is VALID [2022-04-28 03:02:20,050 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-28 03:02:20,050 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-28 03:02:20,051 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-28 03:02:20,051 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-28 03:02:20,052 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-28 03:02:20,052 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-28 03:02:20,053 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-28 03:02:20,053 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-28 03:02:20,054 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-28 03:02:20,054 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-28 03:02:20,055 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-28 03:02:20,055 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-28 03:02:20,056 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-28 03:02:20,056 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-28 03:02:20,057 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-28 03:02:20,057 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-28 03:02:20,058 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-28 03:02:20,058 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-28 03:02:20,058 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-28 03:02:20,058 INFO L290 TraceCheckUtils]: 24: Hoare triple {4639#false} ~cond := #in~cond; {4639#false} is VALID [2022-04-28 03:02:20,059 INFO L290 TraceCheckUtils]: 25: Hoare triple {4639#false} assume 0 == ~cond; {4639#false} is VALID [2022-04-28 03:02:20,059 INFO L290 TraceCheckUtils]: 26: Hoare triple {4639#false} assume !false; {4639#false} is VALID [2022-04-28 03:02:20,059 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:20,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:02:20,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514066839] [2022-04-28 03:02:20,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514066839] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:02:20,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413740999] [2022-04-28 03:02:20,059 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:02:20,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:20,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:20,060 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:02:20,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-28 03:02:20,090 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:02:20,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:02:20,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-28 03:02:20,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:20,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:02:20,298 INFO L272 TraceCheckUtils]: 0: Hoare triple {4638#true} call ULTIMATE.init(); {4638#true} is VALID [2022-04-28 03:02:20,298 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-28 03:02:20,298 INFO L290 TraceCheckUtils]: 2: Hoare triple {4638#true} assume true; {4638#true} is VALID [2022-04-28 03:02:20,298 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4638#true} {4638#true} #34#return; {4638#true} is VALID [2022-04-28 03:02:20,298 INFO L272 TraceCheckUtils]: 4: Hoare triple {4638#true} call #t~ret4 := main(); {4638#true} is VALID [2022-04-28 03:02:20,299 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-28 03:02:20,299 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-28 03:02:20,300 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-28 03:02:20,300 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-28 03:02:20,301 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-28 03:02:20,301 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-28 03:02:20,302 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-28 03:02:20,302 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-28 03:02:20,303 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-28 03:02:20,303 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-28 03:02:20,304 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-28 03:02:20,304 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-28 03:02:20,305 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-28 03:02:20,305 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-28 03:02:20,306 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-28 03:02:20,306 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-28 03:02:20,307 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-28 03:02:20,307 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-28 03:02:20,307 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-28 03:02:20,307 INFO L290 TraceCheckUtils]: 24: Hoare triple {4639#false} ~cond := #in~cond; {4639#false} is VALID [2022-04-28 03:02:20,307 INFO L290 TraceCheckUtils]: 25: Hoare triple {4639#false} assume 0 == ~cond; {4639#false} is VALID [2022-04-28 03:02:20,307 INFO L290 TraceCheckUtils]: 26: Hoare triple {4639#false} assume !false; {4639#false} is VALID [2022-04-28 03:02:20,308 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:20,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:02:21,224 INFO L290 TraceCheckUtils]: 26: Hoare triple {4639#false} assume !false; {4639#false} is VALID [2022-04-28 03:02:21,225 INFO L290 TraceCheckUtils]: 25: Hoare triple {4746#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4639#false} is VALID [2022-04-28 03:02:21,225 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-28 03:02:21,225 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-28 03:02:21,226 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-28 03:02:21,228 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-28 03:02:21,228 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-28 03:02:21,229 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-28 03:02:21,230 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-28 03:02:21,231 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-28 03:02:21,232 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-28 03:02:21,232 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-28 03:02:21,239 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-28 03:02:21,239 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-28 03:02:21,241 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-28 03:02:21,242 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-28 03:02:21,243 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-28 03:02:21,244 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-28 03:02:21,245 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-28 03:02:21,246 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-28 03:02:21,248 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-28 03:02:21,248 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-28 03:02:21,248 INFO L272 TraceCheckUtils]: 4: Hoare triple {4638#true} call #t~ret4 := main(); {4638#true} is VALID [2022-04-28 03:02:21,248 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4638#true} {4638#true} #34#return; {4638#true} is VALID [2022-04-28 03:02:21,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {4638#true} assume true; {4638#true} is VALID [2022-04-28 03:02:21,249 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-28 03:02:21,249 INFO L272 TraceCheckUtils]: 0: Hoare triple {4638#true} call ULTIMATE.init(); {4638#true} is VALID [2022-04-28 03:02:21,249 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:21,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413740999] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:02:21,249 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:02:21,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 22] total 41 [2022-04-28 03:02:21,250 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:02:21,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [313475664] [2022-04-28 03:02:21,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [313475664] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:02:21,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:02:21,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 03:02:21,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349713540] [2022-04-28 03:02:21,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:02:21,251 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-28 03:02:21,251 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:02:21,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:21,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:21,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 03:02:21,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:21,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 03:02:21,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1221, Unknown=0, NotChecked=0, Total=1640 [2022-04-28 03:02:21,274 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:22,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:22,095 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-28 03:02:22,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 03:02:22,095 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-28 03:02:22,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:02:22,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:22,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. [2022-04-28 03:02:22,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:22,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. [2022-04-28 03:02:22,097 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 34 transitions. [2022-04-28 03:02:22,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:22,120 INFO L225 Difference]: With dead ends: 34 [2022-04-28 03:02:22,120 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 03:02:22,121 INFO L412 NwaCegarLoop]: 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-28 03:02:22,122 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:02:22,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 93 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:02:22,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 03:02:22,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-28 03:02:22,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:02:22,146 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:22,147 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:22,147 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:22,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:22,147 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-28 03:02:22,147 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-28 03:02:22,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:22,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:22,148 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-28 03:02:22,148 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-28 03:02:22,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:22,148 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-28 03:02:22,148 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-28 03:02:22,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:22,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:22,148 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:02:22,148 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:02:22,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 24 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:22,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2022-04-28 03:02:22,149 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2022-04-28 03:02:22,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:02:22,149 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2022-04-28 03:02:22,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:22,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 29 transitions. [2022-04-28 03:02:22,171 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:22,171 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-28 03:02:22,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 03:02:22,172 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:02:22,172 INFO L195 NwaCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:02:22,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-28 03:02:22,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2022-04-28 03:02:22,572 WARN L477 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-28 03:02:22,572 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:02:22,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:02:22,573 INFO L85 PathProgramCache]: Analyzing trace with hash -2003439498, now seen corresponding path program 33 times [2022-04-28 03:02:22,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:22,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [963876950] [2022-04-28 03:02:22,693 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-28 03:02:22,695 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:02:22,697 INFO L85 PathProgramCache]: Analyzing trace with hash -921622281, now seen corresponding path program 1 times [2022-04-28 03:02:22,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:22,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925847197] [2022-04-28 03:02:22,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:22,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:22,701 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-28 03:02:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:02:22,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2007243305] [2022-04-28 03:02:22,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:22,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:22,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:22,713 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:02:22,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-28 03:02:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:22,755 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:02:22,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:22,765 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:02:22,765 INFO L85 PathProgramCache]: Analyzing trace with hash -2003439498, now seen corresponding path program 34 times [2022-04-28 03:02:22,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:22,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448112935] [2022-04-28 03:02:22,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:22,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:23,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:02:23,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:23,071 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-28 03:02:23,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {5061#true} assume true; {5061#true} is VALID [2022-04-28 03:02:23,071 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5061#true} {5061#true} #34#return; {5061#true} is VALID [2022-04-28 03:02:23,073 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-28 03:02:23,073 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-28 03:02:23,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {5061#true} assume true; {5061#true} is VALID [2022-04-28 03:02:23,073 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5061#true} {5061#true} #34#return; {5061#true} is VALID [2022-04-28 03:02:23,073 INFO L272 TraceCheckUtils]: 4: Hoare triple {5061#true} call #t~ret4 := main(); {5061#true} is VALID [2022-04-28 03:02:23,073 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-28 03:02:23,074 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-28 03:02:23,075 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-28 03:02:23,075 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-28 03:02:23,076 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-28 03:02:23,077 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-28 03:02:23,077 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-28 03:02:23,078 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-28 03:02:23,078 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-28 03:02:23,079 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-28 03:02:23,079 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-28 03:02:23,080 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-28 03:02:23,080 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-28 03:02:23,081 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-28 03:02:23,081 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-28 03:02:23,082 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-28 03:02:23,082 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-28 03:02:23,083 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-28 03:02:23,083 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-28 03:02:23,083 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-28 03:02:23,083 INFO L290 TraceCheckUtils]: 25: Hoare triple {5062#false} ~cond := #in~cond; {5062#false} is VALID [2022-04-28 03:02:23,084 INFO L290 TraceCheckUtils]: 26: Hoare triple {5062#false} assume 0 == ~cond; {5062#false} is VALID [2022-04-28 03:02:23,084 INFO L290 TraceCheckUtils]: 27: Hoare triple {5062#false} assume !false; {5062#false} is VALID [2022-04-28 03:02:23,084 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:23,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:02:23,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448112935] [2022-04-28 03:02:23,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448112935] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:02:23,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351297559] [2022-04-28 03:02:23,084 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:02:23,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:23,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:23,087 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:02:23,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-28 03:02:23,122 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:02:23,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:02:23,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 03:02:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:23,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:02:23,414 INFO L272 TraceCheckUtils]: 0: Hoare triple {5061#true} call ULTIMATE.init(); {5061#true} is VALID [2022-04-28 03:02:23,415 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-28 03:02:23,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {5061#true} assume true; {5061#true} is VALID [2022-04-28 03:02:23,415 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5061#true} {5061#true} #34#return; {5061#true} is VALID [2022-04-28 03:02:23,415 INFO L272 TraceCheckUtils]: 4: Hoare triple {5061#true} call #t~ret4 := main(); {5061#true} is VALID [2022-04-28 03:02:23,415 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-28 03:02:23,416 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-28 03:02:23,416 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-28 03:02:23,417 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-28 03:02:23,417 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-28 03:02:23,418 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-28 03:02:23,418 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-28 03:02:23,419 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-28 03:02:23,419 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-28 03:02:23,420 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-28 03:02:23,420 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-28 03:02:23,421 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-28 03:02:23,421 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-28 03:02:23,422 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-28 03:02:23,422 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-28 03:02:23,423 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-28 03:02:23,423 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-28 03:02:23,424 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-28 03:02:23,424 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-28 03:02:23,424 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-28 03:02:23,424 INFO L290 TraceCheckUtils]: 25: Hoare triple {5062#false} ~cond := #in~cond; {5062#false} is VALID [2022-04-28 03:02:23,424 INFO L290 TraceCheckUtils]: 26: Hoare triple {5062#false} assume 0 == ~cond; {5062#false} is VALID [2022-04-28 03:02:23,424 INFO L290 TraceCheckUtils]: 27: Hoare triple {5062#false} assume !false; {5062#false} is VALID [2022-04-28 03:02:23,425 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:23,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:02:24,037 INFO L290 TraceCheckUtils]: 27: Hoare triple {5062#false} assume !false; {5062#false} is VALID [2022-04-28 03:02:24,037 INFO L290 TraceCheckUtils]: 26: Hoare triple {5062#false} assume 0 == ~cond; {5062#false} is VALID [2022-04-28 03:02:24,037 INFO L290 TraceCheckUtils]: 25: Hoare triple {5062#false} ~cond := #in~cond; {5062#false} is VALID [2022-04-28 03:02:24,037 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-28 03:02:24,037 INFO L290 TraceCheckUtils]: 23: Hoare triple {5182#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {5062#false} is VALID [2022-04-28 03:02:24,038 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-28 03:02:24,041 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-28 03:02:24,042 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-28 03:02:24,043 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-28 03:02:24,043 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-28 03:02:24,044 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-28 03:02:24,044 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-28 03:02:24,045 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-28 03:02:24,046 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-28 03:02:24,046 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-28 03:02:24,047 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-28 03:02:24,048 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-28 03:02:24,048 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-28 03:02:24,049 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-28 03:02:24,049 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-28 03:02:24,053 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-28 03:02:24,053 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-28 03:02:24,054 INFO L290 TraceCheckUtils]: 5: Hoare triple {5061#true} ~x~0 := 268435441; {5250#(< 1 (mod (+ main_~x~0 4294967262) 4294967296))} is VALID [2022-04-28 03:02:24,054 INFO L272 TraceCheckUtils]: 4: Hoare triple {5061#true} call #t~ret4 := main(); {5061#true} is VALID [2022-04-28 03:02:24,054 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5061#true} {5061#true} #34#return; {5061#true} is VALID [2022-04-28 03:02:24,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {5061#true} assume true; {5061#true} is VALID [2022-04-28 03:02:24,054 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-28 03:02:24,054 INFO L272 TraceCheckUtils]: 0: Hoare triple {5061#true} call ULTIMATE.init(); {5061#true} is VALID [2022-04-28 03:02:24,054 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:24,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351297559] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:02:24,055 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:02:24,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-28 03:02:24,055 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:02:24,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [963876950] [2022-04-28 03:02:24,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [963876950] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:02:24,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:02:24,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 03:02:24,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596539827] [2022-04-28 03:02:24,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:02:24,056 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 03:02:24,056 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:02:24,056 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:24,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:24,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 03:02:24,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:24,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 03:02:24,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=1123, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 03:02:24,074 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:25,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:25,038 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-28 03:02:25,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 03:02:25,038 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-28 03:02:25,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:02:25,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:25,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 35 transitions. [2022-04-28 03:02:25,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:25,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 35 transitions. [2022-04-28 03:02:25,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 35 transitions. [2022-04-28 03:02:25,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:25,070 INFO L225 Difference]: With dead ends: 35 [2022-04-28 03:02:25,070 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 03:02:25,070 INFO L412 NwaCegarLoop]: 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-28 03:02:25,071 INFO L413 NwaCegarLoop]: 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-28 03:02:25,071 INFO L414 NwaCegarLoop]: 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-28 03:02:25,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 03:02:25,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-28 03:02:25,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:02:25,124 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:25,124 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:25,124 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:25,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:25,125 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-28 03:02:25,125 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-28 03:02:25,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:25,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:25,125 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-28 03:02:25,125 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 30 states. [2022-04-28 03:02:25,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:25,126 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-28 03:02:25,126 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-28 03:02:25,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:25,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:25,126 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:02:25,126 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:02:25,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:25,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2022-04-28 03:02:25,127 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2022-04-28 03:02:25,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:02:25,127 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2022-04-28 03:02:25,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 20 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:25,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 30 transitions. [2022-04-28 03:02:25,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:25,158 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-28 03:02:25,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 03:02:25,159 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:02:25,159 INFO L195 NwaCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:02:25,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-04-28 03:02:25,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-28 03:02:25,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34,SelfDestructingSolverStorable35 [2022-04-28 03:02:25,563 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:02:25,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:02:25,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1940621028, now seen corresponding path program 35 times [2022-04-28 03:02:25,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:25,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [101419010] [2022-04-28 03:02:25,693 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-28 03:02:25,695 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:02:25,697 INFO L85 PathProgramCache]: Analyzing trace with hash -862516937, now seen corresponding path program 1 times [2022-04-28 03:02:25,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:25,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615313166] [2022-04-28 03:02:25,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:25,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:25,701 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-28 03:02:25,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:02:25,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1920339914] [2022-04-28 03:02:25,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:25,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:25,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:25,708 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:02:25,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-28 03:02:25,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:25,755 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:02:25,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:25,764 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:02:25,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1940621028, now seen corresponding path program 36 times [2022-04-28 03:02:25,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:25,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813345416] [2022-04-28 03:02:25,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:25,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:25,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:26,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:02:26,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:26,101 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-28 03:02:26,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {5497#true} assume true; {5497#true} is VALID [2022-04-28 03:02:26,101 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5497#true} {5497#true} #34#return; {5497#true} is VALID [2022-04-28 03:02:26,101 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-28 03:02:26,101 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-28 03:02:26,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {5497#true} assume true; {5497#true} is VALID [2022-04-28 03:02:26,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5497#true} {5497#true} #34#return; {5497#true} is VALID [2022-04-28 03:02:26,102 INFO L272 TraceCheckUtils]: 4: Hoare triple {5497#true} call #t~ret4 := main(); {5497#true} is VALID [2022-04-28 03:02:26,102 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-28 03:02:26,103 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-28 03:02:26,103 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-28 03:02:26,104 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-28 03:02:26,104 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-28 03:02:26,105 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-28 03:02:26,105 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-28 03:02:26,106 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-28 03:02:26,106 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-28 03:02:26,107 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-28 03:02:26,107 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-28 03:02:26,108 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-28 03:02:26,108 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-28 03:02:26,109 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-28 03:02:26,109 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-28 03:02:26,110 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-28 03:02:26,111 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-28 03:02:26,111 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-28 03:02:26,112 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-28 03:02:26,112 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-28 03:02:26,112 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-28 03:02:26,112 INFO L290 TraceCheckUtils]: 26: Hoare triple {5498#false} ~cond := #in~cond; {5498#false} is VALID [2022-04-28 03:02:26,112 INFO L290 TraceCheckUtils]: 27: Hoare triple {5498#false} assume 0 == ~cond; {5498#false} is VALID [2022-04-28 03:02:26,112 INFO L290 TraceCheckUtils]: 28: Hoare triple {5498#false} assume !false; {5498#false} is VALID [2022-04-28 03:02:26,113 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:26,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:02:26,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813345416] [2022-04-28 03:02:26,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813345416] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:02:26,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373248019] [2022-04-28 03:02:26,113 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:02:26,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:26,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:26,116 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:02:26,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-04-28 03:02:26,454 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-28 03:02:26,454 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:02:26,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-28 03:02:26,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:26,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:02:26,675 INFO L272 TraceCheckUtils]: 0: Hoare triple {5497#true} call ULTIMATE.init(); {5497#true} is VALID [2022-04-28 03:02:26,676 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-28 03:02:26,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {5497#true} assume true; {5497#true} is VALID [2022-04-28 03:02:26,676 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5497#true} {5497#true} #34#return; {5497#true} is VALID [2022-04-28 03:02:26,676 INFO L272 TraceCheckUtils]: 4: Hoare triple {5497#true} call #t~ret4 := main(); {5497#true} is VALID [2022-04-28 03:02:26,676 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-28 03:02:26,677 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-28 03:02:26,677 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-28 03:02:26,678 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-28 03:02:26,678 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-28 03:02:26,679 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-28 03:02:26,679 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-28 03:02:26,680 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-28 03:02:26,680 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-28 03:02:26,681 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-28 03:02:26,681 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-28 03:02:26,682 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-28 03:02:26,682 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-28 03:02:26,683 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-28 03:02:26,683 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-28 03:02:26,684 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-28 03:02:26,684 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-28 03:02:26,685 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-28 03:02:26,685 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-28 03:02:26,686 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-28 03:02:26,686 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-28 03:02:26,686 INFO L290 TraceCheckUtils]: 26: Hoare triple {5498#false} ~cond := #in~cond; {5498#false} is VALID [2022-04-28 03:02:26,686 INFO L290 TraceCheckUtils]: 27: Hoare triple {5498#false} assume 0 == ~cond; {5498#false} is VALID [2022-04-28 03:02:26,686 INFO L290 TraceCheckUtils]: 28: Hoare triple {5498#false} assume !false; {5498#false} is VALID [2022-04-28 03:02:26,686 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:26,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:02:27,688 INFO L290 TraceCheckUtils]: 28: Hoare triple {5498#false} assume !false; {5498#false} is VALID [2022-04-28 03:02:27,689 INFO L290 TraceCheckUtils]: 27: Hoare triple {5613#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5498#false} is VALID [2022-04-28 03:02:27,689 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-28 03:02:27,690 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-28 03:02:27,690 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-28 03:02:27,691 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-28 03:02:27,693 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-28 03:02:27,693 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-28 03:02:27,697 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-28 03:02:27,698 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-28 03:02:27,699 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-28 03:02:27,700 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-28 03:02:27,701 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-28 03:02:27,702 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-28 03:02:27,703 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-28 03:02:27,706 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-28 03:02:27,706 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-28 03:02:27,707 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-28 03:02:27,708 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-28 03:02:27,709 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-28 03:02:27,710 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-28 03:02:27,712 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-28 03:02:27,715 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-28 03:02:27,716 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-28 03:02:27,716 INFO L272 TraceCheckUtils]: 4: Hoare triple {5497#true} call #t~ret4 := main(); {5497#true} is VALID [2022-04-28 03:02:27,716 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5497#true} {5497#true} #34#return; {5497#true} is VALID [2022-04-28 03:02:27,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {5497#true} assume true; {5497#true} is VALID [2022-04-28 03:02:27,716 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-28 03:02:27,716 INFO L272 TraceCheckUtils]: 0: Hoare triple {5497#true} call ULTIMATE.init(); {5497#true} is VALID [2022-04-28 03:02:27,716 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:27,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373248019] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:02:27,716 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:02:27,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 24] total 45 [2022-04-28 03:02:27,717 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:02:27,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [101419010] [2022-04-28 03:02:27,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [101419010] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:02:27,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:02:27,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 03:02:27,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846949180] [2022-04-28 03:02:27,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:02:27,718 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-28 03:02:27,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:02:27,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:27,738 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:27,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 03:02:27,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:27,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 03:02:27,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=1475, Unknown=0, NotChecked=0, Total=1980 [2022-04-28 03:02:27,739 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:28,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:28,684 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-28 03:02:28,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 03:02:28,685 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-28 03:02:28,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:02:28,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:28,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 36 transitions. [2022-04-28 03:02:28,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:28,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 36 transitions. [2022-04-28 03:02:28,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 36 transitions. [2022-04-28 03:02:28,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:28,712 INFO L225 Difference]: With dead ends: 36 [2022-04-28 03:02:28,712 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 03:02:28,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=978, Invalid=3054, Unknown=0, NotChecked=0, Total=4032 [2022-04-28 03:02:28,714 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:02:28,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 73 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:02:28,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 03:02:28,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-28 03:02:28,740 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:02:28,740 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:28,740 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:28,740 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:28,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:28,741 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-28 03:02:28,741 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 03:02:28,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:28,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:28,741 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-28 03:02:28,741 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-28 03:02:28,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:28,742 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-28 03:02:28,742 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 03:02:28,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:28,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:28,742 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:02:28,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:02:28,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:28,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-28 03:02:28,743 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2022-04-28 03:02:28,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:02:28,743 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-28 03:02:28,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:28,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 31 transitions. [2022-04-28 03:02:28,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:28,770 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 03:02:28,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 03:02:28,770 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:02:28,770 INFO L195 NwaCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:02:28,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-04-28 03:02:28,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2022-04-28 03:02:29,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36,SelfDestructingSolverStorable37,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:29,171 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:02:29,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:02:29,172 INFO L85 PathProgramCache]: Analyzing trace with hash 6751542, now seen corresponding path program 37 times [2022-04-28 03:02:29,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:29,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [878872528] [2022-04-28 03:02:29,307 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-28 03:02:29,310 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:02:29,312 INFO L85 PathProgramCache]: Analyzing trace with hash -803411593, now seen corresponding path program 1 times [2022-04-28 03:02:29,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:29,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120622054] [2022-04-28 03:02:29,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:29,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:29,316 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-28 03:02:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:02:29,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1537174842] [2022-04-28 03:02:29,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:29,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:29,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:29,334 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:02:29,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-04-28 03:02:29,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:29,375 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:02:29,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:29,385 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:02:29,385 INFO L85 PathProgramCache]: Analyzing trace with hash 6751542, now seen corresponding path program 38 times [2022-04-28 03:02:29,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:29,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210838176] [2022-04-28 03:02:29,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:29,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:29,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:29,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:02:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:29,768 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-28 03:02:29,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {5952#true} assume true; {5952#true} is VALID [2022-04-28 03:02:29,768 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5952#true} {5952#true} #34#return; {5952#true} is VALID [2022-04-28 03:02:29,770 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-28 03:02:29,770 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-28 03:02:29,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {5952#true} assume true; {5952#true} is VALID [2022-04-28 03:02:29,771 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5952#true} {5952#true} #34#return; {5952#true} is VALID [2022-04-28 03:02:29,771 INFO L272 TraceCheckUtils]: 4: Hoare triple {5952#true} call #t~ret4 := main(); {5952#true} is VALID [2022-04-28 03:02:29,771 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-28 03:02:29,771 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-28 03:02:29,772 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-28 03:02:29,772 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-28 03:02:29,773 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-28 03:02:29,773 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-28 03:02:29,774 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-28 03:02:29,774 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-28 03:02:29,775 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-28 03:02:29,775 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-28 03:02:29,776 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-28 03:02:29,776 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-28 03:02:29,777 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-28 03:02:29,777 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-28 03:02:29,778 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-28 03:02:29,778 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-28 03:02:29,779 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-28 03:02:29,779 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-28 03:02:29,780 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-28 03:02:29,780 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-28 03:02:29,781 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-28 03:02:29,781 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-28 03:02:29,781 INFO L290 TraceCheckUtils]: 27: Hoare triple {5953#false} ~cond := #in~cond; {5953#false} is VALID [2022-04-28 03:02:29,781 INFO L290 TraceCheckUtils]: 28: Hoare triple {5953#false} assume 0 == ~cond; {5953#false} is VALID [2022-04-28 03:02:29,781 INFO L290 TraceCheckUtils]: 29: Hoare triple {5953#false} assume !false; {5953#false} is VALID [2022-04-28 03:02:29,781 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:29,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:02:29,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210838176] [2022-04-28 03:02:29,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210838176] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:02:29,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340573273] [2022-04-28 03:02:29,782 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:02:29,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:29,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:29,784 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:02:29,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-04-28 03:02:29,825 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:02:29,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:02:29,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-28 03:02:29,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:29,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:02:30,064 INFO L272 TraceCheckUtils]: 0: Hoare triple {5952#true} call ULTIMATE.init(); {5952#true} is VALID [2022-04-28 03:02:30,064 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-28 03:02:30,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {5952#true} assume true; {5952#true} is VALID [2022-04-28 03:02:30,064 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5952#true} {5952#true} #34#return; {5952#true} is VALID [2022-04-28 03:02:30,064 INFO L272 TraceCheckUtils]: 4: Hoare triple {5952#true} call #t~ret4 := main(); {5952#true} is VALID [2022-04-28 03:02:30,064 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-28 03:02:30,065 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-28 03:02:30,065 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-28 03:02:30,066 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-28 03:02:30,066 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-28 03:02:30,067 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-28 03:02:30,067 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-28 03:02:30,068 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-28 03:02:30,068 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-28 03:02:30,069 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-28 03:02:30,069 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-28 03:02:30,070 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-28 03:02:30,070 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-28 03:02:30,071 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-28 03:02:30,071 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-28 03:02:30,072 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-28 03:02:30,072 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-28 03:02:30,073 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-28 03:02:30,073 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-28 03:02:30,074 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-28 03:02:30,075 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-28 03:02:30,075 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-28 03:02:30,075 INFO L290 TraceCheckUtils]: 27: Hoare triple {5953#false} ~cond := #in~cond; {5953#false} is VALID [2022-04-28 03:02:30,075 INFO L290 TraceCheckUtils]: 28: Hoare triple {5953#false} assume 0 == ~cond; {5953#false} is VALID [2022-04-28 03:02:30,075 INFO L290 TraceCheckUtils]: 29: Hoare triple {5953#false} assume !false; {5953#false} is VALID [2022-04-28 03:02:30,075 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:30,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:02:31,161 INFO L290 TraceCheckUtils]: 29: Hoare triple {5953#false} assume !false; {5953#false} is VALID [2022-04-28 03:02:31,162 INFO L290 TraceCheckUtils]: 28: Hoare triple {6072#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5953#false} is VALID [2022-04-28 03:02:31,162 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-28 03:02:31,163 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-28 03:02:31,163 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-28 03:02:31,164 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-28 03:02:31,165 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-28 03:02:31,166 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-28 03:02:31,167 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-28 03:02:31,168 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-28 03:02:31,169 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-28 03:02:31,169 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-28 03:02:31,170 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-28 03:02:31,171 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-28 03:02:31,173 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-28 03:02:31,174 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-28 03:02:31,180 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-28 03:02:31,180 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-28 03:02:31,182 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-28 03:02:31,183 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-28 03:02:31,183 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-28 03:02:31,184 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-28 03:02:31,185 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-28 03:02:31,186 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-28 03:02:31,186 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-28 03:02:31,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {5952#true} call #t~ret4 := main(); {5952#true} is VALID [2022-04-28 03:02:31,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5952#true} {5952#true} #34#return; {5952#true} is VALID [2022-04-28 03:02:31,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {5952#true} assume true; {5952#true} is VALID [2022-04-28 03:02:31,186 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-28 03:02:31,186 INFO L272 TraceCheckUtils]: 0: Hoare triple {5952#true} call ULTIMATE.init(); {5952#true} is VALID [2022-04-28 03:02:31,187 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:31,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340573273] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:02:31,187 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:02:31,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 25] total 47 [2022-04-28 03:02:31,187 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:02:31,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [878872528] [2022-04-28 03:02:31,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [878872528] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:02:31,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:02:31,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 03:02:31,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576405330] [2022-04-28 03:02:31,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:02:31,188 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 03:02:31,188 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:02:31,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:31,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:31,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 03:02:31,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:31,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 03:02:31,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=1611, Unknown=0, NotChecked=0, Total=2162 [2022-04-28 03:02:31,208 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:32,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:32,124 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-28 03:02:32,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 03:02:32,124 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 03:02:32,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:02:32,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:32,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 37 transitions. [2022-04-28 03:02:32,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:32,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 37 transitions. [2022-04-28 03:02:32,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 37 transitions. [2022-04-28 03:02:32,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:32,158 INFO L225 Difference]: With dead ends: 37 [2022-04-28 03:02:32,158 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 03:02:32,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1069, Invalid=3353, Unknown=0, NotChecked=0, Total=4422 [2022-04-28 03:02:32,159 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:02:32,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 33 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:02:32,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 03:02:32,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-28 03:02:32,186 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:02:32,186 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:32,186 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:32,186 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:32,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:32,187 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-28 03:02:32,187 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-28 03:02:32,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:32,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:32,187 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-28 03:02:32,187 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 32 states. [2022-04-28 03:02:32,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:32,188 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-28 03:02:32,188 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-28 03:02:32,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:32,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:32,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:02:32,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:02:32,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:32,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2022-04-28 03:02:32,189 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2022-04-28 03:02:32,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:02:32,189 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2022-04-28 03:02:32,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:32,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 32 transitions. [2022-04-28 03:02:32,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:32,213 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-28 03:02:32,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 03:02:32,213 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:02:32,213 INFO L195 NwaCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:02:32,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-04-28 03:02:32,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-04-28 03:02:32,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38,SelfDestructingSolverStorable39 [2022-04-28 03:02:32,616 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:02:32,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:02:32,616 INFO L85 PathProgramCache]: Analyzing trace with hash 245759068, now seen corresponding path program 39 times [2022-04-28 03:02:32,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:32,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1447422333] [2022-04-28 03:02:32,747 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-28 03:02:32,748 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:02:32,750 INFO L85 PathProgramCache]: Analyzing trace with hash -744306249, now seen corresponding path program 1 times [2022-04-28 03:02:32,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:32,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987823731] [2022-04-28 03:02:32,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:32,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:32,764 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-28 03:02:32,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:02:32,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1168513009] [2022-04-28 03:02:32,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:32,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:32,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:32,773 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:02:32,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-04-28 03:02:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:32,813 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:02:32,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:32,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:02:32,821 INFO L85 PathProgramCache]: Analyzing trace with hash 245759068, now seen corresponding path program 40 times [2022-04-28 03:02:32,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:32,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510497698] [2022-04-28 03:02:32,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:32,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:32,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:33,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:02:33,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:33,200 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-28 03:02:33,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-28 03:02:33,200 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6423#true} {6423#true} #34#return; {6423#true} is VALID [2022-04-28 03:02:33,201 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-28 03:02:33,201 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-28 03:02:33,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-28 03:02:33,201 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6423#true} {6423#true} #34#return; {6423#true} is VALID [2022-04-28 03:02:33,201 INFO L272 TraceCheckUtils]: 4: Hoare triple {6423#true} call #t~ret4 := main(); {6423#true} is VALID [2022-04-28 03:02:33,202 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-28 03:02:33,203 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-28 03:02:33,203 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-28 03:02:33,204 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-28 03:02:33,205 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-28 03:02:33,205 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-28 03:02:33,206 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-28 03:02:33,207 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-28 03:02:33,207 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-28 03:02:33,208 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-28 03:02:33,209 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-28 03:02:33,209 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-28 03:02:33,210 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-28 03:02:33,211 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-28 03:02:33,212 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-28 03:02:33,212 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-28 03:02:33,213 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-28 03:02:33,214 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-28 03:02:33,214 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-28 03:02:33,215 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-28 03:02:33,216 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-28 03:02:33,216 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-28 03:02:33,216 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-28 03:02:33,216 INFO L290 TraceCheckUtils]: 28: Hoare triple {6424#false} ~cond := #in~cond; {6424#false} is VALID [2022-04-28 03:02:33,217 INFO L290 TraceCheckUtils]: 29: Hoare triple {6424#false} assume 0 == ~cond; {6424#false} is VALID [2022-04-28 03:02:33,217 INFO L290 TraceCheckUtils]: 30: Hoare triple {6424#false} assume !false; {6424#false} is VALID [2022-04-28 03:02:33,217 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:33,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:02:33,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510497698] [2022-04-28 03:02:33,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510497698] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:02:33,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464423434] [2022-04-28 03:02:33,218 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:02:33,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:33,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:33,220 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:02:33,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-04-28 03:02:33,265 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:02:33,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:02:33,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-28 03:02:33,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:33,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:02:33,570 INFO L272 TraceCheckUtils]: 0: Hoare triple {6423#true} call ULTIMATE.init(); {6423#true} is VALID [2022-04-28 03:02:33,570 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-28 03:02:33,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-28 03:02:33,570 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6423#true} {6423#true} #34#return; {6423#true} is VALID [2022-04-28 03:02:33,570 INFO L272 TraceCheckUtils]: 4: Hoare triple {6423#true} call #t~ret4 := main(); {6423#true} is VALID [2022-04-28 03:02:33,571 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-28 03:02:33,571 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-28 03:02:33,572 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-28 03:02:33,572 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-28 03:02:33,573 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-28 03:02:33,573 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-28 03:02:33,574 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-28 03:02:33,574 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-28 03:02:33,575 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-28 03:02:33,575 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-28 03:02:33,576 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-28 03:02:33,576 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-28 03:02:33,577 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-28 03:02:33,577 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-28 03:02:33,578 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-28 03:02:33,579 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-28 03:02:33,580 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-28 03:02:33,581 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-28 03:02:33,581 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-28 03:02:33,582 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-28 03:02:33,583 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-28 03:02:33,583 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-28 03:02:33,583 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-28 03:02:33,583 INFO L290 TraceCheckUtils]: 28: Hoare triple {6424#false} ~cond := #in~cond; {6424#false} is VALID [2022-04-28 03:02:33,583 INFO L290 TraceCheckUtils]: 29: Hoare triple {6424#false} assume 0 == ~cond; {6424#false} is VALID [2022-04-28 03:02:33,584 INFO L290 TraceCheckUtils]: 30: Hoare triple {6424#false} assume !false; {6424#false} is VALID [2022-04-28 03:02:33,584 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:33,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:02:34,365 INFO L290 TraceCheckUtils]: 30: Hoare triple {6424#false} assume !false; {6424#false} is VALID [2022-04-28 03:02:34,366 INFO L290 TraceCheckUtils]: 29: Hoare triple {6424#false} assume 0 == ~cond; {6424#false} is VALID [2022-04-28 03:02:34,366 INFO L290 TraceCheckUtils]: 28: Hoare triple {6424#false} ~cond := #in~cond; {6424#false} is VALID [2022-04-28 03:02:34,366 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-28 03:02:34,366 INFO L290 TraceCheckUtils]: 26: Hoare triple {6556#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {6424#false} is VALID [2022-04-28 03:02:34,367 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-28 03:02:34,368 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-28 03:02:34,370 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-28 03:02:34,371 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-28 03:02:34,372 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-28 03:02:34,372 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-28 03:02:34,373 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-28 03:02:34,374 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-28 03:02:34,374 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-28 03:02:34,375 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-28 03:02:34,376 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-28 03:02:34,380 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-28 03:02:34,380 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-28 03:02:34,381 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-28 03:02:34,382 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-28 03:02:34,382 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-28 03:02:34,383 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-28 03:02:34,383 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-28 03:02:34,384 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-28 03:02:34,385 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-28 03:02:34,385 INFO L290 TraceCheckUtils]: 5: Hoare triple {6423#true} ~x~0 := 268435441; {6636#(< 1 (mod (+ main_~x~0 4294967256) 4294967296))} is VALID [2022-04-28 03:02:34,386 INFO L272 TraceCheckUtils]: 4: Hoare triple {6423#true} call #t~ret4 := main(); {6423#true} is VALID [2022-04-28 03:02:34,386 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6423#true} {6423#true} #34#return; {6423#true} is VALID [2022-04-28 03:02:34,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {6423#true} assume true; {6423#true} is VALID [2022-04-28 03:02:34,386 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-28 03:02:34,386 INFO L272 TraceCheckUtils]: 0: Hoare triple {6423#true} call ULTIMATE.init(); {6423#true} is VALID [2022-04-28 03:02:34,386 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:34,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464423434] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:02:34,386 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:02:34,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-28 03:02:34,387 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:02:34,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1447422333] [2022-04-28 03:02:34,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1447422333] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:02:34,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:02:34,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 03:02:34,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114762504] [2022-04-28 03:02:34,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:02:34,387 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-28 03:02:34,387 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:02:34,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:34,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:34,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 03:02:34,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:34,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 03:02:34,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=572, Invalid=1498, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 03:02:34,407 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:35,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:35,497 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-28 03:02:35,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 03:02:35,497 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-04-28 03:02:35,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:02:35,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:35,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 38 transitions. [2022-04-28 03:02:35,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:35,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 38 transitions. [2022-04-28 03:02:35,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 38 transitions. [2022-04-28 03:02:35,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:35,531 INFO L225 Difference]: With dead ends: 38 [2022-04-28 03:02:35,531 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 03:02:35,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1137, Invalid=3285, Unknown=0, NotChecked=0, Total=4422 [2022-04-28 03:02:35,533 INFO L413 NwaCegarLoop]: 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-28 03:02:35,533 INFO L414 NwaCegarLoop]: 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-28 03:02:35,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 03:02:35,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-28 03:02:35,573 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:02:35,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:35,573 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:35,574 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:35,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:35,574 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-28 03:02:35,574 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-28 03:02:35,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:35,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:35,575 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-28 03:02:35,575 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-28 03:02:35,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:35,575 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-28 03:02:35,575 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-28 03:02:35,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:35,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:35,576 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:02:35,576 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:02:35,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:35,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2022-04-28 03:02:35,577 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2022-04-28 03:02:35,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:02:35,577 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2022-04-28 03:02:35,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:35,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 33 transitions. [2022-04-28 03:02:35,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:35,608 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-28 03:02:35,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 03:02:35,609 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:02:35,609 INFO L195 NwaCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:02:35,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-04-28 03:02:35,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-04-28 03:02:36,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40,40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-04-28 03:02:36,010 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:02:36,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:02:36,010 INFO L85 PathProgramCache]: Analyzing trace with hash -934942218, now seen corresponding path program 41 times [2022-04-28 03:02:36,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:36,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1236415050] [2022-04-28 03:02:36,155 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-28 03:02:36,157 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:02:36,159 INFO L85 PathProgramCache]: Analyzing trace with hash -685200905, now seen corresponding path program 1 times [2022-04-28 03:02:36,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:36,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416260362] [2022-04-28 03:02:36,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:36,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:36,176 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-28 03:02:36,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:02:36,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1737450508] [2022-04-28 03:02:36,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:36,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:36,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:36,184 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:02:36,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-04-28 03:02:36,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:36,226 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:02:36,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:36,234 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:02:36,234 INFO L85 PathProgramCache]: Analyzing trace with hash -934942218, now seen corresponding path program 42 times [2022-04-28 03:02:36,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:36,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537838702] [2022-04-28 03:02:36,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:36,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:36,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:36,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:02:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:36,654 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-28 03:02:36,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {6907#true} assume true; {6907#true} is VALID [2022-04-28 03:02:36,655 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6907#true} {6907#true} #34#return; {6907#true} is VALID [2022-04-28 03:02:36,655 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-28 03:02:36,655 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-28 03:02:36,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {6907#true} assume true; {6907#true} is VALID [2022-04-28 03:02:36,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6907#true} {6907#true} #34#return; {6907#true} is VALID [2022-04-28 03:02:36,655 INFO L272 TraceCheckUtils]: 4: Hoare triple {6907#true} call #t~ret4 := main(); {6907#true} is VALID [2022-04-28 03:02:36,656 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-28 03:02:36,656 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-28 03:02:36,657 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-28 03:02:36,657 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-28 03:02:36,658 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-28 03:02:36,658 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-28 03:02:36,659 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-28 03:02:36,659 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-28 03:02:36,660 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-28 03:02:36,660 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-28 03:02:36,661 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-28 03:02:36,661 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-28 03:02:36,662 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-28 03:02:36,662 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-28 03:02:36,663 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-28 03:02:36,663 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-28 03:02:36,664 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-28 03:02:36,664 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-28 03:02:36,665 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-28 03:02:36,665 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-28 03:02:36,666 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-28 03:02:36,666 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-28 03:02:36,667 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-28 03:02:36,667 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-28 03:02:36,667 INFO L290 TraceCheckUtils]: 29: Hoare triple {6908#false} ~cond := #in~cond; {6908#false} is VALID [2022-04-28 03:02:36,667 INFO L290 TraceCheckUtils]: 30: Hoare triple {6908#false} assume 0 == ~cond; {6908#false} is VALID [2022-04-28 03:02:36,667 INFO L290 TraceCheckUtils]: 31: Hoare triple {6908#false} assume !false; {6908#false} is VALID [2022-04-28 03:02:36,667 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:36,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:02:36,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537838702] [2022-04-28 03:02:36,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537838702] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:02:36,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133664804] [2022-04-28 03:02:36,668 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:02:36,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:36,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:36,669 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:02:36,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-04-28 03:02:36,858 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2022-04-28 03:02:36,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:02:36,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-28 03:02:36,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:36,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:02:37,115 INFO L272 TraceCheckUtils]: 0: Hoare triple {6907#true} call ULTIMATE.init(); {6907#true} is VALID [2022-04-28 03:02:37,116 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-28 03:02:37,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {6907#true} assume true; {6907#true} is VALID [2022-04-28 03:02:37,116 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6907#true} {6907#true} #34#return; {6907#true} is VALID [2022-04-28 03:02:37,116 INFO L272 TraceCheckUtils]: 4: Hoare triple {6907#true} call #t~ret4 := main(); {6907#true} is VALID [2022-04-28 03:02:37,132 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-28 03:02:37,133 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-28 03:02:37,134 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-28 03:02:37,134 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-28 03:02:37,135 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-28 03:02:37,135 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-28 03:02:37,136 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-28 03:02:37,136 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-28 03:02:37,137 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-28 03:02:37,138 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-28 03:02:37,138 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-28 03:02:37,139 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-28 03:02:37,139 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-28 03:02:37,140 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-28 03:02:37,140 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-28 03:02:37,141 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-28 03:02:37,141 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-28 03:02:37,142 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-28 03:02:37,142 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-28 03:02:37,143 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-28 03:02:37,143 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-28 03:02:37,144 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-28 03:02:37,144 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-28 03:02:37,145 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-28 03:02:37,145 INFO L290 TraceCheckUtils]: 29: Hoare triple {6908#false} ~cond := #in~cond; {6908#false} is VALID [2022-04-28 03:02:37,145 INFO L290 TraceCheckUtils]: 30: Hoare triple {6908#false} assume 0 == ~cond; {6908#false} is VALID [2022-04-28 03:02:37,145 INFO L290 TraceCheckUtils]: 31: Hoare triple {6908#false} assume !false; {6908#false} is VALID [2022-04-28 03:02:37,145 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:37,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:02:38,484 INFO L290 TraceCheckUtils]: 31: Hoare triple {6908#false} assume !false; {6908#false} is VALID [2022-04-28 03:02:38,484 INFO L290 TraceCheckUtils]: 30: Hoare triple {7035#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6908#false} is VALID [2022-04-28 03:02:38,485 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-28 03:02:38,485 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-28 03:02:38,486 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-28 03:02:38,489 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-28 03:02:38,490 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-28 03:02:38,491 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-28 03:02:38,492 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-28 03:02:38,493 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-28 03:02:38,498 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-28 03:02:38,498 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-28 03:02:38,501 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-28 03:02:38,502 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-28 03:02:38,503 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-28 03:02:38,506 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-28 03:02:38,508 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-28 03:02:38,511 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-28 03:02:38,513 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-28 03:02:38,514 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-28 03:02:38,514 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-28 03:02:38,516 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-28 03:02:38,516 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-28 03:02:38,518 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-28 03:02:38,519 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-28 03:02:38,520 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-28 03:02:38,521 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-28 03:02:38,521 INFO L272 TraceCheckUtils]: 4: Hoare triple {6907#true} call #t~ret4 := main(); {6907#true} is VALID [2022-04-28 03:02:38,521 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6907#true} {6907#true} #34#return; {6907#true} is VALID [2022-04-28 03:02:38,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {6907#true} assume true; {6907#true} is VALID [2022-04-28 03:02:38,521 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-28 03:02:38,521 INFO L272 TraceCheckUtils]: 0: Hoare triple {6907#true} call ULTIMATE.init(); {6907#true} is VALID [2022-04-28 03:02:38,521 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:38,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133664804] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:02:38,522 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:02:38,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 27] total 51 [2022-04-28 03:02:38,522 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:02:38,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1236415050] [2022-04-28 03:02:38,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1236415050] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:02:38,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:02:38,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 03:02:38,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940554595] [2022-04-28 03:02:38,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:02:38,523 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-28 03:02:38,523 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:02:38,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:38,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:38,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 03:02:38,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:38,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 03:02:38,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=649, Invalid=1901, Unknown=0, NotChecked=0, Total=2550 [2022-04-28 03:02:38,543 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:39,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:39,680 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-28 03:02:39,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 03:02:39,681 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-28 03:02:39,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:02:39,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:39,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 39 transitions. [2022-04-28 03:02:39,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:39,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 39 transitions. [2022-04-28 03:02:39,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 39 transitions. [2022-04-28 03:02:39,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:39,716 INFO L225 Difference]: With dead ends: 39 [2022-04-28 03:02:39,716 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 03:02:39,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1263, Invalid=3993, Unknown=0, NotChecked=0, Total=5256 [2022-04-28 03:02:39,719 INFO L413 NwaCegarLoop]: 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-28 03:02:39,719 INFO L414 NwaCegarLoop]: 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-28 03:02:39,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 03:02:39,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-28 03:02:39,752 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:02:39,752 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:39,752 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:39,752 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:39,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:39,753 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-28 03:02:39,753 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-28 03:02:39,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:39,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:39,754 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-28 03:02:39,754 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-28 03:02:39,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:39,754 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-28 03:02:39,755 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-28 03:02:39,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:39,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:39,755 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:02:39,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:02:39,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:39,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2022-04-28 03:02:39,756 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2022-04-28 03:02:39,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:02:39,756 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2022-04-28 03:02:39,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.12) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:39,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 34 transitions. [2022-04-28 03:02:39,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:39,792 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-28 03:02:39,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 03:02:39,792 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:02:39,792 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:02:39,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-04-28 03:02:39,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-04-28 03:02:40,195 WARN L477 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-28 03:02:40,196 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:02:40,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:02:40,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1118023580, now seen corresponding path program 43 times [2022-04-28 03:02:40,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:40,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1190765997] [2022-04-28 03:02:40,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-28 03:02:40,330 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:02:40,332 INFO L85 PathProgramCache]: Analyzing trace with hash -626095561, now seen corresponding path program 1 times [2022-04-28 03:02:40,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:40,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883371910] [2022-04-28 03:02:40,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:40,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:40,337 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-28 03:02:40,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:02:40,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1691400954] [2022-04-28 03:02:40,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:40,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:40,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:40,343 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:02:40,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-04-28 03:02:40,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:40,405 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:02:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:40,416 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:02:40,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1118023580, now seen corresponding path program 44 times [2022-04-28 03:02:40,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:40,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316859159] [2022-04-28 03:02:40,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:40,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:40,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:40,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:02:40,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:40,840 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-28 03:02:40,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {7410#true} assume true; {7410#true} is VALID [2022-04-28 03:02:40,841 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7410#true} {7410#true} #34#return; {7410#true} is VALID [2022-04-28 03:02:40,841 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-28 03:02:40,841 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-28 03:02:40,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {7410#true} assume true; {7410#true} is VALID [2022-04-28 03:02:40,841 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7410#true} {7410#true} #34#return; {7410#true} is VALID [2022-04-28 03:02:40,842 INFO L272 TraceCheckUtils]: 4: Hoare triple {7410#true} call #t~ret4 := main(); {7410#true} is VALID [2022-04-28 03:02:40,842 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-28 03:02:40,843 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-28 03:02:40,843 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-28 03:02:40,844 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-28 03:02:40,844 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-28 03:02:40,845 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-28 03:02:40,845 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-28 03:02:40,846 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-28 03:02:40,846 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-28 03:02:40,847 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-28 03:02:40,847 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-28 03:02:40,848 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-28 03:02:40,848 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-28 03:02:40,849 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-28 03:02:40,849 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-28 03:02:40,850 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-28 03:02:40,850 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-28 03:02:40,851 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-28 03:02:40,851 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-28 03:02:40,852 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-28 03:02:40,852 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-28 03:02:40,853 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-28 03:02:40,853 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-28 03:02:40,854 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-28 03:02:40,854 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-28 03:02:40,854 INFO L290 TraceCheckUtils]: 30: Hoare triple {7411#false} ~cond := #in~cond; {7411#false} is VALID [2022-04-28 03:02:40,854 INFO L290 TraceCheckUtils]: 31: Hoare triple {7411#false} assume 0 == ~cond; {7411#false} is VALID [2022-04-28 03:02:40,854 INFO L290 TraceCheckUtils]: 32: Hoare triple {7411#false} assume !false; {7411#false} is VALID [2022-04-28 03:02:40,854 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:40,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:02:40,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316859159] [2022-04-28 03:02:40,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316859159] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:02:40,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664684382] [2022-04-28 03:02:40,855 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:02:40,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:40,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:40,856 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:02:40,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-04-28 03:02:40,888 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:02:40,888 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:02:40,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 50 conjunts are in the unsatisfiable core [2022-04-28 03:02:40,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:40,896 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:02:41,157 INFO L272 TraceCheckUtils]: 0: Hoare triple {7410#true} call ULTIMATE.init(); {7410#true} is VALID [2022-04-28 03:02:41,157 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-28 03:02:41,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {7410#true} assume true; {7410#true} is VALID [2022-04-28 03:02:41,157 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7410#true} {7410#true} #34#return; {7410#true} is VALID [2022-04-28 03:02:41,157 INFO L272 TraceCheckUtils]: 4: Hoare triple {7410#true} call #t~ret4 := main(); {7410#true} is VALID [2022-04-28 03:02:41,158 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-28 03:02:41,158 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-28 03:02:41,159 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-28 03:02:41,159 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-28 03:02:41,160 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-28 03:02:41,160 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-28 03:02:41,161 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-28 03:02:41,161 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-28 03:02:41,162 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-28 03:02:41,162 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-28 03:02:41,163 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-28 03:02:41,163 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-28 03:02:41,164 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-28 03:02:41,164 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-28 03:02:41,165 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-28 03:02:41,165 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-28 03:02:41,166 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-28 03:02:41,166 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-28 03:02:41,167 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-28 03:02:41,167 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-28 03:02:41,168 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-28 03:02:41,168 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-28 03:02:41,169 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-28 03:02:41,169 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-28 03:02:41,169 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-28 03:02:41,169 INFO L290 TraceCheckUtils]: 30: Hoare triple {7411#false} ~cond := #in~cond; {7411#false} is VALID [2022-04-28 03:02:41,170 INFO L290 TraceCheckUtils]: 31: Hoare triple {7411#false} assume 0 == ~cond; {7411#false} is VALID [2022-04-28 03:02:41,170 INFO L290 TraceCheckUtils]: 32: Hoare triple {7411#false} assume !false; {7411#false} is VALID [2022-04-28 03:02:41,170 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:41,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:02:42,522 INFO L290 TraceCheckUtils]: 32: Hoare triple {7411#false} assume !false; {7411#false} is VALID [2022-04-28 03:02:42,523 INFO L290 TraceCheckUtils]: 31: Hoare triple {7542#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {7411#false} is VALID [2022-04-28 03:02:42,523 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-28 03:02:42,523 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-28 03:02:42,524 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-28 03:02:42,526 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-28 03:02:42,527 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-28 03:02:42,527 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-28 03:02:42,528 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-28 03:02:42,529 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-28 03:02:42,530 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-28 03:02:42,531 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-28 03:02:42,532 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-28 03:02:42,536 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-28 03:02:42,537 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-28 03:02:42,539 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-28 03:02:42,540 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-28 03:02:42,543 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-28 03:02:42,546 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-28 03:02:42,547 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-28 03:02:42,548 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-28 03:02:42,551 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-28 03:02:42,552 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-28 03:02:42,553 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-28 03:02:42,554 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-28 03:02:42,556 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-28 03:02:42,556 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-28 03:02:42,557 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-28 03:02:42,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {7410#true} call #t~ret4 := main(); {7410#true} is VALID [2022-04-28 03:02:42,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7410#true} {7410#true} #34#return; {7410#true} is VALID [2022-04-28 03:02:42,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {7410#true} assume true; {7410#true} is VALID [2022-04-28 03:02:42,557 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-28 03:02:42,557 INFO L272 TraceCheckUtils]: 0: Hoare triple {7410#true} call ULTIMATE.init(); {7410#true} is VALID [2022-04-28 03:02:42,558 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:42,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664684382] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:02:42,558 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:02:42,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 28] total 53 [2022-04-28 03:02:42,558 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:02:42,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1190765997] [2022-04-28 03:02:42,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1190765997] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:02:42,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:02:42,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 03:02:42,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700698345] [2022-04-28 03:02:42,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:02:42,559 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-28 03:02:42,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:02:42,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:42,579 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:42,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 03:02:42,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:42,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 03:02:42,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=701, Invalid=2055, Unknown=0, NotChecked=0, Total=2756 [2022-04-28 03:02:42,580 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:43,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:43,967 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-28 03:02:43,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 03:02:43,967 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-04-28 03:02:43,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:02:43,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:43,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. [2022-04-28 03:02:43,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:43,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. [2022-04-28 03:02:43,969 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 40 transitions. [2022-04-28 03:02:44,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:44,016 INFO L225 Difference]: With dead ends: 40 [2022-04-28 03:02:44,016 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 03:02:44,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1366, Invalid=4334, Unknown=0, NotChecked=0, Total=5700 [2022-04-28 03:02:44,018 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:02:44,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 123 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 03:02:44,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 03:02:44,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-28 03:02:44,050 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:02:44,050 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:44,050 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:44,051 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:44,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:44,051 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-28 03:02:44,051 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-28 03:02:44,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:44,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:44,052 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-28 03:02:44,052 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-28 03:02:44,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:44,052 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-28 03:02:44,053 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-28 03:02:44,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:44,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:44,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:02:44,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:02:44,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:44,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2022-04-28 03:02:44,054 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2022-04-28 03:02:44,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:02:44,054 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2022-04-28 03:02:44,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 25 states have internal predecessors, (29), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:44,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 35 transitions. [2022-04-28 03:02:44,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:44,090 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-28 03:02:44,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 03:02:44,090 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:02:44,090 INFO L195 NwaCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:02:44,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-04-28 03:02:44,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-04-28 03:02:44,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44,SelfDestructingSolverStorable45 [2022-04-28 03:02:44,495 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:02:44,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:02:44,495 INFO L85 PathProgramCache]: Analyzing trace with hash 335453878, now seen corresponding path program 45 times [2022-04-28 03:02:44,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:44,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1090357737] [2022-04-28 03:02:44,626 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-28 03:02:44,628 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:02:44,630 INFO L85 PathProgramCache]: Analyzing trace with hash -566990217, now seen corresponding path program 1 times [2022-04-28 03:02:44,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:44,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837152397] [2022-04-28 03:02:44,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:44,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:44,637 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-28 03:02:44,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:02:44,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1353849033] [2022-04-28 03:02:44,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:44,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:44,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:44,644 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:02:44,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-04-28 03:02:44,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:44,686 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:02:44,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:44,695 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:02:44,695 INFO L85 PathProgramCache]: Analyzing trace with hash 335453878, now seen corresponding path program 46 times [2022-04-28 03:02:44,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:44,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056371095] [2022-04-28 03:02:44,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:44,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:45,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:02:45,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:45,164 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-28 03:02:45,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {7929#true} assume true; {7929#true} is VALID [2022-04-28 03:02:45,165 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7929#true} {7929#true} #34#return; {7929#true} is VALID [2022-04-28 03:02:45,165 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-28 03:02:45,165 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-28 03:02:45,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {7929#true} assume true; {7929#true} is VALID [2022-04-28 03:02:45,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7929#true} {7929#true} #34#return; {7929#true} is VALID [2022-04-28 03:02:45,165 INFO L272 TraceCheckUtils]: 4: Hoare triple {7929#true} call #t~ret4 := main(); {7929#true} is VALID [2022-04-28 03:02:45,166 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-28 03:02:45,166 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-28 03:02:45,167 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-28 03:02:45,167 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-28 03:02:45,168 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-28 03:02:45,168 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-28 03:02:45,169 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-28 03:02:45,169 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-28 03:02:45,170 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-28 03:02:45,170 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-28 03:02:45,171 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-28 03:02:45,171 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-28 03:02:45,172 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-28 03:02:45,172 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-28 03:02:45,173 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-28 03:02:45,173 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-28 03:02:45,173 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-28 03:02:45,174 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-28 03:02:45,174 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-28 03:02:45,175 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-28 03:02:45,175 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-28 03:02:45,176 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-28 03:02:45,176 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-28 03:02:45,177 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-28 03:02:45,177 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-28 03:02:45,177 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-28 03:02:45,178 INFO L290 TraceCheckUtils]: 31: Hoare triple {7930#false} ~cond := #in~cond; {7930#false} is VALID [2022-04-28 03:02:45,178 INFO L290 TraceCheckUtils]: 32: Hoare triple {7930#false} assume 0 == ~cond; {7930#false} is VALID [2022-04-28 03:02:45,178 INFO L290 TraceCheckUtils]: 33: Hoare triple {7930#false} assume !false; {7930#false} is VALID [2022-04-28 03:02:45,178 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:45,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:02:45,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056371095] [2022-04-28 03:02:45,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056371095] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:02:45,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290317538] [2022-04-28 03:02:45,178 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:02:45,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:45,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:45,179 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:02:45,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-04-28 03:02:45,240 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:02:45,240 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:02:45,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-28 03:02:45,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:45,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:02:45,585 INFO L272 TraceCheckUtils]: 0: Hoare triple {7929#true} call ULTIMATE.init(); {7929#true} is VALID [2022-04-28 03:02:45,586 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-28 03:02:45,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {7929#true} assume true; {7929#true} is VALID [2022-04-28 03:02:45,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7929#true} {7929#true} #34#return; {7929#true} is VALID [2022-04-28 03:02:45,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {7929#true} call #t~ret4 := main(); {7929#true} is VALID [2022-04-28 03:02:45,586 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-28 03:02:45,587 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-28 03:02:45,587 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-28 03:02:45,588 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-28 03:02:45,588 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-28 03:02:45,589 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-28 03:02:45,589 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-28 03:02:45,590 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-28 03:02:45,590 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-28 03:02:45,591 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-28 03:02:45,591 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-28 03:02:45,592 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-28 03:02:45,592 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-28 03:02:45,593 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-28 03:02:45,593 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-28 03:02:45,594 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-28 03:02:45,594 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-28 03:02:45,595 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-28 03:02:45,595 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-28 03:02:45,596 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-28 03:02:45,596 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-28 03:02:45,597 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-28 03:02:45,597 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-28 03:02:45,598 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-28 03:02:45,598 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-28 03:02:45,599 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-28 03:02:45,599 INFO L290 TraceCheckUtils]: 31: Hoare triple {7930#false} ~cond := #in~cond; {7930#false} is VALID [2022-04-28 03:02:45,599 INFO L290 TraceCheckUtils]: 32: Hoare triple {7930#false} assume 0 == ~cond; {7930#false} is VALID [2022-04-28 03:02:45,599 INFO L290 TraceCheckUtils]: 33: Hoare triple {7930#false} assume !false; {7930#false} is VALID [2022-04-28 03:02:45,599 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:45,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:02:46,616 INFO L290 TraceCheckUtils]: 33: Hoare triple {7930#false} assume !false; {7930#false} is VALID [2022-04-28 03:02:46,616 INFO L290 TraceCheckUtils]: 32: Hoare triple {7930#false} assume 0 == ~cond; {7930#false} is VALID [2022-04-28 03:02:46,616 INFO L290 TraceCheckUtils]: 31: Hoare triple {7930#false} ~cond := #in~cond; {7930#false} is VALID [2022-04-28 03:02:46,616 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-28 03:02:46,616 INFO L290 TraceCheckUtils]: 29: Hoare triple {8074#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {7930#false} is VALID [2022-04-28 03:02:46,618 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-28 03:02:46,618 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-28 03:02:46,619 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-28 03:02:46,619 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-28 03:02:46,620 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-28 03:02:46,621 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-28 03:02:46,621 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-28 03:02:46,622 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-28 03:02:46,623 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-28 03:02:46,623 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-28 03:02:46,624 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-28 03:02:46,624 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-28 03:02:46,625 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-28 03:02:46,626 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-28 03:02:46,627 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-28 03:02:46,628 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-28 03:02:46,628 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-28 03:02:46,630 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-28 03:02:46,630 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-28 03:02:46,631 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-28 03:02:46,632 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-28 03:02:46,632 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-28 03:02:46,633 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-28 03:02:46,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {7929#true} ~x~0 := 268435441; {8166#(< 1 (mod (+ 4294967250 main_~x~0) 4294967296))} is VALID [2022-04-28 03:02:46,634 INFO L272 TraceCheckUtils]: 4: Hoare triple {7929#true} call #t~ret4 := main(); {7929#true} is VALID [2022-04-28 03:02:46,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7929#true} {7929#true} #34#return; {7929#true} is VALID [2022-04-28 03:02:46,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {7929#true} assume true; {7929#true} is VALID [2022-04-28 03:02:46,634 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-28 03:02:46,634 INFO L272 TraceCheckUtils]: 0: Hoare triple {7929#true} call ULTIMATE.init(); {7929#true} is VALID [2022-04-28 03:02:46,634 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:46,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [290317538] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:02:46,634 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:02:46,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 52 [2022-04-28 03:02:46,635 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:02:46,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1090357737] [2022-04-28 03:02:46,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1090357737] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:02:46,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:02:46,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-28 03:02:46,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965204763] [2022-04-28 03:02:46,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:02:46,635 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-28 03:02:46,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:02:46,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:46,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:46,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-28 03:02:46,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:46,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-28 03:02:46,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=725, Invalid=1927, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 03:02:46,657 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:48,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:48,039 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-28 03:02:48,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 03:02:48,039 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-28 03:02:48,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:02:48,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:48,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 41 transitions. [2022-04-28 03:02:48,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:48,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 41 transitions. [2022-04-28 03:02:48,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 41 transitions. [2022-04-28 03:02:48,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:48,068 INFO L225 Difference]: With dead ends: 41 [2022-04-28 03:02:48,068 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 03:02:48,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1443, Invalid=4257, Unknown=0, NotChecked=0, Total=5700 [2022-04-28 03:02:48,069 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:02:48,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 118 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 03:02:48,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 03:02:48,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-28 03:02:48,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:02:48,111 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:48,111 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:48,111 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:48,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:48,112 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-28 03:02:48,112 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-28 03:02:48,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:48,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:48,113 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-28 03:02:48,113 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-28 03:02:48,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:48,113 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-28 03:02:48,113 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-28 03:02:48,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:48,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:48,114 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:02:48,114 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:02:48,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:48,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2022-04-28 03:02:48,115 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2022-04-28 03:02:48,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:02:48,115 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2022-04-28 03:02:48,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:48,115 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 36 transitions. [2022-04-28 03:02:48,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:48,157 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-28 03:02:48,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 03:02:48,158 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:02:48,158 INFO L195 NwaCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:02:48,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-04-28 03:02:48,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2022-04-28 03:02:48,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46,SelfDestructingSolverStorable47,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:48,559 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:02:48,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:02:48,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1845596892, now seen corresponding path program 47 times [2022-04-28 03:02:48,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:48,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1562167763] [2022-04-28 03:02:48,726 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:02:48,728 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:02:48,730 INFO L85 PathProgramCache]: Analyzing trace with hash -507884873, now seen corresponding path program 1 times [2022-04-28 03:02:48,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:48,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170801601] [2022-04-28 03:02:48,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:48,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:48,736 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-28 03:02:48,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:02:48,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1258616074] [2022-04-28 03:02:48,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:48,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:48,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:48,744 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:02:48,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-04-28 03:02:48,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:48,800 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:02:48,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:48,818 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:02:48,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1845596892, now seen corresponding path program 48 times [2022-04-28 03:02:48,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:48,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199306499] [2022-04-28 03:02:48,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:48,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:48,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:49,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:02:49,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:49,392 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-28 03:02:49,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {8461#true} assume true; {8461#true} is VALID [2022-04-28 03:02:49,392 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8461#true} {8461#true} #34#return; {8461#true} is VALID [2022-04-28 03:02:49,393 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-28 03:02:49,393 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-28 03:02:49,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {8461#true} assume true; {8461#true} is VALID [2022-04-28 03:02:49,393 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8461#true} {8461#true} #34#return; {8461#true} is VALID [2022-04-28 03:02:49,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {8461#true} call #t~ret4 := main(); {8461#true} is VALID [2022-04-28 03:02:49,394 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-28 03:02:49,395 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-28 03:02:49,395 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-28 03:02:49,396 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-28 03:02:49,396 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-28 03:02:49,397 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-28 03:02:49,398 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-28 03:02:49,398 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-28 03:02:49,399 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-28 03:02:49,400 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-28 03:02:49,400 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-28 03:02:49,401 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-28 03:02:49,402 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-28 03:02:49,402 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-28 03:02:49,403 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-28 03:02:49,403 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-28 03:02:49,404 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-28 03:02:49,405 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-28 03:02:49,405 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-28 03:02:49,406 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-28 03:02:49,407 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-28 03:02:49,407 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-28 03:02:49,408 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-28 03:02:49,408 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-28 03:02:49,409 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-28 03:02:49,410 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-28 03:02:49,410 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-28 03:02:49,410 INFO L290 TraceCheckUtils]: 32: Hoare triple {8462#false} ~cond := #in~cond; {8462#false} is VALID [2022-04-28 03:02:49,410 INFO L290 TraceCheckUtils]: 33: Hoare triple {8462#false} assume 0 == ~cond; {8462#false} is VALID [2022-04-28 03:02:49,410 INFO L290 TraceCheckUtils]: 34: Hoare triple {8462#false} assume !false; {8462#false} is VALID [2022-04-28 03:02:49,411 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:49,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:02:49,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199306499] [2022-04-28 03:02:49,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199306499] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:02:49,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418005440] [2022-04-28 03:02:49,411 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:02:49,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:49,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:49,412 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:02:49,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-04-28 03:02:49,796 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-28 03:02:49,797 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:02:49,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 54 conjunts are in the unsatisfiable core [2022-04-28 03:02:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:49,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:02:50,073 INFO L272 TraceCheckUtils]: 0: Hoare triple {8461#true} call ULTIMATE.init(); {8461#true} is VALID [2022-04-28 03:02:50,073 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-28 03:02:50,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {8461#true} assume true; {8461#true} is VALID [2022-04-28 03:02:50,073 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8461#true} {8461#true} #34#return; {8461#true} is VALID [2022-04-28 03:02:50,073 INFO L272 TraceCheckUtils]: 4: Hoare triple {8461#true} call #t~ret4 := main(); {8461#true} is VALID [2022-04-28 03:02:50,074 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-28 03:02:50,074 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-28 03:02:50,075 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-28 03:02:50,075 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-28 03:02:50,076 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-28 03:02:50,076 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-28 03:02:50,077 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-28 03:02:50,077 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-28 03:02:50,078 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-28 03:02:50,078 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-28 03:02:50,079 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-28 03:02:50,079 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-28 03:02:50,080 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-28 03:02:50,080 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-28 03:02:50,080 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-28 03:02:50,081 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-28 03:02:50,081 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-28 03:02:50,082 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-28 03:02:50,082 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-28 03:02:50,083 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-28 03:02:50,083 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-28 03:02:50,084 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-28 03:02:50,087 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-28 03:02:50,088 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-28 03:02:50,088 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-28 03:02:50,089 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-28 03:02:50,089 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-28 03:02:50,089 INFO L290 TraceCheckUtils]: 32: Hoare triple {8462#false} ~cond := #in~cond; {8462#false} is VALID [2022-04-28 03:02:50,089 INFO L290 TraceCheckUtils]: 33: Hoare triple {8462#false} assume 0 == ~cond; {8462#false} is VALID [2022-04-28 03:02:50,089 INFO L290 TraceCheckUtils]: 34: Hoare triple {8462#false} assume !false; {8462#false} is VALID [2022-04-28 03:02:50,090 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:50,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:02:51,660 INFO L290 TraceCheckUtils]: 34: Hoare triple {8462#false} assume !false; {8462#false} is VALID [2022-04-28 03:02:51,660 INFO L290 TraceCheckUtils]: 33: Hoare triple {8601#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {8462#false} is VALID [2022-04-28 03:02:51,660 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-28 03:02:51,661 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-28 03:02:51,662 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-28 03:02:51,663 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-28 03:02:51,664 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-28 03:02:51,665 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-28 03:02:51,666 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-28 03:02:51,667 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-28 03:02:51,673 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-28 03:02:51,673 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-28 03:02:51,674 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-28 03:02:51,675 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-28 03:02:51,676 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-28 03:02:51,677 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-28 03:02:51,677 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-28 03:02:51,680 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-28 03:02:51,682 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-28 03:02:51,684 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-28 03:02:51,684 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-28 03:02:51,686 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-28 03:02:51,687 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-28 03:02:51,688 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-28 03:02:51,689 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-28 03:02:51,691 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-28 03:02:51,692 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-28 03:02:51,693 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-28 03:02:51,693 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-28 03:02:51,694 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-28 03:02:51,694 INFO L272 TraceCheckUtils]: 4: Hoare triple {8461#true} call #t~ret4 := main(); {8461#true} is VALID [2022-04-28 03:02:51,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8461#true} {8461#true} #34#return; {8461#true} is VALID [2022-04-28 03:02:51,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {8461#true} assume true; {8461#true} is VALID [2022-04-28 03:02:51,694 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-28 03:02:51,694 INFO L272 TraceCheckUtils]: 0: Hoare triple {8461#true} call ULTIMATE.init(); {8461#true} is VALID [2022-04-28 03:02:51,694 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:51,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418005440] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:02:51,695 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:02:51,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 30] total 57 [2022-04-28 03:02:51,695 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:02:51,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1562167763] [2022-04-28 03:02:51,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1562167763] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:02:51,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:02:51,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-28 03:02:51,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284468379] [2022-04-28 03:02:51,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:02:51,695 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-28 03:02:51,696 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:02:51,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:51,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:51,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-28 03:02:51,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:51,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-28 03:02:51,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=811, Invalid=2381, Unknown=0, NotChecked=0, Total=3192 [2022-04-28 03:02:51,725 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:53,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:53,162 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-28 03:02:53,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 03:02:53,162 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-28 03:02:53,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:02:53,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:53,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2022-04-28 03:02:53,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:53,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2022-04-28 03:02:53,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 42 transitions. [2022-04-28 03:02:53,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:53,200 INFO L225 Difference]: With dead ends: 42 [2022-04-28 03:02:53,200 INFO L226 Difference]: Without dead ends: 37 [2022-04-28 03:02:53,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1584, Invalid=5058, Unknown=0, NotChecked=0, Total=6642 [2022-04-28 03:02:53,202 INFO L413 NwaCegarLoop]: 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-28 03:02:53,202 INFO L414 NwaCegarLoop]: 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-28 03:02:53,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-28 03:02:53,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-28 03:02:53,241 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:02:53,241 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:53,241 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:53,241 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:53,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:53,243 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-28 03:02:53,243 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-28 03:02:53,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:53,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:53,244 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-28 03:02:53,244 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-28 03:02:53,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:53,246 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-28 03:02:53,246 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-28 03:02:53,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:53,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:53,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:02:53,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:02:53,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:53,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2022-04-28 03:02:53,246 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2022-04-28 03:02:53,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:02:53,247 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2022-04-28 03:02:53,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 27 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:53,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 37 transitions. [2022-04-28 03:02:53,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:53,276 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-28 03:02:53,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 03:02:53,276 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:02:53,276 INFO L195 NwaCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:02:53,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-04-28 03:02:53,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-04-28 03:02:53,677 WARN L477 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-28 03:02:53,677 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:02:53,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:02:53,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1415390070, now seen corresponding path program 49 times [2022-04-28 03:02:53,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:53,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1908208917] [2022-04-28 03:02:53,810 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-28 03:02:53,811 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:02:53,813 INFO L85 PathProgramCache]: Analyzing trace with hash -448779529, now seen corresponding path program 1 times [2022-04-28 03:02:53,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:53,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342478897] [2022-04-28 03:02:53,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:53,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:53,820 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-28 03:02:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:02:53,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1369825017] [2022-04-28 03:02:53,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:53,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:53,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:53,827 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:02:53,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-04-28 03:02:53,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:53,883 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:02:53,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:53,892 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:02:53,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1415390070, now seen corresponding path program 50 times [2022-04-28 03:02:53,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:53,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370227834] [2022-04-28 03:02:53,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:53,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:53,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:54,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:02:54,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:54,406 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-28 03:02:54,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {9012#true} assume true; {9012#true} is VALID [2022-04-28 03:02:54,406 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9012#true} {9012#true} #34#return; {9012#true} is VALID [2022-04-28 03:02:54,407 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-28 03:02:54,407 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-28 03:02:54,407 INFO L290 TraceCheckUtils]: 2: Hoare triple {9012#true} assume true; {9012#true} is VALID [2022-04-28 03:02:54,407 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9012#true} {9012#true} #34#return; {9012#true} is VALID [2022-04-28 03:02:54,407 INFO L272 TraceCheckUtils]: 4: Hoare triple {9012#true} call #t~ret4 := main(); {9012#true} is VALID [2022-04-28 03:02:54,408 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-28 03:02:54,408 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-28 03:02:54,409 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-28 03:02:54,409 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-28 03:02:54,410 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-28 03:02:54,410 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-28 03:02:54,411 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-28 03:02:54,411 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-28 03:02:54,412 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-28 03:02:54,412 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-28 03:02:54,413 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-28 03:02:54,413 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-28 03:02:54,414 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-28 03:02:54,414 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-28 03:02:54,415 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-28 03:02:54,415 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-28 03:02:54,416 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-28 03:02:54,416 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-28 03:02:54,417 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-28 03:02:54,417 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-28 03:02:54,418 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-28 03:02:54,418 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-28 03:02:54,419 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-28 03:02:54,419 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-28 03:02:54,419 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-28 03:02:54,420 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-28 03:02:54,420 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-28 03:02:54,421 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-28 03:02:54,421 INFO L290 TraceCheckUtils]: 33: Hoare triple {9013#false} ~cond := #in~cond; {9013#false} is VALID [2022-04-28 03:02:54,421 INFO L290 TraceCheckUtils]: 34: Hoare triple {9013#false} assume 0 == ~cond; {9013#false} is VALID [2022-04-28 03:02:54,421 INFO L290 TraceCheckUtils]: 35: Hoare triple {9013#false} assume !false; {9013#false} is VALID [2022-04-28 03:02:54,421 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:54,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:02:54,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370227834] [2022-04-28 03:02:54,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370227834] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:02:54,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353873593] [2022-04-28 03:02:54,421 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:02:54,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:54,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:54,422 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:02:54,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-04-28 03:02:54,488 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:02:54,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:02:54,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 53 conjunts are in the unsatisfiable core [2022-04-28 03:02:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:54,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:02:54,857 INFO L272 TraceCheckUtils]: 0: Hoare triple {9012#true} call ULTIMATE.init(); {9012#true} is VALID [2022-04-28 03:02:54,858 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-28 03:02:54,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {9012#true} assume true; {9012#true} is VALID [2022-04-28 03:02:54,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9012#true} {9012#true} #34#return; {9012#true} is VALID [2022-04-28 03:02:54,858 INFO L272 TraceCheckUtils]: 4: Hoare triple {9012#true} call #t~ret4 := main(); {9012#true} is VALID [2022-04-28 03:02:54,858 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-28 03:02:54,859 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-28 03:02:54,859 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-28 03:02:54,860 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-28 03:02:54,860 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-28 03:02:54,861 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-28 03:02:54,861 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-28 03:02:54,862 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-28 03:02:54,862 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-28 03:02:54,863 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-28 03:02:54,863 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-28 03:02:54,864 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-28 03:02:54,864 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-28 03:02:54,865 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-28 03:02:54,865 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-28 03:02:54,866 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-28 03:02:54,866 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-28 03:02:54,867 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-28 03:02:54,867 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-28 03:02:54,868 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-28 03:02:54,868 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-28 03:02:54,869 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-28 03:02:54,869 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-28 03:02:54,870 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-28 03:02:54,870 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-28 03:02:54,871 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-28 03:02:54,871 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-28 03:02:54,871 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-28 03:02:54,871 INFO L290 TraceCheckUtils]: 33: Hoare triple {9013#false} ~cond := #in~cond; {9013#false} is VALID [2022-04-28 03:02:54,872 INFO L290 TraceCheckUtils]: 34: Hoare triple {9013#false} assume 0 == ~cond; {9013#false} is VALID [2022-04-28 03:02:54,872 INFO L290 TraceCheckUtils]: 35: Hoare triple {9013#false} assume !false; {9013#false} is VALID [2022-04-28 03:02:54,872 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:54,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:02:56,052 INFO L290 TraceCheckUtils]: 35: Hoare triple {9013#false} assume !false; {9013#false} is VALID [2022-04-28 03:02:56,052 INFO L290 TraceCheckUtils]: 34: Hoare triple {9013#false} assume 0 == ~cond; {9013#false} is VALID [2022-04-28 03:02:56,052 INFO L290 TraceCheckUtils]: 33: Hoare triple {9013#false} ~cond := #in~cond; {9013#false} is VALID [2022-04-28 03:02:56,052 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-28 03:02:56,053 INFO L290 TraceCheckUtils]: 31: Hoare triple {9165#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {9013#false} is VALID [2022-04-28 03:02:56,054 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-28 03:02:56,055 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-28 03:02:56,056 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-28 03:02:56,056 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-28 03:02:56,057 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-28 03:02:56,057 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-28 03:02:56,058 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-28 03:02:56,059 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-28 03:02:56,059 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-28 03:02:56,060 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-28 03:02:56,060 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-28 03:02:56,061 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-28 03:02:56,062 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-28 03:02:56,062 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-28 03:02:56,063 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-28 03:02:56,064 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-28 03:02:56,064 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-28 03:02:56,065 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-28 03:02:56,065 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-28 03:02:56,066 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-28 03:02:56,067 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-28 03:02:56,067 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-28 03:02:56,068 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-28 03:02:56,069 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-28 03:02:56,069 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-28 03:02:56,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {9012#true} ~x~0 := 268435441; {9265#(< 1 (mod (+ 4294967246 main_~x~0) 4294967296))} is VALID [2022-04-28 03:02:56,070 INFO L272 TraceCheckUtils]: 4: Hoare triple {9012#true} call #t~ret4 := main(); {9012#true} is VALID [2022-04-28 03:02:56,070 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9012#true} {9012#true} #34#return; {9012#true} is VALID [2022-04-28 03:02:56,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {9012#true} assume true; {9012#true} is VALID [2022-04-28 03:02:56,070 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-28 03:02:56,070 INFO L272 TraceCheckUtils]: 0: Hoare triple {9012#true} call ULTIMATE.init(); {9012#true} is VALID [2022-04-28 03:02:56,070 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:56,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353873593] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:02:56,070 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:02:56,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 56 [2022-04-28 03:02:56,071 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:02:56,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1908208917] [2022-04-28 03:02:56,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1908208917] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:02:56,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:02:56,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-28 03:02:56,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171015236] [2022-04-28 03:02:56,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:02:56,071 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-28 03:02:56,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:02:56,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:56,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:56,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-28 03:02:56,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:56,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-28 03:02:56,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=837, Invalid=2243, Unknown=0, NotChecked=0, Total=3080 [2022-04-28 03:02:56,094 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:57,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:57,598 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-28 03:02:57,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 03:02:57,598 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-28 03:02:57,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:02:57,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:57,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2022-04-28 03:02:57,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:57,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2022-04-28 03:02:57,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 43 transitions. [2022-04-28 03:02:57,630 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:57,630 INFO L225 Difference]: With dead ends: 43 [2022-04-28 03:02:57,630 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 03:02:57,631 INFO L412 NwaCegarLoop]: 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-28 03:02:57,631 INFO L413 NwaCegarLoop]: 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-28 03:02:57,632 INFO L414 NwaCegarLoop]: 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-28 03:02:57,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 03:02:57,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-28 03:02:57,678 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:02:57,678 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:57,678 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:57,678 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:57,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:57,679 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-28 03:02:57,679 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-28 03:02:57,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:57,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:57,679 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-28 03:02:57,679 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 38 states. [2022-04-28 03:02:57,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:57,680 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-28 03:02:57,680 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-28 03:02:57,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:57,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:57,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:02:57,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:02:57,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.0303030303030303) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:57,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2022-04-28 03:02:57,681 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2022-04-28 03:02:57,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:02:57,681 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2022-04-28 03:02:57,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:02:57,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 38 transitions. [2022-04-28 03:02:57,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:02:57,712 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-28 03:02:57,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 03:02:57,712 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:02:57,712 INFO L195 NwaCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:02:57,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-04-28 03:02:57,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-04-28 03:02:58,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable50,50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2022-04-28 03:02:58,117 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:02:58,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:02:58,118 INFO L85 PathProgramCache]: Analyzing trace with hash 963880476, now seen corresponding path program 51 times [2022-04-28 03:02:58,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:58,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1383222470] [2022-04-28 03:02:58,242 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-28 03:02:58,245 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:02:58,246 INFO L85 PathProgramCache]: Analyzing trace with hash -389674185, now seen corresponding path program 1 times [2022-04-28 03:02:58,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:58,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430106278] [2022-04-28 03:02:58,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:58,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:58,251 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-28 03:02:58,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:02:58,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [774184673] [2022-04-28 03:02:58,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:58,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:58,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:58,257 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:02:58,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-04-28 03:02:58,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:58,294 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:02:58,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:58,303 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:02:58,304 INFO L85 PathProgramCache]: Analyzing trace with hash 963880476, now seen corresponding path program 52 times [2022-04-28 03:02:58,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:58,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224719837] [2022-04-28 03:02:58,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:58,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:58,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:58,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:02:58,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:58,858 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-28 03:02:58,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {9576#true} assume true; {9576#true} is VALID [2022-04-28 03:02:58,859 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9576#true} {9576#true} #34#return; {9576#true} is VALID [2022-04-28 03:02:58,859 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-28 03:02:58,859 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-28 03:02:58,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {9576#true} assume true; {9576#true} is VALID [2022-04-28 03:02:58,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9576#true} {9576#true} #34#return; {9576#true} is VALID [2022-04-28 03:02:58,860 INFO L272 TraceCheckUtils]: 4: Hoare triple {9576#true} call #t~ret4 := main(); {9576#true} is VALID [2022-04-28 03:02:58,860 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-28 03:02:58,861 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-28 03:02:58,861 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-28 03:02:58,862 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-28 03:02:58,862 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-28 03:02:58,863 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-28 03:02:58,863 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-28 03:02:58,864 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-28 03:02:58,864 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-28 03:02:58,865 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-28 03:02:58,865 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-28 03:02:58,866 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-28 03:02:58,866 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-28 03:02:58,867 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-28 03:02:58,867 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-28 03:02:58,868 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-28 03:02:58,868 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-28 03:02:58,869 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-28 03:02:58,869 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-28 03:02:58,870 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-28 03:02:58,870 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-28 03:02:58,871 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-28 03:02:58,871 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-28 03:02:58,872 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-28 03:02:58,872 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-28 03:02:58,873 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-28 03:02:58,873 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-28 03:02:58,874 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-28 03:02:58,874 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-28 03:02:58,874 INFO L290 TraceCheckUtils]: 34: Hoare triple {9577#false} ~cond := #in~cond; {9577#false} is VALID [2022-04-28 03:02:58,874 INFO L290 TraceCheckUtils]: 35: Hoare triple {9577#false} assume 0 == ~cond; {9577#false} is VALID [2022-04-28 03:02:58,874 INFO L290 TraceCheckUtils]: 36: Hoare triple {9577#false} assume !false; {9577#false} is VALID [2022-04-28 03:02:58,874 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:58,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:02:58,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224719837] [2022-04-28 03:02:58,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224719837] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:02:58,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844740739] [2022-04-28 03:02:58,875 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:02:58,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:58,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:58,876 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:02:58,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-04-28 03:02:58,950 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:02:58,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:02:58,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 55 conjunts are in the unsatisfiable core [2022-04-28 03:02:58,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:58,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:02:59,343 INFO L272 TraceCheckUtils]: 0: Hoare triple {9576#true} call ULTIMATE.init(); {9576#true} is VALID [2022-04-28 03:02:59,343 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-28 03:02:59,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {9576#true} assume true; {9576#true} is VALID [2022-04-28 03:02:59,343 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9576#true} {9576#true} #34#return; {9576#true} is VALID [2022-04-28 03:02:59,344 INFO L272 TraceCheckUtils]: 4: Hoare triple {9576#true} call #t~ret4 := main(); {9576#true} is VALID [2022-04-28 03:02:59,344 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-28 03:02:59,345 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-28 03:02:59,345 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-28 03:02:59,346 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-28 03:02:59,347 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-28 03:02:59,347 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-28 03:02:59,348 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-28 03:02:59,348 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-28 03:02:59,349 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-28 03:02:59,350 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-28 03:02:59,350 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-28 03:02:59,351 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-28 03:02:59,352 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-28 03:02:59,352 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-28 03:02:59,353 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-28 03:02:59,353 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-28 03:02:59,354 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-28 03:02:59,354 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-28 03:02:59,355 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-28 03:02:59,355 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-28 03:02:59,356 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-28 03:02:59,356 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-28 03:02:59,357 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-28 03:02:59,357 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-28 03:02:59,358 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-28 03:02:59,358 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-28 03:02:59,359 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-28 03:02:59,359 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-28 03:02:59,359 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-28 03:02:59,360 INFO L290 TraceCheckUtils]: 34: Hoare triple {9577#false} ~cond := #in~cond; {9577#false} is VALID [2022-04-28 03:02:59,360 INFO L290 TraceCheckUtils]: 35: Hoare triple {9577#false} assume 0 == ~cond; {9577#false} is VALID [2022-04-28 03:02:59,360 INFO L290 TraceCheckUtils]: 36: Hoare triple {9577#false} assume !false; {9577#false} is VALID [2022-04-28 03:02:59,360 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:02:59,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:03:00,594 INFO L290 TraceCheckUtils]: 36: Hoare triple {9577#false} assume !false; {9577#false} is VALID [2022-04-28 03:03:00,594 INFO L290 TraceCheckUtils]: 35: Hoare triple {9577#false} assume 0 == ~cond; {9577#false} is VALID [2022-04-28 03:03:00,594 INFO L290 TraceCheckUtils]: 34: Hoare triple {9577#false} ~cond := #in~cond; {9577#false} is VALID [2022-04-28 03:03:00,594 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-28 03:03:00,594 INFO L290 TraceCheckUtils]: 32: Hoare triple {9733#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {9577#false} is VALID [2022-04-28 03:03:00,596 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-28 03:03:00,597 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-28 03:03:00,597 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-28 03:03:00,598 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-28 03:03:00,599 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-28 03:03:00,599 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-28 03:03:00,600 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-28 03:03:00,600 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-28 03:03:00,601 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-28 03:03:00,602 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-28 03:03:00,603 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-28 03:03:00,603 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-28 03:03:00,604 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-28 03:03:00,605 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-28 03:03:00,605 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-28 03:03:00,606 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-28 03:03:00,607 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-28 03:03:00,607 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-28 03:03:00,608 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-28 03:03:00,609 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-28 03:03:00,610 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-28 03:03:00,614 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-28 03:03:00,615 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-28 03:03:00,615 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-28 03:03:00,617 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-28 03:03:00,617 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-28 03:03:00,618 INFO L290 TraceCheckUtils]: 5: Hoare triple {9576#true} ~x~0 := 268435441; {9837#(< 1 (mod (+ main_~x~0 4294967244) 4294967296))} is VALID [2022-04-28 03:03:00,618 INFO L272 TraceCheckUtils]: 4: Hoare triple {9576#true} call #t~ret4 := main(); {9576#true} is VALID [2022-04-28 03:03:00,618 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9576#true} {9576#true} #34#return; {9576#true} is VALID [2022-04-28 03:03:00,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {9576#true} assume true; {9576#true} is VALID [2022-04-28 03:03:00,618 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-28 03:03:00,618 INFO L272 TraceCheckUtils]: 0: Hoare triple {9576#true} call ULTIMATE.init(); {9576#true} is VALID [2022-04-28 03:03:00,618 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:03:00,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844740739] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:03:00,619 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:03:00,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 58 [2022-04-28 03:03:00,619 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:03:00,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1383222470] [2022-04-28 03:03:00,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1383222470] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:03:00,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:03:00,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-28 03:03:00,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242815145] [2022-04-28 03:03:00,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:03:00,624 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-28 03:03:00,624 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:03:00,624 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:00,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:03:00,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-28 03:03:00,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:03:00,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-28 03:03:00,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=896, Invalid=2410, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 03:03:00,647 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:02,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:02,316 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-28 03:03:02,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-28 03:03:02,316 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2022-04-28 03:03:02,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:03:02,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:02,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2022-04-28 03:03:02,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:02,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2022-04-28 03:03:02,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 44 transitions. [2022-04-28 03:03:02,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:03:02,359 INFO L225 Difference]: With dead ends: 44 [2022-04-28 03:03:02,359 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 03:03:02,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1785, Invalid=5355, Unknown=0, NotChecked=0, Total=7140 [2022-04-28 03:03:02,361 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:03:02,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 118 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 03:03:02,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 03:03:02,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-28 03:03:02,400 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:03:02,400 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:02,400 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:02,401 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:02,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:02,401 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-28 03:03:02,401 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-28 03:03:02,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:03:02,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:03:02,402 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-28 03:03:02,402 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-28 03:03:02,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:02,402 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-28 03:03:02,402 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-28 03:03:02,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:03:02,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:03:02,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:03:02,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:03:02,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:02,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2022-04-28 03:03:02,403 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2022-04-28 03:03:02,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:03:02,403 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2022-04-28 03:03:02,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.1) internal successors, (33), 29 states have internal predecessors, (33), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:02,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 39 transitions. [2022-04-28 03:03:02,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:03:02,433 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-28 03:03:02,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 03:03:02,434 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:03:02,434 INFO L195 NwaCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:03:02,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-04-28 03:03:02,637 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-28 03:03:02,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52,SelfDestructingSolverStorable53,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:03:02,834 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:03:02,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:03:02,835 INFO L85 PathProgramCache]: Analyzing trace with hash -148015050, now seen corresponding path program 53 times [2022-04-28 03:03:02,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:03:02,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1773733246] [2022-04-28 03:03:02,959 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-28 03:03:02,961 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:03:02,963 INFO L85 PathProgramCache]: Analyzing trace with hash -330568841, now seen corresponding path program 1 times [2022-04-28 03:03:02,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:03:02,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859434677] [2022-04-28 03:03:02,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:02,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:03:02,967 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-28 03:03:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:03:02,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1531582735] [2022-04-28 03:03:02,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:02,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:03:02,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:03:02,973 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:03:02,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-04-28 03:03:03,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:03:03,015 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:03:03,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:03:03,023 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:03:03,023 INFO L85 PathProgramCache]: Analyzing trace with hash -148015050, now seen corresponding path program 54 times [2022-04-28 03:03:03,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:03:03,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745551575] [2022-04-28 03:03:03,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:03,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:03:03,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:03,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:03:03,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:03,598 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-28 03:03:03,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {10156#true} assume true; {10156#true} is VALID [2022-04-28 03:03:03,598 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10156#true} {10156#true} #34#return; {10156#true} is VALID [2022-04-28 03:03:03,599 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-28 03:03:03,599 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-28 03:03:03,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {10156#true} assume true; {10156#true} is VALID [2022-04-28 03:03:03,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10156#true} {10156#true} #34#return; {10156#true} is VALID [2022-04-28 03:03:03,599 INFO L272 TraceCheckUtils]: 4: Hoare triple {10156#true} call #t~ret4 := main(); {10156#true} is VALID [2022-04-28 03:03:03,611 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-28 03:03:03,612 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-28 03:03:03,613 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-28 03:03:03,613 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-28 03:03:03,614 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-28 03:03:03,614 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-28 03:03:03,615 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-28 03:03:03,615 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-28 03:03:03,616 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-28 03:03:03,616 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-28 03:03:03,617 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-28 03:03:03,617 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-28 03:03:03,618 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-28 03:03:03,618 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-28 03:03:03,623 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-28 03:03:03,628 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-28 03:03:03,628 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-28 03:03:03,629 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-28 03:03:03,630 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-28 03:03:03,631 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-28 03:03:03,632 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-28 03:03:03,632 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-28 03:03:03,633 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-28 03:03:03,634 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-28 03:03:03,634 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-28 03:03:03,635 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-28 03:03:03,636 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-28 03:03:03,636 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-28 03:03:03,637 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-28 03:03:03,637 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-28 03:03:03,637 INFO L290 TraceCheckUtils]: 35: Hoare triple {10157#false} ~cond := #in~cond; {10157#false} is VALID [2022-04-28 03:03:03,637 INFO L290 TraceCheckUtils]: 36: Hoare triple {10157#false} assume 0 == ~cond; {10157#false} is VALID [2022-04-28 03:03:03,637 INFO L290 TraceCheckUtils]: 37: Hoare triple {10157#false} assume !false; {10157#false} is VALID [2022-04-28 03:03:03,638 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:03:03,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:03:03,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745551575] [2022-04-28 03:03:03,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745551575] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:03:03,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732427733] [2022-04-28 03:03:03,638 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:03:03,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:03:03,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:03:03,639 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:03:03,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-04-28 03:03:05,861 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2022-04-28 03:03:05,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:03:05,866 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-28 03:03:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:05,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:03:06,276 INFO L272 TraceCheckUtils]: 0: Hoare triple {10156#true} call ULTIMATE.init(); {10156#true} is VALID [2022-04-28 03:03:06,276 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-28 03:03:06,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {10156#true} assume true; {10156#true} is VALID [2022-04-28 03:03:06,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10156#true} {10156#true} #34#return; {10156#true} is VALID [2022-04-28 03:03:06,276 INFO L272 TraceCheckUtils]: 4: Hoare triple {10156#true} call #t~ret4 := main(); {10156#true} is VALID [2022-04-28 03:03:06,277 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-28 03:03:06,277 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-28 03:03:06,278 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-28 03:03:06,278 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-28 03:03:06,279 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-28 03:03:06,279 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-28 03:03:06,280 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-28 03:03:06,280 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-28 03:03:06,281 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-28 03:03:06,281 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-28 03:03:06,282 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-28 03:03:06,282 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-28 03:03:06,283 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-28 03:03:06,283 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-28 03:03:06,284 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-28 03:03:06,284 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-28 03:03:06,285 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-28 03:03:06,285 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-28 03:03:06,286 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-28 03:03:06,286 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-28 03:03:06,287 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-28 03:03:06,287 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-28 03:03:06,288 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-28 03:03:06,288 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-28 03:03:06,289 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-28 03:03:06,289 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-28 03:03:06,290 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-28 03:03:06,290 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-28 03:03:06,291 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-28 03:03:06,291 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-28 03:03:06,291 INFO L290 TraceCheckUtils]: 35: Hoare triple {10157#false} ~cond := #in~cond; {10157#false} is VALID [2022-04-28 03:03:06,291 INFO L290 TraceCheckUtils]: 36: Hoare triple {10157#false} assume 0 == ~cond; {10157#false} is VALID [2022-04-28 03:03:06,291 INFO L290 TraceCheckUtils]: 37: Hoare triple {10157#false} assume !false; {10157#false} is VALID [2022-04-28 03:03:06,291 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:03:06,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:03:07,645 INFO L290 TraceCheckUtils]: 37: Hoare triple {10157#false} assume !false; {10157#false} is VALID [2022-04-28 03:03:07,645 INFO L290 TraceCheckUtils]: 36: Hoare triple {10157#false} assume 0 == ~cond; {10157#false} is VALID [2022-04-28 03:03:07,645 INFO L290 TraceCheckUtils]: 35: Hoare triple {10157#false} ~cond := #in~cond; {10157#false} is VALID [2022-04-28 03:03:07,645 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-28 03:03:07,646 INFO L290 TraceCheckUtils]: 33: Hoare triple {10317#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {10157#false} is VALID [2022-04-28 03:03:07,648 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-28 03:03:07,648 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-28 03:03:07,649 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-28 03:03:07,650 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-28 03:03:07,651 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-28 03:03:07,651 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-28 03:03:07,652 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-28 03:03:07,652 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-28 03:03:07,653 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-28 03:03:07,654 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-28 03:03:07,654 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-28 03:03:07,655 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-28 03:03:07,656 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-28 03:03:07,656 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-28 03:03:07,657 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-28 03:03:07,658 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-28 03:03:07,658 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-28 03:03:07,659 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-28 03:03:07,660 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-28 03:03:07,660 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-28 03:03:07,661 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-28 03:03:07,661 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-28 03:03:07,664 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-28 03:03:07,665 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-28 03:03:07,665 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-28 03:03:07,666 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-28 03:03:07,666 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-28 03:03:07,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {10156#true} ~x~0 := 268435441; {10425#(< 1 (mod (+ main_~x~0 4294967242) 4294967296))} is VALID [2022-04-28 03:03:07,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {10156#true} call #t~ret4 := main(); {10156#true} is VALID [2022-04-28 03:03:07,667 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10156#true} {10156#true} #34#return; {10156#true} is VALID [2022-04-28 03:03:07,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {10156#true} assume true; {10156#true} is VALID [2022-04-28 03:03:07,667 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-28 03:03:07,667 INFO L272 TraceCheckUtils]: 0: Hoare triple {10156#true} call ULTIMATE.init(); {10156#true} is VALID [2022-04-28 03:03:07,668 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:03:07,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732427733] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:03:07,668 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:03:07,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 60 [2022-04-28 03:03:07,668 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:03:07,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1773733246] [2022-04-28 03:03:07,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1773733246] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:03:07,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:03:07,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-28 03:03:07,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226595484] [2022-04-28 03:03:07,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:03:07,669 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-28 03:03:07,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:03:07,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:07,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:03:07,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-28 03:03:07,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:03:07,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-28 03:03:07,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=957, Invalid=2583, Unknown=0, NotChecked=0, Total=3540 [2022-04-28 03:03:07,704 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:09,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:09,510 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-28 03:03:09,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-28 03:03:09,510 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-28 03:03:09,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:03:09,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:09,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2022-04-28 03:03:09,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:09,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2022-04-28 03:03:09,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 45 transitions. [2022-04-28 03:03:09,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:03:09,541 INFO L225 Difference]: With dead ends: 45 [2022-04-28 03:03:09,541 INFO L226 Difference]: Without dead ends: 40 [2022-04-28 03:03:09,542 INFO L412 NwaCegarLoop]: 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-28 03:03:09,543 INFO L413 NwaCegarLoop]: 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-28 03:03:09,543 INFO L414 NwaCegarLoop]: 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-28 03:03:09,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-28 03:03:09,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-28 03:03:09,590 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:03:09,590 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:09,590 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:09,590 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:09,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:09,591 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-28 03:03:09,591 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-28 03:03:09,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:03:09,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:03:09,591 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-28 03:03:09,591 INFO L87 Difference]: Start difference. First operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-28 03:03:09,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:09,592 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-28 03:03:09,592 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-28 03:03:09,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:03:09,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:03:09,592 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:03:09,592 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:03:09,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:09,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2022-04-28 03:03:09,593 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2022-04-28 03:03:09,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:03:09,593 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2022-04-28 03:03:09,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.096774193548387) internal successors, (34), 30 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:09,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 40 transitions. [2022-04-28 03:03:09,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:03:09,628 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-28 03:03:09,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 03:03:09,628 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:03:09,628 INFO L195 NwaCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:03:09,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2022-04-28 03:03:09,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2022-04-28 03:03:10,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54,SelfDestructingSolverStorable55,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:03:10,032 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:03:10,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:03:10,032 INFO L85 PathProgramCache]: Analyzing trace with hash -257037988, now seen corresponding path program 55 times [2022-04-28 03:03:10,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:03:10,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [972356185] [2022-04-28 03:03:10,153 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-28 03:03:10,155 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:03:10,160 INFO L85 PathProgramCache]: Analyzing trace with hash -271463497, now seen corresponding path program 1 times [2022-04-28 03:03:10,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:03:10,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94257596] [2022-04-28 03:03:10,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:10,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:03:10,168 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-28 03:03:10,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:03:10,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [598037782] [2022-04-28 03:03:10,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:10,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:03:10,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:03:10,179 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:03:10,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-04-28 03:03:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:03:10,219 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:03:10,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:03:10,228 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:03:10,228 INFO L85 PathProgramCache]: Analyzing trace with hash -257037988, now seen corresponding path program 56 times [2022-04-28 03:03:10,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:03:10,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247577948] [2022-04-28 03:03:10,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:10,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:03:10,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:10,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:03:10,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:10,799 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-28 03:03:10,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {10752#true} assume true; {10752#true} is VALID [2022-04-28 03:03:10,799 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10752#true} {10752#true} #34#return; {10752#true} is VALID [2022-04-28 03:03:10,799 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-28 03:03:10,799 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-28 03:03:10,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {10752#true} assume true; {10752#true} is VALID [2022-04-28 03:03:10,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10752#true} {10752#true} #34#return; {10752#true} is VALID [2022-04-28 03:03:10,800 INFO L272 TraceCheckUtils]: 4: Hoare triple {10752#true} call #t~ret4 := main(); {10752#true} is VALID [2022-04-28 03:03:10,800 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-28 03:03:10,800 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-28 03:03:10,801 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-28 03:03:10,801 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-28 03:03:10,802 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-28 03:03:10,802 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-28 03:03:10,803 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-28 03:03:10,803 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-28 03:03:10,804 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-28 03:03:10,804 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-28 03:03:10,805 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-28 03:03:10,805 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-28 03:03:10,806 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-28 03:03:10,806 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-28 03:03:10,807 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-28 03:03:10,807 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-28 03:03:10,808 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-28 03:03:10,808 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-28 03:03:10,809 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-28 03:03:10,809 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-28 03:03:10,811 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-28 03:03:10,812 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-28 03:03:10,813 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-28 03:03:10,813 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-28 03:03:10,814 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-28 03:03:10,815 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-28 03:03:10,815 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-28 03:03:10,816 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-28 03:03:10,816 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-28 03:03:10,817 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-28 03:03:10,817 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-28 03:03:10,817 INFO L290 TraceCheckUtils]: 36: Hoare triple {10753#false} ~cond := #in~cond; {10753#false} is VALID [2022-04-28 03:03:10,817 INFO L290 TraceCheckUtils]: 37: Hoare triple {10753#false} assume 0 == ~cond; {10753#false} is VALID [2022-04-28 03:03:10,817 INFO L290 TraceCheckUtils]: 38: Hoare triple {10753#false} assume !false; {10753#false} is VALID [2022-04-28 03:03:10,818 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:03:10,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:03:10,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247577948] [2022-04-28 03:03:10,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247577948] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:03:10,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709505148] [2022-04-28 03:03:10,818 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:03:10,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:03:10,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:03:10,820 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:03:10,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-04-28 03:03:10,871 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:03:10,871 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:03:10,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 59 conjunts are in the unsatisfiable core [2022-04-28 03:03:10,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:10,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:03:11,280 INFO L272 TraceCheckUtils]: 0: Hoare triple {10752#true} call ULTIMATE.init(); {10752#true} is VALID [2022-04-28 03:03:11,280 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-28 03:03:11,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {10752#true} assume true; {10752#true} is VALID [2022-04-28 03:03:11,280 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10752#true} {10752#true} #34#return; {10752#true} is VALID [2022-04-28 03:03:11,280 INFO L272 TraceCheckUtils]: 4: Hoare triple {10752#true} call #t~ret4 := main(); {10752#true} is VALID [2022-04-28 03:03:11,281 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-28 03:03:11,281 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-28 03:03:11,282 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-28 03:03:11,282 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-28 03:03:11,283 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-28 03:03:11,283 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-28 03:03:11,284 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-28 03:03:11,284 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-28 03:03:11,285 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-28 03:03:11,285 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-28 03:03:11,286 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-28 03:03:11,286 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-28 03:03:11,287 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-28 03:03:11,287 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-28 03:03:11,288 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-28 03:03:11,288 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-28 03:03:11,289 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-28 03:03:11,289 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-28 03:03:11,290 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-28 03:03:11,290 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-28 03:03:11,291 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-28 03:03:11,291 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-28 03:03:11,292 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-28 03:03:11,292 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-28 03:03:11,293 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-28 03:03:11,293 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-28 03:03:11,294 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-28 03:03:11,294 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-28 03:03:11,295 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-28 03:03:11,295 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-28 03:03:11,295 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-28 03:03:11,295 INFO L290 TraceCheckUtils]: 36: Hoare triple {10753#false} ~cond := #in~cond; {10753#false} is VALID [2022-04-28 03:03:11,295 INFO L290 TraceCheckUtils]: 37: Hoare triple {10753#false} assume 0 == ~cond; {10753#false} is VALID [2022-04-28 03:03:11,295 INFO L290 TraceCheckUtils]: 38: Hoare triple {10753#false} assume !false; {10753#false} is VALID [2022-04-28 03:03:11,296 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:03:11,296 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:03:12,714 INFO L290 TraceCheckUtils]: 38: Hoare triple {10753#false} assume !false; {10753#false} is VALID [2022-04-28 03:03:12,714 INFO L290 TraceCheckUtils]: 37: Hoare triple {10753#false} assume 0 == ~cond; {10753#false} is VALID [2022-04-28 03:03:12,714 INFO L290 TraceCheckUtils]: 36: Hoare triple {10753#false} ~cond := #in~cond; {10753#false} is VALID [2022-04-28 03:03:12,714 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-28 03:03:12,715 INFO L290 TraceCheckUtils]: 34: Hoare triple {10917#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {10753#false} is VALID [2022-04-28 03:03:12,718 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-28 03:03:12,718 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-28 03:03:12,720 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-28 03:03:12,720 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-28 03:03:12,721 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-28 03:03:12,721 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-28 03:03:12,722 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-28 03:03:12,723 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-28 03:03:12,723 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-28 03:03:12,724 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-28 03:03:12,725 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-28 03:03:12,725 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-28 03:03:12,726 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-28 03:03:12,726 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-28 03:03:12,727 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-28 03:03:12,728 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-28 03:03:12,728 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-28 03:03:12,729 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-28 03:03:12,730 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-28 03:03:12,730 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-28 03:03:12,731 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-28 03:03:12,731 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-28 03:03:12,732 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-28 03:03:12,733 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-28 03:03:12,734 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-28 03:03:12,735 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-28 03:03:12,736 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-28 03:03:12,736 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-28 03:03:12,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {10752#true} ~x~0 := 268435441; {11029#(< 1 (mod (+ 4294967240 main_~x~0) 4294967296))} is VALID [2022-04-28 03:03:12,737 INFO L272 TraceCheckUtils]: 4: Hoare triple {10752#true} call #t~ret4 := main(); {10752#true} is VALID [2022-04-28 03:03:12,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10752#true} {10752#true} #34#return; {10752#true} is VALID [2022-04-28 03:03:12,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {10752#true} assume true; {10752#true} is VALID [2022-04-28 03:03:12,737 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-28 03:03:12,737 INFO L272 TraceCheckUtils]: 0: Hoare triple {10752#true} call ULTIMATE.init(); {10752#true} is VALID [2022-04-28 03:03:12,738 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:03:12,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709505148] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:03:12,738 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:03:12,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 62 [2022-04-28 03:03:12,738 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:03:12,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [972356185] [2022-04-28 03:03:12,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [972356185] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:03:12,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:03:12,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-28 03:03:12,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872646002] [2022-04-28 03:03:12,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:03:12,739 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-28 03:03:12,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:03:12,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:12,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:03:12,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-28 03:03:12,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:03:12,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-28 03:03:12,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1020, Invalid=2762, Unknown=0, NotChecked=0, Total=3782 [2022-04-28 03:03:12,765 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:14,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:14,640 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-28 03:03:14,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-28 03:03:14,641 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-28 03:03:14,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:03:14,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:14,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2022-04-28 03:03:14,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:14,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2022-04-28 03:03:14,642 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 46 transitions. [2022-04-28 03:03:14,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:03:14,678 INFO L225 Difference]: With dead ends: 46 [2022-04-28 03:03:14,678 INFO L226 Difference]: Without dead ends: 41 [2022-04-28 03:03:14,679 INFO L412 NwaCegarLoop]: 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-28 03:03:14,679 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:03:14,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 108 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 909 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 03:03:14,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-28 03:03:14,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-28 03:03:14,718 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:03:14,718 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:14,718 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:14,718 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:14,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:14,719 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-28 03:03:14,719 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-28 03:03:14,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:03:14,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:03:14,719 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-28 03:03:14,719 INFO L87 Difference]: Start difference. First operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-28 03:03:14,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:14,720 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-28 03:03:14,720 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-28 03:03:14,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:03:14,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:03:14,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:03:14,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:03:14,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 36 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:14,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2022-04-28 03:03:14,721 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2022-04-28 03:03:14,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:03:14,721 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2022-04-28 03:03:14,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.09375) internal successors, (35), 31 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:14,721 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 41 transitions. [2022-04-28 03:03:14,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:03:14,752 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-28 03:03:14,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 03:03:14,752 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:03:14,752 INFO L195 NwaCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:03:14,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2022-04-28 03:03:14,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2022-04-28 03:03:15,152 WARN L477 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-28 03:03:15,153 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:03:15,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:03:15,153 INFO L85 PathProgramCache]: Analyzing trace with hash 658218230, now seen corresponding path program 57 times [2022-04-28 03:03:15,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:03:15,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1332782250] [2022-04-28 03:03:15,284 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-28 03:03:15,286 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:03:15,288 INFO L85 PathProgramCache]: Analyzing trace with hash -212358153, now seen corresponding path program 1 times [2022-04-28 03:03:15,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:03:15,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561139143] [2022-04-28 03:03:15,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:15,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:03:15,293 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-28 03:03:15,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:03:15,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1329389200] [2022-04-28 03:03:15,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:15,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:03:15,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:03:15,311 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:03:15,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-04-28 03:03:15,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:03:15,348 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:03:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:03:15,356 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:03:15,356 INFO L85 PathProgramCache]: Analyzing trace with hash 658218230, now seen corresponding path program 58 times [2022-04-28 03:03:15,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:03:15,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347546456] [2022-04-28 03:03:15,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:15,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:03:15,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:15,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:03:15,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:15,952 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-28 03:03:15,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {11364#true} assume true; {11364#true} is VALID [2022-04-28 03:03:15,953 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11364#true} {11364#true} #34#return; {11364#true} is VALID [2022-04-28 03:03:15,953 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-28 03:03:15,953 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-28 03:03:15,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {11364#true} assume true; {11364#true} is VALID [2022-04-28 03:03:15,954 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11364#true} {11364#true} #34#return; {11364#true} is VALID [2022-04-28 03:03:15,954 INFO L272 TraceCheckUtils]: 4: Hoare triple {11364#true} call #t~ret4 := main(); {11364#true} is VALID [2022-04-28 03:03:15,954 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-28 03:03:15,955 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-28 03:03:15,956 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-28 03:03:15,959 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-28 03:03:15,960 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-28 03:03:15,960 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-28 03:03:15,961 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-28 03:03:15,962 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-28 03:03:15,962 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-28 03:03:15,963 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-28 03:03:15,964 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-28 03:03:15,965 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-28 03:03:15,965 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-28 03:03:15,966 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-28 03:03:15,967 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-28 03:03:15,967 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-28 03:03:15,968 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-28 03:03:15,969 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-28 03:03:15,969 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-28 03:03:15,970 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-28 03:03:15,971 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-28 03:03:15,971 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-28 03:03:15,972 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-28 03:03:15,973 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-28 03:03:15,973 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-28 03:03:15,974 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-28 03:03:15,974 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-28 03:03:15,975 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-28 03:03:15,976 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-28 03:03:15,976 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-28 03:03:15,977 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-28 03:03:15,977 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-28 03:03:15,977 INFO L290 TraceCheckUtils]: 37: Hoare triple {11365#false} ~cond := #in~cond; {11365#false} is VALID [2022-04-28 03:03:15,977 INFO L290 TraceCheckUtils]: 38: Hoare triple {11365#false} assume 0 == ~cond; {11365#false} is VALID [2022-04-28 03:03:15,977 INFO L290 TraceCheckUtils]: 39: Hoare triple {11365#false} assume !false; {11365#false} is VALID [2022-04-28 03:03:15,978 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:03:15,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:03:15,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347546456] [2022-04-28 03:03:15,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347546456] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:03:15,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672915806] [2022-04-28 03:03:15,978 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:03:15,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:03:15,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:03:15,984 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:03:16,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-04-28 03:03:16,126 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:03:16,127 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:03:16,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 61 conjunts are in the unsatisfiable core [2022-04-28 03:03:16,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:16,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:03:16,565 INFO L272 TraceCheckUtils]: 0: Hoare triple {11364#true} call ULTIMATE.init(); {11364#true} is VALID [2022-04-28 03:03:16,565 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-28 03:03:16,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {11364#true} assume true; {11364#true} is VALID [2022-04-28 03:03:16,565 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11364#true} {11364#true} #34#return; {11364#true} is VALID [2022-04-28 03:03:16,565 INFO L272 TraceCheckUtils]: 4: Hoare triple {11364#true} call #t~ret4 := main(); {11364#true} is VALID [2022-04-28 03:03:16,565 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-28 03:03:16,566 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-28 03:03:16,567 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-28 03:03:16,567 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-28 03:03:16,568 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-28 03:03:16,568 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-28 03:03:16,569 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-28 03:03:16,569 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-28 03:03:16,570 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-28 03:03:16,570 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-28 03:03:16,571 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-28 03:03:16,571 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-28 03:03:16,572 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-28 03:03:16,572 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-28 03:03:16,573 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-28 03:03:16,573 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-28 03:03:16,574 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-28 03:03:16,574 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-28 03:03:16,575 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-28 03:03:16,575 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-28 03:03:16,576 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-28 03:03:16,576 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-28 03:03:16,577 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-28 03:03:16,577 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-28 03:03:16,578 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-28 03:03:16,578 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-28 03:03:16,579 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-28 03:03:16,579 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-28 03:03:16,580 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-28 03:03:16,580 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-28 03:03:16,581 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-28 03:03:16,581 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-28 03:03:16,581 INFO L290 TraceCheckUtils]: 37: Hoare triple {11365#false} ~cond := #in~cond; {11365#false} is VALID [2022-04-28 03:03:16,581 INFO L290 TraceCheckUtils]: 38: Hoare triple {11365#false} assume 0 == ~cond; {11365#false} is VALID [2022-04-28 03:03:16,581 INFO L290 TraceCheckUtils]: 39: Hoare triple {11365#false} assume !false; {11365#false} is VALID [2022-04-28 03:03:16,581 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:03:16,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:03:18,097 INFO L290 TraceCheckUtils]: 39: Hoare triple {11365#false} assume !false; {11365#false} is VALID [2022-04-28 03:03:18,097 INFO L290 TraceCheckUtils]: 38: Hoare triple {11365#false} assume 0 == ~cond; {11365#false} is VALID [2022-04-28 03:03:18,097 INFO L290 TraceCheckUtils]: 37: Hoare triple {11365#false} ~cond := #in~cond; {11365#false} is VALID [2022-04-28 03:03:18,097 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-28 03:03:18,097 INFO L290 TraceCheckUtils]: 35: Hoare triple {11533#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {11365#false} is VALID [2022-04-28 03:03:18,099 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-28 03:03:18,099 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-28 03:03:18,100 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-28 03:03:18,100 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-28 03:03:18,101 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-28 03:03:18,102 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-28 03:03:18,102 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-28 03:03:18,104 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-28 03:03:18,104 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-28 03:03:18,105 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-28 03:03:18,106 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-28 03:03:18,108 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-28 03:03:18,110 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-28 03:03:18,111 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-28 03:03:18,113 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-28 03:03:18,114 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-28 03:03:18,114 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-28 03:03:18,115 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-28 03:03:18,116 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-28 03:03:18,116 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-28 03:03:18,117 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-28 03:03:18,118 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-28 03:03:18,119 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-28 03:03:18,119 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-28 03:03:18,121 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-28 03:03:18,121 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-28 03:03:18,122 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-28 03:03:18,123 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-28 03:03:18,123 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-28 03:03:18,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {11364#true} ~x~0 := 268435441; {11649#(< 1 (mod (+ 4294967238 main_~x~0) 4294967296))} is VALID [2022-04-28 03:03:18,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {11364#true} call #t~ret4 := main(); {11364#true} is VALID [2022-04-28 03:03:18,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11364#true} {11364#true} #34#return; {11364#true} is VALID [2022-04-28 03:03:18,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {11364#true} assume true; {11364#true} is VALID [2022-04-28 03:03:18,124 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-28 03:03:18,124 INFO L272 TraceCheckUtils]: 0: Hoare triple {11364#true} call ULTIMATE.init(); {11364#true} is VALID [2022-04-28 03:03:18,124 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:03:18,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672915806] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:03:18,125 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:03:18,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 64 [2022-04-28 03:03:18,125 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:03:18,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1332782250] [2022-04-28 03:03:18,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1332782250] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:03:18,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:03:18,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-28 03:03:18,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670450363] [2022-04-28 03:03:18,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:03:18,126 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-28 03:03:18,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:03:18,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:18,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:03:18,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-28 03:03:18,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:03:18,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-28 03:03:18,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1085, Invalid=2947, Unknown=0, NotChecked=0, Total=4032 [2022-04-28 03:03:18,149 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:20,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:20,044 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-28 03:03:20,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-28 03:03:20,044 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-28 03:03:20,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:03:20,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:20,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2022-04-28 03:03:20,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:20,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2022-04-28 03:03:20,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 47 transitions. [2022-04-28 03:03:20,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:03:20,092 INFO L225 Difference]: With dead ends: 47 [2022-04-28 03:03:20,092 INFO L226 Difference]: Without dead ends: 42 [2022-04-28 03:03:20,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2163, Invalid=6579, Unknown=0, NotChecked=0, Total=8742 [2022-04-28 03:03:20,094 INFO L413 NwaCegarLoop]: 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-28 03:03:20,094 INFO L414 NwaCegarLoop]: 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-28 03:03:20,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-28 03:03:20,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-28 03:03:20,144 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:03:20,144 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:20,144 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:20,145 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:20,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:20,145 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-28 03:03:20,145 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-28 03:03:20,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:03:20,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:03:20,146 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-28 03:03:20,146 INFO L87 Difference]: Start difference. First operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 42 states. [2022-04-28 03:03:20,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:20,147 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-28 03:03:20,147 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-28 03:03:20,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:03:20,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:03:20,147 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:03:20,147 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:03:20,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:20,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2022-04-28 03:03:20,148 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2022-04-28 03:03:20,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:03:20,148 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2022-04-28 03:03:20,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 32 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:20,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 42 transitions. [2022-04-28 03:03:20,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:03:20,181 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-28 03:03:20,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 03:03:20,181 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:03:20,181 INFO L195 NwaCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:03:20,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Ended with exit code 0 [2022-04-28 03:03:20,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-04-28 03:03:20,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58,SelfDestructingSolverStorable59 [2022-04-28 03:03:20,583 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:03:20,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:03:20,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1033610084, now seen corresponding path program 59 times [2022-04-28 03:03:20,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:03:20,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2085449185] [2022-04-28 03:03:20,711 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-28 03:03:20,713 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:03:20,715 INFO L85 PathProgramCache]: Analyzing trace with hash -153252809, now seen corresponding path program 1 times [2022-04-28 03:03:20,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:03:20,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062004965] [2022-04-28 03:03:20,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:20,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:03:20,719 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-28 03:03:20,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:03:20,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1479433286] [2022-04-28 03:03:20,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:20,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:03:20,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:03:20,731 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:03:20,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-04-28 03:03:20,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:03:20,790 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:03:20,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:03:20,801 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:03:20,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1033610084, now seen corresponding path program 60 times [2022-04-28 03:03:20,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:03:20,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490342761] [2022-04-28 03:03:20,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:20,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:03:20,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:21,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:03:21,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:21,421 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-28 03:03:21,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {11992#true} assume true; {11992#true} is VALID [2022-04-28 03:03:21,421 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11992#true} {11992#true} #34#return; {11992#true} is VALID [2022-04-28 03:03:21,421 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-28 03:03:21,422 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-28 03:03:21,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {11992#true} assume true; {11992#true} is VALID [2022-04-28 03:03:21,422 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11992#true} {11992#true} #34#return; {11992#true} is VALID [2022-04-28 03:03:21,422 INFO L272 TraceCheckUtils]: 4: Hoare triple {11992#true} call #t~ret4 := main(); {11992#true} is VALID [2022-04-28 03:03:21,422 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-28 03:03:21,423 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-28 03:03:21,424 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-28 03:03:21,425 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-28 03:03:21,425 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-28 03:03:21,426 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-28 03:03:21,427 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-28 03:03:21,427 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-28 03:03:21,428 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-28 03:03:21,429 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-28 03:03:21,429 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-28 03:03:21,430 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-28 03:03:21,431 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-28 03:03:21,431 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-28 03:03:21,432 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-28 03:03:21,433 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-28 03:03:21,433 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-28 03:03:21,434 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-28 03:03:21,435 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-28 03:03:21,435 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-28 03:03:21,436 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-28 03:03:21,437 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-28 03:03:21,437 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-28 03:03:21,438 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-28 03:03:21,439 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-28 03:03:21,439 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-28 03:03:21,440 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-28 03:03:21,441 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-28 03:03:21,441 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-28 03:03:21,442 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-28 03:03:21,443 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-28 03:03:21,443 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-28 03:03:21,444 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-28 03:03:21,444 INFO L290 TraceCheckUtils]: 38: Hoare triple {11993#false} ~cond := #in~cond; {11993#false} is VALID [2022-04-28 03:03:21,444 INFO L290 TraceCheckUtils]: 39: Hoare triple {11993#false} assume 0 == ~cond; {11993#false} is VALID [2022-04-28 03:03:21,444 INFO L290 TraceCheckUtils]: 40: Hoare triple {11993#false} assume !false; {11993#false} is VALID [2022-04-28 03:03:21,444 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:03:21,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:03:21,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490342761] [2022-04-28 03:03:21,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490342761] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:03:21,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575793712] [2022-04-28 03:03:21,445 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:03:21,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:03:21,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:03:21,448 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:03:21,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-04-28 03:03:23,580 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2022-04-28 03:03:23,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:03:23,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 66 conjunts are in the unsatisfiable core [2022-04-28 03:03:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:23,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:03:23,923 INFO L272 TraceCheckUtils]: 0: Hoare triple {11992#true} call ULTIMATE.init(); {11992#true} is VALID [2022-04-28 03:03:23,924 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-28 03:03:23,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {11992#true} assume true; {11992#true} is VALID [2022-04-28 03:03:23,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11992#true} {11992#true} #34#return; {11992#true} is VALID [2022-04-28 03:03:23,924 INFO L272 TraceCheckUtils]: 4: Hoare triple {11992#true} call #t~ret4 := main(); {11992#true} is VALID [2022-04-28 03:03:23,924 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-28 03:03:23,925 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-28 03:03:23,925 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-28 03:03:23,926 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-28 03:03:23,926 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-28 03:03:23,927 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-28 03:03:23,927 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-28 03:03:23,928 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-28 03:03:23,928 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-28 03:03:23,929 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-28 03:03:23,929 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-28 03:03:23,930 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-28 03:03:23,930 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-28 03:03:23,931 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-28 03:03:23,931 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-28 03:03:23,932 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-28 03:03:23,932 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-28 03:03:23,933 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-28 03:03:23,933 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-28 03:03:23,934 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-28 03:03:23,934 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-28 03:03:23,935 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-28 03:03:23,935 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-28 03:03:23,936 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-28 03:03:23,936 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-28 03:03:23,937 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-28 03:03:23,937 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-28 03:03:23,938 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-28 03:03:23,938 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-28 03:03:23,939 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-28 03:03:23,939 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-28 03:03:23,940 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-28 03:03:23,940 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-28 03:03:23,940 INFO L290 TraceCheckUtils]: 38: Hoare triple {11993#false} ~cond := #in~cond; {11993#false} is VALID [2022-04-28 03:03:23,940 INFO L290 TraceCheckUtils]: 39: Hoare triple {11993#false} assume 0 == ~cond; {11993#false} is VALID [2022-04-28 03:03:23,940 INFO L290 TraceCheckUtils]: 40: Hoare triple {11993#false} assume !false; {11993#false} is VALID [2022-04-28 03:03:23,940 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:03:23,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:03:26,276 INFO L290 TraceCheckUtils]: 40: Hoare triple {11993#false} assume !false; {11993#false} is VALID [2022-04-28 03:03:26,277 INFO L290 TraceCheckUtils]: 39: Hoare triple {12156#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {11993#false} is VALID [2022-04-28 03:03:26,277 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-28 03:03:26,278 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-28 03:03:26,278 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-28 03:03:26,281 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-28 03:03:26,282 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-28 03:03:26,283 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-28 03:03:26,284 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-28 03:03:26,286 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-28 03:03:26,287 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-28 03:03:26,288 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-28 03:03:26,289 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-28 03:03:26,290 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-28 03:03:26,290 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-28 03:03:26,292 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-28 03:03:26,293 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-28 03:03:26,294 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-28 03:03:26,296 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-28 03:03:26,298 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-28 03:03:26,299 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-28 03:03:26,300 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-28 03:03:26,301 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-28 03:03:26,302 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-28 03:03:26,302 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-28 03:03:26,303 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-28 03:03:26,310 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-28 03:03:26,311 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-28 03:03:26,312 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-28 03:03:26,313 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-28 03:03:26,318 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-28 03:03:26,319 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-28 03:03:26,320 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-28 03:03:26,323 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-28 03:03:26,324 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-28 03:03:26,325 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-28 03:03:26,325 INFO L272 TraceCheckUtils]: 4: Hoare triple {11992#true} call #t~ret4 := main(); {11992#true} is VALID [2022-04-28 03:03:26,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11992#true} {11992#true} #34#return; {11992#true} is VALID [2022-04-28 03:03:26,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {11992#true} assume true; {11992#true} is VALID [2022-04-28 03:03:26,325 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-28 03:03:26,325 INFO L272 TraceCheckUtils]: 0: Hoare triple {11992#true} call ULTIMATE.init(); {11992#true} is VALID [2022-04-28 03:03:26,326 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:03:26,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575793712] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:03:26,326 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:03:26,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 36] total 69 [2022-04-28 03:03:26,326 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:03:26,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2085449185] [2022-04-28 03:03:26,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2085449185] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:03:26,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:03:26,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-28 03:03:26,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402117024] [2022-04-28 03:03:26,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:03:26,327 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-28 03:03:26,327 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:03:26,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:26,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:03:26,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-28 03:03:26,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:03:26,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-28 03:03:26,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1189, Invalid=3503, Unknown=0, NotChecked=0, Total=4692 [2022-04-28 03:03:26,355 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:28,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:28,463 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-28 03:03:28,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-28 03:03:28,463 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 41 [2022-04-28 03:03:28,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:03:28,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:28,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2022-04-28 03:03:28,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:28,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2022-04-28 03:03:28,465 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 48 transitions. [2022-04-28 03:03:28,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:03:28,497 INFO L225 Difference]: With dead ends: 48 [2022-04-28 03:03:28,497 INFO L226 Difference]: Without dead ends: 43 [2022-04-28 03:03:28,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2334, Invalid=7566, Unknown=0, NotChecked=0, Total=9900 [2022-04-28 03:03:28,498 INFO L413 NwaCegarLoop]: 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-28 03:03:28,498 INFO L414 NwaCegarLoop]: 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-28 03:03:28,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-28 03:03:28,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-28 03:03:28,540 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:03:28,540 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:28,540 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:28,540 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:28,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:28,541 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-28 03:03:28,541 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-28 03:03:28,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:03:28,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:03:28,541 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-28 03:03:28,541 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-28 03:03:28,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:28,542 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-28 03:03:28,542 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-28 03:03:28,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:03:28,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:03:28,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:03:28,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:03:28,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:28,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2022-04-28 03:03:28,543 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2022-04-28 03:03:28,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:03:28,543 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2022-04-28 03:03:28,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.088235294117647) internal successors, (37), 33 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:28,543 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 43 transitions. [2022-04-28 03:03:28,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:03:28,577 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-28 03:03:28,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 03:03:28,577 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:03:28,577 INFO L195 NwaCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:03:28,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2022-04-28 03:03:28,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Ended with exit code 0 [2022-04-28 03:03:28,979 WARN L477 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-28 03:03:28,979 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:03:28,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:03:28,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1940680266, now seen corresponding path program 61 times [2022-04-28 03:03:28,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:03:28,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [217671817] [2022-04-28 03:03:29,109 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-28 03:03:29,111 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:03:29,113 INFO L85 PathProgramCache]: Analyzing trace with hash -94147465, now seen corresponding path program 1 times [2022-04-28 03:03:29,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:03:29,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707475896] [2022-04-28 03:03:29,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:29,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:03:29,117 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-28 03:03:29,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:03:29,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1491298782] [2022-04-28 03:03:29,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:29,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:03:29,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:03:29,122 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:03:29,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-04-28 03:03:29,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:03:29,160 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:03:29,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:03:29,169 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:03:29,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1940680266, now seen corresponding path program 62 times [2022-04-28 03:03:29,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:03:29,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716221570] [2022-04-28 03:03:29,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:29,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:03:29,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:29,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:03:29,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:29,857 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-28 03:03:29,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {12639#true} assume true; {12639#true} is VALID [2022-04-28 03:03:29,857 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12639#true} {12639#true} #34#return; {12639#true} is VALID [2022-04-28 03:03:29,857 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-28 03:03:29,857 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-28 03:03:29,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {12639#true} assume true; {12639#true} is VALID [2022-04-28 03:03:29,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12639#true} {12639#true} #34#return; {12639#true} is VALID [2022-04-28 03:03:29,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {12639#true} call #t~ret4 := main(); {12639#true} is VALID [2022-04-28 03:03:29,858 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-28 03:03:29,858 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-28 03:03:29,859 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-28 03:03:29,859 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-28 03:03:29,860 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-28 03:03:29,860 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-28 03:03:29,861 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-28 03:03:29,861 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-28 03:03:29,862 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-28 03:03:29,862 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-28 03:03:29,863 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-28 03:03:29,863 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-28 03:03:29,864 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-28 03:03:29,864 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-28 03:03:29,865 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-28 03:03:29,865 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-28 03:03:29,866 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-28 03:03:29,866 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-28 03:03:29,867 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-28 03:03:29,867 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-28 03:03:29,868 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-28 03:03:29,868 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-28 03:03:29,869 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-28 03:03:29,869 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-28 03:03:29,870 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-28 03:03:29,870 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-28 03:03:29,871 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-28 03:03:29,871 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-28 03:03:29,872 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-28 03:03:29,872 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-28 03:03:29,873 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-28 03:03:29,873 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-28 03:03:29,874 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-28 03:03:29,874 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-28 03:03:29,874 INFO L290 TraceCheckUtils]: 39: Hoare triple {12640#false} ~cond := #in~cond; {12640#false} is VALID [2022-04-28 03:03:29,874 INFO L290 TraceCheckUtils]: 40: Hoare triple {12640#false} assume 0 == ~cond; {12640#false} is VALID [2022-04-28 03:03:29,874 INFO L290 TraceCheckUtils]: 41: Hoare triple {12640#false} assume !false; {12640#false} is VALID [2022-04-28 03:03:29,874 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:03:29,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:03:29,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716221570] [2022-04-28 03:03:29,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716221570] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:03:29,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694888018] [2022-04-28 03:03:29,875 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:03:29,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:03:29,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:03:29,876 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:03:29,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2022-04-28 03:03:29,913 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:03:29,913 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:03:29,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 68 conjunts are in the unsatisfiable core [2022-04-28 03:03:29,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:29,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:03:30,275 INFO L272 TraceCheckUtils]: 0: Hoare triple {12639#true} call ULTIMATE.init(); {12639#true} is VALID [2022-04-28 03:03:30,275 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-28 03:03:30,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {12639#true} assume true; {12639#true} is VALID [2022-04-28 03:03:30,275 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12639#true} {12639#true} #34#return; {12639#true} is VALID [2022-04-28 03:03:30,275 INFO L272 TraceCheckUtils]: 4: Hoare triple {12639#true} call #t~ret4 := main(); {12639#true} is VALID [2022-04-28 03:03:30,276 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-28 03:03:30,284 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-28 03:03:30,285 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-28 03:03:30,285 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-28 03:03:30,286 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-28 03:03:30,286 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-28 03:03:30,287 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-28 03:03:30,288 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-28 03:03:30,288 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-28 03:03:30,289 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-28 03:03:30,290 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-28 03:03:30,290 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-28 03:03:30,291 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-28 03:03:30,292 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-28 03:03:30,292 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-28 03:03:30,293 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-28 03:03:30,293 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-28 03:03:30,294 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-28 03:03:30,294 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-28 03:03:30,295 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-28 03:03:30,295 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-28 03:03:30,296 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-28 03:03:30,297 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-28 03:03:30,297 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-28 03:03:30,298 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-28 03:03:30,298 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-28 03:03:30,299 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-28 03:03:30,299 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-28 03:03:30,300 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-28 03:03:30,300 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-28 03:03:30,301 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-28 03:03:30,301 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-28 03:03:30,302 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-28 03:03:30,302 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-28 03:03:30,302 INFO L290 TraceCheckUtils]: 39: Hoare triple {12640#false} ~cond := #in~cond; {12640#false} is VALID [2022-04-28 03:03:30,302 INFO L290 TraceCheckUtils]: 40: Hoare triple {12640#false} assume 0 == ~cond; {12640#false} is VALID [2022-04-28 03:03:30,302 INFO L290 TraceCheckUtils]: 41: Hoare triple {12640#false} assume !false; {12640#false} is VALID [2022-04-28 03:03:30,302 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:03:30,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:03:32,645 INFO L290 TraceCheckUtils]: 41: Hoare triple {12640#false} assume !false; {12640#false} is VALID [2022-04-28 03:03:32,645 INFO L290 TraceCheckUtils]: 40: Hoare triple {12807#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {12640#false} is VALID [2022-04-28 03:03:32,646 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-28 03:03:32,646 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-28 03:03:32,646 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-28 03:03:32,647 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-28 03:03:32,648 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-28 03:03:32,649 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-28 03:03:32,653 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-28 03:03:32,653 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-28 03:03:32,654 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-28 03:03:32,655 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-28 03:03:32,656 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-28 03:03:32,656 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-28 03:03:32,657 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-28 03:03:32,658 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-28 03:03:32,659 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-28 03:03:32,659 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-28 03:03:32,660 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-28 03:03:32,661 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-28 03:03:32,662 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-28 03:03:32,663 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-28 03:03:32,664 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-28 03:03:32,665 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-28 03:03:32,666 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-28 03:03:32,666 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-28 03:03:32,667 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-28 03:03:32,668 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-28 03:03:32,669 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-28 03:03:32,670 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-28 03:03:32,672 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-28 03:03:32,673 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-28 03:03:32,674 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-28 03:03:32,674 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-28 03:03:32,676 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-28 03:03:32,677 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-28 03:03:32,678 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-28 03:03:32,678 INFO L272 TraceCheckUtils]: 4: Hoare triple {12639#true} call #t~ret4 := main(); {12639#true} is VALID [2022-04-28 03:03:32,678 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12639#true} {12639#true} #34#return; {12639#true} is VALID [2022-04-28 03:03:32,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {12639#true} assume true; {12639#true} is VALID [2022-04-28 03:03:32,678 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-28 03:03:32,678 INFO L272 TraceCheckUtils]: 0: Hoare triple {12639#true} call ULTIMATE.init(); {12639#true} is VALID [2022-04-28 03:03:32,678 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:03:32,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694888018] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:03:32,679 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:03:32,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 37] total 71 [2022-04-28 03:03:32,679 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:03:32,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [217671817] [2022-04-28 03:03:32,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [217671817] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:03:32,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:03:32,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-28 03:03:32,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27394878] [2022-04-28 03:03:32,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:03:32,679 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-28 03:03:32,680 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:03:32,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:32,703 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:03:32,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-28 03:03:32,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:03:32,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-28 03:03:32,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1259, Invalid=3711, Unknown=0, NotChecked=0, Total=4970 [2022-04-28 03:03:32,704 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:34,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:34,885 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-28 03:03:34,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-28 03:03:34,886 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-28 03:03:34,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:03:34,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:34,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2022-04-28 03:03:34,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:34,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2022-04-28 03:03:34,887 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 49 transitions. [2022-04-28 03:03:34,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:03:34,919 INFO L225 Difference]: With dead ends: 49 [2022-04-28 03:03:34,919 INFO L226 Difference]: Without dead ends: 44 [2022-04-28 03:03:34,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2473, Invalid=8033, Unknown=0, NotChecked=0, Total=10506 [2022-04-28 03:03:34,921 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 03:03:34,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 28 Invalid, 1074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 03:03:34,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-28 03:03:34,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-28 03:03:34,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:03:34,966 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:34,966 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:34,966 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:34,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:34,967 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-28 03:03:34,967 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-28 03:03:34,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:03:34,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:03:34,967 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-28 03:03:34,967 INFO L87 Difference]: Start difference. First operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 44 states. [2022-04-28 03:03:34,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:34,968 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-28 03:03:34,968 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-28 03:03:34,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:03:34,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:03:34,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:03:34,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:03:34,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.0256410256410255) internal successors, (40), 39 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:34,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2022-04-28 03:03:34,969 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2022-04-28 03:03:34,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:03:34,969 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2022-04-28 03:03:34,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 34 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:34,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 44 transitions. [2022-04-28 03:03:35,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:03:35,009 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-28 03:03:35,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 03:03:35,009 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:03:35,009 INFO L195 NwaCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:03:35,025 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Forceful destruction successful, exit code 0 [2022-04-28 03:03:35,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Ended with exit code 0 [2022-04-28 03:03:35,411 WARN L477 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-28 03:03:35,412 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:03:35,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:03:35,412 INFO L85 PathProgramCache]: Analyzing trace with hash 4915164, now seen corresponding path program 63 times [2022-04-28 03:03:35,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:03:35,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [190339061] [2022-04-28 03:03:35,556 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-28 03:03:35,557 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:03:35,559 INFO L85 PathProgramCache]: Analyzing trace with hash -35042121, now seen corresponding path program 1 times [2022-04-28 03:03:35,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:03:35,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525435477] [2022-04-28 03:03:35,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:35,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:03:35,564 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-28 03:03:35,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:03:35,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2127191822] [2022-04-28 03:03:35,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:35,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:03:35,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:03:35,569 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:03:35,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-04-28 03:03:35,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:03:35,592 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:03:35,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:03:35,611 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:03:35,611 INFO L85 PathProgramCache]: Analyzing trace with hash 4915164, now seen corresponding path program 64 times [2022-04-28 03:03:35,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:03:35,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705746141] [2022-04-28 03:03:35,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:35,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:03:35,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:36,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:03:36,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:36,382 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-28 03:03:36,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {13302#true} assume true; {13302#true} is VALID [2022-04-28 03:03:36,382 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13302#true} {13302#true} #34#return; {13302#true} is VALID [2022-04-28 03:03:36,383 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-28 03:03:36,383 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-28 03:03:36,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {13302#true} assume true; {13302#true} is VALID [2022-04-28 03:03:36,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13302#true} {13302#true} #34#return; {13302#true} is VALID [2022-04-28 03:03:36,383 INFO L272 TraceCheckUtils]: 4: Hoare triple {13302#true} call #t~ret4 := main(); {13302#true} is VALID [2022-04-28 03:03:36,384 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-28 03:03:36,384 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-28 03:03:36,385 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-28 03:03:36,385 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-28 03:03:36,386 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-28 03:03:36,386 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-28 03:03:36,387 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-28 03:03:36,387 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-28 03:03:36,388 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-28 03:03:36,388 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-28 03:03:36,389 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-28 03:03:36,389 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-28 03:03:36,390 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-28 03:03:36,390 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-28 03:03:36,391 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-28 03:03:36,391 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-28 03:03:36,392 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-28 03:03:36,392 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-28 03:03:36,393 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-28 03:03:36,393 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-28 03:03:36,394 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-28 03:03:36,394 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-28 03:03:36,395 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-28 03:03:36,395 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-28 03:03:36,396 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-28 03:03:36,396 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-28 03:03:36,397 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-28 03:03:36,397 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-28 03:03:36,398 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-28 03:03:36,399 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-28 03:03:36,399 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-28 03:03:36,400 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-28 03:03:36,400 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-28 03:03:36,400 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-28 03:03:36,401 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-28 03:03:36,401 INFO L290 TraceCheckUtils]: 40: Hoare triple {13303#false} ~cond := #in~cond; {13303#false} is VALID [2022-04-28 03:03:36,401 INFO L290 TraceCheckUtils]: 41: Hoare triple {13303#false} assume 0 == ~cond; {13303#false} is VALID [2022-04-28 03:03:36,401 INFO L290 TraceCheckUtils]: 42: Hoare triple {13303#false} assume !false; {13303#false} is VALID [2022-04-28 03:03:36,401 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:03:36,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:03:36,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705746141] [2022-04-28 03:03:36,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705746141] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:03:36,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291207170] [2022-04-28 03:03:36,402 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:03:36,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:03:36,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:03:36,403 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:03:36,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2022-04-28 03:03:36,496 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:03:36,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:03:36,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 67 conjunts are in the unsatisfiable core [2022-04-28 03:03:36,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:36,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:03:36,932 INFO L272 TraceCheckUtils]: 0: Hoare triple {13302#true} call ULTIMATE.init(); {13302#true} is VALID [2022-04-28 03:03:36,932 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-28 03:03:36,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {13302#true} assume true; {13302#true} is VALID [2022-04-28 03:03:36,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13302#true} {13302#true} #34#return; {13302#true} is VALID [2022-04-28 03:03:36,932 INFO L272 TraceCheckUtils]: 4: Hoare triple {13302#true} call #t~ret4 := main(); {13302#true} is VALID [2022-04-28 03:03:36,933 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-28 03:03:36,933 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-28 03:03:36,934 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-28 03:03:36,934 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-28 03:03:36,935 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-28 03:03:36,936 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-28 03:03:36,937 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-28 03:03:36,937 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-28 03:03:36,938 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-28 03:03:36,939 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-28 03:03:36,939 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-28 03:03:36,940 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-28 03:03:36,940 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-28 03:03:36,941 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-28 03:03:36,942 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-28 03:03:36,942 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-28 03:03:36,943 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-28 03:03:36,944 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-28 03:03:36,944 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-28 03:03:36,945 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-28 03:03:36,946 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-28 03:03:36,946 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-28 03:03:36,947 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-28 03:03:36,947 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-28 03:03:36,948 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-28 03:03:36,949 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-28 03:03:36,949 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-28 03:03:36,950 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-28 03:03:36,951 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-28 03:03:36,951 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-28 03:03:36,952 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-28 03:03:36,952 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-28 03:03:36,953 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-28 03:03:36,954 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-28 03:03:36,954 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-28 03:03:36,954 INFO L290 TraceCheckUtils]: 40: Hoare triple {13303#false} ~cond := #in~cond; {13303#false} is VALID [2022-04-28 03:03:36,954 INFO L290 TraceCheckUtils]: 41: Hoare triple {13303#false} assume 0 == ~cond; {13303#false} is VALID [2022-04-28 03:03:36,954 INFO L290 TraceCheckUtils]: 42: Hoare triple {13303#false} assume !false; {13303#false} is VALID [2022-04-28 03:03:36,955 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:03:36,955 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:03:38,770 INFO L290 TraceCheckUtils]: 42: Hoare triple {13303#false} assume !false; {13303#false} is VALID [2022-04-28 03:03:38,770 INFO L290 TraceCheckUtils]: 41: Hoare triple {13303#false} assume 0 == ~cond; {13303#false} is VALID [2022-04-28 03:03:38,770 INFO L290 TraceCheckUtils]: 40: Hoare triple {13303#false} ~cond := #in~cond; {13303#false} is VALID [2022-04-28 03:03:38,771 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-28 03:03:38,771 INFO L290 TraceCheckUtils]: 38: Hoare triple {13483#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {13303#false} is VALID [2022-04-28 03:03:38,772 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-28 03:03:38,773 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-28 03:03:38,774 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-28 03:03:38,774 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-28 03:03:38,775 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-28 03:03:38,775 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-28 03:03:38,776 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-28 03:03:38,777 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-28 03:03:38,777 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-28 03:03:38,778 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-28 03:03:38,779 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-28 03:03:38,779 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-28 03:03:38,780 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-28 03:03:38,781 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-28 03:03:38,781 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-28 03:03:38,782 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-28 03:03:38,783 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-28 03:03:38,786 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-28 03:03:38,787 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-28 03:03:38,787 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-28 03:03:38,788 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-28 03:03:38,789 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-28 03:03:38,789 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-28 03:03:38,790 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-28 03:03:38,791 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-28 03:03:38,791 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-28 03:03:38,792 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-28 03:03:38,792 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-28 03:03:38,795 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-28 03:03:38,796 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-28 03:03:38,796 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-28 03:03:38,800 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-28 03:03:38,800 INFO L290 TraceCheckUtils]: 5: Hoare triple {13302#true} ~x~0 := 268435441; {13611#(< 1 (mod (+ main_~x~0 4294967232) 4294967296))} is VALID [2022-04-28 03:03:38,800 INFO L272 TraceCheckUtils]: 4: Hoare triple {13302#true} call #t~ret4 := main(); {13302#true} is VALID [2022-04-28 03:03:38,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13302#true} {13302#true} #34#return; {13302#true} is VALID [2022-04-28 03:03:38,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {13302#true} assume true; {13302#true} is VALID [2022-04-28 03:03:38,800 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-28 03:03:38,801 INFO L272 TraceCheckUtils]: 0: Hoare triple {13302#true} call ULTIMATE.init(); {13302#true} is VALID [2022-04-28 03:03:38,801 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:03:38,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291207170] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:03:38,801 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:03:38,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 70 [2022-04-28 03:03:38,802 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:03:38,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [190339061] [2022-04-28 03:03:38,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [190339061] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:03:38,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:03:38,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-28 03:03:38,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901683522] [2022-04-28 03:03:38,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:03:38,803 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-28 03:03:38,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:03:38,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:38,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:03:38,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-28 03:03:38,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:03:38,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-28 03:03:38,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1292, Invalid=3538, Unknown=0, NotChecked=0, Total=4830 [2022-04-28 03:03:38,836 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:41,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:41,186 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-28 03:03:41,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-28 03:03:41,186 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2022-04-28 03:03:41,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:03:41,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:41,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2022-04-28 03:03:41,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:41,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2022-04-28 03:03:41,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 50 transitions. [2022-04-28 03:03:41,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:03:41,228 INFO L225 Difference]: With dead ends: 50 [2022-04-28 03:03:41,229 INFO L226 Difference]: Without dead ends: 45 [2022-04-28 03:03:41,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2577, Invalid=7929, Unknown=0, NotChecked=0, Total=10506 [2022-04-28 03:03:41,230 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1093 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:03:41,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 48 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1093 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 03:03:41,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-28 03:03:41,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-28 03:03:41,288 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:03:41,288 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:41,288 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:41,288 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:41,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:41,289 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-28 03:03:41,289 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-28 03:03:41,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:03:41,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:03:41,289 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-28 03:03:41,289 INFO L87 Difference]: Start difference. First operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-28 03:03:41,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:41,290 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-28 03:03:41,290 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-28 03:03:41,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:03:41,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:03:41,291 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:03:41,291 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:03:41,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.025) internal successors, (41), 40 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:41,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2022-04-28 03:03:41,292 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2022-04-28 03:03:41,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:03:41,292 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2022-04-28 03:03:41,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.0833333333333333) internal successors, (39), 35 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:41,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 45 transitions. [2022-04-28 03:03:41,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:03:41,335 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-28 03:03:41,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 03:03:41,336 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:03:41,336 INFO L195 NwaCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:03:41,342 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-28 03:03:41,562 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Forceful destruction successful, exit code 0 [2022-04-28 03:03:41,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable64,SelfDestructingSolverStorable65,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:03:41,737 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:03:41,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:03:41,737 INFO L85 PathProgramCache]: Analyzing trace with hash 188831350, now seen corresponding path program 65 times [2022-04-28 03:03:41,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:03:41,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [49403280] [2022-04-28 03:03:41,860 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:03:41,861 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:03:41,863 INFO L85 PathProgramCache]: Analyzing trace with hash 24063223, now seen corresponding path program 1 times [2022-04-28 03:03:41,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:03:41,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226975436] [2022-04-28 03:03:41,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:41,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:03:41,867 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-28 03:03:41,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:03:41,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1531639078] [2022-04-28 03:03:41,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:41,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:03:41,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:03:41,872 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:03:41,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2022-04-28 03:03:41,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:03:41,908 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:03:41,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:03:41,917 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:03:41,917 INFO L85 PathProgramCache]: Analyzing trace with hash 188831350, now seen corresponding path program 66 times [2022-04-28 03:03:41,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:03:41,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199254333] [2022-04-28 03:03:41,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:41,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:03:41,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:42,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:03:42,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:42,730 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-28 03:03:42,730 INFO L290 TraceCheckUtils]: 1: Hoare triple {13978#true} assume true; {13978#true} is VALID [2022-04-28 03:03:42,730 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13978#true} {13978#true} #34#return; {13978#true} is VALID [2022-04-28 03:03:42,731 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-28 03:03:42,731 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-28 03:03:42,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {13978#true} assume true; {13978#true} is VALID [2022-04-28 03:03:42,731 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13978#true} {13978#true} #34#return; {13978#true} is VALID [2022-04-28 03:03:42,731 INFO L272 TraceCheckUtils]: 4: Hoare triple {13978#true} call #t~ret4 := main(); {13978#true} is VALID [2022-04-28 03:03:42,731 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-28 03:03:42,732 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-28 03:03:42,732 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-28 03:03:42,733 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-28 03:03:42,733 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-28 03:03:42,734 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-28 03:03:42,734 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-28 03:03:42,735 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-28 03:03:42,735 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-28 03:03:42,736 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-28 03:03:42,736 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-28 03:03:42,737 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-28 03:03:42,737 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-28 03:03:42,738 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-28 03:03:42,738 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-28 03:03:42,739 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-28 03:03:42,739 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-28 03:03:42,740 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-28 03:03:42,740 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-28 03:03:42,741 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-28 03:03:42,741 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-28 03:03:42,742 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-28 03:03:42,742 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-28 03:03:42,743 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-28 03:03:42,743 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-28 03:03:42,744 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-28 03:03:42,744 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-28 03:03:42,745 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-28 03:03:42,745 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-28 03:03:42,746 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-28 03:03:42,746 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-28 03:03:42,747 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-28 03:03:42,747 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-28 03:03:42,748 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-28 03:03:42,748 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-28 03:03:42,748 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-28 03:03:42,748 INFO L290 TraceCheckUtils]: 41: Hoare triple {13979#false} ~cond := #in~cond; {13979#false} is VALID [2022-04-28 03:03:42,749 INFO L290 TraceCheckUtils]: 42: Hoare triple {13979#false} assume 0 == ~cond; {13979#false} is VALID [2022-04-28 03:03:42,749 INFO L290 TraceCheckUtils]: 43: Hoare triple {13979#false} assume !false; {13979#false} is VALID [2022-04-28 03:03:42,749 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:03:42,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:03:42,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199254333] [2022-04-28 03:03:42,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199254333] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:03:42,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776431339] [2022-04-28 03:03:42,749 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:03:42,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:03:42,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:03:42,750 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:03:42,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2022-04-28 03:03:43,814 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2022-04-28 03:03:43,815 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:03:43,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 72 conjunts are in the unsatisfiable core [2022-04-28 03:03:43,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:43,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:03:44,184 INFO L272 TraceCheckUtils]: 0: Hoare triple {13978#true} call ULTIMATE.init(); {13978#true} is VALID [2022-04-28 03:03:44,184 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-28 03:03:44,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {13978#true} assume true; {13978#true} is VALID [2022-04-28 03:03:44,184 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13978#true} {13978#true} #34#return; {13978#true} is VALID [2022-04-28 03:03:44,184 INFO L272 TraceCheckUtils]: 4: Hoare triple {13978#true} call #t~ret4 := main(); {13978#true} is VALID [2022-04-28 03:03:44,185 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-28 03:03:44,186 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-28 03:03:44,186 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-28 03:03:44,187 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-28 03:03:44,187 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-28 03:03:44,188 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-28 03:03:44,188 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-28 03:03:44,189 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-28 03:03:44,189 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-28 03:03:44,190 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-28 03:03:44,190 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-28 03:03:44,191 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-28 03:03:44,191 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-28 03:03:44,192 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-28 03:03:44,192 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-28 03:03:44,193 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-28 03:03:44,193 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-28 03:03:44,194 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-28 03:03:44,194 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-28 03:03:44,195 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-28 03:03:44,195 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-28 03:03:44,196 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-28 03:03:44,196 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-28 03:03:44,197 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-28 03:03:44,197 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-28 03:03:44,198 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-28 03:03:44,198 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-28 03:03:44,199 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-28 03:03:44,199 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-28 03:03:44,200 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-28 03:03:44,200 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-28 03:03:44,201 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-28 03:03:44,201 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-28 03:03:44,202 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-28 03:03:44,202 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-28 03:03:44,202 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-28 03:03:44,202 INFO L290 TraceCheckUtils]: 41: Hoare triple {13979#false} ~cond := #in~cond; {13979#false} is VALID [2022-04-28 03:03:44,203 INFO L290 TraceCheckUtils]: 42: Hoare triple {13979#false} assume 0 == ~cond; {13979#false} is VALID [2022-04-28 03:03:44,203 INFO L290 TraceCheckUtils]: 43: Hoare triple {13979#false} assume !false; {13979#false} is VALID [2022-04-28 03:03:44,203 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:03:44,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:03:46,813 INFO L290 TraceCheckUtils]: 43: Hoare triple {13979#false} assume !false; {13979#false} is VALID [2022-04-28 03:03:46,814 INFO L290 TraceCheckUtils]: 42: Hoare triple {14154#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {13979#false} is VALID [2022-04-28 03:03:46,814 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-28 03:03:46,815 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-28 03:03:46,815 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-28 03:03:46,816 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-28 03:03:46,819 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-28 03:03:46,819 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-28 03:03:46,821 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-28 03:03:46,822 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-28 03:03:46,824 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-28 03:03:46,824 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-28 03:03:46,828 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-28 03:03:46,829 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-28 03:03:46,830 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-28 03:03:46,836 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-28 03:03:46,837 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-28 03:03:46,839 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-28 03:03:46,840 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-28 03:03:46,841 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-28 03:03:46,842 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-28 03:03:46,845 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-28 03:03:46,845 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-28 03:03:46,846 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-28 03:03:46,847 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-28 03:03:46,848 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-28 03:03:46,848 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-28 03:03:46,850 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-28 03:03:46,851 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-28 03:03:46,852 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-28 03:03:46,854 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-28 03:03:46,855 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-28 03:03:46,856 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-28 03:03:46,856 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-28 03:03:46,857 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-28 03:03:46,859 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-28 03:03:46,862 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-28 03:03:46,863 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-28 03:03:46,863 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-28 03:03:46,863 INFO L272 TraceCheckUtils]: 4: Hoare triple {13978#true} call #t~ret4 := main(); {13978#true} is VALID [2022-04-28 03:03:46,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13978#true} {13978#true} #34#return; {13978#true} is VALID [2022-04-28 03:03:46,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {13978#true} assume true; {13978#true} is VALID [2022-04-28 03:03:46,863 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-28 03:03:46,863 INFO L272 TraceCheckUtils]: 0: Hoare triple {13978#true} call ULTIMATE.init(); {13978#true} is VALID [2022-04-28 03:03:46,864 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:03:46,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776431339] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:03:46,864 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:03:46,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36, 39] total 75 [2022-04-28 03:03:46,864 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:03:46,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [49403280] [2022-04-28 03:03:46,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [49403280] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:03:46,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:03:46,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-28 03:03:46,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294200722] [2022-04-28 03:03:46,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:03:46,865 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-28 03:03:46,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:03:46,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:46,890 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:03:46,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-28 03:03:46,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:03:46,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-28 03:03:46,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1405, Invalid=4145, Unknown=0, NotChecked=0, Total=5550 [2022-04-28 03:03:46,891 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:49,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:49,488 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-28 03:03:49,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-28 03:03:49,488 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2022-04-28 03:03:49,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:03:49,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:49,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2022-04-28 03:03:49,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:49,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2022-04-28 03:03:49,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 51 transitions. [2022-04-28 03:03:49,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:03:49,538 INFO L225 Difference]: With dead ends: 51 [2022-04-28 03:03:49,538 INFO L226 Difference]: Without dead ends: 46 [2022-04-28 03:03:49,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2763, Invalid=9009, Unknown=0, NotChecked=0, Total=11772 [2022-04-28 03:03:49,539 INFO L413 NwaCegarLoop]: 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-28 03:03:49,539 INFO L414 NwaCegarLoop]: 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-28 03:03:49,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-28 03:03:49,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-28 03:03:49,583 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:03:49,583 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:49,583 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:49,583 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:49,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:49,584 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-28 03:03:49,584 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-28 03:03:49,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:03:49,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:03:49,584 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 46 states. [2022-04-28 03:03:49,585 INFO L87 Difference]: Start difference. First operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 46 states. [2022-04-28 03:03:49,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:49,585 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-28 03:03:49,585 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-28 03:03:49,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:03:49,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:03:49,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:03:49,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:03:49,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:49,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2022-04-28 03:03:49,586 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2022-04-28 03:03:49,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:03:49,587 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2022-04-28 03:03:49,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 36 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:49,587 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 46 transitions. [2022-04-28 03:03:49,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:03:49,628 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-28 03:03:49,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 03:03:49,628 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:03:49,628 INFO L195 NwaCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:03:49,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Forceful destruction successful, exit code 0 [2022-04-28 03:03:49,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Forceful destruction successful, exit code 0 [2022-04-28 03:03:50,029 WARN L477 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-28 03:03:50,029 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:03:50,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:03:50,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1595265820, now seen corresponding path program 67 times [2022-04-28 03:03:50,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:03:50,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1854519878] [2022-04-28 03:03:50,171 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-28 03:03:50,173 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:03:50,175 INFO L85 PathProgramCache]: Analyzing trace with hash 83168567, now seen corresponding path program 1 times [2022-04-28 03:03:50,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:03:50,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834284480] [2022-04-28 03:03:50,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:50,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:03:50,182 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-28 03:03:50,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:03:50,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1122496376] [2022-04-28 03:03:50,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:50,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:03:50,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:03:50,193 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:03:50,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2022-04-28 03:03:50,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:03:50,235 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:03:50,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:03:50,244 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:03:50,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1595265820, now seen corresponding path program 68 times [2022-04-28 03:03:50,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:03:50,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678930944] [2022-04-28 03:03:50,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:50,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:03:50,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:51,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:03:51,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:51,030 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-28 03:03:51,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {14673#true} assume true; {14673#true} is VALID [2022-04-28 03:03:51,030 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14673#true} {14673#true} #34#return; {14673#true} is VALID [2022-04-28 03:03:51,030 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-28 03:03:51,030 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-28 03:03:51,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {14673#true} assume true; {14673#true} is VALID [2022-04-28 03:03:51,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14673#true} {14673#true} #34#return; {14673#true} is VALID [2022-04-28 03:03:51,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {14673#true} call #t~ret4 := main(); {14673#true} is VALID [2022-04-28 03:03:51,031 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-28 03:03:51,032 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-28 03:03:51,032 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-28 03:03:51,033 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-28 03:03:51,033 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-28 03:03:51,034 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-28 03:03:51,034 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-28 03:03:51,035 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-28 03:03:51,035 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-28 03:03:51,036 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-28 03:03:51,036 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-28 03:03:51,037 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-28 03:03:51,037 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-28 03:03:51,037 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-28 03:03:51,038 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-28 03:03:51,038 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-28 03:03:51,039 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-28 03:03:51,039 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-28 03:03:51,040 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-28 03:03:51,040 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-28 03:03:51,041 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-28 03:03:51,041 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-28 03:03:51,042 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-28 03:03:51,042 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-28 03:03:51,043 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-28 03:03:51,043 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-28 03:03:51,044 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-28 03:03:51,047 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-28 03:03:51,048 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-28 03:03:51,049 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-28 03:03:51,049 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-28 03:03:51,050 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-28 03:03:51,050 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-28 03:03:51,051 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-28 03:03:51,052 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-28 03:03:51,052 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-28 03:03:51,052 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-28 03:03:51,052 INFO L290 TraceCheckUtils]: 42: Hoare triple {14674#false} ~cond := #in~cond; {14674#false} is VALID [2022-04-28 03:03:51,052 INFO L290 TraceCheckUtils]: 43: Hoare triple {14674#false} assume 0 == ~cond; {14674#false} is VALID [2022-04-28 03:03:51,052 INFO L290 TraceCheckUtils]: 44: Hoare triple {14674#false} assume !false; {14674#false} is VALID [2022-04-28 03:03:51,053 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:03:51,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:03:51,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678930944] [2022-04-28 03:03:51,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678930944] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:03:51,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163013147] [2022-04-28 03:03:51,053 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:03:51,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:03:51,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:03:51,056 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:03:51,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2022-04-28 03:03:51,102 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:03:51,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:03:51,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 74 conjunts are in the unsatisfiable core [2022-04-28 03:03:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:51,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:03:51,524 INFO L272 TraceCheckUtils]: 0: Hoare triple {14673#true} call ULTIMATE.init(); {14673#true} is VALID [2022-04-28 03:03:51,524 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-28 03:03:51,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {14673#true} assume true; {14673#true} is VALID [2022-04-28 03:03:51,524 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14673#true} {14673#true} #34#return; {14673#true} is VALID [2022-04-28 03:03:51,525 INFO L272 TraceCheckUtils]: 4: Hoare triple {14673#true} call #t~ret4 := main(); {14673#true} is VALID [2022-04-28 03:03:51,525 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-28 03:03:51,526 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-28 03:03:51,526 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-28 03:03:51,527 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-28 03:03:51,528 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-28 03:03:51,528 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-28 03:03:51,529 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-28 03:03:51,530 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-28 03:03:51,530 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-28 03:03:51,531 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-28 03:03:51,531 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-28 03:03:51,532 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-28 03:03:51,532 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-28 03:03:51,533 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-28 03:03:51,533 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-28 03:03:51,534 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-28 03:03:51,534 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-28 03:03:51,535 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-28 03:03:51,535 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-28 03:03:51,537 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-28 03:03:51,537 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-28 03:03:51,538 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-28 03:03:51,538 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-28 03:03:51,539 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-28 03:03:51,539 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-28 03:03:51,540 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-28 03:03:51,540 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-28 03:03:51,541 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-28 03:03:51,541 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-28 03:03:51,542 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-28 03:03:51,542 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-28 03:03:51,543 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-28 03:03:51,543 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-28 03:03:51,544 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-28 03:03:51,544 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-28 03:03:51,544 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-28 03:03:51,545 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-28 03:03:51,545 INFO L290 TraceCheckUtils]: 42: Hoare triple {14674#false} ~cond := #in~cond; {14674#false} is VALID [2022-04-28 03:03:51,545 INFO L290 TraceCheckUtils]: 43: Hoare triple {14674#false} assume 0 == ~cond; {14674#false} is VALID [2022-04-28 03:03:51,545 INFO L290 TraceCheckUtils]: 44: Hoare triple {14674#false} assume !false; {14674#false} is VALID [2022-04-28 03:03:51,545 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:03:51,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:03:54,258 INFO L290 TraceCheckUtils]: 44: Hoare triple {14674#false} assume !false; {14674#false} is VALID [2022-04-28 03:03:54,259 INFO L290 TraceCheckUtils]: 43: Hoare triple {14853#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {14674#false} is VALID [2022-04-28 03:03:54,259 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-28 03:03:54,260 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-28 03:03:54,260 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-28 03:03:54,262 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-28 03:03:54,263 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-28 03:03:54,263 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-28 03:03:54,265 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-28 03:03:54,266 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-28 03:03:54,267 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-28 03:03:54,268 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-28 03:03:54,269 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-28 03:03:54,269 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-28 03:03:54,270 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-28 03:03:54,271 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-28 03:03:54,272 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-28 03:03:54,273 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-28 03:03:54,275 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-28 03:03:54,276 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-28 03:03:54,277 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-28 03:03:54,277 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-28 03:03:54,278 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-28 03:03:54,279 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-28 03:03:54,279 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-28 03:03:54,280 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-28 03:03:54,281 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-28 03:03:54,282 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-28 03:03:54,283 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-28 03:03:54,283 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-28 03:03:54,285 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-28 03:03:54,300 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-28 03:03:54,301 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-28 03:03:54,302 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-28 03:03:54,304 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-28 03:03:54,305 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-28 03:03:54,306 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-28 03:03:54,307 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-28 03:03:54,308 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-28 03:03:54,308 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-28 03:03:54,308 INFO L272 TraceCheckUtils]: 4: Hoare triple {14673#true} call #t~ret4 := main(); {14673#true} is VALID [2022-04-28 03:03:54,308 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14673#true} {14673#true} #34#return; {14673#true} is VALID [2022-04-28 03:03:54,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {14673#true} assume true; {14673#true} is VALID [2022-04-28 03:03:54,308 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-28 03:03:54,309 INFO L272 TraceCheckUtils]: 0: Hoare triple {14673#true} call ULTIMATE.init(); {14673#true} is VALID [2022-04-28 03:03:54,309 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:03:54,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163013147] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:03:54,309 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:03:54,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37, 40] total 77 [2022-04-28 03:03:54,310 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:03:54,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1854519878] [2022-04-28 03:03:54,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1854519878] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:03:54,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:03:54,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-28 03:03:54,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414254625] [2022-04-28 03:03:54,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:03:54,310 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-28 03:03:54,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:03:54,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:54,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:03:54,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-28 03:03:54,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:03:54,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-28 03:03:54,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1481, Invalid=4371, Unknown=0, NotChecked=0, Total=5852 [2022-04-28 03:03:54,340 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:56,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:56,816 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-28 03:03:56,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-28 03:03:56,816 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-28 03:03:56,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:03:56,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:56,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2022-04-28 03:03:56,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:56,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2022-04-28 03:03:56,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 52 transitions. [2022-04-28 03:03:56,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:03:56,862 INFO L225 Difference]: With dead ends: 52 [2022-04-28 03:03:56,862 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 03:03:56,864 INFO L412 NwaCegarLoop]: 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-28 03:03:56,864 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1197 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:03:56,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 1268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1197 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 03:03:56,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 03:03:56,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-28 03:03:56,921 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:03:56,921 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:56,921 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:56,921 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:56,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:56,922 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-28 03:03:56,922 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-28 03:03:56,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:03:56,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:03:56,923 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-28 03:03:56,923 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-28 03:03:56,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:56,923 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-28 03:03:56,923 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-28 03:03:56,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:03:56,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:03:56,924 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:03:56,924 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:03:56,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:56,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2022-04-28 03:03:56,924 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2022-04-28 03:03:56,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:03:56,925 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2022-04-28 03:03:56,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 37 states have internal predecessors, (41), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:56,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 47 transitions. [2022-04-28 03:03:56,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:03:56,968 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-28 03:03:56,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-28 03:03:56,968 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:03:56,968 INFO L195 NwaCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:03:56,991 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-28 03:03:57,172 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Forceful destruction successful, exit code 0 [2022-04-28 03:03:57,369 WARN L477 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-28 03:03:57,369 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:03:57,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:03:57,369 INFO L85 PathProgramCache]: Analyzing trace with hash -2049905866, now seen corresponding path program 69 times [2022-04-28 03:03:57,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:03:57,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [274225762] [2022-04-28 03:03:57,486 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-28 03:03:57,488 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:03:57,490 INFO L85 PathProgramCache]: Analyzing trace with hash 142273911, now seen corresponding path program 1 times [2022-04-28 03:03:57,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:03:57,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755028390] [2022-04-28 03:03:57,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:57,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:03:57,494 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-28 03:03:57,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:03:57,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [713360260] [2022-04-28 03:03:57,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:57,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:03:57,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:03:57,498 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-28 03:03:57,500 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-28 03:03:57,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:03:57,536 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:03:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:03:57,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:03:57,545 INFO L85 PathProgramCache]: Analyzing trace with hash -2049905866, now seen corresponding path program 70 times [2022-04-28 03:03:57,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:03:57,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930097599] [2022-04-28 03:03:57,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:57,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:03:57,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:58,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:03:58,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:58,349 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-28 03:03:58,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {15384#true} assume true; {15384#true} is VALID [2022-04-28 03:03:58,349 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15384#true} {15384#true} #34#return; {15384#true} is VALID [2022-04-28 03:03:58,350 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-28 03:03:58,350 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-28 03:03:58,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {15384#true} assume true; {15384#true} is VALID [2022-04-28 03:03:58,350 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15384#true} {15384#true} #34#return; {15384#true} is VALID [2022-04-28 03:03:58,350 INFO L272 TraceCheckUtils]: 4: Hoare triple {15384#true} call #t~ret4 := main(); {15384#true} is VALID [2022-04-28 03:03:58,350 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-28 03:03:58,351 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-28 03:03:58,351 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-28 03:03:58,352 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-28 03:03:58,352 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-28 03:03:58,353 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-28 03:03:58,354 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-28 03:03:58,354 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-28 03:03:58,355 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-28 03:03:58,355 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-28 03:03:58,356 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-28 03:03:58,356 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-28 03:03:58,357 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-28 03:03:58,357 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-28 03:03:58,358 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-28 03:03:58,358 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-28 03:03:58,359 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-28 03:03:58,359 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-28 03:03:58,360 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-28 03:03:58,360 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-28 03:03:58,360 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-28 03:03:58,361 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-28 03:03:58,361 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-28 03:03:58,362 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-28 03:03:58,362 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-28 03:03:58,363 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-28 03:03:58,363 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-28 03:03:58,364 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-28 03:03:58,364 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-28 03:03:58,365 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-28 03:03:58,365 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-28 03:03:58,366 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-28 03:03:58,366 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-28 03:03:58,367 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-28 03:03:58,367 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-28 03:03:58,368 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-28 03:03:58,368 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-28 03:03:58,368 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-28 03:03:58,368 INFO L290 TraceCheckUtils]: 43: Hoare triple {15385#false} ~cond := #in~cond; {15385#false} is VALID [2022-04-28 03:03:58,369 INFO L290 TraceCheckUtils]: 44: Hoare triple {15385#false} assume 0 == ~cond; {15385#false} is VALID [2022-04-28 03:03:58,369 INFO L290 TraceCheckUtils]: 45: Hoare triple {15385#false} assume !false; {15385#false} is VALID [2022-04-28 03:03:58,369 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:03:58,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:03:58,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930097599] [2022-04-28 03:03:58,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930097599] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:03:58,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827437322] [2022-04-28 03:03:58,369 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:03:58,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:03:58,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:03:58,370 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-28 03:03:58,372 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-28 03:03:58,469 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:03:58,469 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:03:58,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 73 conjunts are in the unsatisfiable core [2022-04-28 03:03:58,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:58,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:03:58,922 INFO L272 TraceCheckUtils]: 0: Hoare triple {15384#true} call ULTIMATE.init(); {15384#true} is VALID [2022-04-28 03:03:58,923 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-28 03:03:58,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {15384#true} assume true; {15384#true} is VALID [2022-04-28 03:03:58,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15384#true} {15384#true} #34#return; {15384#true} is VALID [2022-04-28 03:03:58,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {15384#true} call #t~ret4 := main(); {15384#true} is VALID [2022-04-28 03:03:58,923 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-28 03:03:58,924 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-28 03:03:58,924 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-28 03:03:58,925 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-28 03:03:58,925 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-28 03:03:58,926 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-28 03:03:58,926 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-28 03:03:58,931 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-28 03:03:58,932 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-28 03:03:58,933 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-28 03:03:58,933 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-28 03:03:58,934 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-28 03:03:58,935 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-28 03:03:58,935 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-28 03:03:58,936 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-28 03:03:58,937 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-28 03:03:58,937 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-28 03:03:58,938 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-28 03:03:58,938 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-28 03:03:58,939 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-28 03:03:58,940 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-28 03:03:58,940 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-28 03:03:58,941 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-28 03:03:58,941 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-28 03:03:58,942 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-28 03:03:58,943 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-28 03:03:58,943 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-28 03:03:58,944 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-28 03:03:58,945 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-28 03:03:58,945 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-28 03:03:58,946 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-28 03:03:58,946 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-28 03:03:58,947 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-28 03:03:58,948 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-28 03:03:58,948 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-28 03:03:58,949 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-28 03:03:58,949 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-28 03:03:58,950 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-28 03:03:58,950 INFO L290 TraceCheckUtils]: 43: Hoare triple {15385#false} ~cond := #in~cond; {15385#false} is VALID [2022-04-28 03:03:58,950 INFO L290 TraceCheckUtils]: 44: Hoare triple {15385#false} assume 0 == ~cond; {15385#false} is VALID [2022-04-28 03:03:58,950 INFO L290 TraceCheckUtils]: 45: Hoare triple {15385#false} assume !false; {15385#false} is VALID [2022-04-28 03:03:58,950 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:03:58,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:04:01,063 INFO L290 TraceCheckUtils]: 45: Hoare triple {15385#false} assume !false; {15385#false} is VALID [2022-04-28 03:04:01,064 INFO L290 TraceCheckUtils]: 44: Hoare triple {15385#false} assume 0 == ~cond; {15385#false} is VALID [2022-04-28 03:04:01,064 INFO L290 TraceCheckUtils]: 43: Hoare triple {15385#false} ~cond := #in~cond; {15385#false} is VALID [2022-04-28 03:04:01,064 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-28 03:04:01,064 INFO L290 TraceCheckUtils]: 41: Hoare triple {15577#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {15385#false} is VALID [2022-04-28 03:04:01,065 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-28 03:04:01,066 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-28 03:04:01,067 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-28 03:04:01,069 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-28 03:04:01,069 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-28 03:04:01,070 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-28 03:04:01,070 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-28 03:04:01,071 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-28 03:04:01,072 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-28 03:04:01,072 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-28 03:04:01,073 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-28 03:04:01,074 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-28 03:04:01,075 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-28 03:04:01,078 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-28 03:04:01,079 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-28 03:04:01,080 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-28 03:04:01,080 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-28 03:04:01,081 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-28 03:04:01,081 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-28 03:04:01,082 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-28 03:04:01,083 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-28 03:04:01,083 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-28 03:04:01,084 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-28 03:04:01,085 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-28 03:04:01,085 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-28 03:04:01,086 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-28 03:04:01,087 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-28 03:04:01,087 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-28 03:04:01,090 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-28 03:04:01,091 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-28 03:04:01,091 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-28 03:04:01,092 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-28 03:04:01,093 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-28 03:04:01,093 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-28 03:04:01,094 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-28 03:04:01,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {15384#true} ~x~0 := 268435441; {15717#(< 1 (mod (+ main_~x~0 4294967226) 4294967296))} is VALID [2022-04-28 03:04:01,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {15384#true} call #t~ret4 := main(); {15384#true} is VALID [2022-04-28 03:04:01,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15384#true} {15384#true} #34#return; {15384#true} is VALID [2022-04-28 03:04:01,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {15384#true} assume true; {15384#true} is VALID [2022-04-28 03:04:01,095 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-28 03:04:01,095 INFO L272 TraceCheckUtils]: 0: Hoare triple {15384#true} call ULTIMATE.init(); {15384#true} is VALID [2022-04-28 03:04:01,095 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:04:01,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827437322] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:04:01,095 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:04:01,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 76 [2022-04-28 03:04:01,095 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:04:01,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [274225762] [2022-04-28 03:04:01,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [274225762] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:04:01,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:04:01,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-28 03:04:01,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85668217] [2022-04-28 03:04:01,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:04:01,096 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-28 03:04:01,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:04:01,097 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:01,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:04:01,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-28 03:04:01,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:04:01,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-28 03:04:01,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1517, Invalid=4183, Unknown=0, NotChecked=0, Total=5700 [2022-04-28 03:04:01,131 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:03,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:04:03,738 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2022-04-28 03:04:03,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-28 03:04:03,738 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-28 03:04:03,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:04:03,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:03,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2022-04-28 03:04:03,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:03,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2022-04-28 03:04:03,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 53 transitions. [2022-04-28 03:04:03,790 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:04:03,791 INFO L225 Difference]: With dead ends: 53 [2022-04-28 03:04:03,791 INFO L226 Difference]: Without dead ends: 48 [2022-04-28 03:04:03,793 INFO L412 NwaCegarLoop]: 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-28 03:04:03,793 INFO L413 NwaCegarLoop]: 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-28 03:04:03,793 INFO L414 NwaCegarLoop]: 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-28 03:04:03,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-28 03:04:03,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-28 03:04:03,853 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:04:03,853 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:03,853 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:03,853 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:03,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:04:03,854 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-28 03:04:03,854 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-28 03:04:03,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:04:03,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:04:03,855 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-04-28 03:04:03,855 INFO L87 Difference]: Start difference. First operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 48 states. [2022-04-28 03:04:03,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:04:03,855 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-28 03:04:03,855 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-28 03:04:03,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:04:03,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:04:03,856 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:04:03,856 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:04:03,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:03,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2022-04-28 03:04:03,857 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2022-04-28 03:04:03,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:04:03,857 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2022-04-28 03:04:03,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 38 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:03,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 48 transitions. [2022-04-28 03:04:03,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:04:03,902 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-28 03:04:03,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 03:04:03,902 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:04:03,902 INFO L195 NwaCegarLoop]: trace histogram [36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:04:03,928 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-28 03:04:04,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Forceful destruction successful, exit code 0 [2022-04-28 03:04:04,303 WARN L477 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-28 03:04:04,303 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:04:04,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:04:04,304 INFO L85 PathProgramCache]: Analyzing trace with hash 913888860, now seen corresponding path program 71 times [2022-04-28 03:04:04,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:04:04,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1162637945] [2022-04-28 03:04:04,426 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-28 03:04:04,428 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:04:04,430 INFO L85 PathProgramCache]: Analyzing trace with hash 201379255, now seen corresponding path program 1 times [2022-04-28 03:04:04,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:04:04,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753645643] [2022-04-28 03:04:04,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:04:04,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:04:04,434 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-28 03:04:04,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:04:04,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [504488572] [2022-04-28 03:04:04,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:04:04,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:04:04,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:04:04,439 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-28 03:04:04,447 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-28 03:04:04,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:04:04,467 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:04:04,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:04:04,485 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:04:04,486 INFO L85 PathProgramCache]: Analyzing trace with hash 913888860, now seen corresponding path program 72 times [2022-04-28 03:04:04,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:04:04,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185151835] [2022-04-28 03:04:04,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:04:04,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:04:04,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:04:05,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:04:05,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:04:05,384 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-28 03:04:05,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {16108#true} assume true; {16108#true} is VALID [2022-04-28 03:04:05,384 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16108#true} {16108#true} #34#return; {16108#true} is VALID [2022-04-28 03:04:05,384 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-28 03:04:05,385 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-28 03:04:05,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {16108#true} assume true; {16108#true} is VALID [2022-04-28 03:04:05,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16108#true} {16108#true} #34#return; {16108#true} is VALID [2022-04-28 03:04:05,385 INFO L272 TraceCheckUtils]: 4: Hoare triple {16108#true} call #t~ret4 := main(); {16108#true} is VALID [2022-04-28 03:04:05,385 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-28 03:04:05,386 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-28 03:04:05,386 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-28 03:04:05,387 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-28 03:04:05,387 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-28 03:04:05,388 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-28 03:04:05,388 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-28 03:04:05,389 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-28 03:04:05,389 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-28 03:04:05,390 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-28 03:04:05,390 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-28 03:04:05,391 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-28 03:04:05,391 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-28 03:04:05,391 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-28 03:04:05,392 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-28 03:04:05,392 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-28 03:04:05,393 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-28 03:04:05,393 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-28 03:04:05,394 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-28 03:04:05,394 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-28 03:04:05,395 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-28 03:04:05,395 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-28 03:04:05,396 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-28 03:04:05,396 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-28 03:04:05,397 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-28 03:04:05,397 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-28 03:04:05,398 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-28 03:04:05,398 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-28 03:04:05,399 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-28 03:04:05,399 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-28 03:04:05,400 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-28 03:04:05,400 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-28 03:04:05,401 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-28 03:04:05,401 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-28 03:04:05,402 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-28 03:04:05,402 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-28 03:04:05,403 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-28 03:04:05,403 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-28 03:04:05,403 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-28 03:04:05,403 INFO L290 TraceCheckUtils]: 44: Hoare triple {16109#false} ~cond := #in~cond; {16109#false} is VALID [2022-04-28 03:04:05,403 INFO L290 TraceCheckUtils]: 45: Hoare triple {16109#false} assume 0 == ~cond; {16109#false} is VALID [2022-04-28 03:04:05,403 INFO L290 TraceCheckUtils]: 46: Hoare triple {16109#false} assume !false; {16109#false} is VALID [2022-04-28 03:04:05,404 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:04:05,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:04:05,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185151835] [2022-04-28 03:04:05,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185151835] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:04:05,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336238807] [2022-04-28 03:04:05,404 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:04:05,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:04:05,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:04:05,405 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-28 03:04:05,406 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-28 03:04:07,473 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-04-28 03:04:07,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:04:07,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 78 conjunts are in the unsatisfiable core [2022-04-28 03:04:07,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:04:07,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:04:07,865 INFO L272 TraceCheckUtils]: 0: Hoare triple {16108#true} call ULTIMATE.init(); {16108#true} is VALID [2022-04-28 03:04:07,865 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-28 03:04:07,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {16108#true} assume true; {16108#true} is VALID [2022-04-28 03:04:07,865 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16108#true} {16108#true} #34#return; {16108#true} is VALID [2022-04-28 03:04:07,865 INFO L272 TraceCheckUtils]: 4: Hoare triple {16108#true} call #t~ret4 := main(); {16108#true} is VALID [2022-04-28 03:04:07,866 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-28 03:04:07,866 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-28 03:04:07,867 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-28 03:04:07,867 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-28 03:04:07,868 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-28 03:04:07,868 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-28 03:04:07,869 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-28 03:04:07,869 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-28 03:04:07,870 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-28 03:04:07,870 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-28 03:04:07,871 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-28 03:04:07,871 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-28 03:04:07,872 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-28 03:04:07,872 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-28 03:04:07,873 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-28 03:04:07,873 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-28 03:04:07,874 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-28 03:04:07,874 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-28 03:04:07,875 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-28 03:04:07,875 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-28 03:04:07,875 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-28 03:04:07,876 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-28 03:04:07,876 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-28 03:04:07,877 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-28 03:04:07,877 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-28 03:04:07,878 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-28 03:04:07,878 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-28 03:04:07,879 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-28 03:04:07,879 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-28 03:04:07,880 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-28 03:04:07,880 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-28 03:04:07,881 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-28 03:04:07,881 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-28 03:04:07,882 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-28 03:04:07,882 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-28 03:04:07,883 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-28 03:04:07,883 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-28 03:04:07,884 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-28 03:04:07,884 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-28 03:04:07,884 INFO L290 TraceCheckUtils]: 44: Hoare triple {16109#false} ~cond := #in~cond; {16109#false} is VALID [2022-04-28 03:04:07,884 INFO L290 TraceCheckUtils]: 45: Hoare triple {16109#false} assume 0 == ~cond; {16109#false} is VALID [2022-04-28 03:04:07,884 INFO L290 TraceCheckUtils]: 46: Hoare triple {16109#false} assume !false; {16109#false} is VALID [2022-04-28 03:04:07,884 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:04:07,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:04:10,855 INFO L290 TraceCheckUtils]: 46: Hoare triple {16109#false} assume !false; {16109#false} is VALID [2022-04-28 03:04:10,857 INFO L290 TraceCheckUtils]: 45: Hoare triple {16296#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {16109#false} is VALID [2022-04-28 03:04:10,857 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-28 03:04:10,858 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-28 03:04:10,858 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-28 03:04:10,859 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-28 03:04:10,860 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-28 03:04:10,861 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-28 03:04:10,861 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-28 03:04:10,862 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-28 03:04:10,863 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-28 03:04:10,863 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-28 03:04:10,864 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-28 03:04:10,865 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-28 03:04:10,866 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-28 03:04:10,867 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-28 03:04:10,868 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-28 03:04:10,870 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-28 03:04:10,871 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-28 03:04:10,872 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-28 03:04:10,874 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-28 03:04:10,878 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-28 03:04:10,878 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-28 03:04:10,879 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-28 03:04:10,880 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-28 03:04:10,881 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-28 03:04:10,882 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-28 03:04:10,883 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-28 03:04:10,884 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-28 03:04:10,885 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-28 03:04:10,885 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-28 03:04:10,886 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-28 03:04:10,887 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-28 03:04:10,888 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-28 03:04:10,889 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-28 03:04:10,891 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-28 03:04:10,892 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-28 03:04:10,893 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-28 03:04:10,893 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-28 03:04:10,894 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-28 03:04:10,895 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-28 03:04:10,896 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-28 03:04:10,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {16108#true} call #t~ret4 := main(); {16108#true} is VALID [2022-04-28 03:04:10,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16108#true} {16108#true} #34#return; {16108#true} is VALID [2022-04-28 03:04:10,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {16108#true} assume true; {16108#true} is VALID [2022-04-28 03:04:10,896 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-28 03:04:10,896 INFO L272 TraceCheckUtils]: 0: Hoare triple {16108#true} call ULTIMATE.init(); {16108#true} is VALID [2022-04-28 03:04:10,896 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:04:10,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336238807] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:04:10,897 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:04:10,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39, 42] total 81 [2022-04-28 03:04:10,897 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:04:10,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1162637945] [2022-04-28 03:04:10,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1162637945] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:04:10,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:04:10,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-28 03:04:10,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048927361] [2022-04-28 03:04:10,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:04:10,898 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-28 03:04:10,898 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:04:10,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:10,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:04:10,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-28 03:04:10,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:04:10,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-28 03:04:10,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1639, Invalid=4841, Unknown=0, NotChecked=0, Total=6480 [2022-04-28 03:04:10,932 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:13,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:04:13,751 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-28 03:04:13,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-28 03:04:13,751 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-28 03:04:13,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:04:13,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:13,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2022-04-28 03:04:13,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:13,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2022-04-28 03:04:13,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 54 transitions. [2022-04-28 03:04:13,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:04:13,800 INFO L225 Difference]: With dead ends: 54 [2022-04-28 03:04:13,800 INFO L226 Difference]: Without dead ends: 49 [2022-04-28 03:04:13,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=3228, Invalid=10578, Unknown=0, NotChecked=0, Total=13806 [2022-04-28 03:04:13,802 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1394 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:04:13,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 73 Invalid, 1469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1394 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 03:04:13,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-28 03:04:13,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-04-28 03:04:13,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:04:13,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:13,864 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:13,864 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:13,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:04:13,865 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-28 03:04:13,865 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-28 03:04:13,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:04:13,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:04:13,865 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-28 03:04:13,865 INFO L87 Difference]: Start difference. First operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-28 03:04:13,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:04:13,866 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-28 03:04:13,866 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-28 03:04:13,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:04:13,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:04:13,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:04:13,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:04:13,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.0227272727272727) internal successors, (45), 44 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:13,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2022-04-28 03:04:13,867 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2022-04-28 03:04:13,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:04:13,867 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2022-04-28 03:04:13,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.075) internal successors, (43), 39 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:13,867 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 49 transitions. [2022-04-28 03:04:13,915 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:04:13,915 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-28 03:04:13,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-28 03:04:13,915 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:04:13,915 INFO L195 NwaCegarLoop]: trace histogram [37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:04:13,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Forceful destruction successful, exit code 0 [2022-04-28 03:04:14,122 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-28 03:04:14,316 WARN L477 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-28 03:04:14,316 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:04:14,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:04:14,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1697755146, now seen corresponding path program 73 times [2022-04-28 03:04:14,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:04:14,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [127451157] [2022-04-28 03:04:14,444 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-28 03:04:14,447 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:04:14,449 INFO L85 PathProgramCache]: Analyzing trace with hash 260484599, now seen corresponding path program 1 times [2022-04-28 03:04:14,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:04:14,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447839140] [2022-04-28 03:04:14,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:04:14,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:04:14,453 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-28 03:04:14,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:04:14,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1451247258] [2022-04-28 03:04:14,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:04:14,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:04:14,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:04:14,459 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-28 03:04:14,461 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-28 03:04:14,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:04:14,496 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:04:14,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:04:14,504 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:04:14,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1697755146, now seen corresponding path program 74 times [2022-04-28 03:04:14,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:04:14,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990089358] [2022-04-28 03:04:14,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:04:14,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:04:14,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:04:15,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:04:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:04:15,452 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-28 03:04:15,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {16851#true} assume true; {16851#true} is VALID [2022-04-28 03:04:15,453 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16851#true} {16851#true} #34#return; {16851#true} is VALID [2022-04-28 03:04:15,453 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-28 03:04:15,453 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-28 03:04:15,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {16851#true} assume true; {16851#true} is VALID [2022-04-28 03:04:15,453 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16851#true} {16851#true} #34#return; {16851#true} is VALID [2022-04-28 03:04:15,453 INFO L272 TraceCheckUtils]: 4: Hoare triple {16851#true} call #t~ret4 := main(); {16851#true} is VALID [2022-04-28 03:04:15,454 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-28 03:04:15,454 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-28 03:04:15,455 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-28 03:04:15,455 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-28 03:04:15,456 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-28 03:04:15,456 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-28 03:04:15,457 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-28 03:04:15,457 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-28 03:04:15,458 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-28 03:04:15,458 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-28 03:04:15,459 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-28 03:04:15,459 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-28 03:04:15,460 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-28 03:04:15,460 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-28 03:04:15,461 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-28 03:04:15,461 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-28 03:04:15,462 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-28 03:04:15,462 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-28 03:04:15,463 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-28 03:04:15,463 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-28 03:04:15,464 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-28 03:04:15,464 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-28 03:04:15,465 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-28 03:04:15,465 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-28 03:04:15,466 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-28 03:04:15,466 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-28 03:04:15,467 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-28 03:04:15,467 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-28 03:04:15,468 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-28 03:04:15,468 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-28 03:04:15,469 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-28 03:04:15,469 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-28 03:04:15,470 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-28 03:04:15,470 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-28 03:04:15,471 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-28 03:04:15,471 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-28 03:04:15,472 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-28 03:04:15,472 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-28 03:04:15,473 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-28 03:04:15,473 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-28 03:04:15,473 INFO L290 TraceCheckUtils]: 45: Hoare triple {16852#false} ~cond := #in~cond; {16852#false} is VALID [2022-04-28 03:04:15,473 INFO L290 TraceCheckUtils]: 46: Hoare triple {16852#false} assume 0 == ~cond; {16852#false} is VALID [2022-04-28 03:04:15,473 INFO L290 TraceCheckUtils]: 47: Hoare triple {16852#false} assume !false; {16852#false} is VALID [2022-04-28 03:04:15,473 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:04:15,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:04:15,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990089358] [2022-04-28 03:04:15,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990089358] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:04:15,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622144138] [2022-04-28 03:04:15,474 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:04:15,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:04:15,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:04:15,475 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-28 03:04:15,475 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-28 03:04:15,517 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:04:15,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:04:15,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 80 conjunts are in the unsatisfiable core [2022-04-28 03:04:15,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:04:15,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:04:15,915 INFO L272 TraceCheckUtils]: 0: Hoare triple {16851#true} call ULTIMATE.init(); {16851#true} is VALID [2022-04-28 03:04:15,915 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-28 03:04:15,915 INFO L290 TraceCheckUtils]: 2: Hoare triple {16851#true} assume true; {16851#true} is VALID [2022-04-28 03:04:15,915 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16851#true} {16851#true} #34#return; {16851#true} is VALID [2022-04-28 03:04:15,915 INFO L272 TraceCheckUtils]: 4: Hoare triple {16851#true} call #t~ret4 := main(); {16851#true} is VALID [2022-04-28 03:04:15,915 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-28 03:04:15,916 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-28 03:04:15,916 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-28 03:04:15,917 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-28 03:04:15,917 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-28 03:04:15,918 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-28 03:04:15,918 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-28 03:04:15,919 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-28 03:04:15,919 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-28 03:04:15,920 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-28 03:04:15,920 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-28 03:04:15,921 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-28 03:04:15,921 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-28 03:04:15,922 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-28 03:04:15,922 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-28 03:04:15,923 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-28 03:04:15,923 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-28 03:04:15,924 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-28 03:04:15,924 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-28 03:04:15,925 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-28 03:04:15,925 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-28 03:04:15,926 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-28 03:04:15,926 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-28 03:04:15,927 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-28 03:04:15,927 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-28 03:04:15,928 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-28 03:04:15,928 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-28 03:04:15,928 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-28 03:04:15,929 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-28 03:04:15,929 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-28 03:04:15,930 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-28 03:04:15,930 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-28 03:04:15,931 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-28 03:04:15,931 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-28 03:04:15,932 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-28 03:04:15,932 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-28 03:04:15,933 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-28 03:04:15,933 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-28 03:04:15,934 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-28 03:04:15,934 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-28 03:04:15,934 INFO L290 TraceCheckUtils]: 45: Hoare triple {16852#false} ~cond := #in~cond; {16852#false} is VALID [2022-04-28 03:04:15,934 INFO L290 TraceCheckUtils]: 46: Hoare triple {16852#false} assume 0 == ~cond; {16852#false} is VALID [2022-04-28 03:04:15,934 INFO L290 TraceCheckUtils]: 47: Hoare triple {16852#false} assume !false; {16852#false} is VALID [2022-04-28 03:04:15,934 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:04:15,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:04:19,071 INFO L290 TraceCheckUtils]: 47: Hoare triple {16852#false} assume !false; {16852#false} is VALID [2022-04-28 03:04:19,072 INFO L290 TraceCheckUtils]: 46: Hoare triple {17043#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {16852#false} is VALID [2022-04-28 03:04:19,072 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-28 03:04:19,072 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-28 03:04:19,073 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-28 03:04:19,074 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-28 03:04:19,075 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-28 03:04:19,076 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-28 03:04:19,076 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-28 03:04:19,077 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-28 03:04:19,078 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-28 03:04:19,079 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-28 03:04:19,080 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-28 03:04:19,081 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-28 03:04:19,082 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-28 03:04:19,082 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-28 03:04:19,083 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-28 03:04:19,084 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-28 03:04:19,085 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-28 03:04:19,086 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-28 03:04:19,087 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-28 03:04:19,088 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-28 03:04:19,089 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-28 03:04:19,090 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-28 03:04:19,091 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-28 03:04:19,091 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-28 03:04:19,092 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-28 03:04:19,093 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-28 03:04:19,094 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-28 03:04:19,095 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-28 03:04:19,096 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-28 03:04:19,097 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-28 03:04:19,097 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-28 03:04:19,099 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-28 03:04:19,100 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-28 03:04:19,101 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-28 03:04:19,102 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-28 03:04:19,102 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-28 03:04:19,103 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-28 03:04:19,104 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-28 03:04:19,105 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-28 03:04:19,106 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-28 03:04:19,107 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-28 03:04:19,107 INFO L272 TraceCheckUtils]: 4: Hoare triple {16851#true} call #t~ret4 := main(); {16851#true} is VALID [2022-04-28 03:04:19,107 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16851#true} {16851#true} #34#return; {16851#true} is VALID [2022-04-28 03:04:19,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {16851#true} assume true; {16851#true} is VALID [2022-04-28 03:04:19,107 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-28 03:04:19,107 INFO L272 TraceCheckUtils]: 0: Hoare triple {16851#true} call ULTIMATE.init(); {16851#true} is VALID [2022-04-28 03:04:19,108 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:04:19,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622144138] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:04:19,108 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:04:19,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40, 43] total 83 [2022-04-28 03:04:19,108 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:04:19,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [127451157] [2022-04-28 03:04:19,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [127451157] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:04:19,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:04:19,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-28 03:04:19,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412798099] [2022-04-28 03:04:19,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:04:19,109 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-28 03:04:19,109 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:04:19,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:19,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:04:19,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-28 03:04:19,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:04:19,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-28 03:04:19,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1721, Invalid=5085, Unknown=0, NotChecked=0, Total=6806 [2022-04-28 03:04:19,138 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:22,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:04:22,147 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2022-04-28 03:04:22,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-28 03:04:22,147 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-04-28 03:04:22,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:04:22,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:22,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2022-04-28 03:04:22,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:22,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2022-04-28 03:04:22,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 55 transitions. [2022-04-28 03:04:22,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:04:22,201 INFO L225 Difference]: With dead ends: 55 [2022-04-28 03:04:22,202 INFO L226 Difference]: Without dead ends: 50 [2022-04-28 03:04:22,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=3391, Invalid=11129, Unknown=0, NotChecked=0, Total=14520 [2022-04-28 03:04:22,206 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 1508 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:04:22,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 113 Invalid, 1585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1508 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 03:04:22,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-28 03:04:22,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-28 03:04:22,268 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:04:22,268 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:22,268 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:22,268 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:22,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:04:22,269 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-28 03:04:22,269 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-28 03:04:22,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:04:22,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:04:22,270 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 50 states. [2022-04-28 03:04:22,270 INFO L87 Difference]: Start difference. First operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 50 states. [2022-04-28 03:04:22,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:04:22,271 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-28 03:04:22,271 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-28 03:04:22,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:04:22,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:04:22,271 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:04:22,271 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:04:22,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.0222222222222221) internal successors, (46), 45 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:22,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2022-04-28 03:04:22,273 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2022-04-28 03:04:22,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:04:22,273 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2022-04-28 03:04:22,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 40 states have internal predecessors, (44), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:22,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 50 transitions. [2022-04-28 03:04:22,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:04:22,321 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-28 03:04:22,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 03:04:22,321 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:04:22,321 INFO L195 NwaCegarLoop]: trace histogram [38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:04:22,327 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-28 03:04:22,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Forceful destruction successful, exit code 0 [2022-04-28 03:04:22,722 WARN L477 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-28 03:04:22,722 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:04:22,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:04:22,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1054340708, now seen corresponding path program 75 times [2022-04-28 03:04:22,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:04:22,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [38413171] [2022-04-28 03:04:22,852 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-28 03:04:22,853 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:04:22,855 INFO L85 PathProgramCache]: Analyzing trace with hash 319589943, now seen corresponding path program 1 times [2022-04-28 03:04:22,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:04:22,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183237279] [2022-04-28 03:04:22,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:04:22,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:04:22,859 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-28 03:04:22,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:04:22,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1092977384] [2022-04-28 03:04:22,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:04:22,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:04:22,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:04:22,863 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-28 03:04:22,864 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-28 03:04:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:04:22,885 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:04:22,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:04:22,904 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:04:22,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1054340708, now seen corresponding path program 76 times [2022-04-28 03:04:22,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:04:22,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523151911] [2022-04-28 03:04:22,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:04:22,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:04:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:04:23,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:04:23,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:04:23,928 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-28 03:04:23,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {17610#true} assume true; {17610#true} is VALID [2022-04-28 03:04:23,928 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17610#true} {17610#true} #34#return; {17610#true} is VALID [2022-04-28 03:04:23,928 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-28 03:04:23,929 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-28 03:04:23,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {17610#true} assume true; {17610#true} is VALID [2022-04-28 03:04:23,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17610#true} {17610#true} #34#return; {17610#true} is VALID [2022-04-28 03:04:23,929 INFO L272 TraceCheckUtils]: 4: Hoare triple {17610#true} call #t~ret4 := main(); {17610#true} is VALID [2022-04-28 03:04:23,929 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-28 03:04:23,930 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-28 03:04:23,930 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-28 03:04:23,931 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-28 03:04:23,931 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-28 03:04:23,932 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-28 03:04:23,932 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-28 03:04:23,933 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-28 03:04:23,933 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-28 03:04:23,933 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-28 03:04:23,934 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-28 03:04:23,934 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-28 03:04:23,935 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-28 03:04:23,935 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-28 03:04:23,936 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-28 03:04:23,936 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-28 03:04:23,937 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-28 03:04:23,937 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-28 03:04:23,938 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-28 03:04:23,938 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-28 03:04:23,939 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-28 03:04:23,939 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-28 03:04:23,940 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-28 03:04:23,940 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-28 03:04:23,941 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-28 03:04:23,941 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-28 03:04:23,942 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-28 03:04:23,942 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-28 03:04:23,943 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-28 03:04:23,943 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-28 03:04:23,944 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-28 03:04:23,944 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-28 03:04:23,945 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-28 03:04:23,945 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-28 03:04:23,945 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-28 03:04:23,946 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-28 03:04:23,946 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-28 03:04:23,947 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-28 03:04:23,947 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-28 03:04:23,948 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-28 03:04:23,948 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-28 03:04:23,948 INFO L290 TraceCheckUtils]: 46: Hoare triple {17611#false} ~cond := #in~cond; {17611#false} is VALID [2022-04-28 03:04:23,948 INFO L290 TraceCheckUtils]: 47: Hoare triple {17611#false} assume 0 == ~cond; {17611#false} is VALID [2022-04-28 03:04:23,948 INFO L290 TraceCheckUtils]: 48: Hoare triple {17611#false} assume !false; {17611#false} is VALID [2022-04-28 03:04:23,948 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:04:23,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:04:23,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523151911] [2022-04-28 03:04:23,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523151911] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:04:23,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180653330] [2022-04-28 03:04:23,949 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:04:23,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:04:23,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:04:23,950 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-28 03:04:23,950 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-28 03:04:24,013 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:04:24,013 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:04:24,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 79 conjunts are in the unsatisfiable core [2022-04-28 03:04:24,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:04:24,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:04:24,486 INFO L272 TraceCheckUtils]: 0: Hoare triple {17610#true} call ULTIMATE.init(); {17610#true} is VALID [2022-04-28 03:04:24,486 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-28 03:04:24,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {17610#true} assume true; {17610#true} is VALID [2022-04-28 03:04:24,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17610#true} {17610#true} #34#return; {17610#true} is VALID [2022-04-28 03:04:24,486 INFO L272 TraceCheckUtils]: 4: Hoare triple {17610#true} call #t~ret4 := main(); {17610#true} is VALID [2022-04-28 03:04:24,486 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-28 03:04:24,487 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-28 03:04:24,487 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-28 03:04:24,488 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-28 03:04:24,488 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-28 03:04:24,489 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-28 03:04:24,489 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-28 03:04:24,490 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-28 03:04:24,490 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-28 03:04:24,491 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-28 03:04:24,491 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-28 03:04:24,492 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-28 03:04:24,492 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-28 03:04:24,493 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-28 03:04:24,493 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-28 03:04:24,494 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-28 03:04:24,494 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-28 03:04:24,495 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-28 03:04:24,495 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-28 03:04:24,496 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-28 03:04:24,496 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-28 03:04:24,497 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-28 03:04:24,497 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-28 03:04:24,498 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-28 03:04:24,498 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-28 03:04:24,499 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-28 03:04:24,499 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-28 03:04:24,500 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-28 03:04:24,500 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-28 03:04:24,501 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-28 03:04:24,501 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-28 03:04:24,501 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-28 03:04:24,502 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-28 03:04:24,502 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-28 03:04:24,503 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-28 03:04:24,503 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-28 03:04:24,504 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-28 03:04:24,504 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-28 03:04:24,505 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-28 03:04:24,505 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-28 03:04:24,505 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-28 03:04:24,506 INFO L290 TraceCheckUtils]: 46: Hoare triple {17611#false} ~cond := #in~cond; {17611#false} is VALID [2022-04-28 03:04:24,506 INFO L290 TraceCheckUtils]: 47: Hoare triple {17611#false} assume 0 == ~cond; {17611#false} is VALID [2022-04-28 03:04:24,506 INFO L290 TraceCheckUtils]: 48: Hoare triple {17611#false} assume !false; {17611#false} is VALID [2022-04-28 03:04:24,506 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:04:24,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:04:26,942 INFO L290 TraceCheckUtils]: 48: Hoare triple {17611#false} assume !false; {17611#false} is VALID [2022-04-28 03:04:26,943 INFO L290 TraceCheckUtils]: 47: Hoare triple {17611#false} assume 0 == ~cond; {17611#false} is VALID [2022-04-28 03:04:26,943 INFO L290 TraceCheckUtils]: 46: Hoare triple {17611#false} ~cond := #in~cond; {17611#false} is VALID [2022-04-28 03:04:26,943 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-28 03:04:26,943 INFO L290 TraceCheckUtils]: 44: Hoare triple {17815#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {17611#false} is VALID [2022-04-28 03:04:26,945 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-28 03:04:26,946 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-28 03:04:26,947 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-28 03:04:26,947 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-28 03:04:26,948 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-28 03:04:26,950 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-28 03:04:26,951 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-28 03:04:26,952 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-28 03:04:26,952 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-28 03:04:26,953 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-28 03:04:26,954 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-28 03:04:26,954 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-28 03:04:26,956 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-28 03:04:26,957 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-28 03:04:26,958 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-28 03:04:26,958 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-28 03:04:26,959 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-28 03:04:26,960 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-28 03:04:26,960 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-28 03:04:26,961 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-28 03:04:26,962 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-28 03:04:26,963 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-28 03:04:26,963 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-28 03:04:26,964 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-28 03:04:26,965 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-28 03:04:26,965 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-28 03:04:26,966 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-28 03:04:26,966 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-28 03:04:26,968 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-28 03:04:26,969 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-28 03:04:26,969 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-28 03:04:26,970 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-28 03:04:26,971 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-28 03:04:26,971 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-28 03:04:26,972 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-28 03:04:26,973 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-28 03:04:26,973 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-28 03:04:26,975 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-28 03:04:26,976 INFO L290 TraceCheckUtils]: 5: Hoare triple {17610#true} ~x~0 := 268435441; {17967#(< 1 (mod (+ main_~x~0 4294967220) 4294967296))} is VALID [2022-04-28 03:04:26,976 INFO L272 TraceCheckUtils]: 4: Hoare triple {17610#true} call #t~ret4 := main(); {17610#true} is VALID [2022-04-28 03:04:26,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17610#true} {17610#true} #34#return; {17610#true} is VALID [2022-04-28 03:04:26,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {17610#true} assume true; {17610#true} is VALID [2022-04-28 03:04:26,976 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-28 03:04:26,976 INFO L272 TraceCheckUtils]: 0: Hoare triple {17610#true} call ULTIMATE.init(); {17610#true} is VALID [2022-04-28 03:04:26,977 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:04:26,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180653330] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:04:26,977 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:04:26,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 41, 41] total 82 [2022-04-28 03:04:26,977 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:04:26,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [38413171] [2022-04-28 03:04:26,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [38413171] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:04:26,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:04:26,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-28 03:04:26,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420282491] [2022-04-28 03:04:26,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:04:26,978 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-28 03:04:26,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:04:26,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:27,005 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:04:27,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-28 03:04:27,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:04:27,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-28 03:04:27,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1760, Invalid=4882, Unknown=0, NotChecked=0, Total=6642 [2022-04-28 03:04:27,007 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:30,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:04:30,154 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-28 03:04:30,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-28 03:04:30,154 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-28 03:04:30,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:04:30,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:30,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2022-04-28 03:04:30,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:30,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2022-04-28 03:04:30,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 56 transitions. [2022-04-28 03:04:30,206 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:04:30,206 INFO L225 Difference]: With dead ends: 56 [2022-04-28 03:04:30,206 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 03:04:30,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 822 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=3513, Invalid=11007, Unknown=0, NotChecked=0, Total=14520 [2022-04-28 03:04:30,208 INFO L413 NwaCegarLoop]: 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-28 03:04:30,208 INFO L414 NwaCegarLoop]: 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-28 03:04:30,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 03:04:30,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-28 03:04:30,277 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:04:30,277 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:30,277 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:30,278 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:30,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:04:30,278 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-28 03:04:30,279 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-28 03:04:30,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:04:30,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:04:30,279 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-28 03:04:30,279 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-28 03:04:30,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:04:30,280 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-28 03:04:30,280 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-28 03:04:30,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:04:30,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:04:30,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:04:30,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:04:30,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:30,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2022-04-28 03:04:30,281 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2022-04-28 03:04:30,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:04:30,281 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2022-04-28 03:04:30,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:30,281 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 51 transitions. [2022-04-28 03:04:30,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:04:30,330 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-28 03:04:30,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 03:04:30,330 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:04:30,330 INFO L195 NwaCegarLoop]: trace histogram [39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:04:30,337 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-28 03:04:30,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Ended with exit code 0 [2022-04-28 03:04:30,731 WARN L477 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-28 03:04:30,731 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:04:30,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:04:30,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1711637686, now seen corresponding path program 77 times [2022-04-28 03:04:30,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:04:30,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1753737420] [2022-04-28 03:04:30,877 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-28 03:04:30,878 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:04:30,880 INFO L85 PathProgramCache]: Analyzing trace with hash 378695287, now seen corresponding path program 1 times [2022-04-28 03:04:30,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:04:30,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037908106] [2022-04-28 03:04:30,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:04:30,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:04:30,884 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-28 03:04:30,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:04:30,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1955581142] [2022-04-28 03:04:30,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:04:30,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:04:30,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:04:30,888 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-28 03:04:30,891 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-28 03:04:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:04:30,911 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:04:30,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:04:30,930 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:04:30,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1711637686, now seen corresponding path program 78 times [2022-04-28 03:04:30,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:04:30,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685275474] [2022-04-28 03:04:30,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:04:30,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:04:30,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:04:31,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:04:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:04:31,976 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-28 03:04:31,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {18382#true} assume true; {18382#true} is VALID [2022-04-28 03:04:31,976 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18382#true} {18382#true} #34#return; {18382#true} is VALID [2022-04-28 03:04:31,977 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-28 03:04:31,977 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-28 03:04:31,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {18382#true} assume true; {18382#true} is VALID [2022-04-28 03:04:31,977 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18382#true} {18382#true} #34#return; {18382#true} is VALID [2022-04-28 03:04:31,977 INFO L272 TraceCheckUtils]: 4: Hoare triple {18382#true} call #t~ret4 := main(); {18382#true} is VALID [2022-04-28 03:04:31,978 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-28 03:04:31,979 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-28 03:04:31,979 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-28 03:04:31,980 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-28 03:04:31,981 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-28 03:04:31,981 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-28 03:04:31,982 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-28 03:04:31,983 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-28 03:04:31,983 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-28 03:04:31,984 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-28 03:04:31,985 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-28 03:04:31,986 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-28 03:04:31,986 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-28 03:04:31,987 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-28 03:04:31,988 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-28 03:04:31,988 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-28 03:04:31,989 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-28 03:04:31,990 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-28 03:04:31,990 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-28 03:04:31,991 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-28 03:04:31,992 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-28 03:04:31,992 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-28 03:04:31,993 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-28 03:04:31,993 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-28 03:04:31,994 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-28 03:04:31,994 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-28 03:04:31,995 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-28 03:04:31,995 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-28 03:04:31,996 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-28 03:04:31,996 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-28 03:04:31,997 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-28 03:04:31,997 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-28 03:04:31,998 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-28 03:04:31,998 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-28 03:04:31,999 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-28 03:04:31,999 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-28 03:04:32,000 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-28 03:04:32,000 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-28 03:04:32,001 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-28 03:04:32,001 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-28 03:04:32,002 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-28 03:04:32,002 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-28 03:04:32,002 INFO L290 TraceCheckUtils]: 47: Hoare triple {18383#false} ~cond := #in~cond; {18383#false} is VALID [2022-04-28 03:04:32,002 INFO L290 TraceCheckUtils]: 48: Hoare triple {18383#false} assume 0 == ~cond; {18383#false} is VALID [2022-04-28 03:04:32,002 INFO L290 TraceCheckUtils]: 49: Hoare triple {18383#false} assume !false; {18383#false} is VALID [2022-04-28 03:04:32,002 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:04:32,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:04:32,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685275474] [2022-04-28 03:04:32,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685275474] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:04:32,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956616843] [2022-04-28 03:04:32,003 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:04:32,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:04:32,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:04:32,004 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-28 03:04:32,004 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-28 03:04:34,974 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2022-04-28 03:04:34,974 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:04:34,978 WARN L261 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 84 conjunts are in the unsatisfiable core [2022-04-28 03:04:34,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:04:34,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:04:35,402 INFO L272 TraceCheckUtils]: 0: Hoare triple {18382#true} call ULTIMATE.init(); {18382#true} is VALID [2022-04-28 03:04:35,402 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-28 03:04:35,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {18382#true} assume true; {18382#true} is VALID [2022-04-28 03:04:35,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18382#true} {18382#true} #34#return; {18382#true} is VALID [2022-04-28 03:04:35,402 INFO L272 TraceCheckUtils]: 4: Hoare triple {18382#true} call #t~ret4 := main(); {18382#true} is VALID [2022-04-28 03:04:35,402 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-28 03:04:35,403 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-28 03:04:35,403 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-28 03:04:35,404 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-28 03:04:35,404 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-28 03:04:35,405 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-28 03:04:35,405 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-28 03:04:35,406 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-28 03:04:35,406 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-28 03:04:35,407 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-28 03:04:35,407 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-28 03:04:35,408 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-28 03:04:35,408 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-28 03:04:35,409 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-28 03:04:35,409 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-28 03:04:35,410 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-28 03:04:35,410 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-28 03:04:35,411 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-28 03:04:35,411 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-28 03:04:35,412 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-28 03:04:35,412 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-28 03:04:35,413 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-28 03:04:35,413 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-28 03:04:35,414 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-28 03:04:35,414 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-28 03:04:35,415 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-28 03:04:35,415 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-28 03:04:35,416 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-28 03:04:35,416 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-28 03:04:35,417 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-28 03:04:35,417 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-28 03:04:35,418 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-28 03:04:35,418 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-28 03:04:35,419 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-28 03:04:35,419 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-28 03:04:35,420 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-28 03:04:35,420 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-28 03:04:35,420 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-28 03:04:35,421 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-28 03:04:35,421 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-28 03:04:35,422 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-28 03:04:35,422 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-28 03:04:35,422 INFO L290 TraceCheckUtils]: 47: Hoare triple {18383#false} ~cond := #in~cond; {18383#false} is VALID [2022-04-28 03:04:35,422 INFO L290 TraceCheckUtils]: 48: Hoare triple {18383#false} assume 0 == ~cond; {18383#false} is VALID [2022-04-28 03:04:35,422 INFO L290 TraceCheckUtils]: 49: Hoare triple {18383#false} assume !false; {18383#false} is VALID [2022-04-28 03:04:35,422 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:04:35,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:04:38,866 INFO L290 TraceCheckUtils]: 49: Hoare triple {18383#false} assume !false; {18383#false} is VALID [2022-04-28 03:04:38,867 INFO L290 TraceCheckUtils]: 48: Hoare triple {18582#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {18383#false} is VALID [2022-04-28 03:04:38,867 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-28 03:04:38,868 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-28 03:04:38,868 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-28 03:04:38,869 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-28 03:04:38,870 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-28 03:04:38,871 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-28 03:04:38,872 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-28 03:04:38,873 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-28 03:04:38,873 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-28 03:04:38,874 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-28 03:04:38,875 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-28 03:04:38,876 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-28 03:04:38,878 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-28 03:04:38,879 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-28 03:04:38,880 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-28 03:04:38,883 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-28 03:04:38,884 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-28 03:04:38,885 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-28 03:04:38,885 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-28 03:04:38,888 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-28 03:04:38,889 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-28 03:04:38,890 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-28 03:04:38,890 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-28 03:04:38,891 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-28 03:04:38,892 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-28 03:04:38,893 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-28 03:04:38,893 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-28 03:04:38,894 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-28 03:04:38,895 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-28 03:04:38,896 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-28 03:04:38,897 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-28 03:04:38,897 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-28 03:04:38,898 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-28 03:04:38,899 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-28 03:04:38,900 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-28 03:04:38,901 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-28 03:04:38,901 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-28 03:04:38,905 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-28 03:04:38,906 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-28 03:04:38,907 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-28 03:04:38,908 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-28 03:04:38,908 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-28 03:04:38,909 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-28 03:04:38,909 INFO L272 TraceCheckUtils]: 4: Hoare triple {18382#true} call #t~ret4 := main(); {18382#true} is VALID [2022-04-28 03:04:38,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18382#true} {18382#true} #34#return; {18382#true} is VALID [2022-04-28 03:04:38,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {18382#true} assume true; {18382#true} is VALID [2022-04-28 03:04:38,909 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-28 03:04:38,909 INFO L272 TraceCheckUtils]: 0: Hoare triple {18382#true} call ULTIMATE.init(); {18382#true} is VALID [2022-04-28 03:04:38,910 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:04:38,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956616843] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:04:38,910 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:04:38,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 45] total 87 [2022-04-28 03:04:38,910 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:04:38,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1753737420] [2022-04-28 03:04:38,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1753737420] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:04:38,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:04:38,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-04-28 03:04:38,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441240906] [2022-04-28 03:04:38,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:04:38,911 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-28 03:04:38,911 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:04:38,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:38,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:04:38,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-28 03:04:38,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:04:38,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-28 03:04:38,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=5591, Unknown=0, NotChecked=0, Total=7482 [2022-04-28 03:04:38,941 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:42,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:04:42,182 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2022-04-28 03:04:42,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-28 03:04:42,182 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-28 03:04:42,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:04:42,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:42,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2022-04-28 03:04:42,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:42,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2022-04-28 03:04:42,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 57 transitions. [2022-04-28 03:04:42,242 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:04:42,242 INFO L225 Difference]: With dead ends: 57 [2022-04-28 03:04:42,242 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 03:04:42,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 869 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=3729, Invalid=12273, Unknown=0, NotChecked=0, Total=16002 [2022-04-28 03:04:42,244 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1622 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:04:42,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 73 Invalid, 1703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1622 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-28 03:04:42,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 03:04:42,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-28 03:04:42,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:04:42,303 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:42,303 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:42,303 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:42,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:04:42,303 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-28 03:04:42,304 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-04-28 03:04:42,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:04:42,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:04:42,304 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 52 states. [2022-04-28 03:04:42,304 INFO L87 Difference]: Start difference. First operand has 52 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 52 states. [2022-04-28 03:04:42,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:04:42,305 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-28 03:04:42,305 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-04-28 03:04:42,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:04:42,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:04:42,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:04:42,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:04:42,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.0212765957446808) internal successors, (48), 47 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:42,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2022-04-28 03:04:42,306 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2022-04-28 03:04:42,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:04:42,306 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2022-04-28 03:04:42,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:42,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 52 transitions. [2022-04-28 03:04:42,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:04:42,350 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-04-28 03:04:42,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 03:04:42,351 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:04:42,351 INFO L195 NwaCegarLoop]: trace histogram [40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:04:42,355 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-28 03:04:42,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Ended with exit code 0 [2022-04-28 03:04:42,755 WARN L477 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-28 03:04:42,755 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:04:42,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:04:42,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1557621980, now seen corresponding path program 79 times [2022-04-28 03:04:42,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:04:42,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1380651527] [2022-04-28 03:04:42,873 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-28 03:04:42,874 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:04:42,876 INFO L85 PathProgramCache]: Analyzing trace with hash 437800631, now seen corresponding path program 1 times [2022-04-28 03:04:42,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:04:42,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240540008] [2022-04-28 03:04:42,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:04:42,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:04:42,880 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-28 03:04:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:04:42,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1901066676] [2022-04-28 03:04:42,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:04:42,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:04:42,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:04:42,888 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-28 03:04:42,889 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-28 03:04:42,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:04:42,924 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:04:42,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:04:42,932 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:04:42,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1557621980, now seen corresponding path program 80 times [2022-04-28 03:04:42,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:04:42,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989793359] [2022-04-28 03:04:42,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:04:42,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:04:42,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:04:43,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:04:43,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:04:43,865 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-28 03:04:43,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {19173#true} assume true; {19173#true} is VALID [2022-04-28 03:04:43,865 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19173#true} {19173#true} #34#return; {19173#true} is VALID [2022-04-28 03:04:43,865 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-28 03:04:43,865 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-28 03:04:43,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {19173#true} assume true; {19173#true} is VALID [2022-04-28 03:04:43,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19173#true} {19173#true} #34#return; {19173#true} is VALID [2022-04-28 03:04:43,866 INFO L272 TraceCheckUtils]: 4: Hoare triple {19173#true} call #t~ret4 := main(); {19173#true} is VALID [2022-04-28 03:04:43,866 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-28 03:04:43,866 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-28 03:04:43,867 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-28 03:04:43,867 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-28 03:04:43,868 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-28 03:04:43,868 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-28 03:04:43,869 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-28 03:04:43,869 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-28 03:04:43,870 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-28 03:04:43,870 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-28 03:04:43,871 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-28 03:04:43,871 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-28 03:04:43,872 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-28 03:04:43,872 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-28 03:04:43,873 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-28 03:04:43,873 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-28 03:04:43,874 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-28 03:04:43,874 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-28 03:04:43,875 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-28 03:04:43,875 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-28 03:04:43,876 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-28 03:04:43,876 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-28 03:04:43,877 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-28 03:04:43,877 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-28 03:04:43,878 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-28 03:04:43,878 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-28 03:04:43,879 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-28 03:04:43,879 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-28 03:04:43,880 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-28 03:04:43,880 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-28 03:04:43,881 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-28 03:04:43,881 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-28 03:04:43,882 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-28 03:04:43,882 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-28 03:04:43,883 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-28 03:04:43,883 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-28 03:04:43,884 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-28 03:04:43,884 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-28 03:04:43,884 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-28 03:04:43,885 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-28 03:04:43,885 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-28 03:04:43,886 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-28 03:04:43,886 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-28 03:04:43,886 INFO L290 TraceCheckUtils]: 48: Hoare triple {19174#false} ~cond := #in~cond; {19174#false} is VALID [2022-04-28 03:04:43,886 INFO L290 TraceCheckUtils]: 49: Hoare triple {19174#false} assume 0 == ~cond; {19174#false} is VALID [2022-04-28 03:04:43,886 INFO L290 TraceCheckUtils]: 50: Hoare triple {19174#false} assume !false; {19174#false} is VALID [2022-04-28 03:04:43,886 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:04:43,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:04:43,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989793359] [2022-04-28 03:04:43,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989793359] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:04:43,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070295460] [2022-04-28 03:04:43,887 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:04:43,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:04:43,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:04:43,888 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-28 03:04:43,888 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-28 03:04:43,970 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:04:43,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:04:43,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 83 conjunts are in the unsatisfiable core [2022-04-28 03:04:43,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:04:43,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:04:44,478 INFO L272 TraceCheckUtils]: 0: Hoare triple {19173#true} call ULTIMATE.init(); {19173#true} is VALID [2022-04-28 03:04:44,478 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-28 03:04:44,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {19173#true} assume true; {19173#true} is VALID [2022-04-28 03:04:44,478 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19173#true} {19173#true} #34#return; {19173#true} is VALID [2022-04-28 03:04:44,478 INFO L272 TraceCheckUtils]: 4: Hoare triple {19173#true} call #t~ret4 := main(); {19173#true} is VALID [2022-04-28 03:04:44,479 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-28 03:04:44,479 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-28 03:04:44,480 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-28 03:04:44,480 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-28 03:04:44,481 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-28 03:04:44,481 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-28 03:04:44,482 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-28 03:04:44,482 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-28 03:04:44,483 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-28 03:04:44,483 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-28 03:04:44,484 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-28 03:04:44,484 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-28 03:04:44,485 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-28 03:04:44,485 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-28 03:04:44,486 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-28 03:04:44,486 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-28 03:04:44,487 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-28 03:04:44,487 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-28 03:04:44,487 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-28 03:04:44,488 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-28 03:04:44,488 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-28 03:04:44,489 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-28 03:04:44,489 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-28 03:04:44,490 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-28 03:04:44,490 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-28 03:04:44,491 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-28 03:04:44,491 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-28 03:04:44,492 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-28 03:04:44,492 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-28 03:04:44,493 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-28 03:04:44,493 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-28 03:04:44,494 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-28 03:04:44,494 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-28 03:04:44,495 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-28 03:04:44,495 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-28 03:04:44,496 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-28 03:04:44,496 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-28 03:04:44,497 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-28 03:04:44,497 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-28 03:04:44,498 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-28 03:04:44,498 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-28 03:04:44,499 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-28 03:04:44,499 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-28 03:04:44,499 INFO L290 TraceCheckUtils]: 48: Hoare triple {19174#false} ~cond := #in~cond; {19174#false} is VALID [2022-04-28 03:04:44,499 INFO L290 TraceCheckUtils]: 49: Hoare triple {19174#false} assume 0 == ~cond; {19174#false} is VALID [2022-04-28 03:04:44,499 INFO L290 TraceCheckUtils]: 50: Hoare triple {19174#false} assume !false; {19174#false} is VALID [2022-04-28 03:04:44,499 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:04:44,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:04:47,128 INFO L290 TraceCheckUtils]: 50: Hoare triple {19174#false} assume !false; {19174#false} is VALID [2022-04-28 03:04:47,128 INFO L290 TraceCheckUtils]: 49: Hoare triple {19174#false} assume 0 == ~cond; {19174#false} is VALID [2022-04-28 03:04:47,128 INFO L290 TraceCheckUtils]: 48: Hoare triple {19174#false} ~cond := #in~cond; {19174#false} is VALID [2022-04-28 03:04:47,128 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-28 03:04:47,129 INFO L290 TraceCheckUtils]: 46: Hoare triple {19386#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {19174#false} is VALID [2022-04-28 03:04:47,130 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-28 03:04:47,130 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-28 03:04:47,131 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-28 03:04:47,132 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-28 03:04:47,132 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-28 03:04:47,133 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-28 03:04:47,133 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-28 03:04:47,135 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-28 03:04:47,136 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-28 03:04:47,136 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-28 03:04:47,137 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-28 03:04:47,138 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-28 03:04:47,138 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-28 03:04:47,139 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-28 03:04:47,140 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-28 03:04:47,140 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-28 03:04:47,141 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-28 03:04:47,141 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-28 03:04:47,142 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-28 03:04:47,143 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-28 03:04:47,143 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-28 03:04:47,144 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-28 03:04:47,145 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-28 03:04:47,146 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-28 03:04:47,146 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-28 03:04:47,149 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-28 03:04:47,150 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-28 03:04:47,150 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-28 03:04:47,151 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-28 03:04:47,151 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-28 03:04:47,152 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-28 03:04:47,153 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-28 03:04:47,153 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-28 03:04:47,154 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-28 03:04:47,155 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-28 03:04:47,156 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-28 03:04:47,156 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-28 03:04:47,157 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-28 03:04:47,158 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-28 03:04:47,159 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-28 03:04:47,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {19173#true} ~x~0 := 268435441; {19546#(< 1 (mod (+ 4294967216 main_~x~0) 4294967296))} is VALID [2022-04-28 03:04:47,159 INFO L272 TraceCheckUtils]: 4: Hoare triple {19173#true} call #t~ret4 := main(); {19173#true} is VALID [2022-04-28 03:04:47,159 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19173#true} {19173#true} #34#return; {19173#true} is VALID [2022-04-28 03:04:47,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {19173#true} assume true; {19173#true} is VALID [2022-04-28 03:04:47,159 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-28 03:04:47,160 INFO L272 TraceCheckUtils]: 0: Hoare triple {19173#true} call ULTIMATE.init(); {19173#true} is VALID [2022-04-28 03:04:47,160 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:04:47,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070295460] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:04:47,160 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:04:47,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43, 43] total 86 [2022-04-28 03:04:47,160 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:04:47,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1380651527] [2022-04-28 03:04:47,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1380651527] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:04:47,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:04:47,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-04-28 03:04:47,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637710808] [2022-04-28 03:04:47,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:04:47,161 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-04-28 03:04:47,161 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:04:47,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:47,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:04:47,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-28 03:04:47,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:04:47,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-28 03:04:47,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1932, Invalid=5378, Unknown=0, NotChecked=0, Total=7310 [2022-04-28 03:04:47,189 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:50,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:04:50,568 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-28 03:04:50,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-28 03:04:50,569 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-04-28 03:04:50,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:04:50,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:50,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2022-04-28 03:04:50,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:50,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2022-04-28 03:04:50,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 58 transitions. [2022-04-28 03:04:50,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:04:50,623 INFO L225 Difference]: With dead ends: 58 [2022-04-28 03:04:50,623 INFO L226 Difference]: Without dead ends: 53 [2022-04-28 03:04:50,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 905 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=3857, Invalid=12145, Unknown=0, NotChecked=0, Total=16002 [2022-04-28 03:04:50,625 INFO L413 NwaCegarLoop]: 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-28 03:04:50,625 INFO L414 NwaCegarLoop]: 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-28 03:04:50,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-28 03:04:50,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-04-28 03:04:50,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:04:50,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:50,692 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:50,692 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:50,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:04:50,693 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2022-04-28 03:04:50,693 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-04-28 03:04:50,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:04:50,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:04:50,693 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-28 03:04:50,694 INFO L87 Difference]: Start difference. First operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-28 03:04:50,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:04:50,694 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2022-04-28 03:04:50,694 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-04-28 03:04:50,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:04:50,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:04:50,695 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:04:50,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:04:50,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.0208333333333333) internal successors, (49), 48 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:50,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2022-04-28 03:04:50,695 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2022-04-28 03:04:50,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:04:50,696 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2022-04-28 03:04:50,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 43 states have internal predecessors, (47), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:50,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 53 transitions. [2022-04-28 03:04:50,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:04:50,745 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-04-28 03:04:50,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-28 03:04:50,745 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:04:50,745 INFO L195 NwaCegarLoop]: trace histogram [41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:04:50,752 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-28 03:04:50,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Forceful destruction successful, exit code 0 [2022-04-28 03:04:51,146 WARN L477 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-28 03:04:51,146 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:04:51,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:04:51,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1078102390, now seen corresponding path program 81 times [2022-04-28 03:04:51,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:04:51,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1187552723] [2022-04-28 03:04:51,265 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-28 03:04:51,267 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:04:51,269 INFO L85 PathProgramCache]: Analyzing trace with hash 496905975, now seen corresponding path program 1 times [2022-04-28 03:04:51,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:04:51,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842465182] [2022-04-28 03:04:51,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:04:51,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:04:51,273 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-28 03:04:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:04:51,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1509680806] [2022-04-28 03:04:51,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:04:51,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:04:51,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:04:51,277 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-28 03:04:51,302 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-28 03:04:51,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:04:51,329 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:04:51,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:04:51,338 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:04:51,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1078102390, now seen corresponding path program 82 times [2022-04-28 03:04:51,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:04:51,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855259755] [2022-04-28 03:04:51,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:04:51,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:04:51,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:04:52,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:04:52,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:04:52,315 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-28 03:04:52,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {19977#true} assume true; {19977#true} is VALID [2022-04-28 03:04:52,315 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19977#true} {19977#true} #34#return; {19977#true} is VALID [2022-04-28 03:04:52,316 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-28 03:04:52,316 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-28 03:04:52,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {19977#true} assume true; {19977#true} is VALID [2022-04-28 03:04:52,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19977#true} {19977#true} #34#return; {19977#true} is VALID [2022-04-28 03:04:52,316 INFO L272 TraceCheckUtils]: 4: Hoare triple {19977#true} call #t~ret4 := main(); {19977#true} is VALID [2022-04-28 03:04:52,317 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-28 03:04:52,317 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-28 03:04:52,318 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-28 03:04:52,318 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-28 03:04:52,319 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-28 03:04:52,319 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-28 03:04:52,320 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-28 03:04:52,320 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-28 03:04:52,321 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-28 03:04:52,321 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-28 03:04:52,322 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-28 03:04:52,322 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-28 03:04:52,322 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-28 03:04:52,323 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-28 03:04:52,323 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-28 03:04:52,324 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-28 03:04:52,324 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-28 03:04:52,325 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-28 03:04:52,325 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-28 03:04:52,326 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-28 03:04:52,326 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-28 03:04:52,327 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-28 03:04:52,327 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-28 03:04:52,328 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-28 03:04:52,328 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-28 03:04:52,329 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-28 03:04:52,329 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-28 03:04:52,330 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-28 03:04:52,330 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-28 03:04:52,331 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-28 03:04:52,331 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-28 03:04:52,332 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-28 03:04:52,332 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-28 03:04:52,333 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-28 03:04:52,333 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-28 03:04:52,334 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-28 03:04:52,334 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-28 03:04:52,335 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-28 03:04:52,335 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-28 03:04:52,336 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-28 03:04:52,336 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-28 03:04:52,337 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-28 03:04:52,337 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-28 03:04:52,337 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-28 03:04:52,337 INFO L290 TraceCheckUtils]: 49: Hoare triple {19978#false} ~cond := #in~cond; {19978#false} is VALID [2022-04-28 03:04:52,337 INFO L290 TraceCheckUtils]: 50: Hoare triple {19978#false} assume 0 == ~cond; {19978#false} is VALID [2022-04-28 03:04:52,338 INFO L290 TraceCheckUtils]: 51: Hoare triple {19978#false} assume !false; {19978#false} is VALID [2022-04-28 03:04:52,338 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:04:52,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:04:52,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855259755] [2022-04-28 03:04:52,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855259755] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:04:52,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327704230] [2022-04-28 03:04:52,338 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:04:52,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:04:52,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:04:52,344 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-28 03:04:52,345 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-28 03:04:52,496 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:04:52,496 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:04:52,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 85 conjunts are in the unsatisfiable core [2022-04-28 03:04:52,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:04:52,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:04:53,029 INFO L272 TraceCheckUtils]: 0: Hoare triple {19977#true} call ULTIMATE.init(); {19977#true} is VALID [2022-04-28 03:04:53,029 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-28 03:04:53,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {19977#true} assume true; {19977#true} is VALID [2022-04-28 03:04:53,030 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19977#true} {19977#true} #34#return; {19977#true} is VALID [2022-04-28 03:04:53,030 INFO L272 TraceCheckUtils]: 4: Hoare triple {19977#true} call #t~ret4 := main(); {19977#true} is VALID [2022-04-28 03:04:53,030 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-28 03:04:53,030 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-28 03:04:53,031 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-28 03:04:53,031 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-28 03:04:53,032 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-28 03:04:53,032 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-28 03:04:53,033 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-28 03:04:53,033 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-28 03:04:53,034 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-28 03:04:53,034 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-28 03:04:53,035 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-28 03:04:53,035 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-28 03:04:53,036 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-28 03:04:53,036 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-28 03:04:53,037 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-28 03:04:53,037 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-28 03:04:53,038 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-28 03:04:53,038 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-28 03:04:53,039 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-28 03:04:53,039 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-28 03:04:53,040 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-28 03:04:53,040 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-28 03:04:53,041 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-28 03:04:53,041 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-28 03:04:53,042 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-28 03:04:53,042 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-28 03:04:53,043 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-28 03:04:53,043 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-28 03:04:53,044 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-28 03:04:53,044 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-28 03:04:53,045 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-28 03:04:53,045 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-28 03:04:53,046 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-28 03:04:53,046 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-28 03:04:53,047 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-28 03:04:53,047 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-28 03:04:53,048 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-28 03:04:53,048 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-28 03:04:53,049 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-28 03:04:53,049 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-28 03:04:53,050 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-28 03:04:53,050 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-28 03:04:53,050 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-28 03:04:53,051 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-28 03:04:53,051 INFO L290 TraceCheckUtils]: 49: Hoare triple {19978#false} ~cond := #in~cond; {19978#false} is VALID [2022-04-28 03:04:53,051 INFO L290 TraceCheckUtils]: 50: Hoare triple {19978#false} assume 0 == ~cond; {19978#false} is VALID [2022-04-28 03:04:53,051 INFO L290 TraceCheckUtils]: 51: Hoare triple {19978#false} assume !false; {19978#false} is VALID [2022-04-28 03:04:53,051 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:04:53,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:04:55,834 INFO L290 TraceCheckUtils]: 51: Hoare triple {19978#false} assume !false; {19978#false} is VALID [2022-04-28 03:04:55,835 INFO L290 TraceCheckUtils]: 50: Hoare triple {19978#false} assume 0 == ~cond; {19978#false} is VALID [2022-04-28 03:04:55,835 INFO L290 TraceCheckUtils]: 49: Hoare triple {19978#false} ~cond := #in~cond; {19978#false} is VALID [2022-04-28 03:04:55,835 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-28 03:04:55,835 INFO L290 TraceCheckUtils]: 47: Hoare triple {20194#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {19978#false} is VALID [2022-04-28 03:04:55,836 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-28 03:04:55,837 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-28 03:04:55,837 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-28 03:04:55,838 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-28 03:04:55,839 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-28 03:04:55,839 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-28 03:04:55,840 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-28 03:04:55,840 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-28 03:04:55,841 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-28 03:04:55,842 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-28 03:04:55,843 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-28 03:04:55,846 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-28 03:04:55,846 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-28 03:04:55,847 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-28 03:04:55,848 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-28 03:04:55,848 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-28 03:04:55,849 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-28 03:04:55,849 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-28 03:04:55,850 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-28 03:04:55,851 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-28 03:04:55,851 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-28 03:04:55,852 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-28 03:04:55,853 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-28 03:04:55,853 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-28 03:04:55,854 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-28 03:04:55,855 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-28 03:04:55,856 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-28 03:04:55,856 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-28 03:04:55,857 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-28 03:04:55,857 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-28 03:04:55,858 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-28 03:04:55,859 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-28 03:04:55,859 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-28 03:04:55,860 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-28 03:04:55,860 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-28 03:04:55,861 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-28 03:04:55,862 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-28 03:04:55,863 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-28 03:04:55,863 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-28 03:04:55,864 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-28 03:04:55,865 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-28 03:04:55,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {19977#true} ~x~0 := 268435441; {20358#(< 1 (mod (+ main_~x~0 4294967214) 4294967296))} is VALID [2022-04-28 03:04:55,865 INFO L272 TraceCheckUtils]: 4: Hoare triple {19977#true} call #t~ret4 := main(); {19977#true} is VALID [2022-04-28 03:04:55,865 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19977#true} {19977#true} #34#return; {19977#true} is VALID [2022-04-28 03:04:55,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {19977#true} assume true; {19977#true} is VALID [2022-04-28 03:04:55,865 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-28 03:04:55,865 INFO L272 TraceCheckUtils]: 0: Hoare triple {19977#true} call ULTIMATE.init(); {19977#true} is VALID [2022-04-28 03:04:55,866 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:04:55,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327704230] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:04:55,866 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:04:55,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 44, 44] total 88 [2022-04-28 03:04:55,866 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:04:55,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1187552723] [2022-04-28 03:04:55,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1187552723] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:04:55,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:04:55,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-04-28 03:04:55,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471419734] [2022-04-28 03:04:55,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:04:55,867 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-28 03:04:55,867 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:04:55,867 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 45 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:55,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:04:55,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-04-28 03:04:55,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:04:55,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-04-28 03:04:55,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2021, Invalid=5635, Unknown=0, NotChecked=0, Total=7656 [2022-04-28 03:04:55,896 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand has 45 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:59,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:04:59,530 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2022-04-28 03:04:59,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-04-28 03:04:59,530 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-04-28 03:04:59,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:04:59,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:59,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2022-04-28 03:04:59,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:59,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2022-04-28 03:04:59,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 59 transitions. [2022-04-28 03:04:59,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:04:59,570 INFO L225 Difference]: With dead ends: 59 [2022-04-28 03:04:59,570 INFO L226 Difference]: Without dead ends: 54 [2022-04-28 03:04:59,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 948 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=4035, Invalid=12735, Unknown=0, NotChecked=0, Total=16770 [2022-04-28 03:04:59,572 INFO L413 NwaCegarLoop]: 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.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:04:59,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 168 Invalid, 1964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1879 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-28 03:04:59,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-28 03:04:59,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-28 03:04:59,636 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:04:59,636 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:59,636 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:59,636 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:59,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:04:59,637 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-28 03:04:59,637 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-04-28 03:04:59,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:04:59,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:04:59,637 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-28 03:04:59,637 INFO L87 Difference]: Start difference. First operand has 54 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-28 03:04:59,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:04:59,638 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-28 03:04:59,638 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-04-28 03:04:59,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:04:59,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:04:59,638 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:04:59,638 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:04:59,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:59,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2022-04-28 03:04:59,639 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2022-04-28 03:04:59,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:04:59,639 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2022-04-28 03:04:59,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 44 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:04:59,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 54 transitions. [2022-04-28 03:04:59,679 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:04:59,679 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-04-28 03:04:59,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-28 03:04:59,680 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:04:59,680 INFO L195 NwaCegarLoop]: trace histogram [42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:04:59,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Ended with exit code 0 [2022-04-28 03:04:59,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Ended with exit code 0 [2022-04-28 03:05:00,080 WARN L477 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-28 03:05:00,080 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:05:00,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:05:00,081 INFO L85 PathProgramCache]: Analyzing trace with hash -902103012, now seen corresponding path program 83 times [2022-04-28 03:05:00,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:05:00,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [856923716] [2022-04-28 03:05:00,213 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-28 03:05:00,215 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:05:00,217 INFO L85 PathProgramCache]: Analyzing trace with hash 556011319, now seen corresponding path program 1 times [2022-04-28 03:05:00,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:05:00,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995615510] [2022-04-28 03:05:00,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:05:00,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:05:00,220 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-28 03:05:00,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:05:00,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [846746252] [2022-04-28 03:05:00,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:05:00,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:05:00,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:05:00,226 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-28 03:05:00,235 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-28 03:05:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:05:00,281 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:05:00,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:05:00,291 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:05:00,291 INFO L85 PathProgramCache]: Analyzing trace with hash -902103012, now seen corresponding path program 84 times [2022-04-28 03:05:00,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:05:00,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244638478] [2022-04-28 03:05:00,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:05:00,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:05:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:01,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:05:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:01,313 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-28 03:05:01,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {20797#true} assume true; {20797#true} is VALID [2022-04-28 03:05:01,313 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20797#true} {20797#true} #34#return; {20797#true} is VALID [2022-04-28 03:05:01,314 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-28 03:05:01,314 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-28 03:05:01,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {20797#true} assume true; {20797#true} is VALID [2022-04-28 03:05:01,314 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20797#true} {20797#true} #34#return; {20797#true} is VALID [2022-04-28 03:05:01,314 INFO L272 TraceCheckUtils]: 4: Hoare triple {20797#true} call #t~ret4 := main(); {20797#true} is VALID [2022-04-28 03:05:01,314 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-28 03:05:01,315 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-28 03:05:01,316 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-28 03:05:01,316 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-28 03:05:01,316 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-28 03:05:01,317 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-28 03:05:01,317 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-28 03:05:01,318 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-28 03:05:01,318 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-28 03:05:01,319 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-28 03:05:01,319 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-28 03:05:01,320 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-28 03:05:01,320 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-28 03:05:01,321 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-28 03:05:01,321 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-28 03:05:01,322 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-28 03:05:01,322 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-28 03:05:01,323 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-28 03:05:01,323 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-28 03:05:01,324 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-28 03:05:01,324 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-28 03:05:01,325 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-28 03:05:01,325 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-28 03:05:01,326 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-28 03:05:01,326 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-28 03:05:01,327 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-28 03:05:01,327 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-28 03:05:01,328 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-28 03:05:01,328 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-28 03:05:01,329 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-28 03:05:01,329 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-28 03:05:01,330 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-28 03:05:01,330 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-28 03:05:01,331 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-28 03:05:01,331 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-28 03:05:01,332 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-28 03:05:01,332 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-28 03:05:01,333 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-28 03:05:01,333 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-28 03:05:01,334 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-28 03:05:01,334 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-28 03:05:01,335 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-28 03:05:01,335 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-28 03:05:01,336 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-28 03:05:01,336 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-28 03:05:01,336 INFO L290 TraceCheckUtils]: 50: Hoare triple {20798#false} ~cond := #in~cond; {20798#false} is VALID [2022-04-28 03:05:01,336 INFO L290 TraceCheckUtils]: 51: Hoare triple {20798#false} assume 0 == ~cond; {20798#false} is VALID [2022-04-28 03:05:01,336 INFO L290 TraceCheckUtils]: 52: Hoare triple {20798#false} assume !false; {20798#false} is VALID [2022-04-28 03:05:01,336 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:05:01,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:05:01,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244638478] [2022-04-28 03:05:01,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244638478] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:05:01,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527945189] [2022-04-28 03:05:01,337 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:05:01,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:05:01,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:05:01,338 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-28 03:05:01,339 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-28 03:05:04,173 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2022-04-28 03:05:04,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:05:04,177 WARN L261 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 90 conjunts are in the unsatisfiable core [2022-04-28 03:05:04,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:04,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:05:04,636 INFO L272 TraceCheckUtils]: 0: Hoare triple {20797#true} call ULTIMATE.init(); {20797#true} is VALID [2022-04-28 03:05:04,636 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-28 03:05:04,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {20797#true} assume true; {20797#true} is VALID [2022-04-28 03:05:04,636 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20797#true} {20797#true} #34#return; {20797#true} is VALID [2022-04-28 03:05:04,636 INFO L272 TraceCheckUtils]: 4: Hoare triple {20797#true} call #t~ret4 := main(); {20797#true} is VALID [2022-04-28 03:05:04,636 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-28 03:05:04,637 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-28 03:05:04,637 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-28 03:05:04,638 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-28 03:05:04,638 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-28 03:05:04,639 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-28 03:05:04,639 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-28 03:05:04,640 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-28 03:05:04,641 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-28 03:05:04,641 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-28 03:05:04,642 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-28 03:05:04,642 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-28 03:05:04,643 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-28 03:05:04,643 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-28 03:05:04,644 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-28 03:05:04,644 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-28 03:05:04,645 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-28 03:05:04,645 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-28 03:05:04,645 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-28 03:05:04,646 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-28 03:05:04,646 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-28 03:05:04,647 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-28 03:05:04,647 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-28 03:05:04,648 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-28 03:05:04,648 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-28 03:05:04,649 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-28 03:05:04,649 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-28 03:05:04,650 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-28 03:05:04,650 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-28 03:05:04,651 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-28 03:05:04,651 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-28 03:05:04,652 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-28 03:05:04,652 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-28 03:05:04,653 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-28 03:05:04,653 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-28 03:05:04,654 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-28 03:05:04,654 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-28 03:05:04,655 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-28 03:05:04,655 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-28 03:05:04,656 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-28 03:05:04,656 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-28 03:05:04,657 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-28 03:05:04,657 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-28 03:05:04,658 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-28 03:05:04,658 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-28 03:05:04,658 INFO L290 TraceCheckUtils]: 50: Hoare triple {20798#false} ~cond := #in~cond; {20798#false} is VALID [2022-04-28 03:05:04,658 INFO L290 TraceCheckUtils]: 51: Hoare triple {20798#false} assume 0 == ~cond; {20798#false} is VALID [2022-04-28 03:05:04,658 INFO L290 TraceCheckUtils]: 52: Hoare triple {20798#false} assume !false; {20798#false} is VALID [2022-04-28 03:05:04,658 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:05:04,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:05:08,589 INFO L290 TraceCheckUtils]: 52: Hoare triple {20798#false} assume !false; {20798#false} is VALID [2022-04-28 03:05:08,590 INFO L290 TraceCheckUtils]: 51: Hoare triple {21009#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {20798#false} is VALID [2022-04-28 03:05:08,590 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-28 03:05:08,590 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-28 03:05:08,591 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-28 03:05:08,592 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-28 03:05:08,593 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-28 03:05:08,594 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-28 03:05:08,595 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-28 03:05:08,596 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-28 03:05:08,597 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-28 03:05:08,598 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-28 03:05:08,599 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-28 03:05:08,600 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-28 03:05:08,600 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-28 03:05:08,603 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-28 03:05:08,603 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-28 03:05:08,604 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-28 03:05:08,608 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-28 03:05:08,609 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-28 03:05:08,610 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-28 03:05:08,611 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-28 03:05:08,612 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-28 03:05:08,613 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-28 03:05:08,613 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-28 03:05:08,615 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-28 03:05:08,616 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-28 03:05:08,618 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-28 03:05:08,619 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-28 03:05:08,619 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-28 03:05:08,620 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-28 03:05:08,621 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-28 03:05:08,622 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-28 03:05:08,623 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-28 03:05:08,625 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-28 03:05:08,626 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-28 03:05:08,627 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-28 03:05:08,628 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-28 03:05:08,629 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-28 03:05:08,629 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-28 03:05:08,631 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-28 03:05:08,632 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-28 03:05:08,632 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-28 03:05:08,634 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-28 03:05:08,635 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-28 03:05:08,636 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-28 03:05:08,637 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-28 03:05:08,637 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-28 03:05:08,637 INFO L272 TraceCheckUtils]: 4: Hoare triple {20797#true} call #t~ret4 := main(); {20797#true} is VALID [2022-04-28 03:05:08,637 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20797#true} {20797#true} #34#return; {20797#true} is VALID [2022-04-28 03:05:08,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {20797#true} assume true; {20797#true} is VALID [2022-04-28 03:05:08,637 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-28 03:05:08,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {20797#true} call ULTIMATE.init(); {20797#true} is VALID [2022-04-28 03:05:08,638 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:05:08,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527945189] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:05:08,638 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:05:08,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 45, 48] total 93 [2022-04-28 03:05:08,638 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:05:08,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [856923716] [2022-04-28 03:05:08,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [856923716] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:05:08,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:05:08,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-04-28 03:05:08,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638244391] [2022-04-28 03:05:08,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:05:08,639 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-04-28 03:05:08,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:05:08,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:08,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:05:08,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-28 03:05:08,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:05:08,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-28 03:05:08,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2161, Invalid=6395, Unknown=0, NotChecked=0, Total=8556 [2022-04-28 03:05:08,669 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:12,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:12,449 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-04-28 03:05:12,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-28 03:05:12,449 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-04-28 03:05:12,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:05:12,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:12,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2022-04-28 03:05:12,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:12,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2022-04-28 03:05:12,450 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 60 transitions. [2022-04-28 03:05:12,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:05:12,490 INFO L225 Difference]: With dead ends: 60 [2022-04-28 03:05:12,490 INFO L226 Difference]: Without dead ends: 55 [2022-04-28 03:05:12,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 998 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=4266, Invalid=14094, Unknown=0, NotChecked=0, Total=18360 [2022-04-28 03:05:12,491 INFO L413 NwaCegarLoop]: 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-28 03:05:12,491 INFO L414 NwaCegarLoop]: 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-28 03:05:12,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-28 03:05:12,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-28 03:05:12,550 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:05:12,551 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:12,551 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:12,551 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:12,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:12,551 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2022-04-28 03:05:12,551 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2022-04-28 03:05:12,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:05:12,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:05:12,552 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-28 03:05:12,552 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-28 03:05:12,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:12,552 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2022-04-28 03:05:12,552 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2022-04-28 03:05:12,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:05:12,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:05:12,553 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:05:12,553 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:05:12,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:12,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2022-04-28 03:05:12,554 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2022-04-28 03:05:12,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:05:12,554 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2022-04-28 03:05:12,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.065217391304348) internal successors, (49), 45 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:12,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 55 transitions. [2022-04-28 03:05:12,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:05:12,597 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2022-04-28 03:05:12,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-28 03:05:12,597 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:05:12,597 INFO L195 NwaCegarLoop]: trace histogram [43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:05:12,601 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-28 03:05:12,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Forceful destruction successful, exit code 0 [2022-04-28 03:05:12,998 WARN L477 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-28 03:05:12,998 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:05:12,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:05:12,998 INFO L85 PathProgramCache]: Analyzing trace with hash 2136038966, now seen corresponding path program 85 times [2022-04-28 03:05:12,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:05:12,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1333894139] [2022-04-28 03:05:13,124 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-28 03:05:13,126 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:05:13,128 INFO L85 PathProgramCache]: Analyzing trace with hash 615116663, now seen corresponding path program 1 times [2022-04-28 03:05:13,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:05:13,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75913010] [2022-04-28 03:05:13,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:05:13,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:05:13,132 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-28 03:05:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:05:13,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [832848326] [2022-04-28 03:05:13,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:05:13,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:05:13,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:05:13,137 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-28 03:05:13,145 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-28 03:05:13,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:05:13,166 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:05:13,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:05:13,185 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:05:13,185 INFO L85 PathProgramCache]: Analyzing trace with hash 2136038966, now seen corresponding path program 86 times [2022-04-28 03:05:13,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:05:13,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671786309] [2022-04-28 03:05:13,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:05:13,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:05:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:14,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:05:14,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:14,273 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-28 03:05:14,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {21636#true} assume true; {21636#true} is VALID [2022-04-28 03:05:14,273 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21636#true} {21636#true} #34#return; {21636#true} is VALID [2022-04-28 03:05:14,274 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-28 03:05:14,274 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-28 03:05:14,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {21636#true} assume true; {21636#true} is VALID [2022-04-28 03:05:14,274 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21636#true} {21636#true} #34#return; {21636#true} is VALID [2022-04-28 03:05:14,274 INFO L272 TraceCheckUtils]: 4: Hoare triple {21636#true} call #t~ret4 := main(); {21636#true} is VALID [2022-04-28 03:05:14,274 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-28 03:05:14,275 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-28 03:05:14,275 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-28 03:05:14,276 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-28 03:05:14,276 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-28 03:05:14,277 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-28 03:05:14,277 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-28 03:05:14,278 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-28 03:05:14,278 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-28 03:05:14,279 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-28 03:05:14,279 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-28 03:05:14,280 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-28 03:05:14,280 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-28 03:05:14,281 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-28 03:05:14,281 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-28 03:05:14,282 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-28 03:05:14,282 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-28 03:05:14,283 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-28 03:05:14,283 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-28 03:05:14,284 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-28 03:05:14,284 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-28 03:05:14,285 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-28 03:05:14,285 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-28 03:05:14,286 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-28 03:05:14,286 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-28 03:05:14,287 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-28 03:05:14,287 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-28 03:05:14,288 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-28 03:05:14,288 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-28 03:05:14,289 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-28 03:05:14,289 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-28 03:05:14,290 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-28 03:05:14,290 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-28 03:05:14,291 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-28 03:05:14,291 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-28 03:05:14,292 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-28 03:05:14,292 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-28 03:05:14,293 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-28 03:05:14,293 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-28 03:05:14,294 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-28 03:05:14,294 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-28 03:05:14,294 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-28 03:05:14,295 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-28 03:05:14,296 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-28 03:05:14,296 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-28 03:05:14,296 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-28 03:05:14,296 INFO L290 TraceCheckUtils]: 51: Hoare triple {21637#false} ~cond := #in~cond; {21637#false} is VALID [2022-04-28 03:05:14,296 INFO L290 TraceCheckUtils]: 52: Hoare triple {21637#false} assume 0 == ~cond; {21637#false} is VALID [2022-04-28 03:05:14,296 INFO L290 TraceCheckUtils]: 53: Hoare triple {21637#false} assume !false; {21637#false} is VALID [2022-04-28 03:05:14,297 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:05:14,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:05:14,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671786309] [2022-04-28 03:05:14,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671786309] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:05:14,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086233376] [2022-04-28 03:05:14,297 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:05:14,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:05:14,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:05:14,298 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-28 03:05:14,298 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-28 03:05:14,363 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:05:14,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:05:14,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 89 conjunts are in the unsatisfiable core [2022-04-28 03:05:14,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:14,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:05:14,906 INFO L272 TraceCheckUtils]: 0: Hoare triple {21636#true} call ULTIMATE.init(); {21636#true} is VALID [2022-04-28 03:05:14,906 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-28 03:05:14,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {21636#true} assume true; {21636#true} is VALID [2022-04-28 03:05:14,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21636#true} {21636#true} #34#return; {21636#true} is VALID [2022-04-28 03:05:14,906 INFO L272 TraceCheckUtils]: 4: Hoare triple {21636#true} call #t~ret4 := main(); {21636#true} is VALID [2022-04-28 03:05:14,906 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-28 03:05:14,907 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-28 03:05:14,907 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-28 03:05:14,908 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-28 03:05:14,908 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-28 03:05:14,909 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-28 03:05:14,909 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-28 03:05:14,910 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-28 03:05:14,910 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-28 03:05:14,911 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-28 03:05:14,911 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-28 03:05:14,912 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-28 03:05:14,912 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-28 03:05:14,913 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-28 03:05:14,913 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-28 03:05:14,914 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-28 03:05:14,914 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-28 03:05:14,915 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-28 03:05:14,915 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-28 03:05:14,916 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-28 03:05:14,916 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-28 03:05:14,917 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-28 03:05:14,917 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-28 03:05:14,918 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-28 03:05:14,918 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-28 03:05:14,919 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-28 03:05:14,919 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-28 03:05:14,920 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-28 03:05:14,920 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-28 03:05:14,921 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-28 03:05:14,921 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-28 03:05:14,922 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-28 03:05:14,922 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-28 03:05:14,923 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-28 03:05:14,923 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-28 03:05:14,924 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-28 03:05:14,924 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-28 03:05:14,925 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-28 03:05:14,925 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-28 03:05:14,926 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-28 03:05:14,926 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-28 03:05:14,927 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-28 03:05:14,927 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-28 03:05:14,928 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-28 03:05:14,928 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-28 03:05:14,928 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-28 03:05:14,928 INFO L290 TraceCheckUtils]: 51: Hoare triple {21637#false} ~cond := #in~cond; {21637#false} is VALID [2022-04-28 03:05:14,928 INFO L290 TraceCheckUtils]: 52: Hoare triple {21637#false} assume 0 == ~cond; {21637#false} is VALID [2022-04-28 03:05:14,928 INFO L290 TraceCheckUtils]: 53: Hoare triple {21637#false} assume !false; {21637#false} is VALID [2022-04-28 03:05:14,929 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:05:14,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:05:17,983 INFO L290 TraceCheckUtils]: 53: Hoare triple {21637#false} assume !false; {21637#false} is VALID [2022-04-28 03:05:17,983 INFO L290 TraceCheckUtils]: 52: Hoare triple {21637#false} assume 0 == ~cond; {21637#false} is VALID [2022-04-28 03:05:17,983 INFO L290 TraceCheckUtils]: 51: Hoare triple {21637#false} ~cond := #in~cond; {21637#false} is VALID [2022-04-28 03:05:17,983 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-28 03:05:17,983 INFO L290 TraceCheckUtils]: 49: Hoare triple {21861#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {21637#false} is VALID [2022-04-28 03:05:17,984 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-28 03:05:17,985 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-28 03:05:17,985 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-28 03:05:17,986 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-28 03:05:17,987 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-28 03:05:17,987 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-28 03:05:17,988 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-28 03:05:17,988 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-28 03:05:17,989 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-28 03:05:17,990 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-28 03:05:17,990 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-28 03:05:17,991 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-28 03:05:17,995 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-28 03:05:17,996 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-28 03:05:17,997 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-28 03:05:17,998 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-28 03:05:17,998 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-28 03:05:17,999 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-28 03:05:18,000 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-28 03:05:18,002 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-28 03:05:18,003 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-28 03:05:18,004 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-28 03:05:18,004 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-28 03:05:18,005 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-28 03:05:18,007 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-28 03:05:18,008 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-28 03:05:18,009 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-28 03:05:18,009 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-28 03:05:18,010 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-28 03:05:18,011 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-28 03:05:18,011 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-28 03:05:18,012 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-28 03:05:18,012 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-28 03:05:18,013 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-28 03:05:18,014 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-28 03:05:18,021 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-28 03:05:18,022 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-28 03:05:18,023 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-28 03:05:18,023 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-28 03:05:18,024 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-28 03:05:18,024 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-28 03:05:18,025 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-28 03:05:18,026 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-28 03:05:18,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {21636#true} ~x~0 := 268435441; {22033#(< 1 (mod (+ 4294967210 main_~x~0) 4294967296))} is VALID [2022-04-28 03:05:18,026 INFO L272 TraceCheckUtils]: 4: Hoare triple {21636#true} call #t~ret4 := main(); {21636#true} is VALID [2022-04-28 03:05:18,026 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21636#true} {21636#true} #34#return; {21636#true} is VALID [2022-04-28 03:05:18,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {21636#true} assume true; {21636#true} is VALID [2022-04-28 03:05:18,027 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-28 03:05:18,027 INFO L272 TraceCheckUtils]: 0: Hoare triple {21636#true} call ULTIMATE.init(); {21636#true} is VALID [2022-04-28 03:05:18,027 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:05:18,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086233376] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:05:18,027 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:05:18,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 46] total 92 [2022-04-28 03:05:18,027 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:05:18,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1333894139] [2022-04-28 03:05:18,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1333894139] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:05:18,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:05:18,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-04-28 03:05:18,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464172146] [2022-04-28 03:05:18,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:05:18,028 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2022-04-28 03:05:18,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:05:18,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:18,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:05:18,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-04-28 03:05:18,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:05:18,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-04-28 03:05:18,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2205, Invalid=6167, Unknown=0, NotChecked=0, Total=8372 [2022-04-28 03:05:18,058 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:21,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:21,894 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2022-04-28 03:05:21,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-28 03:05:21,894 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2022-04-28 03:05:21,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:05:21,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:21,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2022-04-28 03:05:21,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:21,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2022-04-28 03:05:21,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 61 transitions. [2022-04-28 03:05:21,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:05:21,934 INFO L225 Difference]: With dead ends: 61 [2022-04-28 03:05:21,934 INFO L226 Difference]: Without dead ends: 56 [2022-04-28 03:05:21,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1037 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=4403, Invalid=13957, Unknown=0, NotChecked=0, Total=18360 [2022-04-28 03:05:21,936 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 1959 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:05:21,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 78 Invalid, 2048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1959 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-28 03:05:21,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-28 03:05:21,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-28 03:05:21,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:05:21,996 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:21,996 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:21,996 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:21,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:21,997 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-28 03:05:21,997 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-04-28 03:05:21,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:05:21,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:05:21,998 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 56 states. [2022-04-28 03:05:21,998 INFO L87 Difference]: Start difference. First operand has 56 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 56 states. [2022-04-28 03:05:21,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:21,999 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-28 03:05:21,999 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-04-28 03:05:21,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:05:21,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:05:21,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:05:21,999 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:05:21,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:22,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2022-04-28 03:05:22,000 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2022-04-28 03:05:22,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:05:22,000 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2022-04-28 03:05:22,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 46 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:22,000 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 56 transitions. [2022-04-28 03:05:22,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:05:22,050 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-04-28 03:05:22,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-28 03:05:22,051 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:05:22,051 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:05:22,056 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-28 03:05:22,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Forceful destruction successful, exit code 0 [2022-04-28 03:05:22,451 WARN L477 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-28 03:05:22,451 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:05:22,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:05:22,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1829159772, now seen corresponding path program 87 times [2022-04-28 03:05:22,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:05:22,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1137839594] [2022-04-28 03:05:22,571 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-28 03:05:22,572 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:05:22,574 INFO L85 PathProgramCache]: Analyzing trace with hash 674222007, now seen corresponding path program 1 times [2022-04-28 03:05:22,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:05:22,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356311136] [2022-04-28 03:05:22,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:05:22,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:05:22,579 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-28 03:05:22,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:05:22,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [500048747] [2022-04-28 03:05:22,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:05:22,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:05:22,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:05:22,584 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-28 03:05:22,585 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-28 03:05:22,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:05:22,620 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:05:22,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:05:22,628 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:05:22,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1829159772, now seen corresponding path program 88 times [2022-04-28 03:05:22,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:05:22,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253416237] [2022-04-28 03:05:22,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:05:22,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:05:22,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:23,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:05:23,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:23,733 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-28 03:05:23,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {22488#true} assume true; {22488#true} is VALID [2022-04-28 03:05:23,733 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22488#true} {22488#true} #34#return; {22488#true} is VALID [2022-04-28 03:05:23,734 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-28 03:05:23,734 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-28 03:05:23,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {22488#true} assume true; {22488#true} is VALID [2022-04-28 03:05:23,734 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22488#true} {22488#true} #34#return; {22488#true} is VALID [2022-04-28 03:05:23,734 INFO L272 TraceCheckUtils]: 4: Hoare triple {22488#true} call #t~ret4 := main(); {22488#true} is VALID [2022-04-28 03:05:23,734 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-28 03:05:23,735 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-28 03:05:23,735 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-28 03:05:23,736 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-28 03:05:23,736 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-28 03:05:23,737 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-28 03:05:23,737 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-28 03:05:23,738 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-28 03:05:23,738 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-28 03:05:23,739 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-28 03:05:23,739 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-28 03:05:23,740 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-28 03:05:23,740 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-28 03:05:23,741 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-28 03:05:23,741 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-28 03:05:23,742 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-28 03:05:23,742 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-28 03:05:23,743 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-28 03:05:23,743 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-28 03:05:23,744 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-28 03:05:23,744 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-28 03:05:23,745 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-28 03:05:23,745 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-28 03:05:23,746 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-28 03:05:23,746 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-28 03:05:23,747 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-28 03:05:23,747 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-28 03:05:23,748 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-28 03:05:23,748 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-28 03:05:23,749 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-28 03:05:23,749 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-28 03:05:23,750 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-28 03:05:23,750 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-28 03:05:23,750 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-28 03:05:23,751 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-28 03:05:23,751 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-28 03:05:23,752 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-28 03:05:23,752 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-28 03:05:23,753 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-28 03:05:23,753 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-28 03:05:23,754 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-28 03:05:23,754 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-28 03:05:23,755 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-28 03:05:23,755 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-28 03:05:23,756 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-28 03:05:23,756 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-28 03:05:23,756 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-28 03:05:23,756 INFO L290 TraceCheckUtils]: 52: Hoare triple {22489#false} ~cond := #in~cond; {22489#false} is VALID [2022-04-28 03:05:23,757 INFO L290 TraceCheckUtils]: 53: Hoare triple {22489#false} assume 0 == ~cond; {22489#false} is VALID [2022-04-28 03:05:23,757 INFO L290 TraceCheckUtils]: 54: Hoare triple {22489#false} assume !false; {22489#false} is VALID [2022-04-28 03:05:23,757 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:05:23,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:05:23,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253416237] [2022-04-28 03:05:23,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253416237] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:05:23,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352116518] [2022-04-28 03:05:23,757 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:05:23,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:05:23,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:05:23,758 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-28 03:05:23,759 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-28 03:05:23,861 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:05:23,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:05:23,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 91 conjunts are in the unsatisfiable core [2022-04-28 03:05:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:23,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:05:24,403 INFO L272 TraceCheckUtils]: 0: Hoare triple {22488#true} call ULTIMATE.init(); {22488#true} is VALID [2022-04-28 03:05:24,403 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-28 03:05:24,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {22488#true} assume true; {22488#true} is VALID [2022-04-28 03:05:24,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22488#true} {22488#true} #34#return; {22488#true} is VALID [2022-04-28 03:05:24,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {22488#true} call #t~ret4 := main(); {22488#true} is VALID [2022-04-28 03:05:24,403 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-28 03:05:24,404 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-28 03:05:24,404 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-28 03:05:24,405 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-28 03:05:24,405 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-28 03:05:24,406 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-28 03:05:24,406 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-28 03:05:24,407 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-28 03:05:24,407 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-28 03:05:24,408 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-28 03:05:24,408 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-28 03:05:24,409 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-28 03:05:24,409 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-28 03:05:24,410 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-28 03:05:24,410 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-28 03:05:24,411 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-28 03:05:24,411 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-28 03:05:24,412 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-28 03:05:24,412 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-28 03:05:24,413 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-28 03:05:24,413 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-28 03:05:24,414 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-28 03:05:24,414 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-28 03:05:24,415 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-28 03:05:24,415 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-28 03:05:24,416 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-28 03:05:24,416 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-28 03:05:24,417 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-28 03:05:24,417 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-28 03:05:24,418 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-28 03:05:24,418 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-28 03:05:24,419 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-28 03:05:24,419 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-28 03:05:24,419 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-28 03:05:24,420 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-28 03:05:24,420 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-28 03:05:24,421 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-28 03:05:24,421 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-28 03:05:24,422 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-28 03:05:24,422 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-28 03:05:24,423 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-28 03:05:24,423 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-28 03:05:24,424 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-28 03:05:24,424 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-28 03:05:24,425 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-28 03:05:24,425 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-28 03:05:24,425 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-28 03:05:24,425 INFO L290 TraceCheckUtils]: 52: Hoare triple {22489#false} ~cond := #in~cond; {22489#false} is VALID [2022-04-28 03:05:24,426 INFO L290 TraceCheckUtils]: 53: Hoare triple {22489#false} assume 0 == ~cond; {22489#false} is VALID [2022-04-28 03:05:24,426 INFO L290 TraceCheckUtils]: 54: Hoare triple {22489#false} assume !false; {22489#false} is VALID [2022-04-28 03:05:24,426 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:05:24,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:05:27,567 INFO L290 TraceCheckUtils]: 54: Hoare triple {22489#false} assume !false; {22489#false} is VALID [2022-04-28 03:05:27,568 INFO L290 TraceCheckUtils]: 53: Hoare triple {22489#false} assume 0 == ~cond; {22489#false} is VALID [2022-04-28 03:05:27,568 INFO L290 TraceCheckUtils]: 52: Hoare triple {22489#false} ~cond := #in~cond; {22489#false} is VALID [2022-04-28 03:05:27,568 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-28 03:05:27,568 INFO L290 TraceCheckUtils]: 50: Hoare triple {22717#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {22489#false} is VALID [2022-04-28 03:05:27,569 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-28 03:05:27,570 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-28 03:05:27,571 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-28 03:05:27,572 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-28 03:05:27,572 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-28 03:05:27,573 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-28 03:05:27,573 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-28 03:05:27,574 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-28 03:05:27,575 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-28 03:05:27,575 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-28 03:05:27,576 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-28 03:05:27,577 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-28 03:05:27,577 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-28 03:05:27,578 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-28 03:05:27,579 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-28 03:05:27,579 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-28 03:05:27,580 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-28 03:05:27,581 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-28 03:05:27,582 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-28 03:05:27,582 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-28 03:05:27,583 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-28 03:05:27,584 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-28 03:05:27,584 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-28 03:05:27,585 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-28 03:05:27,585 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-28 03:05:27,586 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-28 03:05:27,587 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-28 03:05:27,587 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-28 03:05:27,588 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-28 03:05:27,588 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-28 03:05:27,589 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-28 03:05:27,590 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-28 03:05:27,590 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-28 03:05:27,591 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-28 03:05:27,592 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-28 03:05:27,592 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-28 03:05:27,593 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-28 03:05:27,593 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-28 03:05:27,594 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-28 03:05:27,595 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-28 03:05:27,595 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-28 03:05:27,596 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-28 03:05:27,597 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-28 03:05:27,597 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-28 03:05:27,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {22488#true} ~x~0 := 268435441; {22893#(< 1 (mod (+ main_~x~0 4294967208) 4294967296))} is VALID [2022-04-28 03:05:27,598 INFO L272 TraceCheckUtils]: 4: Hoare triple {22488#true} call #t~ret4 := main(); {22488#true} is VALID [2022-04-28 03:05:27,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22488#true} {22488#true} #34#return; {22488#true} is VALID [2022-04-28 03:05:27,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {22488#true} assume true; {22488#true} is VALID [2022-04-28 03:05:27,598 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-28 03:05:27,598 INFO L272 TraceCheckUtils]: 0: Hoare triple {22488#true} call ULTIMATE.init(); {22488#true} is VALID [2022-04-28 03:05:27,598 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:05:27,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352116518] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:05:27,598 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:05:27,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 47, 47] total 94 [2022-04-28 03:05:27,599 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:05:27,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1137839594] [2022-04-28 03:05:27,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1137839594] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:05:27,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:05:27,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-04-28 03:05:27,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652229537] [2022-04-28 03:05:27,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:05:27,599 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2022-04-28 03:05:27,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:05:27,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 48 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:27,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:05:27,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-04-28 03:05:27,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:05:27,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-04-28 03:05:27,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2300, Invalid=6442, Unknown=0, NotChecked=0, Total=8742 [2022-04-28 03:05:27,630 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand has 48 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:31,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:31,576 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2022-04-28 03:05:31,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-28 03:05:31,576 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2022-04-28 03:05:31,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:05:31,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:31,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2022-04-28 03:05:31,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:31,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2022-04-28 03:05:31,578 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 62 transitions. [2022-04-28 03:05:31,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:05:31,618 INFO L225 Difference]: With dead ends: 62 [2022-04-28 03:05:31,618 INFO L226 Difference]: Without dead ends: 57 [2022-04-28 03:05:31,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1083 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=4593, Invalid=14589, Unknown=0, NotChecked=0, Total=19182 [2022-04-28 03:05:31,621 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 2032 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:05:31,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 63 Invalid, 2123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 2032 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-28 03:05:31,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-28 03:05:31,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-28 03:05:31,684 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:05:31,684 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:31,684 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:31,684 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:31,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:31,685 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2022-04-28 03:05:31,685 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2022-04-28 03:05:31,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:05:31,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:05:31,685 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-28 03:05:31,685 INFO L87 Difference]: Start difference. First operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-28 03:05:31,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:31,686 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2022-04-28 03:05:31,686 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2022-04-28 03:05:31,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:05:31,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:05:31,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:05:31,686 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:05:31,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:31,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2022-04-28 03:05:31,687 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2022-04-28 03:05:31,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:05:31,687 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2022-04-28 03:05:31,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.0625) internal successors, (51), 47 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:31,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 57 transitions. [2022-04-28 03:05:31,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:05:31,730 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2022-04-28 03:05:31,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-28 03:05:31,730 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:05:31,730 INFO L195 NwaCegarLoop]: trace histogram [45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:05:31,746 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-28 03:05:31,934 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-28 03:05:32,131 WARN L477 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-28 03:05:32,131 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:05:32,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:05:32,132 INFO L85 PathProgramCache]: Analyzing trace with hash 905839350, now seen corresponding path program 89 times [2022-04-28 03:05:32,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:05:32,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [633408754] [2022-04-28 03:05:32,244 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-28 03:05:32,245 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:05:32,247 INFO L85 PathProgramCache]: Analyzing trace with hash 733327351, now seen corresponding path program 1 times [2022-04-28 03:05:32,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:05:32,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827918501] [2022-04-28 03:05:32,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:05:32,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:05:32,251 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-28 03:05:32,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:05:32,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [732143521] [2022-04-28 03:05:32,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:05:32,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:05:32,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:05:32,255 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-28 03:05:32,259 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-28 03:05:32,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:05:32,294 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:05:32,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:05:32,302 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:05:32,302 INFO L85 PathProgramCache]: Analyzing trace with hash 905839350, now seen corresponding path program 90 times [2022-04-28 03:05:32,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:05:32,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938504399] [2022-04-28 03:05:32,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:05:32,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:05:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:33,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:05:33,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:33,435 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-28 03:05:33,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {23356#true} assume true; {23356#true} is VALID [2022-04-28 03:05:33,436 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23356#true} {23356#true} #34#return; {23356#true} is VALID [2022-04-28 03:05:33,436 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-28 03:05:33,436 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-28 03:05:33,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {23356#true} assume true; {23356#true} is VALID [2022-04-28 03:05:33,436 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23356#true} {23356#true} #34#return; {23356#true} is VALID [2022-04-28 03:05:33,436 INFO L272 TraceCheckUtils]: 4: Hoare triple {23356#true} call #t~ret4 := main(); {23356#true} is VALID [2022-04-28 03:05:33,437 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-28 03:05:33,437 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-28 03:05:33,438 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-28 03:05:33,438 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-28 03:05:33,439 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-28 03:05:33,439 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-28 03:05:33,440 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-28 03:05:33,440 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-28 03:05:33,441 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-28 03:05:33,441 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-28 03:05:33,442 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-28 03:05:33,442 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-28 03:05:33,442 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-28 03:05:33,443 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-28 03:05:33,443 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-28 03:05:33,444 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-28 03:05:33,444 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-28 03:05:33,445 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-28 03:05:33,445 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-28 03:05:33,446 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-28 03:05:33,446 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-28 03:05:33,447 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-28 03:05:33,447 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-28 03:05:33,448 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-28 03:05:33,448 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-28 03:05:33,449 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-28 03:05:33,449 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-28 03:05:33,450 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-28 03:05:33,450 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-28 03:05:33,451 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-28 03:05:33,451 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-28 03:05:33,452 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-28 03:05:33,452 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-28 03:05:33,453 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-28 03:05:33,453 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-28 03:05:33,454 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-28 03:05:33,454 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-28 03:05:33,455 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-28 03:05:33,455 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-28 03:05:33,456 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-28 03:05:33,456 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-28 03:05:33,456 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-28 03:05:33,457 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-28 03:05:33,457 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-28 03:05:33,458 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-28 03:05:33,458 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-28 03:05:33,459 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-28 03:05:33,459 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-28 03:05:33,459 INFO L290 TraceCheckUtils]: 53: Hoare triple {23357#false} ~cond := #in~cond; {23357#false} is VALID [2022-04-28 03:05:33,459 INFO L290 TraceCheckUtils]: 54: Hoare triple {23357#false} assume 0 == ~cond; {23357#false} is VALID [2022-04-28 03:05:33,459 INFO L290 TraceCheckUtils]: 55: Hoare triple {23357#false} assume !false; {23357#false} is VALID [2022-04-28 03:05:33,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:05:33,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:05:33,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938504399] [2022-04-28 03:05:33,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938504399] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:05:33,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833529467] [2022-04-28 03:05:33,460 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:05:33,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:05:33,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:05:33,461 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-28 03:05:33,462 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-28 03:05:42,662 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2022-04-28 03:05:42,662 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:05:42,672 WARN L261 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 93 conjunts are in the unsatisfiable core [2022-04-28 03:05:42,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:42,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:05:43,265 INFO L272 TraceCheckUtils]: 0: Hoare triple {23356#true} call ULTIMATE.init(); {23356#true} is VALID [2022-04-28 03:05:43,265 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-28 03:05:43,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {23356#true} assume true; {23356#true} is VALID [2022-04-28 03:05:43,265 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23356#true} {23356#true} #34#return; {23356#true} is VALID [2022-04-28 03:05:43,265 INFO L272 TraceCheckUtils]: 4: Hoare triple {23356#true} call #t~ret4 := main(); {23356#true} is VALID [2022-04-28 03:05:43,266 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-28 03:05:43,266 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-28 03:05:43,267 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-28 03:05:43,267 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-28 03:05:43,268 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-28 03:05:43,268 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-28 03:05:43,269 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-28 03:05:43,269 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-28 03:05:43,270 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-28 03:05:43,270 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-28 03:05:43,271 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-28 03:05:43,271 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-28 03:05:43,272 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-28 03:05:43,272 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-28 03:05:43,273 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-28 03:05:43,273 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-28 03:05:43,274 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-28 03:05:43,274 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-28 03:05:43,275 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-28 03:05:43,275 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-28 03:05:43,276 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-28 03:05:43,276 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-28 03:05:43,277 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-28 03:05:43,277 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-28 03:05:43,278 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-28 03:05:43,278 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-28 03:05:43,279 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-28 03:05:43,279 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-28 03:05:43,280 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-28 03:05:43,280 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-28 03:05:43,281 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-28 03:05:43,281 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-28 03:05:43,282 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-28 03:05:43,282 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-28 03:05:43,283 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-28 03:05:43,283 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-28 03:05:43,284 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-28 03:05:43,284 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-28 03:05:43,284 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-28 03:05:43,285 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-28 03:05:43,285 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-28 03:05:43,286 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-28 03:05:43,286 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-28 03:05:43,287 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-28 03:05:43,287 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-28 03:05:43,288 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-28 03:05:43,288 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-28 03:05:43,289 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-28 03:05:43,289 INFO L290 TraceCheckUtils]: 53: Hoare triple {23357#false} ~cond := #in~cond; {23357#false} is VALID [2022-04-28 03:05:43,289 INFO L290 TraceCheckUtils]: 54: Hoare triple {23357#false} assume 0 == ~cond; {23357#false} is VALID [2022-04-28 03:05:43,289 INFO L290 TraceCheckUtils]: 55: Hoare triple {23357#false} assume !false; {23357#false} is VALID [2022-04-28 03:05:43,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:05:43,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:05:46,613 INFO L290 TraceCheckUtils]: 55: Hoare triple {23357#false} assume !false; {23357#false} is VALID [2022-04-28 03:05:46,613 INFO L290 TraceCheckUtils]: 54: Hoare triple {23357#false} assume 0 == ~cond; {23357#false} is VALID [2022-04-28 03:05:46,613 INFO L290 TraceCheckUtils]: 53: Hoare triple {23357#false} ~cond := #in~cond; {23357#false} is VALID [2022-04-28 03:05:46,614 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-28 03:05:46,614 INFO L290 TraceCheckUtils]: 51: Hoare triple {23589#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {23357#false} is VALID [2022-04-28 03:05:46,615 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-28 03:05:46,615 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-28 03:05:46,616 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-28 03:05:46,617 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-28 03:05:46,618 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-28 03:05:46,619 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-28 03:05:46,620 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-28 03:05:46,620 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-28 03:05:46,621 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-28 03:05:46,621 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-28 03:05:46,622 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-28 03:05:46,624 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-28 03:05:46,624 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-28 03:05:46,625 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-28 03:05:46,626 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-28 03:05:46,626 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-28 03:05:46,627 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-28 03:05:46,628 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-28 03:05:46,629 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-28 03:05:46,630 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-28 03:05:46,631 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-28 03:05:46,631 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-28 03:05:46,632 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-28 03:05:46,632 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-28 03:05:46,633 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-28 03:05:46,634 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-28 03:05:46,634 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-28 03:05:46,635 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-28 03:05:46,636 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-28 03:05:46,637 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-28 03:05:46,638 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-28 03:05:46,638 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-28 03:05:46,639 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-28 03:05:46,640 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-28 03:05:46,640 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-28 03:05:46,641 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-28 03:05:46,642 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-28 03:05:46,643 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-28 03:05:46,643 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-28 03:05:46,644 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-28 03:05:46,644 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-28 03:05:46,645 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-28 03:05:46,646 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-28 03:05:46,646 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-28 03:05:46,647 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-28 03:05:46,647 INFO L290 TraceCheckUtils]: 5: Hoare triple {23356#true} ~x~0 := 268435441; {23769#(< 1 (mod (+ 4294967206 main_~x~0) 4294967296))} is VALID [2022-04-28 03:05:46,648 INFO L272 TraceCheckUtils]: 4: Hoare triple {23356#true} call #t~ret4 := main(); {23356#true} is VALID [2022-04-28 03:05:46,648 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23356#true} {23356#true} #34#return; {23356#true} is VALID [2022-04-28 03:05:46,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {23356#true} assume true; {23356#true} is VALID [2022-04-28 03:05:46,648 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-28 03:05:46,648 INFO L272 TraceCheckUtils]: 0: Hoare triple {23356#true} call ULTIMATE.init(); {23356#true} is VALID [2022-04-28 03:05:46,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:05:46,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833529467] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:05:46,648 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:05:46,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48, 48] total 96 [2022-04-28 03:05:46,649 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:05:46,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [633408754] [2022-04-28 03:05:46,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [633408754] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:05:46,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:05:46,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2022-04-28 03:05:46,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135045058] [2022-04-28 03:05:46,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:05:46,649 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 48 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-04-28 03:05:46,649 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:05:46,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 49 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 48 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:46,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:05:46,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-04-28 03:05:46,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:05:46,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-04-28 03:05:46,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2397, Invalid=6723, Unknown=0, NotChecked=0, Total=9120 [2022-04-28 03:05:46,687 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand has 49 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 48 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:50,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:50,980 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2022-04-28 03:05:50,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-28 03:05:50,980 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 48 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-04-28 03:05:50,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:05:50,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 48 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:50,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2022-04-28 03:05:50,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 48 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:50,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2022-04-28 03:05:50,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 63 transitions. [2022-04-28 03:05:51,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:05:51,033 INFO L225 Difference]: With dead ends: 63 [2022-04-28 03:05:51,033 INFO L226 Difference]: Without dead ends: 58 [2022-04-28 03:05:51,034 INFO L412 NwaCegarLoop]: 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-28 03:05:51,035 INFO L413 NwaCegarLoop]: 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-28 03:05:51,035 INFO L414 NwaCegarLoop]: 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-28 03:05:51,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-28 03:05:51,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-04-28 03:05:51,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:05:51,100 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:51,100 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:51,100 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:51,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:51,100 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-28 03:05:51,100 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-28 03:05:51,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:05:51,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:05:51,101 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-28 03:05:51,101 INFO L87 Difference]: Start difference. First operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-28 03:05:51,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:51,101 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-28 03:05:51,101 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-28 03:05:51,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:05:51,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:05:51,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:05:51,102 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:05:51,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.0188679245283019) internal successors, (54), 53 states have internal predecessors, (54), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:51,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2022-04-28 03:05:51,102 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2022-04-28 03:05:51,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:05:51,103 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2022-04-28 03:05:51,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 48 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:51,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 58 transitions. [2022-04-28 03:05:51,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:05:51,151 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-28 03:05:51,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-28 03:05:51,151 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:05:51,151 INFO L195 NwaCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:05:51,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Forceful destruction successful, exit code 0 [2022-04-28 03:05:51,356 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-28 03:05:51,553 WARN L477 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-28 03:05:51,553 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:05:51,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:05:51,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1947289956, now seen corresponding path program 91 times [2022-04-28 03:05:51,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:05:51,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [461054808] [2022-04-28 03:05:51,673 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-28 03:05:51,675 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:05:51,677 INFO L85 PathProgramCache]: Analyzing trace with hash 792432695, now seen corresponding path program 1 times [2022-04-28 03:05:51,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:05:51,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383304269] [2022-04-28 03:05:51,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:05:51,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:05:51,681 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-28 03:05:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:05:51,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [902565820] [2022-04-28 03:05:51,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:05:51,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:05:51,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:05:51,685 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-28 03:05:51,685 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-28 03:05:51,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:05:51,723 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:05:51,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:05:51,732 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:05:51,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1947289956, now seen corresponding path program 92 times [2022-04-28 03:05:51,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:05:51,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634303346] [2022-04-28 03:05:51,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:05:51,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:05:51,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:52,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:05:52,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:52,961 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-28 03:05:52,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {24240#true} assume true; {24240#true} is VALID [2022-04-28 03:05:52,961 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24240#true} {24240#true} #34#return; {24240#true} is VALID [2022-04-28 03:05:52,962 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-28 03:05:52,962 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-28 03:05:52,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {24240#true} assume true; {24240#true} is VALID [2022-04-28 03:05:52,962 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24240#true} {24240#true} #34#return; {24240#true} is VALID [2022-04-28 03:05:52,962 INFO L272 TraceCheckUtils]: 4: Hoare triple {24240#true} call #t~ret4 := main(); {24240#true} is VALID [2022-04-28 03:05:52,962 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-28 03:05:52,963 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-28 03:05:52,964 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-28 03:05:52,964 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-28 03:05:52,965 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-28 03:05:52,965 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-28 03:05:52,966 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-28 03:05:52,966 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-28 03:05:52,966 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-28 03:05:52,967 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-28 03:05:52,967 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-28 03:05:52,968 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-28 03:05:52,968 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-28 03:05:52,969 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-28 03:05:52,969 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-28 03:05:52,970 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-28 03:05:52,970 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-28 03:05:52,971 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-28 03:05:52,971 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-28 03:05:52,972 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-28 03:05:52,972 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-28 03:05:52,973 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-28 03:05:52,973 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-28 03:05:52,974 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-28 03:05:52,974 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-28 03:05:52,975 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-28 03:05:52,975 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-28 03:05:52,976 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-28 03:05:52,976 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-28 03:05:52,977 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-28 03:05:52,977 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-28 03:05:52,978 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-28 03:05:52,978 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-28 03:05:52,979 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-28 03:05:52,979 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-28 03:05:52,980 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-28 03:05:52,980 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-28 03:05:52,981 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-28 03:05:52,981 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-28 03:05:52,982 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-28 03:05:52,982 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-28 03:05:52,983 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-28 03:05:52,983 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-28 03:05:52,984 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-28 03:05:52,984 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-28 03:05:52,985 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-28 03:05:52,985 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-28 03:05:52,986 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-28 03:05:52,986 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-28 03:05:52,986 INFO L290 TraceCheckUtils]: 54: Hoare triple {24241#false} ~cond := #in~cond; {24241#false} is VALID [2022-04-28 03:05:52,986 INFO L290 TraceCheckUtils]: 55: Hoare triple {24241#false} assume 0 == ~cond; {24241#false} is VALID [2022-04-28 03:05:52,986 INFO L290 TraceCheckUtils]: 56: Hoare triple {24241#false} assume !false; {24241#false} is VALID [2022-04-28 03:05:52,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:05:52,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:05:52,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634303346] [2022-04-28 03:05:52,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634303346] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:05:52,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067428033] [2022-04-28 03:05:52,987 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:05:52,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:05:52,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:05:52,988 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-28 03:05:52,988 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-28 03:05:53,106 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:05:53,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:05:53,107 WARN L261 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 95 conjunts are in the unsatisfiable core [2022-04-28 03:05:53,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:53,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:05:53,693 INFO L272 TraceCheckUtils]: 0: Hoare triple {24240#true} call ULTIMATE.init(); {24240#true} is VALID [2022-04-28 03:05:53,693 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-28 03:05:53,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {24240#true} assume true; {24240#true} is VALID [2022-04-28 03:05:53,693 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24240#true} {24240#true} #34#return; {24240#true} is VALID [2022-04-28 03:05:53,693 INFO L272 TraceCheckUtils]: 4: Hoare triple {24240#true} call #t~ret4 := main(); {24240#true} is VALID [2022-04-28 03:05:53,693 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-28 03:05:53,694 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-28 03:05:53,694 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-28 03:05:53,695 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-28 03:05:53,695 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-28 03:05:53,696 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-28 03:05:53,696 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-28 03:05:53,697 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-28 03:05:53,697 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-28 03:05:53,698 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-28 03:05:53,698 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-28 03:05:53,699 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-28 03:05:53,699 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-28 03:05:53,700 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-28 03:05:53,700 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-28 03:05:53,701 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-28 03:05:53,701 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-28 03:05:53,702 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-28 03:05:53,702 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-28 03:05:53,703 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-28 03:05:53,703 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-28 03:05:53,704 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-28 03:05:53,704 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-28 03:05:53,705 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-28 03:05:53,705 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-28 03:05:53,706 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-28 03:05:53,706 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-28 03:05:53,707 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-28 03:05:53,707 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-28 03:05:53,708 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-28 03:05:53,708 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-28 03:05:53,709 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-28 03:05:53,709 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-28 03:05:53,710 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-28 03:05:53,710 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-28 03:05:53,711 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-28 03:05:53,711 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-28 03:05:53,712 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-28 03:05:53,712 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-28 03:05:53,713 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-28 03:05:53,713 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-28 03:05:53,714 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-28 03:05:53,714 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-28 03:05:53,714 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-28 03:05:53,715 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-28 03:05:53,715 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-28 03:05:53,716 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-28 03:05:53,716 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-28 03:05:53,717 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-28 03:05:53,717 INFO L290 TraceCheckUtils]: 54: Hoare triple {24241#false} ~cond := #in~cond; {24241#false} is VALID [2022-04-28 03:05:53,717 INFO L290 TraceCheckUtils]: 55: Hoare triple {24241#false} assume 0 == ~cond; {24241#false} is VALID [2022-04-28 03:05:53,717 INFO L290 TraceCheckUtils]: 56: Hoare triple {24241#false} assume !false; {24241#false} is VALID [2022-04-28 03:05:53,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:05:53,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:05:57,202 INFO L290 TraceCheckUtils]: 56: Hoare triple {24241#false} assume !false; {24241#false} is VALID [2022-04-28 03:05:57,202 INFO L290 TraceCheckUtils]: 55: Hoare triple {24241#false} assume 0 == ~cond; {24241#false} is VALID [2022-04-28 03:05:57,202 INFO L290 TraceCheckUtils]: 54: Hoare triple {24241#false} ~cond := #in~cond; {24241#false} is VALID [2022-04-28 03:05:57,203 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-28 03:05:57,203 INFO L290 TraceCheckUtils]: 52: Hoare triple {24477#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {24241#false} is VALID [2022-04-28 03:05:57,204 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-28 03:05:57,205 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-28 03:05:57,205 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-28 03:05:57,206 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-28 03:05:57,207 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-28 03:05:57,207 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-28 03:05:57,208 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-28 03:05:57,208 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-28 03:05:57,209 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-28 03:05:57,210 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-28 03:05:57,210 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-28 03:05:57,211 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-28 03:05:57,211 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-28 03:05:57,212 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-28 03:05:57,213 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-28 03:05:57,213 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-28 03:05:57,214 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-28 03:05:57,215 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-28 03:05:57,216 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-28 03:05:57,216 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-28 03:05:57,217 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-28 03:05:57,217 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-28 03:05:57,218 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-28 03:05:57,219 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-28 03:05:57,220 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-28 03:05:57,221 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-28 03:05:57,221 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-28 03:05:57,222 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-28 03:05:57,223 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-28 03:05:57,224 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-28 03:05:57,224 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-28 03:05:57,225 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-28 03:05:57,226 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-28 03:05:57,229 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-28 03:05:57,230 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-28 03:05:57,231 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-28 03:05:57,231 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-28 03:05:57,233 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-28 03:05:57,233 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-28 03:05:57,234 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-28 03:05:57,234 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-28 03:05:57,235 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-28 03:05:57,236 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-28 03:05:57,242 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-28 03:05:57,243 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-28 03:05:57,243 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-28 03:05:57,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {24240#true} ~x~0 := 268435441; {24661#(< 1 (mod (+ main_~x~0 4294967204) 4294967296))} is VALID [2022-04-28 03:05:57,244 INFO L272 TraceCheckUtils]: 4: Hoare triple {24240#true} call #t~ret4 := main(); {24240#true} is VALID [2022-04-28 03:05:57,244 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24240#true} {24240#true} #34#return; {24240#true} is VALID [2022-04-28 03:05:57,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {24240#true} assume true; {24240#true} is VALID [2022-04-28 03:05:57,244 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-28 03:05:57,244 INFO L272 TraceCheckUtils]: 0: Hoare triple {24240#true} call ULTIMATE.init(); {24240#true} is VALID [2022-04-28 03:05:57,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:05:57,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067428033] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:05:57,244 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:05:57,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49, 49] total 98 [2022-04-28 03:05:57,245 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:05:57,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [461054808] [2022-04-28 03:05:57,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [461054808] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:05:57,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:05:57,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2022-04-28 03:05:57,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120820745] [2022-04-28 03:05:57,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:05:57,245 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2022-04-28 03:05:57,245 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:05:57,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:05:57,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:05:57,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-28 03:05:57,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:05:57,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-28 03:05:57,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2496, Invalid=7010, Unknown=0, NotChecked=0, Total=9506 [2022-04-28 03:05:57,277 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand has 50 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:01,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:06:01,821 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2022-04-28 03:06:01,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-04-28 03:06:01,821 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2022-04-28 03:06:01,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:06:01,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:01,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-04-28 03:06:01,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:01,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-04-28 03:06:01,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 64 transitions. [2022-04-28 03:06:01,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:06:01,868 INFO L225 Difference]: With dead ends: 64 [2022-04-28 03:06:01,868 INFO L226 Difference]: Without dead ends: 59 [2022-04-28 03:06:01,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1178 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=4985, Invalid=15895, Unknown=0, NotChecked=0, Total=20880 [2022-04-28 03:06:01,869 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 2354 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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.8s IncrementalHoareTripleChecker+Time [2022-04-28 03:06:01,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 203 Invalid, 2449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 2354 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-28 03:06:01,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-28 03:06:01,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-04-28 03:06:01,935 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:06:01,935 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:01,935 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:01,935 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:01,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:06:01,936 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2022-04-28 03:06:01,936 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2022-04-28 03:06:01,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:06:01,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:06:01,936 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-28 03:06:01,936 INFO L87 Difference]: Start difference. First operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-28 03:06:01,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:06:01,937 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2022-04-28 03:06:01,937 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2022-04-28 03:06:01,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:06:01,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:06:01,937 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:06:01,937 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:06:01,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:01,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2022-04-28 03:06:01,938 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2022-04-28 03:06:01,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:06:01,938 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2022-04-28 03:06:01,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:01,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 59 transitions. [2022-04-28 03:06:01,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:06:01,984 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2022-04-28 03:06:01,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-28 03:06:01,984 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:06:01,985 INFO L195 NwaCegarLoop]: trace histogram [47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:06:01,991 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-28 03:06:02,192 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-28 03:06:02,389 WARN L477 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-28 03:06:02,389 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:06:02,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:06:02,389 INFO L85 PathProgramCache]: Analyzing trace with hash -199985226, now seen corresponding path program 93 times [2022-04-28 03:06:02,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:06:02,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1867152724] [2022-04-28 03:06:02,496 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-28 03:06:02,498 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:06:02,500 INFO L85 PathProgramCache]: Analyzing trace with hash 851538039, now seen corresponding path program 1 times [2022-04-28 03:06:02,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:06:02,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569560285] [2022-04-28 03:06:02,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:06:02,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:06:02,504 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-28 03:06:02,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:06:02,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1676977642] [2022-04-28 03:06:02,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:06:02,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:06:02,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:06:02,508 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-28 03:06:02,512 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-28 03:06:02,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:06:02,547 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:06:02,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:06:02,555 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:06:02,555 INFO L85 PathProgramCache]: Analyzing trace with hash -199985226, now seen corresponding path program 94 times [2022-04-28 03:06:02,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:06:02,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87077690] [2022-04-28 03:06:02,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:06:02,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:06:02,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:06:03,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:06:03,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:06:03,766 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-28 03:06:03,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {25140#true} assume true; {25140#true} is VALID [2022-04-28 03:06:03,766 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25140#true} {25140#true} #34#return; {25140#true} is VALID [2022-04-28 03:06:03,767 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-28 03:06:03,767 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-28 03:06:03,767 INFO L290 TraceCheckUtils]: 2: Hoare triple {25140#true} assume true; {25140#true} is VALID [2022-04-28 03:06:03,767 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25140#true} {25140#true} #34#return; {25140#true} is VALID [2022-04-28 03:06:03,767 INFO L272 TraceCheckUtils]: 4: Hoare triple {25140#true} call #t~ret4 := main(); {25140#true} is VALID [2022-04-28 03:06:03,767 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-28 03:06:03,768 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-28 03:06:03,768 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-28 03:06:03,769 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-28 03:06:03,769 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-28 03:06:03,770 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-28 03:06:03,770 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-28 03:06:03,771 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-28 03:06:03,771 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-28 03:06:03,772 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-28 03:06:03,772 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-28 03:06:03,773 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-28 03:06:03,773 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-28 03:06:03,774 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-28 03:06:03,774 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-28 03:06:03,775 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-28 03:06:03,775 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-28 03:06:03,776 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-28 03:06:03,776 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-28 03:06:03,777 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-28 03:06:03,777 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-28 03:06:03,778 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-28 03:06:03,778 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-28 03:06:03,778 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-28 03:06:03,779 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-28 03:06:03,779 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-28 03:06:03,780 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-28 03:06:03,780 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-28 03:06:03,781 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-28 03:06:03,781 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-28 03:06:03,782 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-28 03:06:03,782 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-28 03:06:03,783 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-28 03:06:03,783 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-28 03:06:03,784 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-28 03:06:03,784 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-28 03:06:03,785 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-28 03:06:03,785 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-28 03:06:03,786 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-28 03:06:03,786 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-28 03:06:03,787 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-28 03:06:03,787 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-28 03:06:03,788 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-28 03:06:03,788 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-28 03:06:03,789 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-28 03:06:03,789 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-28 03:06:03,790 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-28 03:06:03,790 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-28 03:06:03,791 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-28 03:06:03,791 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-28 03:06:03,791 INFO L290 TraceCheckUtils]: 55: Hoare triple {25141#false} ~cond := #in~cond; {25141#false} is VALID [2022-04-28 03:06:03,791 INFO L290 TraceCheckUtils]: 56: Hoare triple {25141#false} assume 0 == ~cond; {25141#false} is VALID [2022-04-28 03:06:03,791 INFO L290 TraceCheckUtils]: 57: Hoare triple {25141#false} assume !false; {25141#false} is VALID [2022-04-28 03:06:03,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:06:03,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:06:03,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87077690] [2022-04-28 03:06:03,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87077690] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:06:03,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604067994] [2022-04-28 03:06:03,791 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:06:03,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:06:03,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:06:03,792 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-28 03:06:03,793 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-28 03:06:03,912 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:06:03,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:06:03,914 WARN L261 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 97 conjunts are in the unsatisfiable core [2022-04-28 03:06:03,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:06:03,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:06:04,494 INFO L272 TraceCheckUtils]: 0: Hoare triple {25140#true} call ULTIMATE.init(); {25140#true} is VALID [2022-04-28 03:06:04,494 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-28 03:06:04,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {25140#true} assume true; {25140#true} is VALID [2022-04-28 03:06:04,495 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25140#true} {25140#true} #34#return; {25140#true} is VALID [2022-04-28 03:06:04,495 INFO L272 TraceCheckUtils]: 4: Hoare triple {25140#true} call #t~ret4 := main(); {25140#true} is VALID [2022-04-28 03:06:04,495 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-28 03:06:04,495 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-28 03:06:04,496 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-28 03:06:04,496 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-28 03:06:04,497 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-28 03:06:04,497 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-28 03:06:04,498 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-28 03:06:04,498 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-28 03:06:04,499 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-28 03:06:04,499 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-28 03:06:04,500 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-28 03:06:04,500 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-28 03:06:04,501 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-28 03:06:04,501 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-28 03:06:04,502 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-28 03:06:04,502 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-28 03:06:04,503 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-28 03:06:04,503 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-28 03:06:04,504 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-28 03:06:04,504 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-28 03:06:04,505 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-28 03:06:04,505 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-28 03:06:04,506 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-28 03:06:04,506 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-28 03:06:04,507 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-28 03:06:04,507 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-28 03:06:04,508 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-28 03:06:04,508 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-28 03:06:04,509 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-28 03:06:04,509 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-28 03:06:04,510 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-28 03:06:04,510 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-28 03:06:04,511 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-28 03:06:04,511 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-28 03:06:04,512 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-28 03:06:04,512 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-28 03:06:04,513 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-28 03:06:04,513 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-28 03:06:04,513 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-28 03:06:04,514 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-28 03:06:04,514 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-28 03:06:04,515 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-28 03:06:04,515 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-28 03:06:04,516 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-28 03:06:04,516 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-28 03:06:04,517 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-28 03:06:04,517 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-28 03:06:04,518 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-28 03:06:04,518 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-28 03:06:04,518 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-28 03:06:04,519 INFO L290 TraceCheckUtils]: 55: Hoare triple {25141#false} ~cond := #in~cond; {25141#false} is VALID [2022-04-28 03:06:04,519 INFO L290 TraceCheckUtils]: 56: Hoare triple {25141#false} assume 0 == ~cond; {25141#false} is VALID [2022-04-28 03:06:04,519 INFO L290 TraceCheckUtils]: 57: Hoare triple {25141#false} assume !false; {25141#false} is VALID [2022-04-28 03:06:04,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:06:04,519 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:06:08,079 INFO L290 TraceCheckUtils]: 57: Hoare triple {25141#false} assume !false; {25141#false} is VALID [2022-04-28 03:06:08,079 INFO L290 TraceCheckUtils]: 56: Hoare triple {25141#false} assume 0 == ~cond; {25141#false} is VALID [2022-04-28 03:06:08,079 INFO L290 TraceCheckUtils]: 55: Hoare triple {25141#false} ~cond := #in~cond; {25141#false} is VALID [2022-04-28 03:06:08,080 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-28 03:06:08,080 INFO L290 TraceCheckUtils]: 53: Hoare triple {25381#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {25141#false} is VALID [2022-04-28 03:06:08,081 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-28 03:06:08,081 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-28 03:06:08,082 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-28 03:06:08,082 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-28 03:06:08,083 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-28 03:06:08,084 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-28 03:06:08,084 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-28 03:06:08,085 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-28 03:06:08,086 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-28 03:06:08,086 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-28 03:06:08,087 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-28 03:06:08,088 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-28 03:06:08,089 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-28 03:06:08,092 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-28 03:06:08,093 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-28 03:06:08,094 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-28 03:06:08,094 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-28 03:06:08,095 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-28 03:06:08,096 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-28 03:06:08,096 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-28 03:06:08,097 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-28 03:06:08,097 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-28 03:06:08,098 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-28 03:06:08,099 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-28 03:06:08,099 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-28 03:06:08,100 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-28 03:06:08,100 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-28 03:06:08,101 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-28 03:06:08,102 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-28 03:06:08,102 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-28 03:06:08,103 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-28 03:06:08,103 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-28 03:06:08,104 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-28 03:06:08,105 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-28 03:06:08,105 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-28 03:06:08,106 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-28 03:06:08,107 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-28 03:06:08,107 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-28 03:06:08,108 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-28 03:06:08,113 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-28 03:06:08,113 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-28 03:06:08,114 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-28 03:06:08,115 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-28 03:06:08,116 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-28 03:06:08,116 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-28 03:06:08,117 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-28 03:06:08,117 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-28 03:06:08,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {25140#true} ~x~0 := 268435441; {25569#(< 1 (mod (+ 4294967202 main_~x~0) 4294967296))} is VALID [2022-04-28 03:06:08,118 INFO L272 TraceCheckUtils]: 4: Hoare triple {25140#true} call #t~ret4 := main(); {25140#true} is VALID [2022-04-28 03:06:08,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25140#true} {25140#true} #34#return; {25140#true} is VALID [2022-04-28 03:06:08,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {25140#true} assume true; {25140#true} is VALID [2022-04-28 03:06:08,118 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-28 03:06:08,118 INFO L272 TraceCheckUtils]: 0: Hoare triple {25140#true} call ULTIMATE.init(); {25140#true} is VALID [2022-04-28 03:06:08,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:06:08,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604067994] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:06:08,119 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:06:08,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 50, 50] total 100 [2022-04-28 03:06:08,119 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:06:08,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1867152724] [2022-04-28 03:06:08,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1867152724] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:06:08,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:06:08,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2022-04-28 03:06:08,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17531840] [2022-04-28 03:06:08,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:06:08,120 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 50 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2022-04-28 03:06:08,120 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:06:08,120 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 51 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 50 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:08,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:06:08,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-04-28 03:06:08,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:06:08,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-04-28 03:06:08,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2597, Invalid=7303, Unknown=0, NotChecked=0, Total=9900 [2022-04-28 03:06:08,152 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand has 51 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 50 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:12,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:06:12,562 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2022-04-28 03:06:12,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-04-28 03:06:12,562 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 50 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2022-04-28 03:06:12,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:06:12,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 50 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:12,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2022-04-28 03:06:12,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 50 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:12,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2022-04-28 03:06:12,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 65 transitions. [2022-04-28 03:06:12,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:06:12,622 INFO L225 Difference]: With dead ends: 65 [2022-04-28 03:06:12,622 INFO L226 Difference]: Without dead ends: 60 [2022-04-28 03:06:12,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1227 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=5187, Invalid=16569, Unknown=0, NotChecked=0, Total=21756 [2022-04-28 03:06:12,626 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 2268 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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.8s IncrementalHoareTripleChecker+Time [2022-04-28 03:06:12,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 23 Invalid, 2365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 2268 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-28 03:06:12,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-28 03:06:12,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-28 03:06:12,704 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:06:12,704 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 55 states have (on average 1.018181818181818) internal successors, (56), 55 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:12,704 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 55 states have (on average 1.018181818181818) internal successors, (56), 55 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:12,705 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 55 states have (on average 1.018181818181818) internal successors, (56), 55 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:12,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:06:12,706 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-04-28 03:06:12,706 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2022-04-28 03:06:12,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:06:12,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:06:12,707 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 55 states have (on average 1.018181818181818) internal successors, (56), 55 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 60 states. [2022-04-28 03:06:12,707 INFO L87 Difference]: Start difference. First operand has 60 states, 55 states have (on average 1.018181818181818) internal successors, (56), 55 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 60 states. [2022-04-28 03:06:12,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:06:12,709 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-04-28 03:06:12,709 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2022-04-28 03:06:12,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:06:12,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:06:12,709 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:06:12,709 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:06:12,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 55 states have (on average 1.018181818181818) internal successors, (56), 55 states have internal predecessors, (56), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:12,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2022-04-28 03:06:12,710 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2022-04-28 03:06:12,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:06:12,710 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2022-04-28 03:06:12,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.0588235294117647) internal successors, (54), 50 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:12,710 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 60 transitions. [2022-04-28 03:06:12,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:06:12,764 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2022-04-28 03:06:12,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 03:06:12,764 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:06:12,764 INFO L195 NwaCegarLoop]: trace histogram [48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:06:12,788 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-28 03:06:12,971 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-28 03:06:13,165 WARN L477 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-28 03:06:13,166 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:06:13,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:06:13,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1868113444, now seen corresponding path program 95 times [2022-04-28 03:06:13,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:06:13,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [265074720] [2022-04-28 03:06:13,315 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-28 03:06:13,317 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:06:13,320 INFO L85 PathProgramCache]: Analyzing trace with hash 910643383, now seen corresponding path program 1 times [2022-04-28 03:06:13,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:06:13,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357174303] [2022-04-28 03:06:13,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:06:13,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:06:13,325 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-28 03:06:13,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:06:13,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1499984423] [2022-04-28 03:06:13,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:06:13,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:06:13,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:06:13,336 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-28 03:06:13,337 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-28 03:06:13,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:06:13,385 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:06:13,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:06:13,395 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:06:13,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1868113444, now seen corresponding path program 96 times [2022-04-28 03:06:13,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:06:13,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106209064] [2022-04-28 03:06:13,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:06:13,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:06:13,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:06:14,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:06:14,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:06:14,709 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-28 03:06:14,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {26056#true} assume true; {26056#true} is VALID [2022-04-28 03:06:14,709 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26056#true} {26056#true} #34#return; {26056#true} is VALID [2022-04-28 03:06:14,710 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-28 03:06:14,710 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-28 03:06:14,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {26056#true} assume true; {26056#true} is VALID [2022-04-28 03:06:14,710 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26056#true} {26056#true} #34#return; {26056#true} is VALID [2022-04-28 03:06:14,710 INFO L272 TraceCheckUtils]: 4: Hoare triple {26056#true} call #t~ret4 := main(); {26056#true} is VALID [2022-04-28 03:06:14,710 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-28 03:06:14,711 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-28 03:06:14,711 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-28 03:06:14,713 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-28 03:06:14,713 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-28 03:06:14,714 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-28 03:06:14,715 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-28 03:06:14,715 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-28 03:06:14,716 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-28 03:06:14,717 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-28 03:06:14,717 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-28 03:06:14,718 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-28 03:06:14,718 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-28 03:06:14,719 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-28 03:06:14,719 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-28 03:06:14,720 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-28 03:06:14,732 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-28 03:06:14,732 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-28 03:06:14,733 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-28 03:06:14,734 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-28 03:06:14,734 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-28 03:06:14,735 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-28 03:06:14,735 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-28 03:06:14,736 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-28 03:06:14,737 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-28 03:06:14,737 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-28 03:06:14,738 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-28 03:06:14,739 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-28 03:06:14,739 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-28 03:06:14,740 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-28 03:06:14,740 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-28 03:06:14,741 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-28 03:06:14,742 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-28 03:06:14,742 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-28 03:06:14,743 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-28 03:06:14,743 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-28 03:06:14,744 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-28 03:06:14,745 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-28 03:06:14,745 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-28 03:06:14,746 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-28 03:06:14,746 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-28 03:06:14,747 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-28 03:06:14,748 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-28 03:06:14,748 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-28 03:06:14,749 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-28 03:06:14,750 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-28 03:06:14,750 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-28 03:06:14,751 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-28 03:06:14,751 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-28 03:06:14,752 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-28 03:06:14,752 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-28 03:06:14,752 INFO L290 TraceCheckUtils]: 56: Hoare triple {26057#false} ~cond := #in~cond; {26057#false} is VALID [2022-04-28 03:06:14,752 INFO L290 TraceCheckUtils]: 57: Hoare triple {26057#false} assume 0 == ~cond; {26057#false} is VALID [2022-04-28 03:06:14,752 INFO L290 TraceCheckUtils]: 58: Hoare triple {26057#false} assume !false; {26057#false} is VALID [2022-04-28 03:06:14,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:06:14,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:06:14,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106209064] [2022-04-28 03:06:14,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106209064] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:06:14,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818488645] [2022-04-28 03:06:14,753 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:06:14,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:06:14,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:06:14,756 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-28 03:06:14,757 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-28 03:06:21,470 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2022-04-28 03:06:21,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:06:21,476 WARN L261 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 102 conjunts are in the unsatisfiable core [2022-04-28 03:06:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:06:21,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:06:21,993 INFO L272 TraceCheckUtils]: 0: Hoare triple {26056#true} call ULTIMATE.init(); {26056#true} is VALID [2022-04-28 03:06:21,993 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-28 03:06:21,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {26056#true} assume true; {26056#true} is VALID [2022-04-28 03:06:21,993 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26056#true} {26056#true} #34#return; {26056#true} is VALID [2022-04-28 03:06:21,993 INFO L272 TraceCheckUtils]: 4: Hoare triple {26056#true} call #t~ret4 := main(); {26056#true} is VALID [2022-04-28 03:06:21,994 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-28 03:06:21,994 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-28 03:06:21,995 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-28 03:06:21,995 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-28 03:06:21,996 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-28 03:06:21,996 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-28 03:06:21,997 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-28 03:06:21,997 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-28 03:06:21,997 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-28 03:06:21,998 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-28 03:06:21,998 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-28 03:06:21,999 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-28 03:06:21,999 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-28 03:06:22,000 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-28 03:06:22,000 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-28 03:06:22,001 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-28 03:06:22,001 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-28 03:06:22,002 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-28 03:06:22,002 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-28 03:06:22,003 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-28 03:06:22,003 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-28 03:06:22,004 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-28 03:06:22,004 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-28 03:06:22,005 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-28 03:06:22,005 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-28 03:06:22,006 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-28 03:06:22,006 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-28 03:06:22,007 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-28 03:06:22,007 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-28 03:06:22,008 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-28 03:06:22,008 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-28 03:06:22,009 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-28 03:06:22,009 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-28 03:06:22,010 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-28 03:06:22,010 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-28 03:06:22,011 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-28 03:06:22,011 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-28 03:06:22,012 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-28 03:06:22,012 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-28 03:06:22,013 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-28 03:06:22,013 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-28 03:06:22,014 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-28 03:06:22,014 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-28 03:06:22,015 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-28 03:06:22,015 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-28 03:06:22,016 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-28 03:06:22,016 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-28 03:06:22,016 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-28 03:06:22,017 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-28 03:06:22,017 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-28 03:06:22,017 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-28 03:06:22,018 INFO L290 TraceCheckUtils]: 56: Hoare triple {26057#false} ~cond := #in~cond; {26057#false} is VALID [2022-04-28 03:06:22,018 INFO L290 TraceCheckUtils]: 57: Hoare triple {26057#false} assume 0 == ~cond; {26057#false} is VALID [2022-04-28 03:06:22,018 INFO L290 TraceCheckUtils]: 58: Hoare triple {26057#false} assume !false; {26057#false} is VALID [2022-04-28 03:06:22,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:06:22,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:06:26,822 INFO L290 TraceCheckUtils]: 58: Hoare triple {26057#false} assume !false; {26057#false} is VALID [2022-04-28 03:06:26,822 INFO L290 TraceCheckUtils]: 57: Hoare triple {26292#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {26057#false} is VALID [2022-04-28 03:06:26,822 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-28 03:06:26,823 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-28 03:06:26,823 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-28 03:06:26,824 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-28 03:06:26,826 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-28 03:06:26,827 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-28 03:06:26,827 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-28 03:06:26,828 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-28 03:06:26,830 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-28 03:06:26,831 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-28 03:06:26,832 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-28 03:06:26,832 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-28 03:06:26,833 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-28 03:06:26,834 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-28 03:06:26,835 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-28 03:06:26,837 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-28 03:06:26,838 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-28 03:06:26,839 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-28 03:06:26,840 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-28 03:06:26,844 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-28 03:06:26,845 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-28 03:06:26,846 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-28 03:06:26,847 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-28 03:06:26,847 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-28 03:06:26,849 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-28 03:06:26,850 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-28 03:06:26,851 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-28 03:06:26,851 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-28 03:06:26,855 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-28 03:06:26,856 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-28 03:06:26,861 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-28 03:06:26,862 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-28 03:06:26,863 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-28 03:06:26,864 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-28 03:06:26,866 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-28 03:06:26,867 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-28 03:06:26,868 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-28 03:06:26,869 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-28 03:06:26,871 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-28 03:06:26,873 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-28 03:06:26,873 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-28 03:06:26,874 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-28 03:06:26,875 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-28 03:06:26,876 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-28 03:06:26,877 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-28 03:06:26,878 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-28 03:06:26,879 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-28 03:06:26,880 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-28 03:06:26,881 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-28 03:06:26,883 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-28 03:06:26,884 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-28 03:06:26,884 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-28 03:06:26,884 INFO L272 TraceCheckUtils]: 4: Hoare triple {26056#true} call #t~ret4 := main(); {26056#true} is VALID [2022-04-28 03:06:26,884 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26056#true} {26056#true} #34#return; {26056#true} is VALID [2022-04-28 03:06:26,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {26056#true} assume true; {26056#true} is VALID [2022-04-28 03:06:26,885 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-28 03:06:26,885 INFO L272 TraceCheckUtils]: 0: Hoare triple {26056#true} call ULTIMATE.init(); {26056#true} is VALID [2022-04-28 03:06:26,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:06:26,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818488645] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:06:26,885 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:06:26,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 51, 54] total 105 [2022-04-28 03:06:26,885 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:06:26,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [265074720] [2022-04-28 03:06:26,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [265074720] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:06:26,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:06:26,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2022-04-28 03:06:26,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686004953] [2022-04-28 03:06:26,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:06:26,886 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-28 03:06:26,886 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:06:26,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 52 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:26,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:06:26,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-04-28 03:06:26,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:06:26,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-04-28 03:06:26,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2755, Invalid=8165, Unknown=0, NotChecked=0, Total=10920 [2022-04-28 03:06:26,918 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand has 52 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:31,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:06:31,566 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2022-04-28 03:06:31,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-04-28 03:06:31,566 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2022-04-28 03:06:31,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:06:31,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:31,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2022-04-28 03:06:31,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:31,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2022-04-28 03:06:31,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 66 transitions. [2022-04-28 03:06:31,609 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:06:31,609 INFO L225 Difference]: With dead ends: 66 [2022-04-28 03:06:31,609 INFO L226 Difference]: Without dead ends: 61 [2022-04-28 03:06:31,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1283 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=5448, Invalid=18114, Unknown=0, NotChecked=0, Total=23562 [2022-04-28 03:06:31,611 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 2414 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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-28 03:06:31,611 INFO L414 NwaCegarLoop]: 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-28 03:06:31,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-28 03:06:31,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-28 03:06:31,683 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:06:31,683 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:31,683 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:31,683 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:31,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:06:31,683 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2022-04-28 03:06:31,684 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2022-04-28 03:06:31,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:06:31,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:06:31,684 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-28 03:06:31,684 INFO L87 Difference]: Start difference. First operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 61 states. [2022-04-28 03:06:31,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:06:31,685 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2022-04-28 03:06:31,685 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2022-04-28 03:06:31,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:06:31,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:06:31,685 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:06:31,685 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:06:31,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.0178571428571428) internal successors, (57), 56 states have internal predecessors, (57), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:31,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2022-04-28 03:06:31,686 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2022-04-28 03:06:31,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:06:31,686 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2022-04-28 03:06:31,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 51 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:31,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 61 transitions. [2022-04-28 03:06:31,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:06:31,745 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2022-04-28 03:06:31,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-28 03:06:31,745 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:06:31,745 INFO L195 NwaCegarLoop]: trace histogram [49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:06:31,755 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-28 03:06:31,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Ended with exit code 0 [2022-04-28 03:06:32,150 WARN L477 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-28 03:06:32,151 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:06:32,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:06:32,151 INFO L85 PathProgramCache]: Analyzing trace with hash -2040480650, now seen corresponding path program 97 times [2022-04-28 03:06:32,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:06:32,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [904726970] [2022-04-28 03:06:32,273 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-28 03:06:32,275 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:06:32,277 INFO L85 PathProgramCache]: Analyzing trace with hash 969748727, now seen corresponding path program 1 times [2022-04-28 03:06:32,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:06:32,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760830883] [2022-04-28 03:06:32,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:06:32,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:06:32,280 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-28 03:06:32,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:06:32,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [170646594] [2022-04-28 03:06:32,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:06:32,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:06:32,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:06:32,284 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-28 03:06:32,284 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-28 03:06:32,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:06:32,329 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:06:32,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:06:32,337 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:06:32,337 INFO L85 PathProgramCache]: Analyzing trace with hash -2040480650, now seen corresponding path program 98 times [2022-04-28 03:06:32,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:06:32,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108439562] [2022-04-28 03:06:32,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:06:32,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:06:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:06:33,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:06:33,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:06:33,615 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-28 03:06:33,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {26991#true} assume true; {26991#true} is VALID [2022-04-28 03:06:33,615 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26991#true} {26991#true} #34#return; {26991#true} is VALID [2022-04-28 03:06:33,616 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-28 03:06:33,616 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-28 03:06:33,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {26991#true} assume true; {26991#true} is VALID [2022-04-28 03:06:33,616 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26991#true} {26991#true} #34#return; {26991#true} is VALID [2022-04-28 03:06:33,616 INFO L272 TraceCheckUtils]: 4: Hoare triple {26991#true} call #t~ret4 := main(); {26991#true} is VALID [2022-04-28 03:06:33,616 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-28 03:06:33,617 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-28 03:06:33,617 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-28 03:06:33,618 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-28 03:06:33,618 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-28 03:06:33,619 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-28 03:06:33,619 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-28 03:06:33,620 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-28 03:06:33,620 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-28 03:06:33,621 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-28 03:06:33,621 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-28 03:06:33,622 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-28 03:06:33,622 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-28 03:06:33,623 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-28 03:06:33,623 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-28 03:06:33,624 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-28 03:06:33,624 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-28 03:06:33,625 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-28 03:06:33,625 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-28 03:06:33,626 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-28 03:06:33,626 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-28 03:06:33,627 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-28 03:06:33,627 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-28 03:06:33,628 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-28 03:06:33,628 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-28 03:06:33,629 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-28 03:06:33,629 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-28 03:06:33,630 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-28 03:06:33,630 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-28 03:06:33,631 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-28 03:06:33,631 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-28 03:06:33,632 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-28 03:06:33,632 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-28 03:06:33,633 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-28 03:06:33,633 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-28 03:06:33,634 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-28 03:06:33,634 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-28 03:06:33,634 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-28 03:06:33,635 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-28 03:06:33,635 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-28 03:06:33,636 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-28 03:06:33,636 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-28 03:06:33,637 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-28 03:06:33,637 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-28 03:06:33,638 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-28 03:06:33,638 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-28 03:06:33,639 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-28 03:06:33,639 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-28 03:06:33,640 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-28 03:06:33,640 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-28 03:06:33,641 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-28 03:06:33,641 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-28 03:06:33,641 INFO L290 TraceCheckUtils]: 57: Hoare triple {26992#false} ~cond := #in~cond; {26992#false} is VALID [2022-04-28 03:06:33,641 INFO L290 TraceCheckUtils]: 58: Hoare triple {26992#false} assume 0 == ~cond; {26992#false} is VALID [2022-04-28 03:06:33,641 INFO L290 TraceCheckUtils]: 59: Hoare triple {26992#false} assume !false; {26992#false} is VALID [2022-04-28 03:06:33,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:06:33,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:06:33,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108439562] [2022-04-28 03:06:33,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108439562] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:06:33,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203822896] [2022-04-28 03:06:33,642 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:06:33,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:06:33,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:06:33,643 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-28 03:06:33,643 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-28 03:06:33,693 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:06:33,693 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:06:33,694 WARN L261 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 104 conjunts are in the unsatisfiable core [2022-04-28 03:06:33,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:06:33,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:06:34,204 INFO L272 TraceCheckUtils]: 0: Hoare triple {26991#true} call ULTIMATE.init(); {26991#true} is VALID [2022-04-28 03:06:34,205 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-28 03:06:34,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {26991#true} assume true; {26991#true} is VALID [2022-04-28 03:06:34,205 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26991#true} {26991#true} #34#return; {26991#true} is VALID [2022-04-28 03:06:34,205 INFO L272 TraceCheckUtils]: 4: Hoare triple {26991#true} call #t~ret4 := main(); {26991#true} is VALID [2022-04-28 03:06:34,205 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-28 03:06:34,206 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-28 03:06:34,206 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-28 03:06:34,207 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-28 03:06:34,207 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-28 03:06:34,208 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-28 03:06:34,208 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-28 03:06:34,209 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-28 03:06:34,209 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-28 03:06:34,210 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-28 03:06:34,210 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-28 03:06:34,210 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-28 03:06:34,211 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-28 03:06:34,211 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-28 03:06:34,212 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-28 03:06:34,212 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-28 03:06:34,213 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-28 03:06:34,213 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-28 03:06:34,214 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-28 03:06:34,214 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-28 03:06:34,215 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-28 03:06:34,215 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-28 03:06:34,216 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-28 03:06:34,216 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-28 03:06:34,217 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-28 03:06:34,217 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-28 03:06:34,218 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-28 03:06:34,218 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-28 03:06:34,219 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-28 03:06:34,219 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-28 03:06:34,220 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-28 03:06:34,220 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-28 03:06:34,221 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-28 03:06:34,221 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-28 03:06:34,222 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-28 03:06:34,222 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-28 03:06:34,223 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-28 03:06:34,223 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-28 03:06:34,223 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-28 03:06:34,224 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-28 03:06:34,224 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-28 03:06:34,225 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-28 03:06:34,225 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-28 03:06:34,226 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-28 03:06:34,226 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-28 03:06:34,227 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-28 03:06:34,227 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-28 03:06:34,228 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-28 03:06:34,228 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-28 03:06:34,229 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-28 03:06:34,229 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-28 03:06:34,229 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-28 03:06:34,229 INFO L290 TraceCheckUtils]: 57: Hoare triple {26992#false} ~cond := #in~cond; {26992#false} is VALID [2022-04-28 03:06:34,229 INFO L290 TraceCheckUtils]: 58: Hoare triple {26992#false} assume 0 == ~cond; {26992#false} is VALID [2022-04-28 03:06:34,230 INFO L290 TraceCheckUtils]: 59: Hoare triple {26992#false} assume !false; {26992#false} is VALID [2022-04-28 03:06:34,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:06:34,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:06:39,245 INFO L290 TraceCheckUtils]: 59: Hoare triple {26992#false} assume !false; {26992#false} is VALID [2022-04-28 03:06:39,246 INFO L290 TraceCheckUtils]: 58: Hoare triple {27231#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {26992#false} is VALID [2022-04-28 03:06:39,246 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-28 03:06:39,246 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-28 03:06:39,247 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-28 03:06:39,248 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-28 03:06:39,249 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-28 03:06:39,250 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-28 03:06:39,251 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-28 03:06:39,252 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-28 03:06:39,253 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-28 03:06:39,254 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-28 03:06:39,255 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-28 03:06:39,255 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-28 03:06:39,256 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-28 03:06:39,258 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-28 03:06:39,259 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-28 03:06:39,259 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-28 03:06:39,260 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-28 03:06:39,261 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-28 03:06:39,262 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-28 03:06:39,263 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-28 03:06:39,264 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-28 03:06:39,264 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-28 03:06:39,265 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-28 03:06:39,266 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-28 03:06:39,267 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-28 03:06:39,267 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-28 03:06:39,268 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-28 03:06:39,269 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-28 03:06:39,273 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-28 03:06:39,273 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-28 03:06:39,274 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-28 03:06:39,277 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-28 03:06:39,280 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-28 03:06:39,281 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-28 03:06:39,283 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-28 03:06:39,283 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-28 03:06:39,284 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-28 03:06:39,285 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-28 03:06:39,286 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-28 03:06:39,287 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-28 03:06:39,288 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-28 03:06:39,290 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-28 03:06:39,291 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-28 03:06:39,291 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-28 03:06:39,292 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-28 03:06:39,293 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-28 03:06:39,294 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-28 03:06:39,295 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-28 03:06:39,296 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-28 03:06:39,300 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-28 03:06:39,301 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-28 03:06:39,302 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-28 03:06:39,303 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-28 03:06:39,303 INFO L272 TraceCheckUtils]: 4: Hoare triple {26991#true} call #t~ret4 := main(); {26991#true} is VALID [2022-04-28 03:06:39,303 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26991#true} {26991#true} #34#return; {26991#true} is VALID [2022-04-28 03:06:39,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {26991#true} assume true; {26991#true} is VALID [2022-04-28 03:06:39,303 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-28 03:06:39,303 INFO L272 TraceCheckUtils]: 0: Hoare triple {26991#true} call ULTIMATE.init(); {26991#true} is VALID [2022-04-28 03:06:39,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:06:39,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203822896] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:06:39,304 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:06:39,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 52, 55] total 107 [2022-04-28 03:06:39,304 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:06:39,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [904726970] [2022-04-28 03:06:39,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [904726970] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:06:39,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:06:39,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2022-04-28 03:06:39,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196112323] [2022-04-28 03:06:39,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:06:39,305 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2022-04-28 03:06:39,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:06:39,305 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 53 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:39,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:06:39,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-04-28 03:06:39,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:06:39,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-04-28 03:06:39,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2861, Invalid=8481, Unknown=0, NotChecked=0, Total=11342 [2022-04-28 03:06:39,338 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand has 53 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:44,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:06:44,454 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2022-04-28 03:06:44,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-04-28 03:06:44,454 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2022-04-28 03:06:44,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:06:44,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:44,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2022-04-28 03:06:44,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:44,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2022-04-28 03:06:44,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 67 transitions. [2022-04-28 03:06:44,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:06:44,498 INFO L225 Difference]: With dead ends: 67 [2022-04-28 03:06:44,498 INFO L226 Difference]: Without dead ends: 62 [2022-04-28 03:06:44,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1334 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=5659, Invalid=18833, Unknown=0, NotChecked=0, Total=24492 [2022-04-28 03:06:44,500 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 2647 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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, 2.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:06:44,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 208 Invalid, 2748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 2647 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-28 03:06:44,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-28 03:06:44,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-04-28 03:06:44,565 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:06:44,565 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 62 states, 57 states have (on average 1.0175438596491229) internal successors, (58), 57 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:44,565 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 62 states, 57 states have (on average 1.0175438596491229) internal successors, (58), 57 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:44,566 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 62 states, 57 states have (on average 1.0175438596491229) internal successors, (58), 57 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:44,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:06:44,566 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2022-04-28 03:06:44,566 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2022-04-28 03:06:44,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:06:44,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:06:44,567 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 57 states have (on average 1.0175438596491229) internal successors, (58), 57 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 62 states. [2022-04-28 03:06:44,567 INFO L87 Difference]: Start difference. First operand has 62 states, 57 states have (on average 1.0175438596491229) internal successors, (58), 57 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 62 states. [2022-04-28 03:06:44,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:06:44,567 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2022-04-28 03:06:44,568 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2022-04-28 03:06:44,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:06:44,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:06:44,568 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:06:44,568 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:06:44,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 57 states have (on average 1.0175438596491229) internal successors, (58), 57 states have internal predecessors, (58), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:44,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2022-04-28 03:06:44,569 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2022-04-28 03:06:44,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:06:44,569 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2022-04-28 03:06:44,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 52 states have internal predecessors, (56), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:44,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 62 transitions. [2022-04-28 03:06:44,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:06:44,635 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2022-04-28 03:06:44,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-28 03:06:44,636 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:06:44,636 INFO L195 NwaCegarLoop]: trace histogram [50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:06:44,657 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-28 03:06:44,840 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-28 03:06:45,037 WARN L477 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-28 03:06:45,037 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:06:45,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:06:45,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1206070556, now seen corresponding path program 99 times [2022-04-28 03:06:45,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:06:45,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [545775379] [2022-04-28 03:06:45,155 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-28 03:06:45,156 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:06:45,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1028854071, now seen corresponding path program 1 times [2022-04-28 03:06:45,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:06:45,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964307727] [2022-04-28 03:06:45,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:06:45,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:06:45,162 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-28 03:06:45,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:06:45,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1036264600] [2022-04-28 03:06:45,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:06:45,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:06:45,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:06:45,167 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-28 03:06:45,175 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-28 03:06:45,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:06:45,220 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:06:45,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:06:45,230 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:06:45,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1206070556, now seen corresponding path program 100 times [2022-04-28 03:06:45,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:06:45,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137001152] [2022-04-28 03:06:45,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:06:45,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:06:45,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:06:46,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:06:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:06:46,580 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-28 03:06:46,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {27942#true} assume true; {27942#true} is VALID [2022-04-28 03:06:46,581 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27942#true} {27942#true} #34#return; {27942#true} is VALID [2022-04-28 03:06:46,581 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-28 03:06:46,581 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-28 03:06:46,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {27942#true} assume true; {27942#true} is VALID [2022-04-28 03:06:46,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27942#true} {27942#true} #34#return; {27942#true} is VALID [2022-04-28 03:06:46,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {27942#true} call #t~ret4 := main(); {27942#true} is VALID [2022-04-28 03:06:46,582 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-28 03:06:46,582 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-28 03:06:46,583 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-28 03:06:46,583 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-28 03:06:46,584 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-28 03:06:46,584 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-28 03:06:46,585 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-28 03:06:46,585 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-28 03:06:46,586 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-28 03:06:46,586 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-28 03:06:46,587 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-28 03:06:46,587 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-28 03:06:46,588 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-28 03:06:46,588 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-28 03:06:46,589 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-28 03:06:46,589 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-28 03:06:46,590 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-28 03:06:46,590 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-28 03:06:46,591 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-28 03:06:46,591 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-28 03:06:46,592 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-28 03:06:46,592 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-28 03:06:46,594 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-28 03:06:46,594 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-28 03:06:46,595 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-28 03:06:46,595 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-28 03:06:46,596 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-28 03:06:46,596 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-28 03:06:46,597 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-28 03:06:46,597 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-28 03:06:46,598 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-28 03:06:46,598 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-28 03:06:46,599 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-28 03:06:46,599 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-28 03:06:46,600 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-28 03:06:46,600 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-28 03:06:46,601 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-28 03:06:46,601 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-28 03:06:46,602 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-28 03:06:46,602 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-28 03:06:46,603 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-28 03:06:46,603 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-28 03:06:46,604 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-28 03:06:46,604 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-28 03:06:46,605 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-28 03:06:46,605 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-28 03:06:46,606 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-28 03:06:46,606 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-28 03:06:46,607 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-28 03:06:46,607 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-28 03:06:46,608 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-28 03:06:46,608 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-28 03:06:46,608 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-28 03:06:46,608 INFO L290 TraceCheckUtils]: 58: Hoare triple {27943#false} ~cond := #in~cond; {27943#false} is VALID [2022-04-28 03:06:46,608 INFO L290 TraceCheckUtils]: 59: Hoare triple {27943#false} assume 0 == ~cond; {27943#false} is VALID [2022-04-28 03:06:46,608 INFO L290 TraceCheckUtils]: 60: Hoare triple {27943#false} assume !false; {27943#false} is VALID [2022-04-28 03:06:46,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:06:46,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:06:46,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137001152] [2022-04-28 03:06:46,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137001152] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:06:46,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59675893] [2022-04-28 03:06:46,616 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:06:46,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:06:46,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:06:46,617 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-28 03:06:46,617 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-28 03:06:46,708 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:06:46,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:06:46,710 WARN L261 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 103 conjunts are in the unsatisfiable core [2022-04-28 03:06:46,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:06:46,721 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:06:47,295 INFO L272 TraceCheckUtils]: 0: Hoare triple {27942#true} call ULTIMATE.init(); {27942#true} is VALID [2022-04-28 03:06:47,295 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-28 03:06:47,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {27942#true} assume true; {27942#true} is VALID [2022-04-28 03:06:47,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27942#true} {27942#true} #34#return; {27942#true} is VALID [2022-04-28 03:06:47,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {27942#true} call #t~ret4 := main(); {27942#true} is VALID [2022-04-28 03:06:47,295 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-28 03:06:47,296 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-28 03:06:47,296 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-28 03:06:47,297 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-28 03:06:47,297 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-28 03:06:47,298 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-28 03:06:47,298 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-28 03:06:47,299 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-28 03:06:47,299 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-28 03:06:47,300 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-28 03:06:47,300 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-28 03:06:47,301 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-28 03:06:47,301 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-28 03:06:47,302 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-28 03:06:47,302 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-28 03:06:47,303 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-28 03:06:47,303 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-28 03:06:47,304 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-28 03:06:47,304 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-28 03:06:47,305 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-28 03:06:47,305 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-28 03:06:47,306 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-28 03:06:47,306 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-28 03:06:47,307 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-28 03:06:47,307 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-28 03:06:47,308 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-28 03:06:47,308 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-28 03:06:47,309 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-28 03:06:47,309 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-28 03:06:47,310 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-28 03:06:47,311 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-28 03:06:47,312 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-28 03:06:47,312 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-28 03:06:47,313 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-28 03:06:47,313 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-28 03:06:47,314 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-28 03:06:47,314 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-28 03:06:47,315 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-28 03:06:47,315 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-28 03:06:47,316 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-28 03:06:47,316 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-28 03:06:47,317 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-28 03:06:47,317 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-28 03:06:47,318 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-28 03:06:47,318 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-28 03:06:47,319 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-28 03:06:47,319 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-28 03:06:47,320 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-28 03:06:47,320 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-28 03:06:47,321 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-28 03:06:47,321 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-28 03:06:47,322 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-28 03:06:47,322 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-28 03:06:47,322 INFO L290 TraceCheckUtils]: 58: Hoare triple {27943#false} ~cond := #in~cond; {27943#false} is VALID [2022-04-28 03:06:47,322 INFO L290 TraceCheckUtils]: 59: Hoare triple {27943#false} assume 0 == ~cond; {27943#false} is VALID [2022-04-28 03:06:47,322 INFO L290 TraceCheckUtils]: 60: Hoare triple {27943#false} assume !false; {27943#false} is VALID [2022-04-28 03:06:47,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:06:47,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:06:51,296 INFO L290 TraceCheckUtils]: 60: Hoare triple {27943#false} assume !false; {27943#false} is VALID [2022-04-28 03:06:51,296 INFO L290 TraceCheckUtils]: 59: Hoare triple {27943#false} assume 0 == ~cond; {27943#false} is VALID [2022-04-28 03:06:51,296 INFO L290 TraceCheckUtils]: 58: Hoare triple {27943#false} ~cond := #in~cond; {27943#false} is VALID [2022-04-28 03:06:51,296 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-28 03:06:51,296 INFO L290 TraceCheckUtils]: 56: Hoare triple {28195#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {27943#false} is VALID [2022-04-28 03:06:51,297 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-28 03:06:51,300 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-28 03:06:51,300 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-28 03:06:51,301 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-28 03:06:51,301 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-28 03:06:51,302 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-28 03:06:51,303 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-28 03:06:51,303 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-28 03:06:51,304 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-28 03:06:51,304 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-28 03:06:51,305 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-28 03:06:51,306 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-28 03:06:51,306 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-28 03:06:51,307 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-28 03:06:51,308 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-28 03:06:51,309 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-28 03:06:51,309 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-28 03:06:51,310 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-28 03:06:51,311 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-28 03:06:51,312 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-28 03:06:51,312 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-28 03:06:51,313 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-28 03:06:51,313 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-28 03:06:51,315 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-28 03:06:51,316 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-28 03:06:51,317 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-28 03:06:51,317 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-28 03:06:51,318 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-28 03:06:51,318 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-28 03:06:51,319 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-28 03:06:51,320 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-28 03:06:51,320 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-28 03:06:51,321 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-28 03:06:51,322 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-28 03:06:51,323 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-28 03:06:51,324 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-28 03:06:51,325 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-28 03:06:51,325 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-28 03:06:51,326 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-28 03:06:51,327 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-28 03:06:51,327 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-28 03:06:51,328 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-28 03:06:51,330 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-28 03:06:51,330 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-28 03:06:51,331 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-28 03:06:51,331 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-28 03:06:51,332 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-28 03:06:51,333 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-28 03:06:51,333 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-28 03:06:51,334 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-28 03:06:51,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {27942#true} ~x~0 := 268435441; {28395#(< 1 (mod (+ 4294967196 main_~x~0) 4294967296))} is VALID [2022-04-28 03:06:51,334 INFO L272 TraceCheckUtils]: 4: Hoare triple {27942#true} call #t~ret4 := main(); {27942#true} is VALID [2022-04-28 03:06:51,334 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27942#true} {27942#true} #34#return; {27942#true} is VALID [2022-04-28 03:06:51,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {27942#true} assume true; {27942#true} is VALID [2022-04-28 03:06:51,335 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-28 03:06:51,335 INFO L272 TraceCheckUtils]: 0: Hoare triple {27942#true} call ULTIMATE.init(); {27942#true} is VALID [2022-04-28 03:06:51,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:06:51,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59675893] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:06:51,335 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:06:51,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 53, 53] total 106 [2022-04-28 03:06:51,336 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:06:51,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [545775379] [2022-04-28 03:06:51,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [545775379] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:06:51,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:06:51,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2022-04-28 03:06:51,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567248218] [2022-04-28 03:06:51,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:06:51,336 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2022-04-28 03:06:51,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:06:51,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 54 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:51,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:06:51,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-04-28 03:06:51,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:06:51,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-04-28 03:06:51,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2912, Invalid=8218, Unknown=0, NotChecked=0, Total=11130 [2022-04-28 03:06:51,386 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand has 54 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:56,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:06:56,325 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2022-04-28 03:06:56,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-04-28 03:06:56,325 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2022-04-28 03:06:56,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:06:56,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:56,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2022-04-28 03:06:56,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:56,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2022-04-28 03:06:56,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 68 transitions. [2022-04-28 03:06:56,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:06:56,369 INFO L225 Difference]: With dead ends: 68 [2022-04-28 03:06:56,369 INFO L226 Difference]: Without dead ends: 63 [2022-04-28 03:06:56,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1380 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=5817, Invalid=18675, Unknown=0, NotChecked=0, Total=24492 [2022-04-28 03:06:56,371 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 2582 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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, 2.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:06:56,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 43 Invalid, 2685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 2582 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-28 03:06:56,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-28 03:06:56,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-04-28 03:06:56,453 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:06:56,453 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:56,453 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:56,453 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:56,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:06:56,454 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2022-04-28 03:06:56,454 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2022-04-28 03:06:56,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:06:56,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:06:56,454 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 63 states. [2022-04-28 03:06:56,454 INFO L87 Difference]: Start difference. First operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 63 states. [2022-04-28 03:06:56,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:06:56,455 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2022-04-28 03:06:56,455 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2022-04-28 03:06:56,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:06:56,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:06:56,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:06:56,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:06:56,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:56,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2022-04-28 03:06:56,456 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2022-04-28 03:06:56,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:06:56,456 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2022-04-28 03:06:56,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:06:56,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 63 transitions. [2022-04-28 03:06:56,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:06:56,502 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2022-04-28 03:06:56,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-28 03:06:56,502 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:06:56,502 INFO L195 NwaCegarLoop]: trace histogram [51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:06:56,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Ended with exit code 0 [2022-04-28 03:06:56,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Ended with exit code 0 [2022-04-28 03:06:56,903 WARN L477 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-28 03:06:56,903 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:06:56,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:06:56,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1230057162, now seen corresponding path program 101 times [2022-04-28 03:06:56,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:06:56,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [847966305] [2022-04-28 03:06:57,013 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-28 03:06:57,014 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:06:57,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1087959415, now seen corresponding path program 1 times [2022-04-28 03:06:57,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:06:57,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120697806] [2022-04-28 03:06:57,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:06:57,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:06:57,022 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-28 03:06:57,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:06:57,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [459342317] [2022-04-28 03:06:57,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:06:57,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:06:57,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:06:57,026 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-28 03:06:57,050 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-28 03:06:57,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:06:57,083 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:06:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:06:57,094 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:06:57,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1230057162, now seen corresponding path program 102 times [2022-04-28 03:06:57,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:06:57,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172243590] [2022-04-28 03:06:57,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:06:57,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:06:57,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:06:58,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:06:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:06:58,491 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-28 03:06:58,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {28906#true} assume true; {28906#true} is VALID [2022-04-28 03:06:58,492 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28906#true} {28906#true} #34#return; {28906#true} is VALID [2022-04-28 03:06:58,492 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-28 03:06:58,492 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-28 03:06:58,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {28906#true} assume true; {28906#true} is VALID [2022-04-28 03:06:58,492 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28906#true} {28906#true} #34#return; {28906#true} is VALID [2022-04-28 03:06:58,492 INFO L272 TraceCheckUtils]: 4: Hoare triple {28906#true} call #t~ret4 := main(); {28906#true} is VALID [2022-04-28 03:06:58,493 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-28 03:06:58,493 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-28 03:06:58,494 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-28 03:06:58,494 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-28 03:06:58,495 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-28 03:06:58,495 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-28 03:06:58,496 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-28 03:06:58,496 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-28 03:06:58,497 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-28 03:06:58,497 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-28 03:06:58,498 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-28 03:06:58,498 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-28 03:06:58,499 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-28 03:06:58,499 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-28 03:06:58,500 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-28 03:06:58,500 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-28 03:06:58,501 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-28 03:06:58,501 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-28 03:06:58,501 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-28 03:06:58,502 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-28 03:06:58,502 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-28 03:06:58,503 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-28 03:06:58,503 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-28 03:06:58,504 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-28 03:06:58,504 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-28 03:06:58,505 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-28 03:06:58,505 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-28 03:06:58,506 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-28 03:06:58,506 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-28 03:06:58,507 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-28 03:06:58,507 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-28 03:06:58,508 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-28 03:06:58,508 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-28 03:06:58,509 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-28 03:06:58,509 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-28 03:06:58,510 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-28 03:06:58,510 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-28 03:06:58,511 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-28 03:06:58,511 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-28 03:06:58,512 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-28 03:06:58,512 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-28 03:06:58,513 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-28 03:06:58,513 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-28 03:06:58,514 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-28 03:06:58,514 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-28 03:06:58,514 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-28 03:06:58,515 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-28 03:06:58,515 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-28 03:06:58,516 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-28 03:06:58,516 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-28 03:06:58,517 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-28 03:06:58,518 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-28 03:06:58,518 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-28 03:06:58,518 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-28 03:06:58,518 INFO L290 TraceCheckUtils]: 59: Hoare triple {28907#false} ~cond := #in~cond; {28907#false} is VALID [2022-04-28 03:06:58,518 INFO L290 TraceCheckUtils]: 60: Hoare triple {28907#false} assume 0 == ~cond; {28907#false} is VALID [2022-04-28 03:06:58,518 INFO L290 TraceCheckUtils]: 61: Hoare triple {28907#false} assume !false; {28907#false} is VALID [2022-04-28 03:06:58,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:06:58,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:06:58,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172243590] [2022-04-28 03:06:58,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172243590] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:06:58,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521764248] [2022-04-28 03:06:58,519 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:06:58,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:06:58,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:06:58,521 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-28 03:06:58,522 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-28 03:07:07,839 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2022-04-28 03:07:07,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:07:07,846 WARN L261 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 108 conjunts are in the unsatisfiable core [2022-04-28 03:07:07,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:07,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:07:08,368 INFO L272 TraceCheckUtils]: 0: Hoare triple {28906#true} call ULTIMATE.init(); {28906#true} is VALID [2022-04-28 03:07:08,368 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-28 03:07:08,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {28906#true} assume true; {28906#true} is VALID [2022-04-28 03:07:08,368 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28906#true} {28906#true} #34#return; {28906#true} is VALID [2022-04-28 03:07:08,368 INFO L272 TraceCheckUtils]: 4: Hoare triple {28906#true} call #t~ret4 := main(); {28906#true} is VALID [2022-04-28 03:07:08,369 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-28 03:07:08,369 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-28 03:07:08,370 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-28 03:07:08,370 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-28 03:07:08,371 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-28 03:07:08,371 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-28 03:07:08,372 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-28 03:07:08,372 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-28 03:07:08,373 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-28 03:07:08,373 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-28 03:07:08,374 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-28 03:07:08,374 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-28 03:07:08,375 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-28 03:07:08,375 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-28 03:07:08,376 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-28 03:07:08,376 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-28 03:07:08,377 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-28 03:07:08,377 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-28 03:07:08,378 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-28 03:07:08,378 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-28 03:07:08,378 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-28 03:07:08,379 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-28 03:07:08,379 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-28 03:07:08,380 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-28 03:07:08,380 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-28 03:07:08,381 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-28 03:07:08,381 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-28 03:07:08,382 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-28 03:07:08,382 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-28 03:07:08,383 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-28 03:07:08,383 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-28 03:07:08,384 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-28 03:07:08,384 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-28 03:07:08,385 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-28 03:07:08,385 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-28 03:07:08,386 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-28 03:07:08,386 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-28 03:07:08,387 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-28 03:07:08,387 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-28 03:07:08,388 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-28 03:07:08,388 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-28 03:07:08,389 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-28 03:07:08,389 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-28 03:07:08,389 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-28 03:07:08,390 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-28 03:07:08,390 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-28 03:07:08,391 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-28 03:07:08,391 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-28 03:07:08,392 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-28 03:07:08,392 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-28 03:07:08,393 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-28 03:07:08,393 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-28 03:07:08,394 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-28 03:07:08,394 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-28 03:07:08,394 INFO L290 TraceCheckUtils]: 59: Hoare triple {28907#false} ~cond := #in~cond; {28907#false} is VALID [2022-04-28 03:07:08,394 INFO L290 TraceCheckUtils]: 60: Hoare triple {28907#false} assume 0 == ~cond; {28907#false} is VALID [2022-04-28 03:07:08,394 INFO L290 TraceCheckUtils]: 61: Hoare triple {28907#false} assume !false; {28907#false} is VALID [2022-04-28 03:07:08,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:07:08,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:07:13,790 INFO L290 TraceCheckUtils]: 61: Hoare triple {28907#false} assume !false; {28907#false} is VALID [2022-04-28 03:07:13,790 INFO L290 TraceCheckUtils]: 60: Hoare triple {29154#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {28907#false} is VALID [2022-04-28 03:07:13,791 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-28 03:07:13,791 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-28 03:07:13,791 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-28 03:07:13,793 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-28 03:07:13,793 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-28 03:07:13,794 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-28 03:07:13,796 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-28 03:07:13,797 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-28 03:07:13,801 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-28 03:07:13,802 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-28 03:07:13,803 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-28 03:07:13,804 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-28 03:07:13,805 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-28 03:07:13,805 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-28 03:07:13,806 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-28 03:07:13,807 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-28 03:07:13,808 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-28 03:07:13,809 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-28 03:07:13,810 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-28 03:07:13,810 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-28 03:07:13,812 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-28 03:07:13,813 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-28 03:07:13,814 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-28 03:07:13,815 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-28 03:07:13,816 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-28 03:07:13,817 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-28 03:07:13,818 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-28 03:07:13,819 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-28 03:07:13,819 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-28 03:07:13,820 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-28 03:07:13,821 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-28 03:07:13,823 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-28 03:07:13,824 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-28 03:07:13,832 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-28 03:07:13,834 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-28 03:07:13,835 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-28 03:07:13,835 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-28 03:07:13,836 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-28 03:07:13,840 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-28 03:07:13,841 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-28 03:07:13,843 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-28 03:07:13,846 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-28 03:07:13,846 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-28 03:07:13,847 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-28 03:07:13,850 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-28 03:07:13,851 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-28 03:07:13,851 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-28 03:07:13,852 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-28 03:07:13,853 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-28 03:07:13,857 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-28 03:07:13,858 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-28 03:07:13,858 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-28 03:07:13,859 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-28 03:07:13,860 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-28 03:07:13,860 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-28 03:07:13,860 INFO L272 TraceCheckUtils]: 4: Hoare triple {28906#true} call #t~ret4 := main(); {28906#true} is VALID [2022-04-28 03:07:13,860 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28906#true} {28906#true} #34#return; {28906#true} is VALID [2022-04-28 03:07:13,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {28906#true} assume true; {28906#true} is VALID [2022-04-28 03:07:13,861 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-28 03:07:13,861 INFO L272 TraceCheckUtils]: 0: Hoare triple {28906#true} call ULTIMATE.init(); {28906#true} is VALID [2022-04-28 03:07:13,861 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:07:13,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521764248] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:07:13,861 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:07:13,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 54, 57] total 111 [2022-04-28 03:07:13,862 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:07:13,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [847966305] [2022-04-28 03:07:13,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [847966305] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:07:13,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:07:13,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2022-04-28 03:07:13,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096834351] [2022-04-28 03:07:13,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:07:13,862 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2022-04-28 03:07:13,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:07:13,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 55 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:13,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:07:13,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-04-28 03:07:13,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:07:13,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-04-28 03:07:13,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3079, Invalid=9131, Unknown=0, NotChecked=0, Total=12210 [2022-04-28 03:07:13,907 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand has 55 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:19,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:19,133 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2022-04-28 03:07:19,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-04-28 03:07:19,133 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2022-04-28 03:07:19,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:07:19,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:19,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2022-04-28 03:07:19,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:19,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2022-04-28 03:07:19,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 69 transitions. [2022-04-28 03:07:19,178 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:07:19,179 INFO L225 Difference]: With dead ends: 69 [2022-04-28 03:07:19,179 INFO L226 Difference]: Without dead ends: 64 [2022-04-28 03:07:19,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1439 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=6093, Invalid=20313, Unknown=0, NotChecked=0, Total=26406 [2022-04-28 03:07:19,180 INFO L413 NwaCegarLoop]: 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-28 03:07:19,180 INFO L414 NwaCegarLoop]: 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-28 03:07:19,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-28 03:07:19,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-04-28 03:07:19,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:07:19,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 64 states, 59 states have (on average 1.0169491525423728) internal successors, (60), 59 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:19,250 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 64 states, 59 states have (on average 1.0169491525423728) internal successors, (60), 59 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:19,250 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 64 states, 59 states have (on average 1.0169491525423728) internal successors, (60), 59 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:19,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:19,251 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2022-04-28 03:07:19,251 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2022-04-28 03:07:19,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:07:19,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:07:19,251 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 59 states have (on average 1.0169491525423728) internal successors, (60), 59 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-04-28 03:07:19,251 INFO L87 Difference]: Start difference. First operand has 64 states, 59 states have (on average 1.0169491525423728) internal successors, (60), 59 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 64 states. [2022-04-28 03:07:19,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:19,252 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2022-04-28 03:07:19,252 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2022-04-28 03:07:19,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:07:19,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:07:19,252 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:07:19,252 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:07:19,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 59 states have (on average 1.0169491525423728) internal successors, (60), 59 states have internal predecessors, (60), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:19,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2022-04-28 03:07:19,253 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2022-04-28 03:07:19,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:07:19,253 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2022-04-28 03:07:19,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 54 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:19,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 64 transitions. [2022-04-28 03:07:19,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:07:19,305 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2022-04-28 03:07:19,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 03:07:19,305 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:07:19,305 INFO L195 NwaCegarLoop]: trace histogram [52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:07:19,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Ended with exit code 0 [2022-04-28 03:07:19,508 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-28 03:07:19,705 WARN L477 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-28 03:07:19,706 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:07:19,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:07:19,706 INFO L85 PathProgramCache]: Analyzing trace with hash 559394908, now seen corresponding path program 103 times [2022-04-28 03:07:19,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:07:19,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [239662317] [2022-04-28 03:07:19,827 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-28 03:07:19,829 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:07:19,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1147064759, now seen corresponding path program 1 times [2022-04-28 03:07:19,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:07:19,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255385316] [2022-04-28 03:07:19,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:07:19,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:07:19,834 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-28 03:07:19,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:07:19,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [372459544] [2022-04-28 03:07:19,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:07:19,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:07:19,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:07:19,838 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-28 03:07:19,839 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-28 03:07:19,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:07:19,863 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:07:19,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:07:19,882 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:07:19,882 INFO L85 PathProgramCache]: Analyzing trace with hash 559394908, now seen corresponding path program 104 times [2022-04-28 03:07:19,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:07:19,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069764023] [2022-04-28 03:07:19,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:07:19,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:07:19,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:21,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:07:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:21,325 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-28 03:07:21,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {29889#true} assume true; {29889#true} is VALID [2022-04-28 03:07:21,326 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29889#true} {29889#true} #34#return; {29889#true} is VALID [2022-04-28 03:07:21,326 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-28 03:07:21,326 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-28 03:07:21,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {29889#true} assume true; {29889#true} is VALID [2022-04-28 03:07:21,326 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29889#true} {29889#true} #34#return; {29889#true} is VALID [2022-04-28 03:07:21,326 INFO L272 TraceCheckUtils]: 4: Hoare triple {29889#true} call #t~ret4 := main(); {29889#true} is VALID [2022-04-28 03:07:21,327 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-28 03:07:21,327 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-28 03:07:21,328 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-28 03:07:21,328 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-28 03:07:21,329 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-28 03:07:21,329 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-28 03:07:21,330 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-28 03:07:21,330 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-28 03:07:21,331 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-28 03:07:21,331 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-28 03:07:21,332 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-28 03:07:21,332 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-28 03:07:21,333 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-28 03:07:21,333 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-28 03:07:21,334 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-28 03:07:21,334 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-28 03:07:21,335 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-28 03:07:21,335 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-28 03:07:21,336 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-28 03:07:21,336 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-28 03:07:21,337 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-28 03:07:21,337 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-28 03:07:21,338 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-28 03:07:21,338 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-28 03:07:21,339 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-28 03:07:21,339 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-28 03:07:21,340 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-28 03:07:21,340 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-28 03:07:21,341 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-28 03:07:21,341 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-28 03:07:21,342 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-28 03:07:21,342 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-28 03:07:21,343 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-28 03:07:21,343 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-28 03:07:21,344 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-28 03:07:21,344 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-28 03:07:21,345 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-28 03:07:21,345 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-28 03:07:21,345 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-28 03:07:21,346 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-28 03:07:21,346 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-28 03:07:21,347 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-28 03:07:21,347 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-28 03:07:21,348 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-28 03:07:21,348 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-28 03:07:21,349 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-28 03:07:21,349 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-28 03:07:21,350 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-28 03:07:21,350 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-28 03:07:21,351 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-28 03:07:21,351 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-28 03:07:21,352 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-28 03:07:21,352 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-28 03:07:21,353 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-28 03:07:21,353 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-28 03:07:21,353 INFO L290 TraceCheckUtils]: 60: Hoare triple {29890#false} ~cond := #in~cond; {29890#false} is VALID [2022-04-28 03:07:21,353 INFO L290 TraceCheckUtils]: 61: Hoare triple {29890#false} assume 0 == ~cond; {29890#false} is VALID [2022-04-28 03:07:21,353 INFO L290 TraceCheckUtils]: 62: Hoare triple {29890#false} assume !false; {29890#false} is VALID [2022-04-28 03:07:21,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:07:21,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:07:21,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069764023] [2022-04-28 03:07:21,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069764023] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:07:21,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484489345] [2022-04-28 03:07:21,354 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:07:21,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:07:21,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:07:21,355 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-28 03:07:21,356 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-28 03:07:21,407 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:07:21,407 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:07:21,409 WARN L261 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 110 conjunts are in the unsatisfiable core [2022-04-28 03:07:21,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:21,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:07:21,959 INFO L272 TraceCheckUtils]: 0: Hoare triple {29889#true} call ULTIMATE.init(); {29889#true} is VALID [2022-04-28 03:07:21,959 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-28 03:07:21,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {29889#true} assume true; {29889#true} is VALID [2022-04-28 03:07:21,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29889#true} {29889#true} #34#return; {29889#true} is VALID [2022-04-28 03:07:21,959 INFO L272 TraceCheckUtils]: 4: Hoare triple {29889#true} call #t~ret4 := main(); {29889#true} is VALID [2022-04-28 03:07:21,960 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-28 03:07:21,960 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-28 03:07:21,961 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-28 03:07:21,961 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-28 03:07:21,962 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-28 03:07:21,962 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-28 03:07:21,963 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-28 03:07:21,963 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-28 03:07:21,964 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-28 03:07:21,964 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-28 03:07:21,965 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-28 03:07:21,965 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-28 03:07:21,966 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-28 03:07:21,966 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-28 03:07:21,967 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-28 03:07:21,967 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-28 03:07:21,967 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-28 03:07:21,968 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-28 03:07:21,968 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-28 03:07:21,969 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-28 03:07:21,969 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-28 03:07:21,970 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-28 03:07:21,970 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-28 03:07:21,971 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-28 03:07:21,971 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-28 03:07:21,972 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-28 03:07:21,972 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-28 03:07:21,973 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-28 03:07:21,973 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-28 03:07:21,974 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-28 03:07:21,974 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-28 03:07:21,975 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-28 03:07:21,975 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-28 03:07:21,976 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-28 03:07:21,976 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-28 03:07:21,977 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-28 03:07:21,977 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-28 03:07:21,978 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-28 03:07:21,978 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-28 03:07:21,979 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-28 03:07:21,979 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-28 03:07:21,980 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-28 03:07:21,980 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-28 03:07:21,981 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-28 03:07:21,981 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-28 03:07:21,982 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-28 03:07:21,982 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-28 03:07:21,983 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-28 03:07:21,983 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-28 03:07:21,984 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-28 03:07:21,984 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-28 03:07:21,985 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-28 03:07:21,985 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-28 03:07:21,986 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-28 03:07:21,986 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-28 03:07:21,986 INFO L290 TraceCheckUtils]: 60: Hoare triple {29890#false} ~cond := #in~cond; {29890#false} is VALID [2022-04-28 03:07:21,986 INFO L290 TraceCheckUtils]: 61: Hoare triple {29890#false} assume 0 == ~cond; {29890#false} is VALID [2022-04-28 03:07:21,986 INFO L290 TraceCheckUtils]: 62: Hoare triple {29890#false} assume !false; {29890#false} is VALID [2022-04-28 03:07:21,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:07:21,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:07:27,541 INFO L290 TraceCheckUtils]: 62: Hoare triple {29890#false} assume !false; {29890#false} is VALID [2022-04-28 03:07:27,541 INFO L290 TraceCheckUtils]: 61: Hoare triple {30141#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {29890#false} is VALID [2022-04-28 03:07:27,542 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-28 03:07:27,542 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-28 03:07:27,542 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-28 03:07:27,544 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-28 03:07:27,544 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-28 03:07:27,545 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-28 03:07:27,547 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-28 03:07:27,548 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-28 03:07:27,549 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-28 03:07:27,549 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-28 03:07:27,550 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-28 03:07:27,551 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-28 03:07:27,553 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-28 03:07:27,554 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-28 03:07:27,554 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-28 03:07:27,555 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-28 03:07:27,556 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-28 03:07:27,557 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-28 03:07:27,557 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-28 03:07:27,559 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-28 03:07:27,560 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-28 03:07:27,561 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-28 03:07:27,562 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-28 03:07:27,563 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-28 03:07:27,564 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-28 03:07:27,565 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-28 03:07:27,565 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-28 03:07:27,566 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-28 03:07:27,567 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-28 03:07:27,567 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-28 03:07:27,568 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-28 03:07:27,569 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-28 03:07:27,572 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-28 03:07:27,573 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-28 03:07:27,574 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-28 03:07:27,574 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-28 03:07:27,575 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-28 03:07:27,576 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-28 03:07:27,578 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-28 03:07:27,579 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-28 03:07:27,580 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-28 03:07:27,588 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-28 03:07:27,589 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-28 03:07:27,590 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-28 03:07:27,591 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-28 03:07:27,593 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-28 03:07:27,593 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-28 03:07:27,594 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-28 03:07:27,595 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-28 03:07:27,596 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-28 03:07:27,597 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-28 03:07:27,598 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-28 03:07:27,599 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-28 03:07:27,599 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-28 03:07:27,600 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-28 03:07:27,600 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-28 03:07:27,600 INFO L272 TraceCheckUtils]: 4: Hoare triple {29889#true} call #t~ret4 := main(); {29889#true} is VALID [2022-04-28 03:07:27,601 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29889#true} {29889#true} #34#return; {29889#true} is VALID [2022-04-28 03:07:27,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {29889#true} assume true; {29889#true} is VALID [2022-04-28 03:07:27,601 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-28 03:07:27,601 INFO L272 TraceCheckUtils]: 0: Hoare triple {29889#true} call ULTIMATE.init(); {29889#true} is VALID [2022-04-28 03:07:27,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:07:27,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484489345] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:07:27,602 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:07:27,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 55, 58] total 113 [2022-04-28 03:07:27,602 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:07:27,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [239662317] [2022-04-28 03:07:27,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [239662317] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:07:27,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:07:27,603 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2022-04-28 03:07:27,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768433289] [2022-04-28 03:07:27,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:07:27,603 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 55 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-28 03:07:27,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:07:27,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 56 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 55 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:27,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:07:27,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-04-28 03:07:27,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:07:27,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-04-28 03:07:27,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3191, Invalid=9465, Unknown=0, NotChecked=0, Total=12656 [2022-04-28 03:07:27,651 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand has 56 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 55 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:33,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:33,129 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2022-04-28 03:07:33,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-04-28 03:07:33,129 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 55 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 63 [2022-04-28 03:07:33,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:07:33,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 55 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:33,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2022-04-28 03:07:33,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 55 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:33,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2022-04-28 03:07:33,131 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 70 transitions. [2022-04-28 03:07:33,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:07:33,191 INFO L225 Difference]: With dead ends: 70 [2022-04-28 03:07:33,191 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 03:07:33,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1493 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=6316, Invalid=21074, Unknown=0, NotChecked=0, Total=27390 [2022-04-28 03:07:33,194 INFO L413 NwaCegarLoop]: 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-28 03:07:33,194 INFO L414 NwaCegarLoop]: 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-28 03:07:33,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 03:07:33,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-28 03:07:33,278 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:07:33,279 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:33,279 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:33,279 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:33,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:33,280 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2022-04-28 03:07:33,280 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2022-04-28 03:07:33,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:07:33,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:07:33,280 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-28 03:07:33,280 INFO L87 Difference]: Start difference. First operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-28 03:07:33,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:33,281 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2022-04-28 03:07:33,281 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2022-04-28 03:07:33,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:07:33,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:07:33,281 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:07:33,281 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:07:33,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.0166666666666666) internal successors, (61), 60 states have internal predecessors, (61), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:33,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2022-04-28 03:07:33,282 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2022-04-28 03:07:33,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:07:33,282 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2022-04-28 03:07:33,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 55 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:33,283 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 65 transitions. [2022-04-28 03:07:33,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:07:33,342 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2022-04-28 03:07:33,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-28 03:07:33,342 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:07:33,342 INFO L195 NwaCegarLoop]: trace histogram [53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:07:33,349 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-28 03:07:33,568 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-28 03:07:33,743 WARN L477 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-28 03:07:33,743 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:07:33,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:07:33,743 INFO L85 PathProgramCache]: Analyzing trace with hash 197834230, now seen corresponding path program 105 times [2022-04-28 03:07:33,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:07:33,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [661577490] [2022-04-28 03:07:33,876 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-28 03:07:33,878 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:07:33,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1206170103, now seen corresponding path program 1 times [2022-04-28 03:07:33,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:07:33,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107041886] [2022-04-28 03:07:33,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:07:33,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:07:33,885 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-28 03:07:33,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:07:33,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [275784982] [2022-04-28 03:07:33,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:07:33,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:07:33,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:07:33,892 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-28 03:07:33,893 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-28 03:07:33,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:07:33,943 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:07:33,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:07:33,955 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:07:33,955 INFO L85 PathProgramCache]: Analyzing trace with hash 197834230, now seen corresponding path program 106 times [2022-04-28 03:07:33,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:07:33,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444227826] [2022-04-28 03:07:33,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:07:33,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:07:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:35,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:07:35,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:35,484 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-28 03:07:35,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {30888#true} assume true; {30888#true} is VALID [2022-04-28 03:07:35,485 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30888#true} {30888#true} #34#return; {30888#true} is VALID [2022-04-28 03:07:35,485 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-28 03:07:35,485 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-28 03:07:35,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {30888#true} assume true; {30888#true} is VALID [2022-04-28 03:07:35,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30888#true} {30888#true} #34#return; {30888#true} is VALID [2022-04-28 03:07:35,486 INFO L272 TraceCheckUtils]: 4: Hoare triple {30888#true} call #t~ret4 := main(); {30888#true} is VALID [2022-04-28 03:07:35,486 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-28 03:07:35,487 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-28 03:07:35,487 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-28 03:07:35,488 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-28 03:07:35,489 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-28 03:07:35,489 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-28 03:07:35,490 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-28 03:07:35,490 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-28 03:07:35,491 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-28 03:07:35,491 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-28 03:07:35,492 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-28 03:07:35,492 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-28 03:07:35,493 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-28 03:07:35,493 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-28 03:07:35,494 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-28 03:07:35,494 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-28 03:07:35,495 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-28 03:07:35,495 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-28 03:07:35,496 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-28 03:07:35,496 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-28 03:07:35,497 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-28 03:07:35,497 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-28 03:07:35,498 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-28 03:07:35,498 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-28 03:07:35,499 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-28 03:07:35,499 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-28 03:07:35,500 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-28 03:07:35,500 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-28 03:07:35,501 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-28 03:07:35,501 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-28 03:07:35,502 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-28 03:07:35,502 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-28 03:07:35,503 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-28 03:07:35,503 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-28 03:07:35,504 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-28 03:07:35,504 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-28 03:07:35,505 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-28 03:07:35,505 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-28 03:07:35,506 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-28 03:07:35,506 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-28 03:07:35,506 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-28 03:07:35,507 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-28 03:07:35,507 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-28 03:07:35,508 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-28 03:07:35,508 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-28 03:07:35,509 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-28 03:07:35,509 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-28 03:07:35,510 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-28 03:07:35,510 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-28 03:07:35,511 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-28 03:07:35,511 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-28 03:07:35,512 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-28 03:07:35,512 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-28 03:07:35,513 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-28 03:07:35,513 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-28 03:07:35,513 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-28 03:07:35,513 INFO L290 TraceCheckUtils]: 61: Hoare triple {30889#false} ~cond := #in~cond; {30889#false} is VALID [2022-04-28 03:07:35,513 INFO L290 TraceCheckUtils]: 62: Hoare triple {30889#false} assume 0 == ~cond; {30889#false} is VALID [2022-04-28 03:07:35,514 INFO L290 TraceCheckUtils]: 63: Hoare triple {30889#false} assume !false; {30889#false} is VALID [2022-04-28 03:07:35,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:07:35,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:07:35,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444227826] [2022-04-28 03:07:35,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444227826] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:07:35,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1393282279] [2022-04-28 03:07:35,514 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:07:35,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:07:35,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:07:35,515 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-28 03:07:35,516 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-28 03:07:35,658 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:07:35,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:07:35,660 WARN L261 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 109 conjunts are in the unsatisfiable core [2022-04-28 03:07:35,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:35,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:07:36,279 INFO L272 TraceCheckUtils]: 0: Hoare triple {30888#true} call ULTIMATE.init(); {30888#true} is VALID [2022-04-28 03:07:36,279 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-28 03:07:36,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {30888#true} assume true; {30888#true} is VALID [2022-04-28 03:07:36,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30888#true} {30888#true} #34#return; {30888#true} is VALID [2022-04-28 03:07:36,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {30888#true} call #t~ret4 := main(); {30888#true} is VALID [2022-04-28 03:07:36,279 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-28 03:07:36,280 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-28 03:07:36,280 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-28 03:07:36,281 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-28 03:07:36,281 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-28 03:07:36,282 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-28 03:07:36,282 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-28 03:07:36,283 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-28 03:07:36,283 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-28 03:07:36,284 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-28 03:07:36,284 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-28 03:07:36,285 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-28 03:07:36,285 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-28 03:07:36,286 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-28 03:07:36,286 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-28 03:07:36,287 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-28 03:07:36,287 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-28 03:07:36,288 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-28 03:07:36,288 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-28 03:07:36,289 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-28 03:07:36,289 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-28 03:07:36,290 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-28 03:07:36,290 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-28 03:07:36,291 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-28 03:07:36,291 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-28 03:07:36,292 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-28 03:07:36,292 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-28 03:07:36,293 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-28 03:07:36,293 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-28 03:07:36,294 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-28 03:07:36,294 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-28 03:07:36,295 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-28 03:07:36,295 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-28 03:07:36,296 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-28 03:07:36,296 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-28 03:07:36,297 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-28 03:07:36,297 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-28 03:07:36,298 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-28 03:07:36,298 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-28 03:07:36,298 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-28 03:07:36,299 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-28 03:07:36,299 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-28 03:07:36,300 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-28 03:07:36,300 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-28 03:07:36,301 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-28 03:07:36,301 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-28 03:07:36,302 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-28 03:07:36,302 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-28 03:07:36,303 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-28 03:07:36,303 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-28 03:07:36,304 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-28 03:07:36,304 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-28 03:07:36,305 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-28 03:07:36,305 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-28 03:07:36,306 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-28 03:07:36,306 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-28 03:07:36,306 INFO L290 TraceCheckUtils]: 61: Hoare triple {30889#false} ~cond := #in~cond; {30889#false} is VALID [2022-04-28 03:07:36,306 INFO L290 TraceCheckUtils]: 62: Hoare triple {30889#false} assume 0 == ~cond; {30889#false} is VALID [2022-04-28 03:07:36,306 INFO L290 TraceCheckUtils]: 63: Hoare triple {30889#false} assume !false; {30889#false} is VALID [2022-04-28 03:07:36,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:07:36,306 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:07:40,770 INFO L290 TraceCheckUtils]: 63: Hoare triple {30889#false} assume !false; {30889#false} is VALID [2022-04-28 03:07:40,770 INFO L290 TraceCheckUtils]: 62: Hoare triple {30889#false} assume 0 == ~cond; {30889#false} is VALID [2022-04-28 03:07:40,770 INFO L290 TraceCheckUtils]: 61: Hoare triple {30889#false} ~cond := #in~cond; {30889#false} is VALID [2022-04-28 03:07:40,771 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-28 03:07:40,771 INFO L290 TraceCheckUtils]: 59: Hoare triple {31153#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {30889#false} is VALID [2022-04-28 03:07:40,772 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-28 03:07:40,772 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-28 03:07:40,773 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-28 03:07:40,774 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-28 03:07:40,774 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-28 03:07:40,775 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-28 03:07:40,776 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-28 03:07:40,778 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-28 03:07:40,778 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-28 03:07:40,779 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-28 03:07:40,780 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-28 03:07:40,781 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-28 03:07:40,783 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-28 03:07:40,784 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-28 03:07:40,784 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-28 03:07:40,785 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-28 03:07:40,785 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-28 03:07:40,786 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-28 03:07:40,787 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-28 03:07:40,788 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-28 03:07:40,789 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-28 03:07:40,789 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-28 03:07:40,790 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-28 03:07:40,792 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-28 03:07:40,792 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-28 03:07:40,793 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-28 03:07:40,793 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-28 03:07:40,794 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-28 03:07:40,795 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-28 03:07:40,795 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-28 03:07:40,796 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-28 03:07:40,796 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-28 03:07:40,797 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-28 03:07:40,798 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-28 03:07:40,798 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-28 03:07:40,799 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-28 03:07:40,800 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-28 03:07:40,801 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-28 03:07:40,802 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-28 03:07:40,802 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-28 03:07:40,803 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-28 03:07:40,804 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-28 03:07:40,804 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-28 03:07:40,805 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-28 03:07:40,806 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-28 03:07:40,806 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-28 03:07:40,807 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-28 03:07:40,807 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-28 03:07:40,808 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-28 03:07:40,809 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-28 03:07:40,810 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-28 03:07:40,811 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-28 03:07:40,812 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-28 03:07:40,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {30888#true} ~x~0 := 268435441; {31365#(< 1 (mod (+ main_~x~0 4294967190) 4294967296))} is VALID [2022-04-28 03:07:40,812 INFO L272 TraceCheckUtils]: 4: Hoare triple {30888#true} call #t~ret4 := main(); {30888#true} is VALID [2022-04-28 03:07:40,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30888#true} {30888#true} #34#return; {30888#true} is VALID [2022-04-28 03:07:40,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {30888#true} assume true; {30888#true} is VALID [2022-04-28 03:07:40,813 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-28 03:07:40,813 INFO L272 TraceCheckUtils]: 0: Hoare triple {30888#true} call ULTIMATE.init(); {30888#true} is VALID [2022-04-28 03:07:40,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:07:40,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1393282279] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:07:40,813 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:07:40,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 56, 56] total 112 [2022-04-28 03:07:40,814 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:07:40,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [661577490] [2022-04-28 03:07:40,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [661577490] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:07:40,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:07:40,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [57] imperfect sequences [] total 57 [2022-04-28 03:07:40,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239565381] [2022-04-28 03:07:40,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:07:40,815 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-28 03:07:40,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:07:40,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 57 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:40,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:07:40,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-04-28 03:07:40,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:07:40,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-04-28 03:07:40,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3245, Invalid=9187, Unknown=0, NotChecked=0, Total=12432 [2022-04-28 03:07:40,850 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand has 57 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:46,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:46,531 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2022-04-28 03:07:46,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-04-28 03:07:46,531 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-28 03:07:46,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:07:46,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:46,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 71 transitions. [2022-04-28 03:07:46,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:46,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 71 transitions. [2022-04-28 03:07:46,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 71 transitions. [2022-04-28 03:07:46,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:07:46,577 INFO L225 Difference]: With dead ends: 71 [2022-04-28 03:07:46,577 INFO L226 Difference]: Without dead ends: 66 [2022-04-28 03:07:46,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1542 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=6483, Invalid=20907, Unknown=0, NotChecked=0, Total=27390 [2022-04-28 03:07:46,579 INFO L413 NwaCegarLoop]: 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-28 03:07:46,579 INFO L414 NwaCegarLoop]: 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-28 03:07:46,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-28 03:07:46,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-04-28 03:07:46,664 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:07:46,664 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 66 states, 61 states have (on average 1.0163934426229508) internal successors, (62), 61 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:46,665 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 66 states, 61 states have (on average 1.0163934426229508) internal successors, (62), 61 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:46,665 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 66 states, 61 states have (on average 1.0163934426229508) internal successors, (62), 61 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:46,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:46,665 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2022-04-28 03:07:46,665 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2022-04-28 03:07:46,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:07:46,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:07:46,666 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 61 states have (on average 1.0163934426229508) internal successors, (62), 61 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 66 states. [2022-04-28 03:07:46,666 INFO L87 Difference]: Start difference. First operand has 66 states, 61 states have (on average 1.0163934426229508) internal successors, (62), 61 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 66 states. [2022-04-28 03:07:46,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:46,666 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2022-04-28 03:07:46,666 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2022-04-28 03:07:46,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:07:46,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:07:46,666 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:07:46,666 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:07:46,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 1.0163934426229508) internal successors, (62), 61 states have internal predecessors, (62), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:46,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2022-04-28 03:07:46,667 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2022-04-28 03:07:46,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:07:46,667 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2022-04-28 03:07:46,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 1.0526315789473684) internal successors, (60), 56 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:07:46,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 66 transitions. [2022-04-28 03:07:46,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:07:46,719 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2022-04-28 03:07:46,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-28 03:07:46,719 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:07:46,719 INFO L195 NwaCegarLoop]: trace histogram [54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:07:46,723 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-28 03:07:46,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Ended with exit code 0 [2022-04-28 03:07:47,120 WARN L477 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-28 03:07:47,120 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:07:47,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:07:47,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1874355100, now seen corresponding path program 107 times [2022-04-28 03:07:47,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:07:47,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1707596832] [2022-04-28 03:07:47,257 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-28 03:07:47,258 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:07:47,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1265275447, now seen corresponding path program 1 times [2022-04-28 03:07:47,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:07:47,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669336036] [2022-04-28 03:07:47,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:07:47,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:07:47,264 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-28 03:07:47,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:07:47,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1403081200] [2022-04-28 03:07:47,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:07:47,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:07:47,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:07:47,268 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-28 03:07:47,269 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-28 03:07:47,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:07:47,290 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:07:47,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:07:47,309 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:07:47,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1874355100, now seen corresponding path program 108 times [2022-04-28 03:07:47,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:07:47,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669659515] [2022-04-28 03:07:47,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:07:47,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:07:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:48,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:07:48,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:48,847 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-28 03:07:48,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {31900#true} assume true; {31900#true} is VALID [2022-04-28 03:07:48,847 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31900#true} {31900#true} #34#return; {31900#true} is VALID [2022-04-28 03:07:48,847 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-28 03:07:48,847 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-28 03:07:48,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {31900#true} assume true; {31900#true} is VALID [2022-04-28 03:07:48,848 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31900#true} {31900#true} #34#return; {31900#true} is VALID [2022-04-28 03:07:48,848 INFO L272 TraceCheckUtils]: 4: Hoare triple {31900#true} call #t~ret4 := main(); {31900#true} is VALID [2022-04-28 03:07:48,848 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-28 03:07:48,848 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-28 03:07:48,849 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-28 03:07:48,849 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-28 03:07:48,850 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-28 03:07:48,850 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-28 03:07:48,851 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-28 03:07:48,851 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-28 03:07:48,852 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-28 03:07:48,852 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-28 03:07:48,853 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-28 03:07:48,853 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-28 03:07:48,854 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-28 03:07:48,854 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-28 03:07:48,855 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-28 03:07:48,855 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-28 03:07:48,856 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-28 03:07:48,856 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-28 03:07:48,857 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-28 03:07:48,857 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-28 03:07:48,858 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-28 03:07:48,858 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-28 03:07:48,859 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-28 03:07:48,859 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-28 03:07:48,860 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-28 03:07:48,860 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-28 03:07:48,861 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-28 03:07:48,861 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-28 03:07:48,862 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-28 03:07:48,862 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-28 03:07:48,863 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-28 03:07:48,863 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-28 03:07:48,864 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-28 03:07:48,864 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-28 03:07:48,864 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-28 03:07:48,865 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-28 03:07:48,865 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-28 03:07:48,866 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-28 03:07:48,866 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-28 03:07:48,867 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-28 03:07:48,867 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-28 03:07:48,868 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-28 03:07:48,868 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-28 03:07:48,869 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-28 03:07:48,869 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-28 03:07:48,870 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-28 03:07:48,870 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-28 03:07:48,871 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-28 03:07:48,871 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-28 03:07:48,872 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-28 03:07:48,872 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-28 03:07:48,873 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-28 03:07:48,873 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-28 03:07:48,874 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-28 03:07:48,874 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-28 03:07:48,875 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-28 03:07:48,875 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-28 03:07:48,875 INFO L290 TraceCheckUtils]: 62: Hoare triple {31901#false} ~cond := #in~cond; {31901#false} is VALID [2022-04-28 03:07:48,875 INFO L290 TraceCheckUtils]: 63: Hoare triple {31901#false} assume 0 == ~cond; {31901#false} is VALID [2022-04-28 03:07:48,875 INFO L290 TraceCheckUtils]: 64: Hoare triple {31901#false} assume !false; {31901#false} is VALID [2022-04-28 03:07:48,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:07:48,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:07:48,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669659515] [2022-04-28 03:07:48,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669659515] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:07:48,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1751426022] [2022-04-28 03:07:48,876 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:07:48,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:07:48,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:07:48,877 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-28 03:07:48,887 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-28 03:08:04,317 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2022-04-28 03:08:04,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:08:04,326 WARN L261 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 114 conjunts are in the unsatisfiable core [2022-04-28 03:08:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:04,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:08:04,883 INFO L272 TraceCheckUtils]: 0: Hoare triple {31900#true} call ULTIMATE.init(); {31900#true} is VALID [2022-04-28 03:08:04,883 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-28 03:08:04,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {31900#true} assume true; {31900#true} is VALID [2022-04-28 03:08:04,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31900#true} {31900#true} #34#return; {31900#true} is VALID [2022-04-28 03:08:04,883 INFO L272 TraceCheckUtils]: 4: Hoare triple {31900#true} call #t~ret4 := main(); {31900#true} is VALID [2022-04-28 03:08:04,884 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-28 03:08:04,884 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-28 03:08:04,885 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-28 03:08:04,885 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-28 03:08:04,886 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-28 03:08:04,886 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-28 03:08:04,887 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-28 03:08:04,887 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-28 03:08:04,888 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-28 03:08:04,888 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-28 03:08:04,888 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-28 03:08:04,889 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-28 03:08:04,889 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-28 03:08:04,890 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-28 03:08:04,890 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-28 03:08:04,891 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-28 03:08:04,891 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-28 03:08:04,892 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-28 03:08:04,892 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-28 03:08:04,893 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-28 03:08:04,893 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-28 03:08:04,894 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-28 03:08:04,894 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-28 03:08:04,895 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-28 03:08:04,895 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-28 03:08:04,896 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-28 03:08:04,896 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-28 03:08:04,897 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-28 03:08:04,897 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-28 03:08:04,898 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-28 03:08:04,898 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-28 03:08:04,899 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-28 03:08:04,899 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-28 03:08:04,900 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-28 03:08:04,900 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-28 03:08:04,901 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-28 03:08:04,901 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-28 03:08:04,902 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-28 03:08:04,902 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-28 03:08:04,902 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-28 03:08:04,903 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-28 03:08:04,903 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-28 03:08:04,904 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-28 03:08:04,904 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-28 03:08:04,905 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-28 03:08:04,905 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-28 03:08:04,906 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-28 03:08:04,906 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-28 03:08:04,907 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-28 03:08:04,907 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-28 03:08:04,908 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-28 03:08:04,908 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-28 03:08:04,909 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-28 03:08:04,909 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-28 03:08:04,910 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-28 03:08:04,910 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-28 03:08:04,910 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-28 03:08:04,910 INFO L290 TraceCheckUtils]: 62: Hoare triple {31901#false} ~cond := #in~cond; {31901#false} is VALID [2022-04-28 03:08:04,910 INFO L290 TraceCheckUtils]: 63: Hoare triple {31901#false} assume 0 == ~cond; {31901#false} is VALID [2022-04-28 03:08:04,910 INFO L290 TraceCheckUtils]: 64: Hoare triple {31901#false} assume !false; {31901#false} is VALID [2022-04-28 03:08:04,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:08:04,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:08:10,870 INFO L290 TraceCheckUtils]: 64: Hoare triple {31901#false} assume !false; {31901#false} is VALID [2022-04-28 03:08:10,870 INFO L290 TraceCheckUtils]: 63: Hoare triple {32160#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {31901#false} is VALID [2022-04-28 03:08:10,871 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-28 03:08:10,871 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-28 03:08:10,871 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-28 03:08:10,875 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-28 03:08:10,876 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-28 03:08:10,876 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-28 03:08:10,877 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-28 03:08:10,878 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-28 03:08:10,879 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-28 03:08:10,879 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-28 03:08:10,881 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-28 03:08:10,882 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-28 03:08:10,882 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-28 03:08:10,883 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-28 03:08:10,884 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-28 03:08:10,884 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-28 03:08:10,885 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-28 03:08:10,886 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-28 03:08:10,888 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-28 03:08:10,890 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-28 03:08:10,891 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-28 03:08:10,891 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-28 03:08:10,892 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-28 03:08:10,894 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-28 03:08:10,895 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-28 03:08:10,895 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-28 03:08:10,896 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-28 03:08:10,897 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-28 03:08:10,897 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-28 03:08:10,898 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-28 03:08:10,900 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-28 03:08:10,900 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-28 03:08:10,901 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-28 03:08:10,902 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-28 03:08:10,904 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-28 03:08:10,905 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-28 03:08:10,906 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-28 03:08:10,906 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-28 03:08:10,908 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-28 03:08:10,909 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-28 03:08:10,909 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-28 03:08:10,910 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-28 03:08:10,911 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-28 03:08:10,912 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-28 03:08:10,913 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-28 03:08:10,914 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-28 03:08:10,914 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-28 03:08:10,915 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-28 03:08:10,916 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-28 03:08:10,917 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-28 03:08:10,917 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-28 03:08:10,918 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-28 03:08:10,921 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-28 03:08:10,922 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-28 03:08:10,923 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-28 03:08:10,925 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-28 03:08:10,925 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-28 03:08:10,926 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-28 03:08:10,926 INFO L272 TraceCheckUtils]: 4: Hoare triple {31900#true} call #t~ret4 := main(); {31900#true} is VALID [2022-04-28 03:08:10,926 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31900#true} {31900#true} #34#return; {31900#true} is VALID [2022-04-28 03:08:10,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {31900#true} assume true; {31900#true} is VALID [2022-04-28 03:08:10,926 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-28 03:08:10,926 INFO L272 TraceCheckUtils]: 0: Hoare triple {31900#true} call ULTIMATE.init(); {31900#true} is VALID [2022-04-28 03:08:10,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:08:10,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1751426022] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:08:10,927 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:08:10,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 57, 60] total 117 [2022-04-28 03:08:10,927 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:08:10,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1707596832] [2022-04-28 03:08:10,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1707596832] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:08:10,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:08:10,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [58] imperfect sequences [] total 58 [2022-04-28 03:08:10,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344650325] [2022-04-28 03:08:10,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:08:10,928 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 57 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-28 03:08:10,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:08:10,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 58 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 57 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:10,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:08:10,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-04-28 03:08:10,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:08:10,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-04-28 03:08:10,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3421, Invalid=10151, Unknown=0, NotChecked=0, Total=13572 [2022-04-28 03:08:10,981 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand has 58 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 57 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:16,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:16,959 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2022-04-28 03:08:16,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-04-28 03:08:16,959 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 57 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2022-04-28 03:08:16,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:08:16,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 57 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:16,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2022-04-28 03:08:16,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 57 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:16,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2022-04-28 03:08:16,961 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 72 transitions. [2022-04-28 03:08:17,005 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:08:17,006 INFO L225 Difference]: With dead ends: 72 [2022-04-28 03:08:17,006 INFO L226 Difference]: Without dead ends: 67 [2022-04-28 03:08:17,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1604 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=6774, Invalid=22638, Unknown=0, NotChecked=0, Total=29412 [2022-04-28 03:08:17,008 INFO L413 NwaCegarLoop]: 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.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:08:17,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 163 Invalid, 3233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 3122 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 03:08:17,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-28 03:08:17,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-28 03:08:17,081 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:08:17,081 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:17,081 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:17,081 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:17,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:17,082 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2022-04-28 03:08:17,082 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2022-04-28 03:08:17,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:08:17,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:08:17,082 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-28 03:08:17,083 INFO L87 Difference]: Start difference. First operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-28 03:08:17,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:17,083 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2022-04-28 03:08:17,083 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2022-04-28 03:08:17,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:08:17,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:08:17,084 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:08:17,084 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:08:17,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:17,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2022-04-28 03:08:17,085 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2022-04-28 03:08:17,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:08:17,085 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2022-04-28 03:08:17,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 57 states have internal predecessors, (61), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:17,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 67 transitions. [2022-04-28 03:08:17,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:08:17,135 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2022-04-28 03:08:17,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 03:08:17,135 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:08:17,135 INFO L195 NwaCegarLoop]: trace histogram [55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:08:17,139 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-28 03:08:17,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Ended with exit code 0 [2022-04-28 03:08:17,536 WARN L477 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-28 03:08:17,536 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:08:17,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:08:17,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1988072778, now seen corresponding path program 109 times [2022-04-28 03:08:17,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:08:17,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1543744204] [2022-04-28 03:08:17,652 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-28 03:08:17,653 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:08:17,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1324380791, now seen corresponding path program 1 times [2022-04-28 03:08:17,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:08:17,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761068080] [2022-04-28 03:08:17,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:08:17,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:08:17,659 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-28 03:08:17,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:08:17,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1128947101] [2022-04-28 03:08:17,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:08:17,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:08:17,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:08:17,664 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-28 03:08:17,686 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-28 03:08:17,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:08:17,718 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:08:17,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:08:17,726 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:08:17,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1988072778, now seen corresponding path program 110 times [2022-04-28 03:08:17,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:08:17,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809366875] [2022-04-28 03:08:17,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:08:17,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:08:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:19,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:08:19,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:19,272 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-28 03:08:19,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {32931#true} assume true; {32931#true} is VALID [2022-04-28 03:08:19,273 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32931#true} {32931#true} #34#return; {32931#true} is VALID [2022-04-28 03:08:19,273 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-28 03:08:19,273 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-28 03:08:19,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {32931#true} assume true; {32931#true} is VALID [2022-04-28 03:08:19,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32931#true} {32931#true} #34#return; {32931#true} is VALID [2022-04-28 03:08:19,273 INFO L272 TraceCheckUtils]: 4: Hoare triple {32931#true} call #t~ret4 := main(); {32931#true} is VALID [2022-04-28 03:08:19,274 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-28 03:08:19,274 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-28 03:08:19,275 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-28 03:08:19,275 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-28 03:08:19,276 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-28 03:08:19,276 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-28 03:08:19,277 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-28 03:08:19,277 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-28 03:08:19,278 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-28 03:08:19,278 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-28 03:08:19,279 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-28 03:08:19,279 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-28 03:08:19,280 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-28 03:08:19,280 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-28 03:08:19,281 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-28 03:08:19,281 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-28 03:08:19,282 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-28 03:08:19,282 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-28 03:08:19,282 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-28 03:08:19,283 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-28 03:08:19,283 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-28 03:08:19,284 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-28 03:08:19,284 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-28 03:08:19,285 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-28 03:08:19,285 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-28 03:08:19,286 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-28 03:08:19,286 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-28 03:08:19,287 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-28 03:08:19,287 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-28 03:08:19,288 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-28 03:08:19,288 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-28 03:08:19,289 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-28 03:08:19,289 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-28 03:08:19,290 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-28 03:08:19,290 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-28 03:08:19,291 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-28 03:08:19,291 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-28 03:08:19,292 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-28 03:08:19,292 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-28 03:08:19,293 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-28 03:08:19,293 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-28 03:08:19,294 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-28 03:08:19,294 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-28 03:08:19,295 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-28 03:08:19,295 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-28 03:08:19,295 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-28 03:08:19,296 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-28 03:08:19,296 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-28 03:08:19,297 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-28 03:08:19,297 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-28 03:08:19,298 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-28 03:08:19,298 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-28 03:08:19,299 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-28 03:08:19,299 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-28 03:08:19,300 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-28 03:08:19,300 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-28 03:08:19,301 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-28 03:08:19,301 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-28 03:08:19,301 INFO L290 TraceCheckUtils]: 63: Hoare triple {32932#false} ~cond := #in~cond; {32932#false} is VALID [2022-04-28 03:08:19,301 INFO L290 TraceCheckUtils]: 64: Hoare triple {32932#false} assume 0 == ~cond; {32932#false} is VALID [2022-04-28 03:08:19,301 INFO L290 TraceCheckUtils]: 65: Hoare triple {32932#false} assume !false; {32932#false} is VALID [2022-04-28 03:08:19,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:08:19,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:08:19,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809366875] [2022-04-28 03:08:19,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809366875] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:08:19,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795301442] [2022-04-28 03:08:19,302 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:08:19,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:08:19,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:08:19,303 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-28 03:08:19,303 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-28 03:08:19,356 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:08:19,357 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:08:19,358 WARN L261 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 116 conjunts are in the unsatisfiable core [2022-04-28 03:08:19,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:19,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:08:19,926 INFO L272 TraceCheckUtils]: 0: Hoare triple {32931#true} call ULTIMATE.init(); {32931#true} is VALID [2022-04-28 03:08:19,927 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-28 03:08:19,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {32931#true} assume true; {32931#true} is VALID [2022-04-28 03:08:19,927 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32931#true} {32931#true} #34#return; {32931#true} is VALID [2022-04-28 03:08:19,927 INFO L272 TraceCheckUtils]: 4: Hoare triple {32931#true} call #t~ret4 := main(); {32931#true} is VALID [2022-04-28 03:08:19,927 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-28 03:08:19,928 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-28 03:08:19,928 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-28 03:08:19,929 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-28 03:08:19,929 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-28 03:08:19,930 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-28 03:08:19,930 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-28 03:08:19,931 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-28 03:08:19,931 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-28 03:08:19,932 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-28 03:08:19,932 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-28 03:08:19,933 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-28 03:08:19,933 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-28 03:08:19,934 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-28 03:08:19,934 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-28 03:08:19,935 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-28 03:08:19,935 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-28 03:08:19,936 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-28 03:08:19,936 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-28 03:08:19,937 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-28 03:08:19,938 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-28 03:08:19,939 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-28 03:08:19,939 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-28 03:08:19,940 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-28 03:08:19,940 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-28 03:08:19,941 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-28 03:08:19,941 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-28 03:08:19,942 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-28 03:08:19,942 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-28 03:08:19,943 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-28 03:08:19,943 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-28 03:08:19,944 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-28 03:08:19,944 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-28 03:08:19,945 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-28 03:08:19,945 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-28 03:08:19,946 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-28 03:08:19,946 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-28 03:08:19,947 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-28 03:08:19,947 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-28 03:08:19,948 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-28 03:08:19,948 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-28 03:08:19,949 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-28 03:08:19,949 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-28 03:08:19,950 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-28 03:08:19,950 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-28 03:08:19,951 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-28 03:08:19,951 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-28 03:08:19,952 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-28 03:08:19,952 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-28 03:08:19,952 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-28 03:08:19,953 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-28 03:08:19,953 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-28 03:08:19,954 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-28 03:08:19,954 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-28 03:08:19,955 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-28 03:08:19,955 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-28 03:08:19,956 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-28 03:08:19,956 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-28 03:08:19,956 INFO L290 TraceCheckUtils]: 63: Hoare triple {32932#false} ~cond := #in~cond; {32932#false} is VALID [2022-04-28 03:08:19,956 INFO L290 TraceCheckUtils]: 64: Hoare triple {32932#false} assume 0 == ~cond; {32932#false} is VALID [2022-04-28 03:08:19,956 INFO L290 TraceCheckUtils]: 65: Hoare triple {32932#false} assume !false; {32932#false} is VALID [2022-04-28 03:08:19,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:08:19,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:08:26,163 INFO L290 TraceCheckUtils]: 65: Hoare triple {32932#false} assume !false; {32932#false} is VALID [2022-04-28 03:08:26,163 INFO L290 TraceCheckUtils]: 64: Hoare triple {33195#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {32932#false} is VALID [2022-04-28 03:08:26,164 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-28 03:08:26,164 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-28 03:08:26,164 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-28 03:08:26,166 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-28 03:08:26,167 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-28 03:08:26,167 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-28 03:08:26,168 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-28 03:08:26,169 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-28 03:08:26,170 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-28 03:08:26,171 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-28 03:08:26,172 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-28 03:08:26,173 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-28 03:08:26,173 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-28 03:08:26,174 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-28 03:08:26,175 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-28 03:08:26,176 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-28 03:08:26,176 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-28 03:08:26,177 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-28 03:08:26,178 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-28 03:08:26,180 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-28 03:08:26,182 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-28 03:08:26,182 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-28 03:08:26,183 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-28 03:08:26,184 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-28 03:08:26,185 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-28 03:08:26,186 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-28 03:08:26,187 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-28 03:08:26,188 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-28 03:08:26,189 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-28 03:08:26,189 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-28 03:08:26,190 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-28 03:08:26,191 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-28 03:08:26,192 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-28 03:08:26,192 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-28 03:08:26,196 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-28 03:08:26,197 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-28 03:08:26,198 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-28 03:08:26,199 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-28 03:08:26,200 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-28 03:08:26,200 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-28 03:08:26,201 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-28 03:08:26,202 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-28 03:08:26,203 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-28 03:08:26,204 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-28 03:08:26,205 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-28 03:08:26,206 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-28 03:08:26,207 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-28 03:08:26,208 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-28 03:08:26,208 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-28 03:08:26,210 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-28 03:08:26,211 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-28 03:08:26,213 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-28 03:08:26,214 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-28 03:08:26,215 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-28 03:08:26,216 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-28 03:08:26,217 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-28 03:08:26,218 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-28 03:08:26,219 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-28 03:08:26,219 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-28 03:08:26,219 INFO L272 TraceCheckUtils]: 4: Hoare triple {32931#true} call #t~ret4 := main(); {32931#true} is VALID [2022-04-28 03:08:26,219 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32931#true} {32931#true} #34#return; {32931#true} is VALID [2022-04-28 03:08:26,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {32931#true} assume true; {32931#true} is VALID [2022-04-28 03:08:26,219 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-28 03:08:26,219 INFO L272 TraceCheckUtils]: 0: Hoare triple {32931#true} call ULTIMATE.init(); {32931#true} is VALID [2022-04-28 03:08:26,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:08:26,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795301442] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:08:26,220 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:08:26,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 58, 61] total 119 [2022-04-28 03:08:26,220 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:08:26,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1543744204] [2022-04-28 03:08:26,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1543744204] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:08:26,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:08:26,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2022-04-28 03:08:26,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716740417] [2022-04-28 03:08:26,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:08:26,221 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 58 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-28 03:08:26,221 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:08:26,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 59 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 58 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:26,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:08:26,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-04-28 03:08:26,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:08:26,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-04-28 03:08:26,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3539, Invalid=10503, Unknown=0, NotChecked=0, Total=14042 [2022-04-28 03:08:26,258 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand has 59 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 58 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:32,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:32,518 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2022-04-28 03:08:32,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-04-28 03:08:32,518 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 58 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-28 03:08:32,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:08:32,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 58 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:32,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2022-04-28 03:08:32,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 58 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:32,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2022-04-28 03:08:32,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 73 transitions. [2022-04-28 03:08:32,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:08:32,586 INFO L225 Difference]: With dead ends: 73 [2022-04-28 03:08:32,586 INFO L226 Difference]: Without dead ends: 68 [2022-04-28 03:08:32,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1661 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=7009, Invalid=23441, Unknown=0, NotChecked=0, Total=30450 [2022-04-28 03:08:32,589 INFO L413 NwaCegarLoop]: 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-28 03:08:32,589 INFO L414 NwaCegarLoop]: 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-28 03:08:32,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-28 03:08:32,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-04-28 03:08:32,663 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:08:32,663 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 68 states, 63 states have (on average 1.0158730158730158) internal successors, (64), 63 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:32,663 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 68 states, 63 states have (on average 1.0158730158730158) internal successors, (64), 63 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:32,663 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 68 states, 63 states have (on average 1.0158730158730158) internal successors, (64), 63 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:32,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:32,664 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2022-04-28 03:08:32,664 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2022-04-28 03:08:32,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:08:32,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:08:32,664 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 63 states have (on average 1.0158730158730158) internal successors, (64), 63 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states. [2022-04-28 03:08:32,664 INFO L87 Difference]: Start difference. First operand has 68 states, 63 states have (on average 1.0158730158730158) internal successors, (64), 63 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states. [2022-04-28 03:08:32,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:32,665 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2022-04-28 03:08:32,665 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2022-04-28 03:08:32,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:08:32,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:08:32,665 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:08:32,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:08:32,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 63 states have (on average 1.0158730158730158) internal successors, (64), 63 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:32,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2022-04-28 03:08:32,666 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2022-04-28 03:08:32,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:08:32,666 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2022-04-28 03:08:32,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 58 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:32,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 68 transitions. [2022-04-28 03:08:32,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:08:32,716 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2022-04-28 03:08:32,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-28 03:08:32,717 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:08:32,717 INFO L195 NwaCegarLoop]: trace histogram [56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:08:32,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Ended with exit code 0 [2022-04-28 03:08:32,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Forceful destruction successful, exit code 0 [2022-04-28 03:08:33,119 WARN L477 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-28 03:08:33,119 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:08:33,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:08:33,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1464252708, now seen corresponding path program 111 times [2022-04-28 03:08:33,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:08:33,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [376015811] [2022-04-28 03:08:33,237 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-28 03:08:33,239 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:08:33,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1383486135, now seen corresponding path program 1 times [2022-04-28 03:08:33,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:08:33,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135693483] [2022-04-28 03:08:33,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:08:33,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:08:33,245 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-28 03:08:33,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:08:33,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [872256093] [2022-04-28 03:08:33,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:08:33,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:08:33,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:08:33,249 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-28 03:08:33,256 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-28 03:08:33,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:08:33,292 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:08:33,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:08:33,299 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:08:33,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1464252708, now seen corresponding path program 112 times [2022-04-28 03:08:33,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:08:33,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548782836] [2022-04-28 03:08:33,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:08:33,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:08:33,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:34,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:08:34,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:34,946 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-28 03:08:34,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {33978#true} assume true; {33978#true} is VALID [2022-04-28 03:08:34,947 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33978#true} {33978#true} #34#return; {33978#true} is VALID [2022-04-28 03:08:34,947 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-28 03:08:34,947 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-28 03:08:34,947 INFO L290 TraceCheckUtils]: 2: Hoare triple {33978#true} assume true; {33978#true} is VALID [2022-04-28 03:08:34,947 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33978#true} {33978#true} #34#return; {33978#true} is VALID [2022-04-28 03:08:34,947 INFO L272 TraceCheckUtils]: 4: Hoare triple {33978#true} call #t~ret4 := main(); {33978#true} is VALID [2022-04-28 03:08:34,948 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-28 03:08:34,948 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-28 03:08:34,949 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-28 03:08:34,949 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-28 03:08:34,950 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-28 03:08:34,950 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-28 03:08:34,951 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-28 03:08:34,951 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-28 03:08:34,952 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-28 03:08:34,952 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-28 03:08:34,953 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-28 03:08:34,953 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-28 03:08:34,954 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-28 03:08:34,954 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-28 03:08:34,955 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-28 03:08:34,955 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-28 03:08:34,956 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-28 03:08:34,956 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-28 03:08:34,957 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-28 03:08:34,957 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-28 03:08:34,958 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-28 03:08:34,958 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-28 03:08:34,959 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-28 03:08:34,959 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-28 03:08:34,960 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-28 03:08:34,960 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-28 03:08:34,961 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-28 03:08:34,961 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-28 03:08:34,961 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-28 03:08:34,962 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-28 03:08:34,962 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-28 03:08:34,963 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-28 03:08:34,963 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-28 03:08:34,964 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-28 03:08:34,964 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-28 03:08:34,965 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-28 03:08:34,965 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-28 03:08:34,966 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-28 03:08:34,966 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-28 03:08:34,967 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-28 03:08:34,967 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-28 03:08:34,968 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-28 03:08:34,968 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-28 03:08:34,969 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-28 03:08:34,969 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-28 03:08:34,970 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-28 03:08:34,970 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-28 03:08:34,971 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-28 03:08:34,971 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-28 03:08:34,972 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-28 03:08:34,972 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-28 03:08:34,973 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-28 03:08:34,973 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-28 03:08:34,974 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-28 03:08:34,974 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-28 03:08:34,975 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-28 03:08:34,975 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-28 03:08:34,976 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-28 03:08:34,976 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-28 03:08:34,976 INFO L290 TraceCheckUtils]: 64: Hoare triple {33979#false} ~cond := #in~cond; {33979#false} is VALID [2022-04-28 03:08:34,976 INFO L290 TraceCheckUtils]: 65: Hoare triple {33979#false} assume 0 == ~cond; {33979#false} is VALID [2022-04-28 03:08:34,976 INFO L290 TraceCheckUtils]: 66: Hoare triple {33979#false} assume !false; {33979#false} is VALID [2022-04-28 03:08:34,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:08:34,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:08:34,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548782836] [2022-04-28 03:08:34,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548782836] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:08:34,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322603189] [2022-04-28 03:08:34,977 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:08:34,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:08:34,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:08:34,978 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-28 03:08:34,978 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-28 03:08:35,118 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:08:35,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:08:35,120 WARN L261 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 115 conjunts are in the unsatisfiable core [2022-04-28 03:08:35,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:35,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:08:35,793 INFO L272 TraceCheckUtils]: 0: Hoare triple {33978#true} call ULTIMATE.init(); {33978#true} is VALID [2022-04-28 03:08:35,793 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-28 03:08:35,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {33978#true} assume true; {33978#true} is VALID [2022-04-28 03:08:35,794 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33978#true} {33978#true} #34#return; {33978#true} is VALID [2022-04-28 03:08:35,794 INFO L272 TraceCheckUtils]: 4: Hoare triple {33978#true} call #t~ret4 := main(); {33978#true} is VALID [2022-04-28 03:08:35,794 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-28 03:08:35,794 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-28 03:08:35,795 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-28 03:08:35,795 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-28 03:08:35,796 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-28 03:08:35,796 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-28 03:08:35,797 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-28 03:08:35,797 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-28 03:08:35,798 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-28 03:08:35,798 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-28 03:08:35,799 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-28 03:08:35,799 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-28 03:08:35,800 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-28 03:08:35,800 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-28 03:08:35,801 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-28 03:08:35,801 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-28 03:08:35,802 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-28 03:08:35,802 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-28 03:08:35,803 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-28 03:08:35,803 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-28 03:08:35,804 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-28 03:08:35,804 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-28 03:08:35,805 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-28 03:08:35,805 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-28 03:08:35,806 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-28 03:08:35,806 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-28 03:08:35,807 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-28 03:08:35,807 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-28 03:08:35,808 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-28 03:08:35,808 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-28 03:08:35,809 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-28 03:08:35,809 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-28 03:08:35,810 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-28 03:08:35,810 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-28 03:08:35,811 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-28 03:08:35,811 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-28 03:08:35,812 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-28 03:08:35,812 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-28 03:08:35,813 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-28 03:08:35,813 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-28 03:08:35,814 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-28 03:08:35,814 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-28 03:08:35,815 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-28 03:08:35,815 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-28 03:08:35,816 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-28 03:08:35,816 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-28 03:08:35,816 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-28 03:08:35,817 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-28 03:08:35,817 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-28 03:08:35,818 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-28 03:08:35,818 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-28 03:08:35,819 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-28 03:08:35,819 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-28 03:08:35,820 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-28 03:08:35,820 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-28 03:08:35,821 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-28 03:08:35,821 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-28 03:08:35,822 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-28 03:08:35,822 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-28 03:08:35,822 INFO L290 TraceCheckUtils]: 64: Hoare triple {33979#false} ~cond := #in~cond; {33979#false} is VALID [2022-04-28 03:08:35,822 INFO L290 TraceCheckUtils]: 65: Hoare triple {33979#false} assume 0 == ~cond; {33979#false} is VALID [2022-04-28 03:08:35,822 INFO L290 TraceCheckUtils]: 66: Hoare triple {33979#false} assume !false; {33979#false} is VALID [2022-04-28 03:08:35,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:08:35,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:08:40,849 INFO L290 TraceCheckUtils]: 66: Hoare triple {33979#false} assume !false; {33979#false} is VALID [2022-04-28 03:08:40,849 INFO L290 TraceCheckUtils]: 65: Hoare triple {33979#false} assume 0 == ~cond; {33979#false} is VALID [2022-04-28 03:08:40,849 INFO L290 TraceCheckUtils]: 64: Hoare triple {33979#false} ~cond := #in~cond; {33979#false} is VALID [2022-04-28 03:08:40,849 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-28 03:08:40,850 INFO L290 TraceCheckUtils]: 62: Hoare triple {34255#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {33979#false} is VALID [2022-04-28 03:08:40,851 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-28 03:08:40,852 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-28 03:08:40,852 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-28 03:08:40,854 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-28 03:08:40,854 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-28 03:08:40,855 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-28 03:08:40,856 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-28 03:08:40,856 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-28 03:08:40,858 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-28 03:08:40,859 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-28 03:08:40,859 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-28 03:08:40,860 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-28 03:08:40,861 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-28 03:08:40,862 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-28 03:08:40,863 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-28 03:08:40,863 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-28 03:08:40,864 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-28 03:08:40,868 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-28 03:08:40,869 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-28 03:08:40,870 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-28 03:08:40,870 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-28 03:08:40,871 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-28 03:08:40,872 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-28 03:08:40,872 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-28 03:08:40,873 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-28 03:08:40,873 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-28 03:08:40,874 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-28 03:08:40,875 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-28 03:08:40,875 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-28 03:08:40,876 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-28 03:08:40,876 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-28 03:08:40,877 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-28 03:08:40,878 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-28 03:08:40,878 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-28 03:08:40,881 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-28 03:08:40,881 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-28 03:08:40,882 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-28 03:08:40,883 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-28 03:08:40,883 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-28 03:08:40,884 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-28 03:08:40,885 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-28 03:08:40,885 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-28 03:08:40,886 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-28 03:08:40,887 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-28 03:08:40,887 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-28 03:08:40,888 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-28 03:08:40,889 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-28 03:08:40,889 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-28 03:08:40,890 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-28 03:08:40,890 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-28 03:08:40,891 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-28 03:08:40,892 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-28 03:08:40,892 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-28 03:08:40,893 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-28 03:08:40,894 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-28 03:08:40,894 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-28 03:08:40,895 INFO L290 TraceCheckUtils]: 5: Hoare triple {33978#true} ~x~0 := 268435441; {34479#(< 1 (mod (+ main_~x~0 4294967184) 4294967296))} is VALID [2022-04-28 03:08:40,895 INFO L272 TraceCheckUtils]: 4: Hoare triple {33978#true} call #t~ret4 := main(); {33978#true} is VALID [2022-04-28 03:08:40,895 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33978#true} {33978#true} #34#return; {33978#true} is VALID [2022-04-28 03:08:40,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {33978#true} assume true; {33978#true} is VALID [2022-04-28 03:08:40,895 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-28 03:08:40,895 INFO L272 TraceCheckUtils]: 0: Hoare triple {33978#true} call ULTIMATE.init(); {33978#true} is VALID [2022-04-28 03:08:40,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:08:40,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322603189] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:08:40,896 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:08:40,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 59, 59] total 118 [2022-04-28 03:08:40,896 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:08:40,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [376015811] [2022-04-28 03:08:40,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [376015811] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:08:40,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:08:40,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2022-04-28 03:08:40,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011243901] [2022-04-28 03:08:40,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:08:40,897 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 1.05) internal successors, (63), 59 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-28 03:08:40,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:08:40,897 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 60 states, 60 states have (on average 1.05) internal successors, (63), 59 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:40,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:08:40,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-04-28 03:08:40,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:08:40,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-04-28 03:08:40,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3596, Invalid=10210, Unknown=0, NotChecked=0, Total=13806 [2022-04-28 03:08:40,936 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand has 60 states, 60 states have (on average 1.05) internal successors, (63), 59 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:47,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:47,343 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2022-04-28 03:08:47,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-04-28 03:08:47,344 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 1.05) internal successors, (63), 59 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 67 [2022-04-28 03:08:47,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:08:47,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 1.05) internal successors, (63), 59 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:47,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2022-04-28 03:08:47,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 1.05) internal successors, (63), 59 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:47,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2022-04-28 03:08:47,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 74 transitions. [2022-04-28 03:08:47,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:08:47,392 INFO L225 Difference]: With dead ends: 74 [2022-04-28 03:08:47,392 INFO L226 Difference]: Without dead ends: 69 [2022-04-28 03:08:47,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1713 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=7185, Invalid=23265, Unknown=0, NotChecked=0, Total=30450 [2022-04-28 03:08:47,394 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 3329 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s 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.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:08:47,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 148 Invalid, 3444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 3329 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-28 03:08:47,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-28 03:08:47,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-04-28 03:08:47,468 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:08:47,468 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 69 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:47,468 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 69 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:47,468 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 69 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:47,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:47,469 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2022-04-28 03:08:47,469 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2022-04-28 03:08:47,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:08:47,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:08:47,469 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-28 03:08:47,469 INFO L87 Difference]: Start difference. First operand has 69 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-28 03:08:47,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:47,470 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2022-04-28 03:08:47,470 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2022-04-28 03:08:47,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:08:47,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:08:47,470 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:08:47,470 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:08:47,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.015625) internal successors, (65), 64 states have internal predecessors, (65), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:47,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2022-04-28 03:08:47,471 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2022-04-28 03:08:47,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:08:47,471 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2022-04-28 03:08:47,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 1.05) internal successors, (63), 59 states have internal predecessors, (63), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:47,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 69 transitions. [2022-04-28 03:08:47,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:08:47,522 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2022-04-28 03:08:47,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-28 03:08:47,522 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:08:47,522 INFO L195 NwaCegarLoop]: trace histogram [57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:08:47,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Forceful destruction successful, exit code 0 [2022-04-28 03:08:47,731 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-28 03:08:47,927 WARN L477 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-28 03:08:47,928 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:08:47,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:08:47,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1889267574, now seen corresponding path program 113 times [2022-04-28 03:08:47,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:08:47,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [62483553] [2022-04-28 03:08:48,045 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-28 03:08:48,047 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:08:48,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1442591479, now seen corresponding path program 1 times [2022-04-28 03:08:48,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:08:48,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30993870] [2022-04-28 03:08:48,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:08:48,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:08:48,053 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-28 03:08:48,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:08:48,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1318621044] [2022-04-28 03:08:48,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:08:48,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:08:48,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:08:48,056 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-28 03:08:48,057 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-28 03:08:48,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:08:48,096 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:08:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:08:48,104 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:08:48,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1889267574, now seen corresponding path program 114 times [2022-04-28 03:08:48,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:08:48,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378957764] [2022-04-28 03:08:48,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:08:48,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:08:48,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:49,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:08:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:49,806 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-28 03:08:49,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {35038#true} assume true; {35038#true} is VALID [2022-04-28 03:08:49,806 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35038#true} {35038#true} #34#return; {35038#true} is VALID [2022-04-28 03:08:49,807 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-28 03:08:49,807 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-28 03:08:49,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {35038#true} assume true; {35038#true} is VALID [2022-04-28 03:08:49,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35038#true} {35038#true} #34#return; {35038#true} is VALID [2022-04-28 03:08:49,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {35038#true} call #t~ret4 := main(); {35038#true} is VALID [2022-04-28 03:08:49,808 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-28 03:08:49,809 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-28 03:08:49,809 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-28 03:08:49,810 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-28 03:08:49,811 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-28 03:08:49,811 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-28 03:08:49,812 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-28 03:08:49,813 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-28 03:08:49,813 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-28 03:08:49,814 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-28 03:08:49,815 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-28 03:08:49,815 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-28 03:08:49,816 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-28 03:08:49,817 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-28 03:08:49,817 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-28 03:08:49,818 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-28 03:08:49,819 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-28 03:08:49,819 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-28 03:08:49,820 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-28 03:08:49,820 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-28 03:08:49,821 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-28 03:08:49,821 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-28 03:08:49,822 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-28 03:08:49,822 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-28 03:08:49,823 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-28 03:08:49,823 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-28 03:08:49,824 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-28 03:08:49,824 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-28 03:08:49,825 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-28 03:08:49,825 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-28 03:08:49,826 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-28 03:08:49,826 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-28 03:08:49,827 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-28 03:08:49,827 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-28 03:08:49,828 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-28 03:08:49,828 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-28 03:08:49,829 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-28 03:08:49,829 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-28 03:08:49,830 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-28 03:08:49,830 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-28 03:08:49,831 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-28 03:08:49,831 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-28 03:08:49,832 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-28 03:08:49,832 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-28 03:08:49,833 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-28 03:08:49,833 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-28 03:08:49,834 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-28 03:08:49,834 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-28 03:08:49,835 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-28 03:08:49,835 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-28 03:08:49,836 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-28 03:08:49,836 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-28 03:08:49,837 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-28 03:08:49,837 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-28 03:08:49,838 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-28 03:08:49,838 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-28 03:08:49,838 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-28 03:08:49,839 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-28 03:08:49,839 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-28 03:08:49,840 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-28 03:08:49,840 INFO L290 TraceCheckUtils]: 65: Hoare triple {35039#false} ~cond := #in~cond; {35039#false} is VALID [2022-04-28 03:08:49,840 INFO L290 TraceCheckUtils]: 66: Hoare triple {35039#false} assume 0 == ~cond; {35039#false} is VALID [2022-04-28 03:08:49,840 INFO L290 TraceCheckUtils]: 67: Hoare triple {35039#false} assume !false; {35039#false} is VALID [2022-04-28 03:08:49,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:08:49,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:08:49,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378957764] [2022-04-28 03:08:49,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378957764] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:08:49,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578730717] [2022-04-28 03:08:49,841 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:08:49,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:08:49,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:08:49,842 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-28 03:08:49,842 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-28 03:09:05,159 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 30 check-sat command(s) [2022-04-28 03:09:05,159 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:09:05,167 WARN L261 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 120 conjunts are in the unsatisfiable core [2022-04-28 03:09:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:05,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:09:05,832 INFO L272 TraceCheckUtils]: 0: Hoare triple {35038#true} call ULTIMATE.init(); {35038#true} is VALID [2022-04-28 03:09:05,832 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-28 03:09:05,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {35038#true} assume true; {35038#true} is VALID [2022-04-28 03:09:05,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35038#true} {35038#true} #34#return; {35038#true} is VALID [2022-04-28 03:09:05,832 INFO L272 TraceCheckUtils]: 4: Hoare triple {35038#true} call #t~ret4 := main(); {35038#true} is VALID [2022-04-28 03:09:05,833 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-28 03:09:05,833 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-28 03:09:05,834 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-28 03:09:05,834 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-28 03:09:05,835 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-28 03:09:05,835 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-28 03:09:05,836 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-28 03:09:05,836 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-28 03:09:05,837 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-28 03:09:05,837 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-28 03:09:05,838 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-28 03:09:05,838 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-28 03:09:05,839 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-28 03:09:05,839 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-28 03:09:05,840 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-28 03:09:05,840 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-28 03:09:05,841 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-28 03:09:05,841 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-28 03:09:05,842 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-28 03:09:05,842 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-28 03:09:05,843 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-28 03:09:05,843 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-28 03:09:05,844 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-28 03:09:05,844 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-28 03:09:05,845 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-28 03:09:05,845 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-28 03:09:05,846 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-28 03:09:05,846 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-28 03:09:05,846 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-28 03:09:05,847 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-28 03:09:05,847 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-28 03:09:05,848 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-28 03:09:05,848 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-28 03:09:05,849 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-28 03:09:05,849 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-28 03:09:05,850 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-28 03:09:05,850 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-28 03:09:05,851 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-28 03:09:05,851 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-28 03:09:05,852 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-28 03:09:05,852 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-28 03:09:05,853 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-28 03:09:05,853 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-28 03:09:05,854 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-28 03:09:05,854 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-28 03:09:05,855 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-28 03:09:05,855 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-28 03:09:05,856 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-28 03:09:05,856 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-28 03:09:05,857 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-28 03:09:05,857 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-28 03:09:05,858 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-28 03:09:05,858 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-28 03:09:05,859 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-28 03:09:05,859 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-28 03:09:05,860 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-28 03:09:05,860 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-28 03:09:05,861 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-28 03:09:05,861 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-28 03:09:05,861 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-28 03:09:05,861 INFO L290 TraceCheckUtils]: 65: Hoare triple {35039#false} ~cond := #in~cond; {35039#false} is VALID [2022-04-28 03:09:05,861 INFO L290 TraceCheckUtils]: 66: Hoare triple {35039#false} assume 0 == ~cond; {35039#false} is VALID [2022-04-28 03:09:05,861 INFO L290 TraceCheckUtils]: 67: Hoare triple {35039#false} assume !false; {35039#false} is VALID [2022-04-28 03:09:05,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:09:05,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:09:12,475 INFO L290 TraceCheckUtils]: 67: Hoare triple {35039#false} assume !false; {35039#false} is VALID [2022-04-28 03:09:12,476 INFO L290 TraceCheckUtils]: 66: Hoare triple {35310#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {35039#false} is VALID [2022-04-28 03:09:12,476 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-28 03:09:12,476 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-28 03:09:12,477 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-28 03:09:12,478 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-28 03:09:12,480 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-28 03:09:12,481 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-28 03:09:12,482 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-28 03:09:12,483 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-28 03:09:12,486 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-28 03:09:12,487 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-28 03:09:12,488 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-28 03:09:12,489 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-28 03:09:12,490 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-28 03:09:12,491 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-28 03:09:12,491 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-28 03:09:12,492 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-28 03:09:12,493 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-28 03:09:12,494 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-28 03:09:12,496 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-28 03:09:12,497 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-28 03:09:12,499 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-28 03:09:12,500 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-28 03:09:12,500 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-28 03:09:12,502 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-28 03:09:12,503 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-28 03:09:12,504 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-28 03:09:12,505 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-28 03:09:12,506 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-28 03:09:12,507 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-28 03:09:12,508 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-28 03:09:12,509 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-28 03:09:12,512 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-28 03:09:12,513 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-28 03:09:12,514 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-28 03:09:12,515 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-28 03:09:12,516 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-28 03:09:12,516 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-28 03:09:12,517 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-28 03:09:12,518 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-28 03:09:12,519 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-28 03:09:12,520 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-28 03:09:12,521 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-28 03:09:12,521 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-28 03:09:12,522 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-28 03:09:12,523 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-28 03:09:12,524 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-28 03:09:12,525 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-28 03:09:12,526 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-28 03:09:12,527 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-28 03:09:12,529 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-28 03:09:12,530 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-28 03:09:12,531 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-28 03:09:12,532 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-28 03:09:12,534 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-28 03:09:12,535 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-28 03:09:12,535 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-28 03:09:12,536 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-28 03:09:12,537 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-28 03:09:12,538 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-28 03:09:12,539 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-28 03:09:12,539 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-28 03:09:12,539 INFO L272 TraceCheckUtils]: 4: Hoare triple {35038#true} call #t~ret4 := main(); {35038#true} is VALID [2022-04-28 03:09:12,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35038#true} {35038#true} #34#return; {35038#true} is VALID [2022-04-28 03:09:12,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {35038#true} assume true; {35038#true} is VALID [2022-04-28 03:09:12,539 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-28 03:09:12,539 INFO L272 TraceCheckUtils]: 0: Hoare triple {35038#true} call ULTIMATE.init(); {35038#true} is VALID [2022-04-28 03:09:12,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:09:12,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578730717] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:09:12,540 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:09:12,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 60, 63] total 123 [2022-04-28 03:09:12,540 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:12,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [62483553] [2022-04-28 03:09:12,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [62483553] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:12,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:12,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2022-04-28 03:09:12,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928345682] [2022-04-28 03:09:12,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:12,541 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 60 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-28 03:09:12,541 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:12,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 61 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 60 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:12,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:12,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-04-28 03:09:12,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:12,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-04-28 03:09:12,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3781, Invalid=11225, Unknown=0, NotChecked=0, Total=15006 [2022-04-28 03:09:12,594 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand has 61 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 60 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:19,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:19,169 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2022-04-28 03:09:19,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-04-28 03:09:19,170 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 60 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-28 03:09:19,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:19,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 60 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:19,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2022-04-28 03:09:19,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 60 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:19,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2022-04-28 03:09:19,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 75 transitions. [2022-04-28 03:09:19,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:19,233 INFO L225 Difference]: With dead ends: 75 [2022-04-28 03:09:19,233 INFO L226 Difference]: Without dead ends: 70 [2022-04-28 03:09:19,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1778 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=7491, Invalid=25089, Unknown=0, NotChecked=0, Total=32580 [2022-04-28 03:09:19,236 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 3448 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 3565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 3448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:09:19,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 153 Invalid, 3565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 3448 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-28 03:09:19,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-28 03:09:19,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-28 03:09:19,330 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:19,330 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 65 states have (on average 1.0153846153846153) internal successors, (66), 65 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:19,331 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 65 states have (on average 1.0153846153846153) internal successors, (66), 65 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:19,331 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 65 states have (on average 1.0153846153846153) internal successors, (66), 65 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:19,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:19,332 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2022-04-28 03:09:19,332 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2022-04-28 03:09:19,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:19,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:19,332 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 65 states have (on average 1.0153846153846153) internal successors, (66), 65 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 70 states. [2022-04-28 03:09:19,332 INFO L87 Difference]: Start difference. First operand has 70 states, 65 states have (on average 1.0153846153846153) internal successors, (66), 65 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 70 states. [2022-04-28 03:09:19,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:19,333 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2022-04-28 03:09:19,333 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2022-04-28 03:09:19,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:19,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:19,333 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:19,333 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:19,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 65 states have (on average 1.0153846153846153) internal successors, (66), 65 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:19,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2022-04-28 03:09:19,334 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2022-04-28 03:09:19,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:19,334 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2022-04-28 03:09:19,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 60 states have internal predecessors, (64), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:19,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 70 transitions. [2022-04-28 03:09:19,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:19,399 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2022-04-28 03:09:19,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-28 03:09:19,399 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:19,399 INFO L195 NwaCegarLoop]: trace histogram [58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:09:19,408 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-28 03:09:19,604 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-28 03:09:19,800 WARN L477 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-28 03:09:19,800 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:09:19,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:19,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1525786084, now seen corresponding path program 115 times [2022-04-28 03:09:19,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:19,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [802908533] [2022-04-28 03:09:19,917 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-28 03:09:19,918 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:09:19,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1501696823, now seen corresponding path program 1 times [2022-04-28 03:09:19,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:19,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905011865] [2022-04-28 03:09:19,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:19,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:19,924 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-28 03:09:19,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:09:19,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [683766405] [2022-04-28 03:09:19,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:19,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:09:19,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:09:19,927 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-28 03:09:19,928 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-28 03:09:19,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:09:19,968 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:09:19,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:09:19,976 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:09:19,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1525786084, now seen corresponding path program 116 times [2022-04-28 03:09:19,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:19,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299152011] [2022-04-28 03:09:19,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:19,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:20,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:21,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:21,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:21,713 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-28 03:09:21,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {36117#true} assume true; {36117#true} is VALID [2022-04-28 03:09:21,713 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36117#true} {36117#true} #34#return; {36117#true} is VALID [2022-04-28 03:09:21,714 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-28 03:09:21,714 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-28 03:09:21,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {36117#true} assume true; {36117#true} is VALID [2022-04-28 03:09:21,714 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36117#true} {36117#true} #34#return; {36117#true} is VALID [2022-04-28 03:09:21,714 INFO L272 TraceCheckUtils]: 4: Hoare triple {36117#true} call #t~ret4 := main(); {36117#true} is VALID [2022-04-28 03:09:21,714 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-28 03:09:21,715 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-28 03:09:21,715 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-28 03:09:21,716 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-28 03:09:21,716 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-28 03:09:21,717 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-28 03:09:21,717 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-28 03:09:21,718 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-28 03:09:21,718 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-28 03:09:21,719 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-28 03:09:21,719 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-28 03:09:21,720 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-28 03:09:21,720 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-28 03:09:21,721 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-28 03:09:21,721 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-28 03:09:21,721 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-28 03:09:21,722 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-28 03:09:21,722 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-28 03:09:21,723 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-28 03:09:21,723 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-28 03:09:21,724 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-28 03:09:21,724 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-28 03:09:21,725 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-28 03:09:21,725 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-28 03:09:21,726 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-28 03:09:21,726 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-28 03:09:21,727 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-28 03:09:21,727 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-28 03:09:21,728 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-28 03:09:21,728 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-28 03:09:21,729 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-28 03:09:21,729 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-28 03:09:21,730 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-28 03:09:21,730 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-28 03:09:21,731 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-28 03:09:21,731 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-28 03:09:21,732 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-28 03:09:21,732 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-28 03:09:21,733 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-28 03:09:21,733 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-28 03:09:21,734 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-28 03:09:21,734 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-28 03:09:21,735 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-28 03:09:21,735 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-28 03:09:21,736 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-28 03:09:21,736 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-28 03:09:21,737 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-28 03:09:21,737 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-28 03:09:21,737 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-28 03:09:21,738 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-28 03:09:21,738 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-28 03:09:21,739 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-28 03:09:21,739 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-28 03:09:21,740 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-28 03:09:21,740 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-28 03:09:21,741 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-28 03:09:21,741 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-28 03:09:21,742 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-28 03:09:21,742 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-28 03:09:21,743 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-28 03:09:21,743 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-28 03:09:21,743 INFO L290 TraceCheckUtils]: 66: Hoare triple {36118#false} ~cond := #in~cond; {36118#false} is VALID [2022-04-28 03:09:21,743 INFO L290 TraceCheckUtils]: 67: Hoare triple {36118#false} assume 0 == ~cond; {36118#false} is VALID [2022-04-28 03:09:21,743 INFO L290 TraceCheckUtils]: 68: Hoare triple {36118#false} assume !false; {36118#false} is VALID [2022-04-28 03:09:21,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:09:21,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:21,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299152011] [2022-04-28 03:09:21,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299152011] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:09:21,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710951086] [2022-04-28 03:09:21,744 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:09:21,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:09:21,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:09:21,745 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-28 03:09:21,745 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-28 03:09:21,799 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:09:21,799 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:09:21,801 WARN L261 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 122 conjunts are in the unsatisfiable core [2022-04-28 03:09:21,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:21,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:09:22,380 INFO L272 TraceCheckUtils]: 0: Hoare triple {36117#true} call ULTIMATE.init(); {36117#true} is VALID [2022-04-28 03:09:22,380 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-28 03:09:22,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {36117#true} assume true; {36117#true} is VALID [2022-04-28 03:09:22,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36117#true} {36117#true} #34#return; {36117#true} is VALID [2022-04-28 03:09:22,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {36117#true} call #t~ret4 := main(); {36117#true} is VALID [2022-04-28 03:09:22,381 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-28 03:09:22,381 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-28 03:09:22,382 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-28 03:09:22,382 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-28 03:09:22,383 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-28 03:09:22,383 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-28 03:09:22,384 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-28 03:09:22,384 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-28 03:09:22,385 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-28 03:09:22,385 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-28 03:09:22,386 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-28 03:09:22,386 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-28 03:09:22,386 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-28 03:09:22,387 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-28 03:09:22,387 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-28 03:09:22,388 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-28 03:09:22,388 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-28 03:09:22,389 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-28 03:09:22,389 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-28 03:09:22,390 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-28 03:09:22,390 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-28 03:09:22,391 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-28 03:09:22,391 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-28 03:09:22,392 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-28 03:09:22,392 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-28 03:09:22,393 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-28 03:09:22,393 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-28 03:09:22,394 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-28 03:09:22,394 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-28 03:09:22,395 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-28 03:09:22,396 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-28 03:09:22,396 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-28 03:09:22,397 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-28 03:09:22,397 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-28 03:09:22,398 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-28 03:09:22,398 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-28 03:09:22,399 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-28 03:09:22,399 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-28 03:09:22,400 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-28 03:09:22,400 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-28 03:09:22,401 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-28 03:09:22,401 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-28 03:09:22,402 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-28 03:09:22,402 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-28 03:09:22,402 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-28 03:09:22,403 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-28 03:09:22,403 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-28 03:09:22,404 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-28 03:09:22,404 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-28 03:09:22,405 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-28 03:09:22,407 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-28 03:09:22,408 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-28 03:09:22,409 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-28 03:09:22,409 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-28 03:09:22,410 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-28 03:09:22,411 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-28 03:09:22,411 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-28 03:09:22,412 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-28 03:09:22,412 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-28 03:09:22,413 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-28 03:09:22,413 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-28 03:09:22,413 INFO L290 TraceCheckUtils]: 66: Hoare triple {36118#false} ~cond := #in~cond; {36118#false} is VALID [2022-04-28 03:09:22,413 INFO L290 TraceCheckUtils]: 67: Hoare triple {36118#false} assume 0 == ~cond; {36118#false} is VALID [2022-04-28 03:09:22,413 INFO L290 TraceCheckUtils]: 68: Hoare triple {36118#false} assume !false; {36118#false} is VALID [2022-04-28 03:09:22,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:09:22,414 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:09:29,181 INFO L290 TraceCheckUtils]: 68: Hoare triple {36118#false} assume !false; {36118#false} is VALID [2022-04-28 03:09:29,182 INFO L290 TraceCheckUtils]: 67: Hoare triple {36393#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {36118#false} is VALID [2022-04-28 03:09:29,182 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-28 03:09:29,183 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-28 03:09:29,183 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-28 03:09:29,185 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-28 03:09:29,187 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-28 03:09:29,188 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-28 03:09:29,190 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-28 03:09:29,191 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-28 03:09:29,193 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-28 03:09:29,194 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-28 03:09:29,195 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-28 03:09:29,196 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-28 03:09:29,197 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-28 03:09:29,199 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-28 03:09:29,200 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-28 03:09:29,200 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-28 03:09:29,202 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-28 03:09:29,203 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-28 03:09:29,204 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-28 03:09:29,204 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-28 03:09:29,205 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-28 03:09:29,206 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-28 03:09:29,207 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-28 03:09:29,207 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-28 03:09:29,211 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-28 03:09:29,212 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-28 03:09:29,213 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-28 03:09:29,214 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-28 03:09:29,214 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-28 03:09:29,215 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-28 03:09:29,216 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-28 03:09:29,218 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-28 03:09:29,218 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-28 03:09:29,219 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-28 03:09:29,220 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-28 03:09:29,220 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-28 03:09:29,221 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-28 03:09:29,224 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-28 03:09:29,225 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-28 03:09:29,226 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-28 03:09:29,227 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-28 03:09:29,229 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-28 03:09:29,230 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-28 03:09:29,231 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-28 03:09:29,231 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-28 03:09:29,232 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-28 03:09:29,233 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-28 03:09:29,233 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-28 03:09:29,234 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-28 03:09:29,235 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-28 03:09:29,236 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-28 03:09:29,237 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-28 03:09:29,237 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-28 03:09:29,238 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-28 03:09:29,239 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-28 03:09:29,241 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-28 03:09:29,242 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-28 03:09:29,243 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-28 03:09:29,243 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-28 03:09:29,244 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-28 03:09:29,245 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-28 03:09:29,245 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-28 03:09:29,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {36117#true} call #t~ret4 := main(); {36117#true} is VALID [2022-04-28 03:09:29,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36117#true} {36117#true} #34#return; {36117#true} is VALID [2022-04-28 03:09:29,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {36117#true} assume true; {36117#true} is VALID [2022-04-28 03:09:29,246 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-28 03:09:29,246 INFO L272 TraceCheckUtils]: 0: Hoare triple {36117#true} call ULTIMATE.init(); {36117#true} is VALID [2022-04-28 03:09:29,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:09:29,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710951086] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:09:29,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:09:29,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 61, 64] total 125 [2022-04-28 03:09:29,247 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:29,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [802908533] [2022-04-28 03:09:29,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [802908533] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:29,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:29,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2022-04-28 03:09:29,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253588587] [2022-04-28 03:09:29,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:29,247 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 61 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-28 03:09:29,247 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:29,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 62 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 61 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:29,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:29,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-04-28 03:09:29,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:29,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-04-28 03:09:29,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3905, Invalid=11595, Unknown=0, NotChecked=0, Total=15500 [2022-04-28 03:09:29,285 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand has 62 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 61 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:36,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:36,247 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2022-04-28 03:09:36,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-04-28 03:09:36,247 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 61 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-28 03:09:36,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:36,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 61 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:36,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2022-04-28 03:09:36,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 61 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:36,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2022-04-28 03:09:36,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 76 transitions. [2022-04-28 03:09:36,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:36,307 INFO L225 Difference]: With dead ends: 76 [2022-04-28 03:09:36,307 INFO L226 Difference]: Without dead ends: 71 [2022-04-28 03:09:36,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1838 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=7738, Invalid=25934, Unknown=0, NotChecked=0, Total=33672 [2022-04-28 03:09:36,309 INFO L413 NwaCegarLoop]: 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.8s IncrementalHoareTripleChecker+Time [2022-04-28 03:09:36,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 263 Invalid, 3793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 3674 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-28 03:09:36,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-28 03:09:36,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-04-28 03:09:36,385 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:36,385 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:36,386 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:36,386 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:36,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:36,386 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2022-04-28 03:09:36,386 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2022-04-28 03:09:36,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:36,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:36,387 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 71 states. [2022-04-28 03:09:36,387 INFO L87 Difference]: Start difference. First operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 71 states. [2022-04-28 03:09:36,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:36,387 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2022-04-28 03:09:36,387 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2022-04-28 03:09:36,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:36,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:36,387 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:36,388 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:36,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:36,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2022-04-28 03:09:36,388 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2022-04-28 03:09:36,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:36,389 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2022-04-28 03:09:36,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 61 states have internal predecessors, (65), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:36,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 71 transitions. [2022-04-28 03:09:36,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:36,456 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2022-04-28 03:09:36,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-28 03:09:36,457 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:36,457 INFO L195 NwaCegarLoop]: trace histogram [59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:09:36,462 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-28 03:09:36,673 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-28 03:09:36,857 WARN L477 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-28 03:09:36,857 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:09:36,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:36,858 INFO L85 PathProgramCache]: Analyzing trace with hash -18267082, now seen corresponding path program 117 times [2022-04-28 03:09:36,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:36,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2108236169] [2022-04-28 03:09:36,973 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-28 03:09:36,975 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:09:36,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1560802167, now seen corresponding path program 1 times [2022-04-28 03:09:36,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:36,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020025268] [2022-04-28 03:09:36,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:36,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:36,980 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-28 03:09:36,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:09:36,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1910251437] [2022-04-28 03:09:36,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:36,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:09:36,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:09:36,984 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-28 03:09:37,009 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-28 03:09:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:09:37,042 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:09:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:09:37,053 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:09:37,053 INFO L85 PathProgramCache]: Analyzing trace with hash -18267082, now seen corresponding path program 118 times [2022-04-28 03:09:37,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:37,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123632826] [2022-04-28 03:09:37,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:37,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:37,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:38,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:38,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:38,902 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-28 03:09:38,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {37212#true} assume true; {37212#true} is VALID [2022-04-28 03:09:38,902 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37212#true} {37212#true} #34#return; {37212#true} is VALID [2022-04-28 03:09:38,903 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-28 03:09:38,903 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-28 03:09:38,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {37212#true} assume true; {37212#true} is VALID [2022-04-28 03:09:38,903 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37212#true} {37212#true} #34#return; {37212#true} is VALID [2022-04-28 03:09:38,903 INFO L272 TraceCheckUtils]: 4: Hoare triple {37212#true} call #t~ret4 := main(); {37212#true} is VALID [2022-04-28 03:09:38,903 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-28 03:09:38,904 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-28 03:09:38,904 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-28 03:09:38,905 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-28 03:09:38,905 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-28 03:09:38,906 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-28 03:09:38,906 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-28 03:09:38,907 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-28 03:09:38,907 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-28 03:09:38,908 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-28 03:09:38,908 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-28 03:09:38,909 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-28 03:09:38,909 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-28 03:09:38,910 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-28 03:09:38,910 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-28 03:09:38,911 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-28 03:09:38,911 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-28 03:09:38,912 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-28 03:09:38,912 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-28 03:09:38,913 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-28 03:09:38,913 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-28 03:09:38,914 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-28 03:09:38,914 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-28 03:09:38,915 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-28 03:09:38,915 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-28 03:09:38,916 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-28 03:09:38,916 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-28 03:09:38,916 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-28 03:09:38,917 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-28 03:09:38,917 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-28 03:09:38,918 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-28 03:09:38,918 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-28 03:09:38,919 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-28 03:09:38,919 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-28 03:09:38,920 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-28 03:09:38,920 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-28 03:09:38,921 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-28 03:09:38,921 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-28 03:09:38,922 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-28 03:09:38,922 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-28 03:09:38,923 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-28 03:09:38,923 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-28 03:09:38,924 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-28 03:09:38,924 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-28 03:09:38,925 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-28 03:09:38,925 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-28 03:09:38,926 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-28 03:09:38,926 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-28 03:09:38,927 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-28 03:09:38,927 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-28 03:09:38,928 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-28 03:09:38,928 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-28 03:09:38,929 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-28 03:09:38,929 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-28 03:09:38,930 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-28 03:09:38,930 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-28 03:09:38,930 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-28 03:09:38,931 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-28 03:09:38,931 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-28 03:09:38,932 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-28 03:09:38,932 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-28 03:09:38,932 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-28 03:09:38,933 INFO L290 TraceCheckUtils]: 67: Hoare triple {37213#false} ~cond := #in~cond; {37213#false} is VALID [2022-04-28 03:09:38,933 INFO L290 TraceCheckUtils]: 68: Hoare triple {37213#false} assume 0 == ~cond; {37213#false} is VALID [2022-04-28 03:09:38,933 INFO L290 TraceCheckUtils]: 69: Hoare triple {37213#false} assume !false; {37213#false} is VALID [2022-04-28 03:09:38,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:09:38,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:38,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123632826] [2022-04-28 03:09:38,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123632826] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:09:38,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80189089] [2022-04-28 03:09:38,933 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:09:38,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:09:38,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:09:38,934 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-28 03:09:38,935 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-28 03:09:39,101 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:09:39,101 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:09:39,103 WARN L261 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 121 conjunts are in the unsatisfiable core [2022-04-28 03:09:39,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:39,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:09:39,859 INFO L272 TraceCheckUtils]: 0: Hoare triple {37212#true} call ULTIMATE.init(); {37212#true} is VALID [2022-04-28 03:09:39,859 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-28 03:09:39,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {37212#true} assume true; {37212#true} is VALID [2022-04-28 03:09:39,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37212#true} {37212#true} #34#return; {37212#true} is VALID [2022-04-28 03:09:39,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {37212#true} call #t~ret4 := main(); {37212#true} is VALID [2022-04-28 03:09:39,860 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-28 03:09:39,860 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-28 03:09:39,861 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-28 03:09:39,861 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-28 03:09:39,862 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-28 03:09:39,862 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-28 03:09:39,863 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-28 03:09:39,863 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-28 03:09:39,864 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-28 03:09:39,864 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-28 03:09:39,865 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-28 03:09:39,865 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-28 03:09:39,866 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-28 03:09:39,866 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-28 03:09:39,867 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-28 03:09:39,867 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-28 03:09:39,868 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-28 03:09:39,868 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-28 03:09:39,869 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-28 03:09:39,869 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-28 03:09:39,870 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-28 03:09:39,870 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-28 03:09:39,871 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-28 03:09:39,871 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-28 03:09:39,872 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-28 03:09:39,872 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-28 03:09:39,873 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-28 03:09:39,873 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-28 03:09:39,874 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-28 03:09:39,874 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-28 03:09:39,875 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-28 03:09:39,875 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-28 03:09:39,876 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-28 03:09:39,876 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-28 03:09:39,877 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-28 03:09:39,877 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-28 03:09:39,878 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-28 03:09:39,878 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-28 03:09:39,879 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-28 03:09:39,879 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-28 03:09:39,880 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-28 03:09:39,880 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-28 03:09:39,881 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-28 03:09:39,881 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-28 03:09:39,882 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-28 03:09:39,882 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-28 03:09:39,883 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-28 03:09:39,883 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-28 03:09:39,884 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-28 03:09:39,884 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-28 03:09:39,885 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-28 03:09:39,885 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-28 03:09:39,886 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-28 03:09:39,886 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-28 03:09:39,887 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-28 03:09:39,887 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-28 03:09:39,888 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-28 03:09:39,888 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-28 03:09:39,889 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-28 03:09:39,889 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-28 03:09:39,890 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-28 03:09:39,890 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-28 03:09:39,890 INFO L290 TraceCheckUtils]: 67: Hoare triple {37213#false} ~cond := #in~cond; {37213#false} is VALID [2022-04-28 03:09:39,890 INFO L290 TraceCheckUtils]: 68: Hoare triple {37213#false} assume 0 == ~cond; {37213#false} is VALID [2022-04-28 03:09:39,890 INFO L290 TraceCheckUtils]: 69: Hoare triple {37213#false} assume !false; {37213#false} is VALID [2022-04-28 03:09:39,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:09:39,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:09:45,398 INFO L290 TraceCheckUtils]: 69: Hoare triple {37213#false} assume !false; {37213#false} is VALID [2022-04-28 03:09:45,399 INFO L290 TraceCheckUtils]: 68: Hoare triple {37213#false} assume 0 == ~cond; {37213#false} is VALID [2022-04-28 03:09:45,399 INFO L290 TraceCheckUtils]: 67: Hoare triple {37213#false} ~cond := #in~cond; {37213#false} is VALID [2022-04-28 03:09:45,399 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-28 03:09:45,399 INFO L290 TraceCheckUtils]: 65: Hoare triple {37501#(< 1 (mod main_~x~0 4294967296))} assume !(~x~0 % 4294967296 > 1); {37213#false} is VALID [2022-04-28 03:09:45,401 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-28 03:09:45,402 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-28 03:09:45,403 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-28 03:09:45,403 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-28 03:09:45,404 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-28 03:09:45,405 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-28 03:09:45,405 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-28 03:09:45,406 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-28 03:09:45,408 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-28 03:09:45,408 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-28 03:09:45,409 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-28 03:09:45,409 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-28 03:09:45,410 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-28 03:09:45,411 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-28 03:09:45,411 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-28 03:09:45,412 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-28 03:09:45,412 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-28 03:09:45,413 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-28 03:09:45,414 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-28 03:09:45,414 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-28 03:09:45,415 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-28 03:09:45,416 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-28 03:09:45,416 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-28 03:09:45,417 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-28 03:09:45,417 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-28 03:09:45,418 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-28 03:09:45,419 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-28 03:09:45,419 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-28 03:09:45,420 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-28 03:09:45,420 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-28 03:09:45,421 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-28 03:09:45,422 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-28 03:09:45,422 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-28 03:09:45,423 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-28 03:09:45,423 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-28 03:09:45,424 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-28 03:09:45,425 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-28 03:09:45,425 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-28 03:09:45,426 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-28 03:09:45,426 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-28 03:09:45,427 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-28 03:09:45,428 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-28 03:09:45,429 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-28 03:09:45,430 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-28 03:09:45,430 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-28 03:09:45,431 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-28 03:09:45,431 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-28 03:09:45,432 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-28 03:09:45,433 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-28 03:09:45,433 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-28 03:09:45,434 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-28 03:09:45,434 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-28 03:09:45,435 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-28 03:09:45,436 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-28 03:09:45,438 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-28 03:09:45,438 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-28 03:09:45,439 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-28 03:09:45,440 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-28 03:09:45,440 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-28 03:09:45,441 INFO L290 TraceCheckUtils]: 5: Hoare triple {37212#true} ~x~0 := 268435441; {37737#(< 1 (mod (+ main_~x~0 4294967178) 4294967296))} is VALID [2022-04-28 03:09:45,441 INFO L272 TraceCheckUtils]: 4: Hoare triple {37212#true} call #t~ret4 := main(); {37212#true} is VALID [2022-04-28 03:09:45,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37212#true} {37212#true} #34#return; {37212#true} is VALID [2022-04-28 03:09:45,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {37212#true} assume true; {37212#true} is VALID [2022-04-28 03:09:45,441 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-28 03:09:45,441 INFO L272 TraceCheckUtils]: 0: Hoare triple {37212#true} call ULTIMATE.init(); {37212#true} is VALID [2022-04-28 03:09:45,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:09:45,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80189089] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:09:45,442 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:09:45,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 62, 62] total 124 [2022-04-28 03:09:45,442 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:45,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2108236169] [2022-04-28 03:09:45,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2108236169] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:45,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:45,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2022-04-28 03:09:45,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370639713] [2022-04-28 03:09:45,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:45,442 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 62 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2022-04-28 03:09:45,442 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:45,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 63 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 62 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:45,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:45,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-04-28 03:09:45,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:45,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-04-28 03:09:45,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3965, Invalid=11287, Unknown=0, NotChecked=0, Total=15252 [2022-04-28 03:09:45,480 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand has 63 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 62 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:52,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:52,328 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2022-04-28 03:09:52,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-04-28 03:09:52,329 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 62 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2022-04-28 03:09:52,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:52,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 62 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:52,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2022-04-28 03:09:52,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 62 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:52,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2022-04-28 03:09:52,330 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 77 transitions. [2022-04-28 03:09:52,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:52,378 INFO L225 Difference]: With dead ends: 77 [2022-04-28 03:09:52,378 INFO L226 Difference]: Without dead ends: 72 [2022-04-28 03:09:52,380 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1893 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=7923, Invalid=25749, Unknown=0, NotChecked=0, Total=33672 [2022-04-28 03:09:52,380 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 3597 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s 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.8s IncrementalHoareTripleChecker+Time [2022-04-28 03:09:52,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 68 Invalid, 3718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 3597 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-04-28 03:09:52,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-28 03:09:52,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-04-28 03:09:52,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:52,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 72 states, 67 states have (on average 1.0149253731343284) internal successors, (68), 67 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:52,458 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 72 states, 67 states have (on average 1.0149253731343284) internal successors, (68), 67 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:52,458 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 72 states, 67 states have (on average 1.0149253731343284) internal successors, (68), 67 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:52,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:52,458 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2022-04-28 03:09:52,458 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2022-04-28 03:09:52,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:52,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:52,459 INFO L74 IsIncluded]: Start isIncluded. First operand has 72 states, 67 states have (on average 1.0149253731343284) internal successors, (68), 67 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-28 03:09:52,459 INFO L87 Difference]: Start difference. First operand has 72 states, 67 states have (on average 1.0149253731343284) internal successors, (68), 67 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-28 03:09:52,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:52,459 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2022-04-28 03:09:52,459 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2022-04-28 03:09:52,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:52,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:52,460 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:52,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:52,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.0149253731343284) internal successors, (68), 67 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:52,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2022-04-28 03:09:52,461 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2022-04-28 03:09:52,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:52,461 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2022-04-28 03:09:52,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 62 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:52,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 72 states and 72 transitions. [2022-04-28 03:09:52,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:52,549 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2022-04-28 03:09:52,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-28 03:09:52,549 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:52,549 INFO L195 NwaCegarLoop]: trace histogram [60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:09:52,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Ended with exit code 0 [2022-04-28 03:09:52,753 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-28 03:09:52,950 WARN L477 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-28 03:09:52,950 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:09:52,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:52,950 INFO L85 PathProgramCache]: Analyzing trace with hash -529818276, now seen corresponding path program 119 times [2022-04-28 03:09:52,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:52,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [858202217] [2022-04-28 03:09:53,059 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-28 03:09:53,060 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:09:53,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1619907511, now seen corresponding path program 1 times [2022-04-28 03:09:53,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:53,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708805824] [2022-04-28 03:09:53,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:53,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:53,066 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-28 03:09:53,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:09:53,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [325035354] [2022-04-28 03:09:53,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:53,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:09:53,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:09:53,070 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-28 03:09:53,070 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-28 03:09:53,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:09:53,107 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:09:53,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:09:53,115 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:09:53,115 INFO L85 PathProgramCache]: Analyzing trace with hash -529818276, now seen corresponding path program 120 times [2022-04-28 03:09:53,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:53,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336383149] [2022-04-28 03:09:53,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:53,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:53,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:54,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:54,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:54,936 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-28 03:09:54,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {38320#true} assume true; {38320#true} is VALID [2022-04-28 03:09:54,936 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38320#true} {38320#true} #34#return; {38320#true} is VALID [2022-04-28 03:09:54,937 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-28 03:09:54,937 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-28 03:09:54,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {38320#true} assume true; {38320#true} is VALID [2022-04-28 03:09:54,937 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38320#true} {38320#true} #34#return; {38320#true} is VALID [2022-04-28 03:09:54,937 INFO L272 TraceCheckUtils]: 4: Hoare triple {38320#true} call #t~ret4 := main(); {38320#true} is VALID [2022-04-28 03:09:54,937 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-28 03:09:54,938 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-28 03:09:54,938 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-28 03:09:54,939 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-28 03:09:54,939 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-28 03:09:54,940 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-28 03:09:54,940 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-28 03:09:54,941 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-28 03:09:54,941 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-28 03:09:54,942 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-28 03:09:54,942 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-28 03:09:54,943 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-28 03:09:54,943 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-28 03:09:54,944 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-28 03:09:54,944 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-28 03:09:54,945 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-28 03:09:54,945 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-28 03:09:54,946 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-28 03:09:54,946 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-28 03:09:54,947 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-28 03:09:54,947 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-28 03:09:54,948 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-28 03:09:54,948 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-28 03:09:54,949 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-28 03:09:54,949 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-28 03:09:54,950 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-28 03:09:54,950 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-28 03:09:54,951 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-28 03:09:54,951 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-28 03:09:54,951 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-28 03:09:54,952 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-28 03:09:54,952 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-28 03:09:54,953 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-28 03:09:54,953 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-28 03:09:54,954 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-28 03:09:54,954 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-28 03:09:54,955 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-28 03:09:54,955 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-28 03:09:54,956 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-28 03:09:54,956 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-28 03:09:54,957 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-28 03:09:54,957 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-28 03:09:54,958 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-28 03:09:54,958 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-28 03:09:54,959 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-28 03:09:54,959 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-28 03:09:54,960 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-28 03:09:54,960 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-28 03:09:54,961 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-28 03:09:54,961 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-28 03:09:54,962 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-28 03:09:54,962 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-28 03:09:54,963 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-28 03:09:54,963 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-28 03:09:54,964 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-28 03:09:54,964 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-28 03:09:54,965 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-28 03:09:54,965 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-28 03:09:54,965 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-28 03:09:54,966 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-28 03:09:54,966 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-28 03:09:54,967 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-28 03:09:54,967 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-28 03:09:54,967 INFO L290 TraceCheckUtils]: 68: Hoare triple {38321#false} ~cond := #in~cond; {38321#false} is VALID [2022-04-28 03:09:54,967 INFO L290 TraceCheckUtils]: 69: Hoare triple {38321#false} assume 0 == ~cond; {38321#false} is VALID [2022-04-28 03:09:54,967 INFO L290 TraceCheckUtils]: 70: Hoare triple {38321#false} assume !false; {38321#false} is VALID [2022-04-28 03:09:54,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:09:54,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:54,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336383149] [2022-04-28 03:09:54,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336383149] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:09:54,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051433445] [2022-04-28 03:09:54,968 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:09:54,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:09:54,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:09:54,969 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-28 03:09:54,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Waiting until timeout for monitored process