/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-acceleration/simple_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 03:00:19,016 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:00:19,018 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:00:19,052 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:00:19,052 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:00:19,053 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:00:19,055 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:00:19,059 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:00:19,061 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:00:19,064 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:00:19,065 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:00:19,066 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:00:19,067 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:00:19,068 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:00:19,069 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:00:19,072 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:00:19,072 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:00:19,073 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:00:19,075 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:00:19,079 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:00:19,081 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:00:19,082 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:00:19,082 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:00:19,083 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:00:19,084 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:00:19,089 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:00:19,089 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:00:19,090 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:00:19,091 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:00:19,091 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:00:19,092 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:00:19,092 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:00:19,093 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:00:19,094 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:00:19,094 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:00:19,095 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:00:19,095 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:00:19,095 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:00:19,095 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:00:19,096 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:00:19,096 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:00:19,097 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:00:19,098 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:00:19,106 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:00:19,107 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:00:19,108 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:00:19,108 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:00:19,109 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:00:19,109 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:00:19,109 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:00:19,109 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:00:19,109 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:00:19,110 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:00:19,110 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:00:19,110 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:00:19,110 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:00:19,110 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:00:19,110 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:00:19,110 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:00:19,110 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:00:19,110 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:00:19,111 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:00:19,111 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:00:19,111 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:00:19,111 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:00:19,111 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:00:19,111 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:00:19,111 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:00:19,111 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:00:19,294 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:00:19,318 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:00:19,320 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:00:19,320 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:00:19,321 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:00:19,322 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/simple_1-1.c [2022-04-28 03:00:19,377 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02d5affe4/ddee3b4c746f4708adf35297b7821faf/FLAG70773e4ae [2022-04-28 03:00:19,703 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:00:19,703 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_1-1.c [2022-04-28 03:00:19,709 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02d5affe4/ddee3b4c746f4708adf35297b7821faf/FLAG70773e4ae [2022-04-28 03:00:20,128 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02d5affe4/ddee3b4c746f4708adf35297b7821faf [2022-04-28 03:00:20,129 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:00:20,130 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:00:20,132 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:00:20,132 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:00:20,135 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:00:20,136 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:00:20" (1/1) ... [2022-04-28 03:00:20,137 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@398b779a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:00:20, skipping insertion in model container [2022-04-28 03:00:20,137 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:00:20" (1/1) ... [2022-04-28 03:00:20,142 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:00:20,150 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:00:20,320 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_1-1.c[322,335] [2022-04-28 03:00:20,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:00:20,344 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:00:20,356 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/simple_1-1.c[322,335] [2022-04-28 03:00:20,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:00:20,367 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:00:20,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:00:20 WrapperNode [2022-04-28 03:00:20,369 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:00:20,369 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:00:20,370 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:00:20,370 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:00:20,378 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:00:20" (1/1) ... [2022-04-28 03:00:20,378 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:00:20" (1/1) ... [2022-04-28 03:00:20,383 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:00:20" (1/1) ... [2022-04-28 03:00:20,384 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:00:20" (1/1) ... [2022-04-28 03:00:20,389 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:00:20" (1/1) ... [2022-04-28 03:00:20,393 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:00:20" (1/1) ... [2022-04-28 03:00:20,396 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:00:20" (1/1) ... [2022-04-28 03:00:20,398 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:00:20,399 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:00:20,399 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:00:20,399 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:00:20,400 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:00:20" (1/1) ... [2022-04-28 03:00:20,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:00:20,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:00:20,421 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:00:20,440 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:00:20,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:00:20,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:00:20,458 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:00:20,458 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 03:00:20,458 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:00:20,458 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:00:20,458 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:00:20,458 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:00:20,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:00:20,459 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:00:20,459 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:00:20,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:00:20,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:00:20,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:00:20,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:00:20,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:00:20,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:00:20,506 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:00:20,507 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:00:20,615 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:00:20,625 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:00:20,625 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 03:00:20,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:00:20 BoogieIcfgContainer [2022-04-28 03:00:20,627 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:00:20,628 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:00:20,628 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:00:20,640 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:00:20,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:00:20" (1/3) ... [2022-04-28 03:00:20,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@416aef87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:00:20, skipping insertion in model container [2022-04-28 03:00:20,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:00:20" (2/3) ... [2022-04-28 03:00:20,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@416aef87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:00:20, skipping insertion in model container [2022-04-28 03:00:20,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:00:20" (3/3) ... [2022-04-28 03:00:20,643 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_1-1.c [2022-04-28 03:00:20,669 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:00:20,669 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 03:00:20,708 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:00:20,722 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@73d579e9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1fa00522 [2022-04-28 03:00:20,723 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 03:00:20,728 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:00:20,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 03:00:20,733 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:00:20,733 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:00:20,733 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:00:20,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:00:20,737 INFO L85 PathProgramCache]: Analyzing trace with hash -219174432, now seen corresponding path program 1 times [2022-04-28 03:00:20,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:20,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [480903521] [2022-04-28 03:00:20,762 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:00:20,763 INFO L85 PathProgramCache]: Analyzing trace with hash -219174432, now seen corresponding path program 2 times [2022-04-28 03:00:20,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:20,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952572881] [2022-04-28 03:00:20,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:20,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:20,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:00:20,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:20,936 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:00:20,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-28 03:00:20,936 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #34#return; {21#true} is VALID [2022-04-28 03:00:20,938 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:00:20,938 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:00:20,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-28 03:00:20,939 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #34#return; {21#true} is VALID [2022-04-28 03:00:20,939 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret4 := main(); {21#true} is VALID [2022-04-28 03:00:20,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} ~x~0 := 0; {21#true} is VALID [2022-04-28 03:00:20,940 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#true} assume !true; {22#false} is VALID [2022-04-28 03:00:20,940 INFO L272 TraceCheckUtils]: 7: Hoare triple {22#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {22#false} is VALID [2022-04-28 03:00:20,940 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2022-04-28 03:00:20,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {22#false} assume 0 == ~cond; {22#false} is VALID [2022-04-28 03:00:20,941 INFO L290 TraceCheckUtils]: 10: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-04-28 03:00:20,941 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:00:20,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:00:20,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952572881] [2022-04-28 03:00:20,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952572881] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:00:20,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:00:20,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:00:20,947 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:00:20,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [480903521] [2022-04-28 03:00:20,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [480903521] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:00:20,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:00:20,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:00:20,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813873997] [2022-04-28 03:00:20,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:00:20,952 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:00:20,954 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:00:20,956 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:00:20,973 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:00:20,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 03:00:20,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:20,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 03:00:20,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 03:00:20,993 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:00:21,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:21,068 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-28 03:00:21,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 03:00:21,068 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:00:21,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:00:21,069 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:00:21,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-28 03:00:21,078 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:00:21,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-28 03:00:21,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2022-04-28 03:00:21,124 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:00:21,131 INFO L225 Difference]: With dead ends: 29 [2022-04-28 03:00:21,131 INFO L226 Difference]: Without dead ends: 12 [2022-04-28 03:00:21,133 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:00:21,136 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:00:21,138 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:00:21,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-04-28 03:00:21,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-04-28 03:00:21,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:00:21,164 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:00:21,164 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:00:21,165 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:00:21,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:21,170 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-28 03:00:21,170 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-28 03:00:21,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:21,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:21,171 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:00:21,171 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:00:21,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:21,173 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-28 03:00:21,174 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-28 03:00:21,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:21,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:21,174 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:00:21,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:00:21,175 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:00:21,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-04-28 03:00:21,178 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 11 [2022-04-28 03:00:21,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:00:21,178 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-04-28 03:00:21,178 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:00:21,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 12 transitions. [2022-04-28 03:00:21,197 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:00:21,198 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-28 03:00:21,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 03:00:21,200 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:00:21,201 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:00:21,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 03:00:21,206 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:00:21,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:00:21,208 INFO L85 PathProgramCache]: Analyzing trace with hash -222868516, now seen corresponding path program 1 times [2022-04-28 03:00:21,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:21,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [327934453] [2022-04-28 03:00:21,211 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:00:21,211 INFO L85 PathProgramCache]: Analyzing trace with hash -222868516, now seen corresponding path program 2 times [2022-04-28 03:00:21,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:21,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177303134] [2022-04-28 03:00:21,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:21,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:21,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:21,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:00:21,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:21,342 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:00:21,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {135#true} assume true; {135#true} is VALID [2022-04-28 03:00:21,343 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {135#true} {135#true} #34#return; {135#true} is VALID [2022-04-28 03:00:21,344 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:00:21,344 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:00:21,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {135#true} assume true; {135#true} is VALID [2022-04-28 03:00:21,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {135#true} {135#true} #34#return; {135#true} is VALID [2022-04-28 03:00:21,347 INFO L272 TraceCheckUtils]: 4: Hoare triple {135#true} call #t~ret4 := main(); {135#true} is VALID [2022-04-28 03:00:21,349 INFO L290 TraceCheckUtils]: 5: Hoare triple {135#true} ~x~0 := 0; {140#(= main_~x~0 0)} is VALID [2022-04-28 03:00:21,351 INFO L290 TraceCheckUtils]: 6: Hoare triple {140#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 268435455); {136#false} is VALID [2022-04-28 03:00:21,351 INFO L272 TraceCheckUtils]: 7: Hoare triple {136#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {136#false} is VALID [2022-04-28 03:00:21,351 INFO L290 TraceCheckUtils]: 8: Hoare triple {136#false} ~cond := #in~cond; {136#false} is VALID [2022-04-28 03:00:21,351 INFO L290 TraceCheckUtils]: 9: Hoare triple {136#false} assume 0 == ~cond; {136#false} is VALID [2022-04-28 03:00:21,351 INFO L290 TraceCheckUtils]: 10: Hoare triple {136#false} assume !false; {136#false} is VALID [2022-04-28 03:00:21,352 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:00:21,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:00:21,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177303134] [2022-04-28 03:00:21,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177303134] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:00:21,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:00:21,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:00:21,352 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:00:21,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [327934453] [2022-04-28 03:00:21,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [327934453] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:00:21,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:00:21,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:00:21,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410680672] [2022-04-28 03:00:21,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:00:21,354 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:00:21,354 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:00:21,354 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:00:21,367 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:00:21,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 03:00:21,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:21,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 03:00:21,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 03:00:21,369 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:00:21,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:21,405 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-28 03:00:21,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 03:00:21,405 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:00:21,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:00:21,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:00:21,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-28 03:00:21,407 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:00:21,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-28 03:00:21,408 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 18 transitions. [2022-04-28 03:00:21,421 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:00:21,422 INFO L225 Difference]: With dead ends: 18 [2022-04-28 03:00:21,422 INFO L226 Difference]: Without dead ends: 13 [2022-04-28 03:00:21,422 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:00:21,423 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:00:21,424 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:00:21,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-28 03:00:21,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-28 03:00:21,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:00:21,426 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:00:21,427 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:00:21,427 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:00:21,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:21,427 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-28 03:00:21,428 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-28 03:00:21,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:21,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:21,428 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:00:21,428 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:00:21,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:21,429 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-28 03:00:21,429 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-28 03:00:21,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:21,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:21,429 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:00:21,429 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:00:21,429 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:00:21,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-28 03:00:21,430 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-28 03:00:21,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:00:21,430 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-28 03:00:21,430 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:00:21,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 13 transitions. [2022-04-28 03:00:21,441 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:00:21,441 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-28 03:00:21,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 03:00:21,441 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:00:21,442 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:00:21,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 03:00:21,442 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:00:21,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:00:21,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1717471862, now seen corresponding path program 1 times [2022-04-28 03:00:21,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:21,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [773932565] [2022-04-28 03:00:21,859 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:00:21,861 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:00:21,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1867307785, now seen corresponding path program 1 times [2022-04-28 03:00:21,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:21,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684731661] [2022-04-28 03:00:21,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:21,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:21,890 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 2) .v_it_1.0) (* (- 1) main_~x~0_5) (* 4294967296 (div (+ (* 2 .v_it_1.0) main_~x~0_5) 4294967296)) 268435455) 0)) [2022-04-28 03:00:21,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:00:21,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [751680761] [2022-04-28 03:00:21,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:21,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:21,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:00:21,937 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:00:21,938 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:00:21,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:00:21,991 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:00:22,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:00:22,026 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:00:22,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1717471862, now seen corresponding path program 2 times [2022-04-28 03:00:22,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:22,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95975000] [2022-04-28 03:00:22,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:22,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:22,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:22,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:00:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:22,084 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:00:22,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-28 03:00:22,084 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-28 03:00:22,085 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:00:22,086 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:00:22,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-28 03:00:22,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-28 03:00:22,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {234#true} call #t~ret4 := main(); {234#true} is VALID [2022-04-28 03:00:22,087 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#true} ~x~0 := 0; {239#(= main_~x~0 0)} is VALID [2022-04-28 03:00:22,088 INFO L290 TraceCheckUtils]: 6: Hoare triple {239#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {240#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-28 03:00:22,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {240#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 268435455); {235#false} is VALID [2022-04-28 03:00:22,091 INFO L272 TraceCheckUtils]: 8: Hoare triple {235#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {235#false} is VALID [2022-04-28 03:00:22,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {235#false} ~cond := #in~cond; {235#false} is VALID [2022-04-28 03:00:22,093 INFO L290 TraceCheckUtils]: 10: Hoare triple {235#false} assume 0 == ~cond; {235#false} is VALID [2022-04-28 03:00:22,093 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#false} assume !false; {235#false} is VALID [2022-04-28 03:00:22,094 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:00:22,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:00:22,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95975000] [2022-04-28 03:00:22,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95975000] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:00:22,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003365763] [2022-04-28 03:00:22,095 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:00:22,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:22,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:00:22,103 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:00:22,384 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:00:22,395 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:00:22,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:00:22,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 03:00:22,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:22,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:00:22,465 INFO L272 TraceCheckUtils]: 0: Hoare triple {234#true} call ULTIMATE.init(); {234#true} is VALID [2022-04-28 03:00:22,465 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:00:22,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-28 03:00:22,466 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-28 03:00:22,466 INFO L272 TraceCheckUtils]: 4: Hoare triple {234#true} call #t~ret4 := main(); {234#true} is VALID [2022-04-28 03:00:22,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#true} ~x~0 := 0; {239#(= main_~x~0 0)} is VALID [2022-04-28 03:00:22,467 INFO L290 TraceCheckUtils]: 6: Hoare triple {239#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {263#(= (+ (- 2) main_~x~0) 0)} is VALID [2022-04-28 03:00:22,468 INFO L290 TraceCheckUtils]: 7: Hoare triple {263#(= (+ (- 2) main_~x~0) 0)} assume !(~x~0 % 4294967296 < 268435455); {235#false} is VALID [2022-04-28 03:00:22,468 INFO L272 TraceCheckUtils]: 8: Hoare triple {235#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {235#false} is VALID [2022-04-28 03:00:22,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {235#false} ~cond := #in~cond; {235#false} is VALID [2022-04-28 03:00:22,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {235#false} assume 0 == ~cond; {235#false} is VALID [2022-04-28 03:00:22,469 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#false} assume !false; {235#false} is VALID [2022-04-28 03:00:22,469 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:00:22,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:00:22,539 INFO L290 TraceCheckUtils]: 11: Hoare triple {235#false} assume !false; {235#false} is VALID [2022-04-28 03:00:22,539 INFO L290 TraceCheckUtils]: 10: Hoare triple {235#false} assume 0 == ~cond; {235#false} is VALID [2022-04-28 03:00:22,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {235#false} ~cond := #in~cond; {235#false} is VALID [2022-04-28 03:00:22,539 INFO L272 TraceCheckUtils]: 8: Hoare triple {235#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {235#false} is VALID [2022-04-28 03:00:22,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {291#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {235#false} is VALID [2022-04-28 03:00:22,542 INFO L290 TraceCheckUtils]: 6: Hoare triple {295#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {291#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:00:22,542 INFO L290 TraceCheckUtils]: 5: Hoare triple {234#true} ~x~0 := 0; {295#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 03:00:22,543 INFO L272 TraceCheckUtils]: 4: Hoare triple {234#true} call #t~ret4 := main(); {234#true} is VALID [2022-04-28 03:00:22,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {234#true} {234#true} #34#return; {234#true} is VALID [2022-04-28 03:00:22,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {234#true} assume true; {234#true} is VALID [2022-04-28 03:00:22,543 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:00:22,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {234#true} call ULTIMATE.init(); {234#true} is VALID [2022-04-28 03:00:22,543 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:00:22,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003365763] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:00:22,544 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:00:22,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-28 03:00:22,544 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:00:22,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [773932565] [2022-04-28 03:00:22,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [773932565] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:00:22,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:00:22,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 03:00:22,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080144911] [2022-04-28 03:00:22,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:00:22,545 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:00:22,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:00:22,545 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:00:22,573 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:00:22,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 03:00:22,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:22,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 03:00:22,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-28 03:00:22,574 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:00:22,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:22,635 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-28 03:00:22,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 03:00:22,636 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:00:22,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:00:22,636 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:00:22,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-28 03:00:22,637 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:00:22,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-28 03:00:22,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2022-04-28 03:00:22,655 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:00:22,655 INFO L225 Difference]: With dead ends: 19 [2022-04-28 03:00:22,655 INFO L226 Difference]: Without dead ends: 14 [2022-04-28 03:00:22,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-04-28 03:00:22,657 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:00:22,657 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:00:22,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-28 03:00:22,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-28 03:00:22,660 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:00:22,660 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:00:22,661 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:00:22,661 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:00:22,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:22,663 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-28 03:00:22,663 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 03:00:22,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:22,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:22,663 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:00:22,663 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:00:22,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:22,664 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-28 03:00:22,664 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 03:00:22,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:22,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:22,664 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:00:22,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:00:22,664 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:00:22,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-28 03:00:22,665 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-28 03:00:22,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:00:22,665 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-28 03:00:22,665 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:00:22,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-28 03:00:22,676 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:00:22,677 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 03:00:22,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 03:00:22,677 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:00:22,677 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:00:22,696 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:00:22,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 03:00:23,093 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:00:23,094 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:00:23,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:00:23,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1738481436, now seen corresponding path program 3 times [2022-04-28 03:00:23,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:23,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [238782082] [2022-04-28 03:00:23,343 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:00:23,348 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:00:23,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1808202441, now seen corresponding path program 1 times [2022-04-28 03:00:23,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:23,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815712934] [2022-04-28 03:00:23,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:23,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:23,373 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_2.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_2.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:00:23,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:00:23,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1512998646] [2022-04-28 03:00:23,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:23,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:23,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:00:23,596 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:00:23,597 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:00:23,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:00:23,660 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:00:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:00:23,671 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:00:23,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1738481436, now seen corresponding path program 4 times [2022-04-28 03:00:23,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:23,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23103585] [2022-04-28 03:00:23,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:23,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:23,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:23,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:00:23,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:23,748 INFO L290 TraceCheckUtils]: 0: Hoare triple {422#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {414#true} is VALID [2022-04-28 03:00:23,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {414#true} assume true; {414#true} is VALID [2022-04-28 03:00:23,749 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {414#true} {414#true} #34#return; {414#true} is VALID [2022-04-28 03:00:23,749 INFO L272 TraceCheckUtils]: 0: Hoare triple {414#true} call ULTIMATE.init(); {422#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:00:23,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {422#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {414#true} is VALID [2022-04-28 03:00:23,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {414#true} assume true; {414#true} is VALID [2022-04-28 03:00:23,750 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {414#true} {414#true} #34#return; {414#true} is VALID [2022-04-28 03:00:23,750 INFO L272 TraceCheckUtils]: 4: Hoare triple {414#true} call #t~ret4 := main(); {414#true} is VALID [2022-04-28 03:00:23,750 INFO L290 TraceCheckUtils]: 5: Hoare triple {414#true} ~x~0 := 0; {419#(= main_~x~0 0)} is VALID [2022-04-28 03:00:23,751 INFO L290 TraceCheckUtils]: 6: Hoare triple {419#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {420#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:00:23,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {420#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {421#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:00:23,752 INFO L290 TraceCheckUtils]: 8: Hoare triple {421#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {415#false} is VALID [2022-04-28 03:00:23,752 INFO L272 TraceCheckUtils]: 9: Hoare triple {415#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {415#false} is VALID [2022-04-28 03:00:23,752 INFO L290 TraceCheckUtils]: 10: Hoare triple {415#false} ~cond := #in~cond; {415#false} is VALID [2022-04-28 03:00:23,752 INFO L290 TraceCheckUtils]: 11: Hoare triple {415#false} assume 0 == ~cond; {415#false} is VALID [2022-04-28 03:00:23,752 INFO L290 TraceCheckUtils]: 12: Hoare triple {415#false} assume !false; {415#false} is VALID [2022-04-28 03:00:23,753 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:00:23,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:00:23,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23103585] [2022-04-28 03:00:23,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23103585] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:00:23,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012868145] [2022-04-28 03:00:23,753 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:00:23,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:23,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:00:23,754 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:00:23,755 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:00:23,788 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:00:23,789 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:00:23,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 03:00:23,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:23,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:00:23,955 INFO L272 TraceCheckUtils]: 0: Hoare triple {414#true} call ULTIMATE.init(); {414#true} is VALID [2022-04-28 03:00:23,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {414#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {414#true} is VALID [2022-04-28 03:00:23,956 INFO L290 TraceCheckUtils]: 2: Hoare triple {414#true} assume true; {414#true} is VALID [2022-04-28 03:00:23,956 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {414#true} {414#true} #34#return; {414#true} is VALID [2022-04-28 03:00:23,956 INFO L272 TraceCheckUtils]: 4: Hoare triple {414#true} call #t~ret4 := main(); {414#true} is VALID [2022-04-28 03:00:23,956 INFO L290 TraceCheckUtils]: 5: Hoare triple {414#true} ~x~0 := 0; {419#(= main_~x~0 0)} is VALID [2022-04-28 03:00:23,957 INFO L290 TraceCheckUtils]: 6: Hoare triple {419#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {420#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:00:23,957 INFO L290 TraceCheckUtils]: 7: Hoare triple {420#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {447#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:00:23,958 INFO L290 TraceCheckUtils]: 8: Hoare triple {447#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {415#false} is VALID [2022-04-28 03:00:23,958 INFO L272 TraceCheckUtils]: 9: Hoare triple {415#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {415#false} is VALID [2022-04-28 03:00:23,958 INFO L290 TraceCheckUtils]: 10: Hoare triple {415#false} ~cond := #in~cond; {415#false} is VALID [2022-04-28 03:00:23,958 INFO L290 TraceCheckUtils]: 11: Hoare triple {415#false} assume 0 == ~cond; {415#false} is VALID [2022-04-28 03:00:23,958 INFO L290 TraceCheckUtils]: 12: Hoare triple {415#false} assume !false; {415#false} is VALID [2022-04-28 03:00:23,958 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:00:23,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:00:24,021 INFO L290 TraceCheckUtils]: 12: Hoare triple {415#false} assume !false; {415#false} is VALID [2022-04-28 03:00:24,021 INFO L290 TraceCheckUtils]: 11: Hoare triple {415#false} assume 0 == ~cond; {415#false} is VALID [2022-04-28 03:00:24,021 INFO L290 TraceCheckUtils]: 10: Hoare triple {415#false} ~cond := #in~cond; {415#false} is VALID [2022-04-28 03:00:24,021 INFO L272 TraceCheckUtils]: 9: Hoare triple {415#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {415#false} is VALID [2022-04-28 03:00:24,022 INFO L290 TraceCheckUtils]: 8: Hoare triple {475#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {415#false} is VALID [2022-04-28 03:00:24,022 INFO L290 TraceCheckUtils]: 7: Hoare triple {479#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {475#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:00:24,023 INFO L290 TraceCheckUtils]: 6: Hoare triple {483#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {479#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 03:00:24,024 INFO L290 TraceCheckUtils]: 5: Hoare triple {414#true} ~x~0 := 0; {483#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 03:00:24,024 INFO L272 TraceCheckUtils]: 4: Hoare triple {414#true} call #t~ret4 := main(); {414#true} is VALID [2022-04-28 03:00:24,024 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {414#true} {414#true} #34#return; {414#true} is VALID [2022-04-28 03:00:24,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {414#true} assume true; {414#true} is VALID [2022-04-28 03:00:24,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {414#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {414#true} is VALID [2022-04-28 03:00:24,024 INFO L272 TraceCheckUtils]: 0: Hoare triple {414#true} call ULTIMATE.init(); {414#true} is VALID [2022-04-28 03:00:24,025 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:00:24,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012868145] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:00:24,025 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:00:24,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-28 03:00:24,025 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:00:24,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [238782082] [2022-04-28 03:00:24,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [238782082] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:00:24,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:00:24,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:00:24,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340249057] [2022-04-28 03:00:24,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:00:24,026 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:00:24,026 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:00:24,027 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:00:24,035 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:00:24,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:00:24,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:24,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:00:24,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-28 03:00:24,036 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:00:24,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:24,116 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 03:00:24,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:00:24,117 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:00:24,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:00:24,117 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:00:24,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-28 03:00:24,118 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:00:24,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-28 03:00:24,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 20 transitions. [2022-04-28 03:00:24,137 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:00:24,138 INFO L225 Difference]: With dead ends: 20 [2022-04-28 03:00:24,138 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 03:00:24,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-04-28 03:00:24,139 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:00:24,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 23 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:00:24,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 03:00:24,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-28 03:00:24,143 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:00:24,144 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:00:24,144 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:00:24,144 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:00:24,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:24,145 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 03:00:24,145 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 03:00:24,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:24,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:24,145 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:00:24,145 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:00:24,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:24,146 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 03:00:24,146 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 03:00:24,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:24,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:24,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:00:24,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:00:24,147 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:00:24,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-28 03:00:24,147 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-28 03:00:24,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:00:24,147 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-28 03:00:24,148 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:00:24,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-28 03:00:24,158 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:00:24,158 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 03:00:24,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 03:00:24,158 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:00:24,158 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:00:24,177 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:00:24,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-28 03:00:24,567 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:00:24,568 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:00:24,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:00:24,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1905189066, now seen corresponding path program 5 times [2022-04-28 03:00:24,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:24,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1354284130] [2022-04-28 03:00:26,969 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:00:26,971 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:00:26,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1749097097, now seen corresponding path program 1 times [2022-04-28 03:00:26,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:26,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276877892] [2022-04-28 03:00:26,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:26,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:26,979 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 2) .v_it_3.0) (* (- 1) main_~x~0_5) (* 4294967296 (div (+ (* 2 .v_it_3.0) main_~x~0_5) 4294967296)) 268435455) 0)) [2022-04-28 03:00:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:00:27,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1528278756] [2022-04-28 03:00:27,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:27,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:27,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:00:27,019 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:00:27,020 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:00:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:00:27,066 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:00:27,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:00:27,088 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:00:27,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1905189066, now seen corresponding path program 6 times [2022-04-28 03:00:27,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:27,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129172099] [2022-04-28 03:00:27,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:27,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:27,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:27,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:00:27,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:27,176 INFO L290 TraceCheckUtils]: 0: Hoare triple {619#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {610#true} is VALID [2022-04-28 03:00:27,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {610#true} assume true; {610#true} is VALID [2022-04-28 03:00:27,177 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {610#true} {610#true} #34#return; {610#true} is VALID [2022-04-28 03:00:27,177 INFO L272 TraceCheckUtils]: 0: Hoare triple {610#true} call ULTIMATE.init(); {619#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:00:27,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {619#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {610#true} is VALID [2022-04-28 03:00:27,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {610#true} assume true; {610#true} is VALID [2022-04-28 03:00:27,178 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {610#true} {610#true} #34#return; {610#true} is VALID [2022-04-28 03:00:27,178 INFO L272 TraceCheckUtils]: 4: Hoare triple {610#true} call #t~ret4 := main(); {610#true} is VALID [2022-04-28 03:00:27,179 INFO L290 TraceCheckUtils]: 5: Hoare triple {610#true} ~x~0 := 0; {615#(= main_~x~0 0)} is VALID [2022-04-28 03:00:27,179 INFO L290 TraceCheckUtils]: 6: Hoare triple {615#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {616#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:00:27,180 INFO L290 TraceCheckUtils]: 7: Hoare triple {616#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {617#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:00:27,182 INFO L290 TraceCheckUtils]: 8: Hoare triple {617#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {618#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-28 03:00:27,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {618#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} assume !(~x~0 % 4294967296 < 268435455); {611#false} is VALID [2022-04-28 03:00:27,193 INFO L272 TraceCheckUtils]: 10: Hoare triple {611#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {611#false} is VALID [2022-04-28 03:00:27,193 INFO L290 TraceCheckUtils]: 11: Hoare triple {611#false} ~cond := #in~cond; {611#false} is VALID [2022-04-28 03:00:27,194 INFO L290 TraceCheckUtils]: 12: Hoare triple {611#false} assume 0 == ~cond; {611#false} is VALID [2022-04-28 03:00:27,194 INFO L290 TraceCheckUtils]: 13: Hoare triple {611#false} assume !false; {611#false} is VALID [2022-04-28 03:00:27,194 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:00:27,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:00:27,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129172099] [2022-04-28 03:00:27,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129172099] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:00:27,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977555301] [2022-04-28 03:00:27,194 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:00:27,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:27,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:00:27,195 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:00:27,197 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:00:27,225 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 03:00:27,226 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:00:27,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 03:00:27,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:27,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:00:27,304 INFO L272 TraceCheckUtils]: 0: Hoare triple {610#true} call ULTIMATE.init(); {610#true} is VALID [2022-04-28 03:00:27,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {610#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {610#true} is VALID [2022-04-28 03:00:27,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {610#true} assume true; {610#true} is VALID [2022-04-28 03:00:27,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {610#true} {610#true} #34#return; {610#true} is VALID [2022-04-28 03:00:27,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {610#true} call #t~ret4 := main(); {610#true} is VALID [2022-04-28 03:00:27,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {610#true} ~x~0 := 0; {615#(= main_~x~0 0)} is VALID [2022-04-28 03:00:27,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {615#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {616#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:00:27,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {616#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {617#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:00:27,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {617#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {647#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:00:27,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {647#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !(~x~0 % 4294967296 < 268435455); {611#false} is VALID [2022-04-28 03:00:27,307 INFO L272 TraceCheckUtils]: 10: Hoare triple {611#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {611#false} is VALID [2022-04-28 03:00:27,307 INFO L290 TraceCheckUtils]: 11: Hoare triple {611#false} ~cond := #in~cond; {611#false} is VALID [2022-04-28 03:00:27,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {611#false} assume 0 == ~cond; {611#false} is VALID [2022-04-28 03:00:27,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {611#false} assume !false; {611#false} is VALID [2022-04-28 03:00:27,308 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:00:27,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:00:27,476 INFO L290 TraceCheckUtils]: 13: Hoare triple {611#false} assume !false; {611#false} is VALID [2022-04-28 03:00:27,477 INFO L290 TraceCheckUtils]: 12: Hoare triple {666#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {611#false} is VALID [2022-04-28 03:00:27,477 INFO L290 TraceCheckUtils]: 11: Hoare triple {670#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {666#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:00:27,478 INFO L272 TraceCheckUtils]: 10: Hoare triple {674#(< 0 (mod main_~x~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {670#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:00:27,478 INFO L290 TraceCheckUtils]: 9: Hoare triple {678#(or (< 0 (mod main_~x~0 2)) (< (mod main_~x~0 4294967296) 268435455))} assume !(~x~0 % 4294967296 < 268435455); {674#(< 0 (mod main_~x~0 2))} is VALID [2022-04-28 03:00:27,479 INFO L290 TraceCheckUtils]: 8: Hoare triple {682#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {678#(or (< 0 (mod main_~x~0 2)) (< (mod main_~x~0 4294967296) 268435455))} is VALID [2022-04-28 03:00:27,480 INFO L290 TraceCheckUtils]: 7: Hoare triple {686#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {682#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} is VALID [2022-04-28 03:00:27,481 INFO L290 TraceCheckUtils]: 6: Hoare triple {690#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {686#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} is VALID [2022-04-28 03:00:27,482 INFO L290 TraceCheckUtils]: 5: Hoare triple {610#true} ~x~0 := 0; {690#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} is VALID [2022-04-28 03:00:27,482 INFO L272 TraceCheckUtils]: 4: Hoare triple {610#true} call #t~ret4 := main(); {610#true} is VALID [2022-04-28 03:00:27,482 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {610#true} {610#true} #34#return; {610#true} is VALID [2022-04-28 03:00:27,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {610#true} assume true; {610#true} is VALID [2022-04-28 03:00:27,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {610#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {610#true} is VALID [2022-04-28 03:00:27,482 INFO L272 TraceCheckUtils]: 0: Hoare triple {610#true} call ULTIMATE.init(); {610#true} is VALID [2022-04-28 03:00:27,483 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:00:27,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977555301] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:00:27,483 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:00:27,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 9] total 15 [2022-04-28 03:00:27,483 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:00:27,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1354284130] [2022-04-28 03:00:27,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1354284130] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:00:27,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:00:27,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 03:00:27,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426034296] [2022-04-28 03:00:27,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:00:27,484 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:00:27,484 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:00:27,484 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:00:27,498 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:00:27,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 03:00:27,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:27,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 03:00:27,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-04-28 03:00:27,499 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:00:27,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:27,627 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-28 03:00:27,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 03:00:27,627 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:00:27,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:00:27,628 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:00:27,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-28 03:00:27,630 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:00:27,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-28 03:00:27,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 21 transitions. [2022-04-28 03:00:27,647 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:00:27,649 INFO L225 Difference]: With dead ends: 21 [2022-04-28 03:00:27,649 INFO L226 Difference]: Without dead ends: 16 [2022-04-28 03:00:27,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2022-04-28 03:00:27,650 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:00:27,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 33 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:00:27,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-28 03:00:27,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-28 03:00:27,658 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:00:27,658 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:00:27,658 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:00:27,659 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:00:27,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:27,661 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-28 03:00:27,661 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 03:00:27,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:27,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:27,661 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:00:27,661 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:00:27,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:27,663 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-28 03:00:27,663 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 03:00:27,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:27,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:27,664 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:00:27,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:00:27,664 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:00:27,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-28 03:00:27,666 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2022-04-28 03:00:27,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:00:27,667 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-28 03:00:27,668 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:00:27,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 16 transitions. [2022-04-28 03:00:27,680 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:00:27,680 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 03:00:27,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 03:00:27,681 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:00:27,681 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:00:27,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-28 03:00:27,917 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:00:28,101 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:00:28,102 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:00:28,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:00:28,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1105142364, now seen corresponding path program 7 times [2022-04-28 03:00:28,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:28,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1344831760] [2022-04-28 03:00:28,393 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:00:28,395 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:00:28,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1689991753, now seen corresponding path program 1 times [2022-04-28 03:00:28,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:28,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991403369] [2022-04-28 03:00:28,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:28,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:28,404 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 2) .v_it_4.0) (* (- 1) main_~x~0_5) (* 4294967296 (div (+ (* 2 .v_it_4.0) main_~x~0_5) 4294967296)) 268435455) 0)) [2022-04-28 03:00:28,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:00:28,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [319547255] [2022-04-28 03:00:28,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:28,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:28,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:00:28,428 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:00:28,434 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:00:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:00:28,478 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:00:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:00:28,490 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:00:28,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1105142364, now seen corresponding path program 8 times [2022-04-28 03:00:28,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:28,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424925868] [2022-04-28 03:00:28,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:28,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:28,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:28,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:00:28,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:28,574 INFO L290 TraceCheckUtils]: 0: Hoare triple {835#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {825#true} is VALID [2022-04-28 03:00:28,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {825#true} assume true; {825#true} is VALID [2022-04-28 03:00:28,575 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {825#true} {825#true} #34#return; {825#true} is VALID [2022-04-28 03:00:28,575 INFO L272 TraceCheckUtils]: 0: Hoare triple {825#true} call ULTIMATE.init(); {835#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:00:28,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {835#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {825#true} is VALID [2022-04-28 03:00:28,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {825#true} assume true; {825#true} is VALID [2022-04-28 03:00:28,576 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {825#true} {825#true} #34#return; {825#true} is VALID [2022-04-28 03:00:28,576 INFO L272 TraceCheckUtils]: 4: Hoare triple {825#true} call #t~ret4 := main(); {825#true} is VALID [2022-04-28 03:00:28,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {825#true} ~x~0 := 0; {830#(= main_~x~0 0)} is VALID [2022-04-28 03:00:28,576 INFO L290 TraceCheckUtils]: 6: Hoare triple {830#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {831#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:00:28,577 INFO L290 TraceCheckUtils]: 7: Hoare triple {831#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {832#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:00:28,577 INFO L290 TraceCheckUtils]: 8: Hoare triple {832#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {833#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:00:28,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {833#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {834#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:00:28,579 INFO L290 TraceCheckUtils]: 10: Hoare triple {834#(and (<= main_~x~0 8) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {826#false} is VALID [2022-04-28 03:00:28,579 INFO L272 TraceCheckUtils]: 11: Hoare triple {826#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {826#false} is VALID [2022-04-28 03:00:28,579 INFO L290 TraceCheckUtils]: 12: Hoare triple {826#false} ~cond := #in~cond; {826#false} is VALID [2022-04-28 03:00:28,579 INFO L290 TraceCheckUtils]: 13: Hoare triple {826#false} assume 0 == ~cond; {826#false} is VALID [2022-04-28 03:00:28,579 INFO L290 TraceCheckUtils]: 14: Hoare triple {826#false} assume !false; {826#false} is VALID [2022-04-28 03:00:28,579 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:00:28,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:00:28,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424925868] [2022-04-28 03:00:28,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424925868] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:00:28,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097038607] [2022-04-28 03:00:28,580 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:00:28,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:28,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:00:28,581 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:00:28,582 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:00:28,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:00:28,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:00:28,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 03:00:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:28,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:00:28,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {825#true} call ULTIMATE.init(); {825#true} is VALID [2022-04-28 03:00:28,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {825#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {825#true} is VALID [2022-04-28 03:00:28,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {825#true} assume true; {825#true} is VALID [2022-04-28 03:00:28,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {825#true} {825#true} #34#return; {825#true} is VALID [2022-04-28 03:00:28,773 INFO L272 TraceCheckUtils]: 4: Hoare triple {825#true} call #t~ret4 := main(); {825#true} is VALID [2022-04-28 03:00:28,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {825#true} ~x~0 := 0; {830#(= main_~x~0 0)} is VALID [2022-04-28 03:00:28,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {830#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {831#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:00:28,774 INFO L290 TraceCheckUtils]: 7: Hoare triple {831#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {832#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:00:28,776 INFO L290 TraceCheckUtils]: 8: Hoare triple {832#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {833#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:00:28,776 INFO L290 TraceCheckUtils]: 9: Hoare triple {833#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {866#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:00:28,777 INFO L290 TraceCheckUtils]: 10: Hoare triple {866#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {826#false} is VALID [2022-04-28 03:00:28,777 INFO L272 TraceCheckUtils]: 11: Hoare triple {826#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {826#false} is VALID [2022-04-28 03:00:28,777 INFO L290 TraceCheckUtils]: 12: Hoare triple {826#false} ~cond := #in~cond; {826#false} is VALID [2022-04-28 03:00:28,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {826#false} assume 0 == ~cond; {826#false} is VALID [2022-04-28 03:00:28,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {826#false} assume !false; {826#false} is VALID [2022-04-28 03:00:28,777 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:00:28,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:00:28,877 INFO L290 TraceCheckUtils]: 14: Hoare triple {826#false} assume !false; {826#false} is VALID [2022-04-28 03:00:28,877 INFO L290 TraceCheckUtils]: 13: Hoare triple {826#false} assume 0 == ~cond; {826#false} is VALID [2022-04-28 03:00:28,878 INFO L290 TraceCheckUtils]: 12: Hoare triple {826#false} ~cond := #in~cond; {826#false} is VALID [2022-04-28 03:00:28,878 INFO L272 TraceCheckUtils]: 11: Hoare triple {826#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {826#false} is VALID [2022-04-28 03:00:28,880 INFO L290 TraceCheckUtils]: 10: Hoare triple {894#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {826#false} is VALID [2022-04-28 03:00:28,881 INFO L290 TraceCheckUtils]: 9: Hoare triple {898#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {894#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:00:28,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {902#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {898#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 03:00:28,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {906#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {902#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 03:00:28,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {910#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {906#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 03:00:28,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {825#true} ~x~0 := 0; {910#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 03:00:28,886 INFO L272 TraceCheckUtils]: 4: Hoare triple {825#true} call #t~ret4 := main(); {825#true} is VALID [2022-04-28 03:00:28,886 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {825#true} {825#true} #34#return; {825#true} is VALID [2022-04-28 03:00:28,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {825#true} assume true; {825#true} is VALID [2022-04-28 03:00:28,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {825#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {825#true} is VALID [2022-04-28 03:00:28,887 INFO L272 TraceCheckUtils]: 0: Hoare triple {825#true} call ULTIMATE.init(); {825#true} is VALID [2022-04-28 03:00:28,887 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:00:28,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097038607] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:00:28,887 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:00:28,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-28 03:00:28,887 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:00:28,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1344831760] [2022-04-28 03:00:28,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1344831760] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:00:28,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:00:28,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 03:00:28,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348157541] [2022-04-28 03:00:28,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:00:28,888 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:00:28,888 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:00:28,888 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:00:28,906 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:00:28,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 03:00:28,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:28,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 03:00:28,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-04-28 03:00:28,907 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:00:29,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:29,072 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 03:00:29,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 03:00:29,072 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:00:29,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:00:29,072 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:00:29,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-28 03:00:29,073 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:00:29,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-28 03:00:29,074 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 22 transitions. [2022-04-28 03:00:29,100 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:00:29,101 INFO L225 Difference]: With dead ends: 22 [2022-04-28 03:00:29,101 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 03:00:29,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2022-04-28 03:00:29,102 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:00:29,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 33 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:00:29,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 03:00:29,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 03:00:29,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:00:29,110 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:00:29,110 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:00:29,110 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:00:29,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:29,111 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-28 03:00:29,111 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 03:00:29,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:29,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:29,112 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:00:29,112 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:00:29,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:29,112 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-28 03:00:29,112 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 03:00:29,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:29,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:29,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:00:29,113 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:00:29,113 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:00:29,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-28 03:00:29,113 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2022-04-28 03:00:29,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:00:29,113 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-28 03:00:29,114 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:00:29,114 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2022-04-28 03:00:29,129 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:00:29,129 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 03:00:29,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 03:00:29,129 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:00:29,129 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:00:29,146 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:00:29,348 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:00:29,543 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:00:29,544 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:00:29,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:00:29,544 INFO L85 PathProgramCache]: Analyzing trace with hash -63863818, now seen corresponding path program 9 times [2022-04-28 03:00:29,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:29,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1178717081] [2022-04-28 03:00:31,757 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:00:31,759 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:00:31,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1630886409, now seen corresponding path program 1 times [2022-04-28 03:00:31,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:31,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910685145] [2022-04-28 03:00:31,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:31,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:31,767 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_5.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_5.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:00:31,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:00:31,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1101006461] [2022-04-28 03:00:31,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:31,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:31,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:00:31,776 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:00:31,777 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:00:31,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:00:31,818 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:00:31,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:00:31,829 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:00:31,830 INFO L85 PathProgramCache]: Analyzing trace with hash -63863818, now seen corresponding path program 10 times [2022-04-28 03:00:31,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:31,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320176011] [2022-04-28 03:00:31,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:31,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:31,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:31,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:00:31,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:31,935 INFO L290 TraceCheckUtils]: 0: Hoare triple {1064#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1053#true} is VALID [2022-04-28 03:00:31,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {1053#true} assume true; {1053#true} is VALID [2022-04-28 03:00:31,936 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1053#true} {1053#true} #34#return; {1053#true} is VALID [2022-04-28 03:00:31,936 INFO L272 TraceCheckUtils]: 0: Hoare triple {1053#true} call ULTIMATE.init(); {1064#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:00:31,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {1064#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1053#true} is VALID [2022-04-28 03:00:31,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {1053#true} assume true; {1053#true} is VALID [2022-04-28 03:00:31,937 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1053#true} {1053#true} #34#return; {1053#true} is VALID [2022-04-28 03:00:31,937 INFO L272 TraceCheckUtils]: 4: Hoare triple {1053#true} call #t~ret4 := main(); {1053#true} is VALID [2022-04-28 03:00:31,937 INFO L290 TraceCheckUtils]: 5: Hoare triple {1053#true} ~x~0 := 0; {1058#(= main_~x~0 0)} is VALID [2022-04-28 03:00:31,937 INFO L290 TraceCheckUtils]: 6: Hoare triple {1058#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1059#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:00:31,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {1059#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1060#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:00:31,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {1060#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1061#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:00:31,939 INFO L290 TraceCheckUtils]: 9: Hoare triple {1061#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1062#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:00:31,940 INFO L290 TraceCheckUtils]: 10: Hoare triple {1062#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1063#(and (<= main_~x~0 10) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:00:31,940 INFO L290 TraceCheckUtils]: 11: Hoare triple {1063#(and (<= main_~x~0 10) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {1054#false} is VALID [2022-04-28 03:00:31,940 INFO L272 TraceCheckUtils]: 12: Hoare triple {1054#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1054#false} is VALID [2022-04-28 03:00:31,940 INFO L290 TraceCheckUtils]: 13: Hoare triple {1054#false} ~cond := #in~cond; {1054#false} is VALID [2022-04-28 03:00:31,941 INFO L290 TraceCheckUtils]: 14: Hoare triple {1054#false} assume 0 == ~cond; {1054#false} is VALID [2022-04-28 03:00:31,941 INFO L290 TraceCheckUtils]: 15: Hoare triple {1054#false} assume !false; {1054#false} is VALID [2022-04-28 03:00:31,941 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:00:31,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:00:31,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320176011] [2022-04-28 03:00:31,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320176011] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:00:31,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737797725] [2022-04-28 03:00:31,941 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:00:31,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:31,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:00:31,942 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:00:31,973 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:00:31,973 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:00:31,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 03:00:31,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:31,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:00:31,984 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:00:32,161 INFO L272 TraceCheckUtils]: 0: Hoare triple {1053#true} call ULTIMATE.init(); {1053#true} is VALID [2022-04-28 03:00:32,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {1053#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1053#true} is VALID [2022-04-28 03:00:32,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {1053#true} assume true; {1053#true} is VALID [2022-04-28 03:00:32,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1053#true} {1053#true} #34#return; {1053#true} is VALID [2022-04-28 03:00:32,161 INFO L272 TraceCheckUtils]: 4: Hoare triple {1053#true} call #t~ret4 := main(); {1053#true} is VALID [2022-04-28 03:00:32,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {1053#true} ~x~0 := 0; {1058#(= main_~x~0 0)} is VALID [2022-04-28 03:00:32,162 INFO L290 TraceCheckUtils]: 6: Hoare triple {1058#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1059#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:00:32,163 INFO L290 TraceCheckUtils]: 7: Hoare triple {1059#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1060#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:00:32,163 INFO L290 TraceCheckUtils]: 8: Hoare triple {1060#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1061#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:00:32,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {1061#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1062#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:00:32,164 INFO L290 TraceCheckUtils]: 10: Hoare triple {1062#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1098#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:00:32,165 INFO L290 TraceCheckUtils]: 11: Hoare triple {1098#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {1054#false} is VALID [2022-04-28 03:00:32,165 INFO L272 TraceCheckUtils]: 12: Hoare triple {1054#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1054#false} is VALID [2022-04-28 03:00:32,165 INFO L290 TraceCheckUtils]: 13: Hoare triple {1054#false} ~cond := #in~cond; {1054#false} is VALID [2022-04-28 03:00:32,165 INFO L290 TraceCheckUtils]: 14: Hoare triple {1054#false} assume 0 == ~cond; {1054#false} is VALID [2022-04-28 03:00:32,165 INFO L290 TraceCheckUtils]: 15: Hoare triple {1054#false} assume !false; {1054#false} is VALID [2022-04-28 03:00:32,165 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:00:32,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:00:32,292 INFO L290 TraceCheckUtils]: 15: Hoare triple {1054#false} assume !false; {1054#false} is VALID [2022-04-28 03:00:32,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {1054#false} assume 0 == ~cond; {1054#false} is VALID [2022-04-28 03:00:32,292 INFO L290 TraceCheckUtils]: 13: Hoare triple {1054#false} ~cond := #in~cond; {1054#false} is VALID [2022-04-28 03:00:32,292 INFO L272 TraceCheckUtils]: 12: Hoare triple {1054#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1054#false} is VALID [2022-04-28 03:00:32,293 INFO L290 TraceCheckUtils]: 11: Hoare triple {1126#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {1054#false} is VALID [2022-04-28 03:00:32,294 INFO L290 TraceCheckUtils]: 10: Hoare triple {1130#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1126#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:00:32,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {1134#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1130#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 03:00:32,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {1138#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1134#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 03:00:32,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {1142#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1138#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 03:00:32,296 INFO L290 TraceCheckUtils]: 6: Hoare triple {1146#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1142#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 03:00:32,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {1053#true} ~x~0 := 0; {1146#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-28 03:00:32,297 INFO L272 TraceCheckUtils]: 4: Hoare triple {1053#true} call #t~ret4 := main(); {1053#true} is VALID [2022-04-28 03:00:32,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1053#true} {1053#true} #34#return; {1053#true} is VALID [2022-04-28 03:00:32,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {1053#true} assume true; {1053#true} is VALID [2022-04-28 03:00:32,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {1053#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1053#true} is VALID [2022-04-28 03:00:32,297 INFO L272 TraceCheckUtils]: 0: Hoare triple {1053#true} call ULTIMATE.init(); {1053#true} is VALID [2022-04-28 03:00:32,297 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:00:32,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737797725] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:00:32,298 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:00:32,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-28 03:00:32,298 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:00:32,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1178717081] [2022-04-28 03:00:32,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1178717081] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:00:32,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:00:32,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:00:32,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494835274] [2022-04-28 03:00:32,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:00:32,299 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:00:32,299 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:00:32,299 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:00:32,310 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:00:32,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 03:00:32,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:32,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 03:00:32,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-04-28 03:00:32,311 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:00:32,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:32,459 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-28 03:00:32,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 03:00:32,459 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:00:32,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:00:32,459 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:00:32,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-28 03:00:32,460 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:00:32,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-28 03:00:32,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 23 transitions. [2022-04-28 03:00:32,477 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:00:32,478 INFO L225 Difference]: With dead ends: 23 [2022-04-28 03:00:32,478 INFO L226 Difference]: Without dead ends: 18 [2022-04-28 03:00:32,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=315, Unknown=0, NotChecked=0, Total=462 [2022-04-28 03:00:32,479 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:00:32,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 23 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:00:32,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-28 03:00:32,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-28 03:00:32,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:00:32,488 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:00:32,488 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:00:32,488 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:00:32,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:32,489 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-28 03:00:32,489 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-28 03:00:32,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:32,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:32,490 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:00:32,490 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:00:32,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:32,490 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-28 03:00:32,490 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-28 03:00:32,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:32,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:32,491 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:00:32,491 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:00:32,491 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:00:32,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-28 03:00:32,491 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2022-04-28 03:00:32,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:00:32,491 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-28 03:00:32,492 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:00:32,492 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 18 transitions. [2022-04-28 03:00:32,506 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:00:32,506 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-28 03:00:32,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 03:00:32,506 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:00:32,506 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:00:32,523 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:00:32,721 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:00:32,915 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:00:32,916 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:00:32,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:00:32,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1943317092, now seen corresponding path program 11 times [2022-04-28 03:00:32,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:32,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1408939359] [2022-04-28 03:00:33,070 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:00:33,072 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:00:33,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1571781065, now seen corresponding path program 1 times [2022-04-28 03:00:33,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:33,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540166100] [2022-04-28 03:00:33,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:33,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:33,081 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_6.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_6.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:00:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:00:33,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1314914634] [2022-04-28 03:00:33,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:33,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:33,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:00:33,088 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:00:33,089 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:00:33,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:00:33,136 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:00:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:00:33,145 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:00:33,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1943317092, now seen corresponding path program 12 times [2022-04-28 03:00:33,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:33,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663726607] [2022-04-28 03:00:33,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:33,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:33,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:33,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:00:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:33,268 INFO L290 TraceCheckUtils]: 0: Hoare triple {1309#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1297#true} is VALID [2022-04-28 03:00:33,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {1297#true} assume true; {1297#true} is VALID [2022-04-28 03:00:33,268 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1297#true} {1297#true} #34#return; {1297#true} is VALID [2022-04-28 03:00:33,269 INFO L272 TraceCheckUtils]: 0: Hoare triple {1297#true} call ULTIMATE.init(); {1309#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:00:33,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {1309#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1297#true} is VALID [2022-04-28 03:00:33,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {1297#true} assume true; {1297#true} is VALID [2022-04-28 03:00:33,269 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1297#true} {1297#true} #34#return; {1297#true} is VALID [2022-04-28 03:00:33,269 INFO L272 TraceCheckUtils]: 4: Hoare triple {1297#true} call #t~ret4 := main(); {1297#true} is VALID [2022-04-28 03:00:33,269 INFO L290 TraceCheckUtils]: 5: Hoare triple {1297#true} ~x~0 := 0; {1302#(= main_~x~0 0)} is VALID [2022-04-28 03:00:33,270 INFO L290 TraceCheckUtils]: 6: Hoare triple {1302#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1303#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:00:33,271 INFO L290 TraceCheckUtils]: 7: Hoare triple {1303#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1304#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:00:33,271 INFO L290 TraceCheckUtils]: 8: Hoare triple {1304#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1305#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:00:33,272 INFO L290 TraceCheckUtils]: 9: Hoare triple {1305#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1306#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:00:33,272 INFO L290 TraceCheckUtils]: 10: Hoare triple {1306#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1307#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:00:33,273 INFO L290 TraceCheckUtils]: 11: Hoare triple {1307#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1308#(and (<= main_~x~0 12) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:00:33,273 INFO L290 TraceCheckUtils]: 12: Hoare triple {1308#(and (<= main_~x~0 12) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {1298#false} is VALID [2022-04-28 03:00:33,273 INFO L272 TraceCheckUtils]: 13: Hoare triple {1298#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1298#false} is VALID [2022-04-28 03:00:33,274 INFO L290 TraceCheckUtils]: 14: Hoare triple {1298#false} ~cond := #in~cond; {1298#false} is VALID [2022-04-28 03:00:33,274 INFO L290 TraceCheckUtils]: 15: Hoare triple {1298#false} assume 0 == ~cond; {1298#false} is VALID [2022-04-28 03:00:33,274 INFO L290 TraceCheckUtils]: 16: Hoare triple {1298#false} assume !false; {1298#false} is VALID [2022-04-28 03:00:33,274 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:00:33,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:00:33,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663726607] [2022-04-28 03:00:33,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663726607] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:00:33,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831505243] [2022-04-28 03:00:33,274 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:00:33,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:33,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:00:33,276 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:00:33,276 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:00:33,306 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 03:00:33,306 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:00:33,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 03:00:33,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:33,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:00:33,431 INFO L272 TraceCheckUtils]: 0: Hoare triple {1297#true} call ULTIMATE.init(); {1297#true} is VALID [2022-04-28 03:00:33,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {1297#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1297#true} is VALID [2022-04-28 03:00:33,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {1297#true} assume true; {1297#true} is VALID [2022-04-28 03:00:33,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1297#true} {1297#true} #34#return; {1297#true} is VALID [2022-04-28 03:00:33,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {1297#true} call #t~ret4 := main(); {1297#true} is VALID [2022-04-28 03:00:33,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {1297#true} ~x~0 := 0; {1302#(= main_~x~0 0)} is VALID [2022-04-28 03:00:33,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {1302#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1303#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:00:33,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {1303#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1304#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:00:33,434 INFO L290 TraceCheckUtils]: 8: Hoare triple {1304#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1305#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:00:33,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {1305#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1306#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:00:33,435 INFO L290 TraceCheckUtils]: 10: Hoare triple {1306#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1307#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:00:33,436 INFO L290 TraceCheckUtils]: 11: Hoare triple {1307#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1346#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:00:33,436 INFO L290 TraceCheckUtils]: 12: Hoare triple {1346#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {1298#false} is VALID [2022-04-28 03:00:33,436 INFO L272 TraceCheckUtils]: 13: Hoare triple {1298#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1298#false} is VALID [2022-04-28 03:00:33,436 INFO L290 TraceCheckUtils]: 14: Hoare triple {1298#false} ~cond := #in~cond; {1298#false} is VALID [2022-04-28 03:00:33,436 INFO L290 TraceCheckUtils]: 15: Hoare triple {1298#false} assume 0 == ~cond; {1298#false} is VALID [2022-04-28 03:00:33,437 INFO L290 TraceCheckUtils]: 16: Hoare triple {1298#false} assume !false; {1298#false} is VALID [2022-04-28 03:00:33,437 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:00:33,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:00:33,728 INFO L290 TraceCheckUtils]: 16: Hoare triple {1298#false} assume !false; {1298#false} is VALID [2022-04-28 03:00:33,733 INFO L290 TraceCheckUtils]: 15: Hoare triple {1365#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1298#false} is VALID [2022-04-28 03:00:33,733 INFO L290 TraceCheckUtils]: 14: Hoare triple {1369#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1365#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:00:33,734 INFO L272 TraceCheckUtils]: 13: Hoare triple {1373#(< 0 (mod main_~x~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1369#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:00:33,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {1377#(or (< 0 (mod main_~x~0 2)) (< (mod main_~x~0 4294967296) 268435455))} assume !(~x~0 % 4294967296 < 268435455); {1373#(< 0 (mod main_~x~0 2))} is VALID [2022-04-28 03:00:33,735 INFO L290 TraceCheckUtils]: 11: Hoare triple {1381#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1377#(or (< 0 (mod main_~x~0 2)) (< (mod main_~x~0 4294967296) 268435455))} is VALID [2022-04-28 03:00:33,736 INFO L290 TraceCheckUtils]: 10: Hoare triple {1385#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1381#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} is VALID [2022-04-28 03:00:33,736 INFO L290 TraceCheckUtils]: 9: Hoare triple {1389#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1385#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} is VALID [2022-04-28 03:00:33,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {1393#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1389#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} is VALID [2022-04-28 03:00:33,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {1397#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1393#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} is VALID [2022-04-28 03:00:33,743 INFO L290 TraceCheckUtils]: 6: Hoare triple {1401#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1397#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} is VALID [2022-04-28 03:00:33,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {1297#true} ~x~0 := 0; {1401#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} is VALID [2022-04-28 03:00:33,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {1297#true} call #t~ret4 := main(); {1297#true} is VALID [2022-04-28 03:00:33,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1297#true} {1297#true} #34#return; {1297#true} is VALID [2022-04-28 03:00:33,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {1297#true} assume true; {1297#true} is VALID [2022-04-28 03:00:33,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {1297#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1297#true} is VALID [2022-04-28 03:00:33,744 INFO L272 TraceCheckUtils]: 0: Hoare triple {1297#true} call ULTIMATE.init(); {1297#true} is VALID [2022-04-28 03:00:33,745 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:00:33,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831505243] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:00:33,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:00:33,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 12] total 21 [2022-04-28 03:00:33,745 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:00:33,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1408939359] [2022-04-28 03:00:33,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1408939359] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:00:33,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:00:33,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 03:00:33,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223278271] [2022-04-28 03:00:33,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:00:33,746 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:00:33,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:00:33,746 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:00:33,757 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:00:33,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 03:00:33,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:33,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 03:00:33,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2022-04-28 03:00:33,758 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:00:33,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:33,950 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 03:00:33,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 03:00:33,951 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:00:33,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:00:33,951 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:00:33,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2022-04-28 03:00:33,952 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:00:33,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 24 transitions. [2022-04-28 03:00:33,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 24 transitions. [2022-04-28 03:00:33,976 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:00:33,977 INFO L225 Difference]: With dead ends: 24 [2022-04-28 03:00:33,977 INFO L226 Difference]: Without dead ends: 19 [2022-04-28 03:00:33,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=198, Invalid=558, Unknown=0, NotChecked=0, Total=756 [2022-04-28 03:00:33,978 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:00:33,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:00:33,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-28 03:00:33,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-28 03:00:33,988 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:00:33,988 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:00:33,988 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:00:33,988 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:00:33,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:33,989 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-28 03:00:33,989 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-28 03:00:33,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:33,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:33,990 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:00:33,990 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:00:33,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:33,990 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-28 03:00:33,990 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-28 03:00:33,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:33,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:33,990 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:00:33,990 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:00:33,991 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:00:33,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2022-04-28 03:00:33,991 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2022-04-28 03:00:33,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:00:33,991 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2022-04-28 03:00:33,991 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:00:33,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 19 transitions. [2022-04-28 03:00:34,010 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:00:34,010 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-28 03:00:34,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 03:00:34,010 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:00:34,010 INFO L195 NwaCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:00:34,014 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:00:34,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-28 03:00:34,427 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:00:34,427 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:00:34,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:00:34,428 INFO L85 PathProgramCache]: Analyzing trace with hash -76826442, now seen corresponding path program 13 times [2022-04-28 03:00:34,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:34,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1967609363] [2022-04-28 03:00:34,584 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:00:34,586 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:00:34,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1512675721, now seen corresponding path program 1 times [2022-04-28 03:00:34,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:34,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133799263] [2022-04-28 03:00:34,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:34,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:34,598 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_7.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_7.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:00:34,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:00:34,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1365997121] [2022-04-28 03:00:34,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:34,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:34,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:00:34,617 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:00:34,660 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:00:34,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:00:34,667 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:00:34,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:00:34,674 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:00:34,675 INFO L85 PathProgramCache]: Analyzing trace with hash -76826442, now seen corresponding path program 14 times [2022-04-28 03:00:34,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:34,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527496137] [2022-04-28 03:00:34,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:34,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:34,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:34,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:00:34,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:34,790 INFO L290 TraceCheckUtils]: 0: Hoare triple {1573#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1560#true} is VALID [2022-04-28 03:00:34,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-28 03:00:34,790 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1560#true} {1560#true} #34#return; {1560#true} is VALID [2022-04-28 03:00:34,791 INFO L272 TraceCheckUtils]: 0: Hoare triple {1560#true} call ULTIMATE.init(); {1573#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:00:34,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {1573#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1560#true} is VALID [2022-04-28 03:00:34,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-28 03:00:34,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1560#true} {1560#true} #34#return; {1560#true} is VALID [2022-04-28 03:00:34,791 INFO L272 TraceCheckUtils]: 4: Hoare triple {1560#true} call #t~ret4 := main(); {1560#true} is VALID [2022-04-28 03:00:34,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {1560#true} ~x~0 := 0; {1565#(= main_~x~0 0)} is VALID [2022-04-28 03:00:34,792 INFO L290 TraceCheckUtils]: 6: Hoare triple {1565#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1566#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:00:34,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {1566#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1567#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:00:34,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {1567#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1568#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:00:34,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {1568#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1569#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:00:34,794 INFO L290 TraceCheckUtils]: 10: Hoare triple {1569#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1570#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:00:34,795 INFO L290 TraceCheckUtils]: 11: Hoare triple {1570#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1571#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:00:34,795 INFO L290 TraceCheckUtils]: 12: Hoare triple {1571#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1572#(and (<= main_~x~0 14) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:00:34,796 INFO L290 TraceCheckUtils]: 13: Hoare triple {1572#(and (<= main_~x~0 14) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {1561#false} is VALID [2022-04-28 03:00:34,796 INFO L272 TraceCheckUtils]: 14: Hoare triple {1561#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1561#false} is VALID [2022-04-28 03:00:34,796 INFO L290 TraceCheckUtils]: 15: Hoare triple {1561#false} ~cond := #in~cond; {1561#false} is VALID [2022-04-28 03:00:34,796 INFO L290 TraceCheckUtils]: 16: Hoare triple {1561#false} assume 0 == ~cond; {1561#false} is VALID [2022-04-28 03:00:34,796 INFO L290 TraceCheckUtils]: 17: Hoare triple {1561#false} assume !false; {1561#false} is VALID [2022-04-28 03:00:34,796 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:00:34,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:00:34,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527496137] [2022-04-28 03:00:34,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527496137] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:00:34,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925539486] [2022-04-28 03:00:34,797 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:00:34,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:34,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:00:34,798 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:00:34,799 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:00:34,823 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:00:34,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:00:34,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 03:00:34,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:34,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:00:35,001 INFO L272 TraceCheckUtils]: 0: Hoare triple {1560#true} call ULTIMATE.init(); {1560#true} is VALID [2022-04-28 03:00:35,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {1560#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1560#true} is VALID [2022-04-28 03:00:35,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-28 03:00:35,002 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1560#true} {1560#true} #34#return; {1560#true} is VALID [2022-04-28 03:00:35,002 INFO L272 TraceCheckUtils]: 4: Hoare triple {1560#true} call #t~ret4 := main(); {1560#true} is VALID [2022-04-28 03:00:35,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {1560#true} ~x~0 := 0; {1565#(= main_~x~0 0)} is VALID [2022-04-28 03:00:35,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {1565#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1566#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:00:35,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {1566#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1567#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:00:35,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {1567#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1568#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:00:35,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {1568#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1569#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:00:35,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {1569#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1570#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:00:35,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {1570#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1571#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:00:35,020 INFO L290 TraceCheckUtils]: 12: Hoare triple {1571#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1613#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:00:35,020 INFO L290 TraceCheckUtils]: 13: Hoare triple {1613#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !(~x~0 % 4294967296 < 268435455); {1561#false} is VALID [2022-04-28 03:00:35,020 INFO L272 TraceCheckUtils]: 14: Hoare triple {1561#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1561#false} is VALID [2022-04-28 03:00:35,020 INFO L290 TraceCheckUtils]: 15: Hoare triple {1561#false} ~cond := #in~cond; {1561#false} is VALID [2022-04-28 03:00:35,021 INFO L290 TraceCheckUtils]: 16: Hoare triple {1561#false} assume 0 == ~cond; {1561#false} is VALID [2022-04-28 03:00:35,021 INFO L290 TraceCheckUtils]: 17: Hoare triple {1561#false} assume !false; {1561#false} is VALID [2022-04-28 03:00:35,021 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:00:35,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:00:35,194 INFO L290 TraceCheckUtils]: 17: Hoare triple {1561#false} assume !false; {1561#false} is VALID [2022-04-28 03:00:35,194 INFO L290 TraceCheckUtils]: 16: Hoare triple {1561#false} assume 0 == ~cond; {1561#false} is VALID [2022-04-28 03:00:35,194 INFO L290 TraceCheckUtils]: 15: Hoare triple {1561#false} ~cond := #in~cond; {1561#false} is VALID [2022-04-28 03:00:35,194 INFO L272 TraceCheckUtils]: 14: Hoare triple {1561#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1561#false} is VALID [2022-04-28 03:00:35,195 INFO L290 TraceCheckUtils]: 13: Hoare triple {1641#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {1561#false} is VALID [2022-04-28 03:00:35,196 INFO L290 TraceCheckUtils]: 12: Hoare triple {1645#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1641#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:00:35,200 INFO L290 TraceCheckUtils]: 11: Hoare triple {1649#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1645#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 03:00:35,201 INFO L290 TraceCheckUtils]: 10: Hoare triple {1653#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1649#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 03:00:35,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {1657#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1653#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 03:00:35,203 INFO L290 TraceCheckUtils]: 8: Hoare triple {1661#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1657#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 03:00:35,203 INFO L290 TraceCheckUtils]: 7: Hoare triple {1665#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1661#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-28 03:00:35,204 INFO L290 TraceCheckUtils]: 6: Hoare triple {1669#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1665#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-28 03:00:35,204 INFO L290 TraceCheckUtils]: 5: Hoare triple {1560#true} ~x~0 := 0; {1669#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-28 03:00:35,204 INFO L272 TraceCheckUtils]: 4: Hoare triple {1560#true} call #t~ret4 := main(); {1560#true} is VALID [2022-04-28 03:00:35,205 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1560#true} {1560#true} #34#return; {1560#true} is VALID [2022-04-28 03:00:35,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {1560#true} assume true; {1560#true} is VALID [2022-04-28 03:00:35,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {1560#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1560#true} is VALID [2022-04-28 03:00:35,205 INFO L272 TraceCheckUtils]: 0: Hoare triple {1560#true} call ULTIMATE.init(); {1560#true} is VALID [2022-04-28 03:00:35,205 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:00:35,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925539486] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:00:35,205 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:00:35,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-28 03:00:35,206 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:00:35,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1967609363] [2022-04-28 03:00:35,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1967609363] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:00:35,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:00:35,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 03:00:35,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600883642] [2022-04-28 03:00:35,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:00:35,207 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:00:35,208 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:00:35,208 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:00:35,223 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:00:35,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 03:00:35,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:35,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 03:00:35,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=263, Unknown=0, NotChecked=0, Total=380 [2022-04-28 03:00:35,224 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:00:35,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:35,452 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-28 03:00:35,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 03:00:35,453 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:00:35,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:00:35,453 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:00:35,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 25 transitions. [2022-04-28 03:00:35,454 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:00:35,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 25 transitions. [2022-04-28 03:00:35,454 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 25 transitions. [2022-04-28 03:00:35,480 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:00:35,481 INFO L225 Difference]: With dead ends: 25 [2022-04-28 03:00:35,481 INFO L226 Difference]: Without dead ends: 20 [2022-04-28 03:00:35,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=227, Invalid=529, Unknown=0, NotChecked=0, Total=756 [2022-04-28 03:00:35,482 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:00:35,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 23 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:00:35,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-28 03:00:35,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-28 03:00:35,493 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:00:35,493 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:00:35,493 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:00:35,494 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:00:35,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:35,495 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 03:00:35,495 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-28 03:00:35,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:35,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:35,497 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:00:35,498 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:00:35,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:35,499 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 03:00:35,499 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-28 03:00:35,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:35,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:35,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:00:35,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:00:35,499 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:00:35,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2022-04-28 03:00:35,500 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2022-04-28 03:00:35,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:00:35,500 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2022-04-28 03:00:35,500 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:00:35,500 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 20 transitions. [2022-04-28 03:00:35,519 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:00:35,519 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2022-04-28 03:00:35,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 03:00:35,519 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:00:35,519 INFO L195 NwaCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:00:35,525 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:00:35,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-04-28 03:00:35,920 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:00:35,920 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:00:35,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:00:35,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1949808860, now seen corresponding path program 15 times [2022-04-28 03:00:35,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:35,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1236256521] [2022-04-28 03:00:36,063 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:00:36,065 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:00:36,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1453570377, now seen corresponding path program 1 times [2022-04-28 03:00:36,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:36,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049051480] [2022-04-28 03:00:36,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:36,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:36,081 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_8.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_8.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:00:36,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:00:36,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1248618367] [2022-04-28 03:00:36,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:36,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:36,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:00:36,090 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:00:36,114 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:00:36,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:00:36,143 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:00:36,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:00:36,173 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:00:36,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1949808860, now seen corresponding path program 16 times [2022-04-28 03:00:36,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:36,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178673945] [2022-04-28 03:00:36,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:36,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:36,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:00:36,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:36,303 INFO L290 TraceCheckUtils]: 0: Hoare triple {1850#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1836#true} is VALID [2022-04-28 03:00:36,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {1836#true} assume true; {1836#true} is VALID [2022-04-28 03:00:36,303 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1836#true} {1836#true} #34#return; {1836#true} is VALID [2022-04-28 03:00:36,303 INFO L272 TraceCheckUtils]: 0: Hoare triple {1836#true} call ULTIMATE.init(); {1850#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:00:36,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {1850#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1836#true} is VALID [2022-04-28 03:00:36,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {1836#true} assume true; {1836#true} is VALID [2022-04-28 03:00:36,304 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1836#true} {1836#true} #34#return; {1836#true} is VALID [2022-04-28 03:00:36,304 INFO L272 TraceCheckUtils]: 4: Hoare triple {1836#true} call #t~ret4 := main(); {1836#true} is VALID [2022-04-28 03:00:36,304 INFO L290 TraceCheckUtils]: 5: Hoare triple {1836#true} ~x~0 := 0; {1841#(= main_~x~0 0)} is VALID [2022-04-28 03:00:36,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {1841#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1842#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:00:36,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {1842#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1843#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:00:36,306 INFO L290 TraceCheckUtils]: 8: Hoare triple {1843#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1844#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:00:36,306 INFO L290 TraceCheckUtils]: 9: Hoare triple {1844#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1845#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:00:36,310 INFO L290 TraceCheckUtils]: 10: Hoare triple {1845#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1846#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:00:36,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {1846#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1847#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:00:36,317 INFO L290 TraceCheckUtils]: 12: Hoare triple {1847#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1848#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:00:36,321 INFO L290 TraceCheckUtils]: 13: Hoare triple {1848#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1849#(and (<= main_~x~0 16) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:00:36,322 INFO L290 TraceCheckUtils]: 14: Hoare triple {1849#(and (<= main_~x~0 16) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {1837#false} is VALID [2022-04-28 03:00:36,322 INFO L272 TraceCheckUtils]: 15: Hoare triple {1837#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1837#false} is VALID [2022-04-28 03:00:36,323 INFO L290 TraceCheckUtils]: 16: Hoare triple {1837#false} ~cond := #in~cond; {1837#false} is VALID [2022-04-28 03:00:36,323 INFO L290 TraceCheckUtils]: 17: Hoare triple {1837#false} assume 0 == ~cond; {1837#false} is VALID [2022-04-28 03:00:36,323 INFO L290 TraceCheckUtils]: 18: Hoare triple {1837#false} assume !false; {1837#false} is VALID [2022-04-28 03:00:36,323 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:00:36,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:00:36,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178673945] [2022-04-28 03:00:36,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178673945] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:00:36,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577504820] [2022-04-28 03:00:36,323 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:00:36,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:36,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:00:36,328 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:00:36,358 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:00:36,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:00:36,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 03:00:36,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:36,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:00:36,369 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:00:36,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {1836#true} call ULTIMATE.init(); {1836#true} is VALID [2022-04-28 03:00:36,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {1836#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1836#true} is VALID [2022-04-28 03:00:36,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {1836#true} assume true; {1836#true} is VALID [2022-04-28 03:00:36,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1836#true} {1836#true} #34#return; {1836#true} is VALID [2022-04-28 03:00:36,543 INFO L272 TraceCheckUtils]: 4: Hoare triple {1836#true} call #t~ret4 := main(); {1836#true} is VALID [2022-04-28 03:00:36,543 INFO L290 TraceCheckUtils]: 5: Hoare triple {1836#true} ~x~0 := 0; {1841#(= main_~x~0 0)} is VALID [2022-04-28 03:00:36,544 INFO L290 TraceCheckUtils]: 6: Hoare triple {1841#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1842#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:00:36,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {1842#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1843#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:00:36,545 INFO L290 TraceCheckUtils]: 8: Hoare triple {1843#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1844#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:00:36,545 INFO L290 TraceCheckUtils]: 9: Hoare triple {1844#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1845#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:00:36,546 INFO L290 TraceCheckUtils]: 10: Hoare triple {1845#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1846#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:00:36,546 INFO L290 TraceCheckUtils]: 11: Hoare triple {1846#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1847#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:00:36,547 INFO L290 TraceCheckUtils]: 12: Hoare triple {1847#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1848#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:00:36,547 INFO L290 TraceCheckUtils]: 13: Hoare triple {1848#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1893#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:00:36,548 INFO L290 TraceCheckUtils]: 14: Hoare triple {1893#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {1837#false} is VALID [2022-04-28 03:00:36,548 INFO L272 TraceCheckUtils]: 15: Hoare triple {1837#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1837#false} is VALID [2022-04-28 03:00:36,548 INFO L290 TraceCheckUtils]: 16: Hoare triple {1837#false} ~cond := #in~cond; {1837#false} is VALID [2022-04-28 03:00:36,548 INFO L290 TraceCheckUtils]: 17: Hoare triple {1837#false} assume 0 == ~cond; {1837#false} is VALID [2022-04-28 03:00:36,548 INFO L290 TraceCheckUtils]: 18: Hoare triple {1837#false} assume !false; {1837#false} is VALID [2022-04-28 03:00:36,548 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:00:36,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:00:36,739 INFO L290 TraceCheckUtils]: 18: Hoare triple {1837#false} assume !false; {1837#false} is VALID [2022-04-28 03:00:36,740 INFO L290 TraceCheckUtils]: 17: Hoare triple {1837#false} assume 0 == ~cond; {1837#false} is VALID [2022-04-28 03:00:36,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {1837#false} ~cond := #in~cond; {1837#false} is VALID [2022-04-28 03:00:36,740 INFO L272 TraceCheckUtils]: 15: Hoare triple {1837#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {1837#false} is VALID [2022-04-28 03:00:36,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {1921#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {1837#false} is VALID [2022-04-28 03:00:36,742 INFO L290 TraceCheckUtils]: 13: Hoare triple {1925#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1921#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:00:36,743 INFO L290 TraceCheckUtils]: 12: Hoare triple {1929#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1925#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 03:00:36,744 INFO L290 TraceCheckUtils]: 11: Hoare triple {1933#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1929#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 03:00:36,745 INFO L290 TraceCheckUtils]: 10: Hoare triple {1937#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1933#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 03:00:36,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {1941#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1937#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 03:00:36,746 INFO L290 TraceCheckUtils]: 8: Hoare triple {1945#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1941#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-28 03:00:36,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {1949#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1945#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-28 03:00:36,747 INFO L290 TraceCheckUtils]: 6: Hoare triple {1953#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {1949#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-28 03:00:36,747 INFO L290 TraceCheckUtils]: 5: Hoare triple {1836#true} ~x~0 := 0; {1953#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-28 03:00:36,747 INFO L272 TraceCheckUtils]: 4: Hoare triple {1836#true} call #t~ret4 := main(); {1836#true} is VALID [2022-04-28 03:00:36,748 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1836#true} {1836#true} #34#return; {1836#true} is VALID [2022-04-28 03:00:36,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {1836#true} assume true; {1836#true} is VALID [2022-04-28 03:00:36,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {1836#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {1836#true} is VALID [2022-04-28 03:00:36,748 INFO L272 TraceCheckUtils]: 0: Hoare triple {1836#true} call ULTIMATE.init(); {1836#true} is VALID [2022-04-28 03:00:36,748 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:00:36,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577504820] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:00:36,748 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:00:36,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-28 03:00:36,748 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:00:36,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1236256521] [2022-04-28 03:00:36,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1236256521] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:00:36,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:00:36,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 03:00:36,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821397555] [2022-04-28 03:00:36,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:00:36,749 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:00:36,749 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:00:36,749 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:00:36,760 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:00:36,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 03:00:36,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:36,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 03:00:36,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=322, Unknown=0, NotChecked=0, Total=462 [2022-04-28 03:00:36,761 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:00:37,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:37,089 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-28 03:00:37,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 03:00:37,090 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:00:37,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:00:37,090 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:00:37,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 26 transitions. [2022-04-28 03:00:37,091 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:00:37,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 26 transitions. [2022-04-28 03:00:37,091 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 26 transitions. [2022-04-28 03:00:37,108 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:00:37,109 INFO L225 Difference]: With dead ends: 26 [2022-04-28 03:00:37,109 INFO L226 Difference]: Without dead ends: 21 [2022-04-28 03:00:37,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=273, Invalid=657, Unknown=0, NotChecked=0, Total=930 [2022-04-28 03:00:37,110 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:00:37,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 58 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:00:37,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-28 03:00:37,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-28 03:00:37,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:00:37,122 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:00:37,122 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:00:37,122 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:00:37,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:37,122 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-28 03:00:37,122 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-28 03:00:37,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:37,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:37,123 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:00:37,123 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:00:37,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:37,123 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-28 03:00:37,124 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-28 03:00:37,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:37,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:37,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:00:37,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:00:37,124 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:00:37,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-04-28 03:00:37,124 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2022-04-28 03:00:37,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:00:37,125 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-04-28 03:00:37,125 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:00:37,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 21 transitions. [2022-04-28 03:00:37,143 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:00:37,143 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-28 03:00:37,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 03:00:37,144 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:00:37,144 INFO L195 NwaCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:00:37,159 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:00:37,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-28 03:00:37,559 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:00:37,560 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:00:37,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:00:37,560 INFO L85 PathProgramCache]: Analyzing trace with hash 350993782, now seen corresponding path program 17 times [2022-04-28 03:00:37,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:37,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1036239253] [2022-04-28 03:00:37,725 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:00:37,727 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:00:37,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1394465033, now seen corresponding path program 1 times [2022-04-28 03:00:37,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:37,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065180555] [2022-04-28 03:00:37,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:37,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:37,736 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_9.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_9.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:00:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:00:37,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [226774459] [2022-04-28 03:00:37,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:37,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:37,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:00:37,755 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:00:37,756 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:00:37,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:00:37,804 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:00:37,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:00:37,814 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:00:37,815 INFO L85 PathProgramCache]: Analyzing trace with hash 350993782, now seen corresponding path program 18 times [2022-04-28 03:00:37,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:37,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972310353] [2022-04-28 03:00:37,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:37,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:37,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:37,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:00:37,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:37,964 INFO L290 TraceCheckUtils]: 0: Hoare triple {2143#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2128#true} is VALID [2022-04-28 03:00:37,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {2128#true} assume true; {2128#true} is VALID [2022-04-28 03:00:37,965 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2128#true} {2128#true} #34#return; {2128#true} is VALID [2022-04-28 03:00:37,965 INFO L272 TraceCheckUtils]: 0: Hoare triple {2128#true} call ULTIMATE.init(); {2143#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:00:37,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {2143#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2128#true} is VALID [2022-04-28 03:00:37,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {2128#true} assume true; {2128#true} is VALID [2022-04-28 03:00:37,965 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2128#true} {2128#true} #34#return; {2128#true} is VALID [2022-04-28 03:00:37,965 INFO L272 TraceCheckUtils]: 4: Hoare triple {2128#true} call #t~ret4 := main(); {2128#true} is VALID [2022-04-28 03:00:37,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {2128#true} ~x~0 := 0; {2133#(= main_~x~0 0)} is VALID [2022-04-28 03:00:37,966 INFO L290 TraceCheckUtils]: 6: Hoare triple {2133#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2134#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:00:37,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {2134#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2135#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:00:37,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {2135#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2136#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:00:37,968 INFO L290 TraceCheckUtils]: 9: Hoare triple {2136#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2137#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:00:37,968 INFO L290 TraceCheckUtils]: 10: Hoare triple {2137#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2138#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:00:37,969 INFO L290 TraceCheckUtils]: 11: Hoare triple {2138#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2139#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:00:37,969 INFO L290 TraceCheckUtils]: 12: Hoare triple {2139#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2140#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:00:37,970 INFO L290 TraceCheckUtils]: 13: Hoare triple {2140#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2141#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:00:37,970 INFO L290 TraceCheckUtils]: 14: Hoare triple {2141#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2142#(and (<= main_~x~0 18) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:00:37,971 INFO L290 TraceCheckUtils]: 15: Hoare triple {2142#(and (<= main_~x~0 18) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {2129#false} is VALID [2022-04-28 03:00:37,971 INFO L272 TraceCheckUtils]: 16: Hoare triple {2129#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2129#false} is VALID [2022-04-28 03:00:37,971 INFO L290 TraceCheckUtils]: 17: Hoare triple {2129#false} ~cond := #in~cond; {2129#false} is VALID [2022-04-28 03:00:37,971 INFO L290 TraceCheckUtils]: 18: Hoare triple {2129#false} assume 0 == ~cond; {2129#false} is VALID [2022-04-28 03:00:37,971 INFO L290 TraceCheckUtils]: 19: Hoare triple {2129#false} assume !false; {2129#false} is VALID [2022-04-28 03:00:37,971 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:00:37,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:00:37,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972310353] [2022-04-28 03:00:37,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972310353] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:00:37,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150213057] [2022-04-28 03:00:37,971 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:00:37,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:37,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:00:37,973 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:00:37,974 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:00:38,021 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-28 03:00:38,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:00:38,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 03:00:38,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:38,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:00:38,259 INFO L272 TraceCheckUtils]: 0: Hoare triple {2128#true} call ULTIMATE.init(); {2128#true} is VALID [2022-04-28 03:00:38,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {2128#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2128#true} is VALID [2022-04-28 03:00:38,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {2128#true} assume true; {2128#true} is VALID [2022-04-28 03:00:38,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2128#true} {2128#true} #34#return; {2128#true} is VALID [2022-04-28 03:00:38,260 INFO L272 TraceCheckUtils]: 4: Hoare triple {2128#true} call #t~ret4 := main(); {2128#true} is VALID [2022-04-28 03:00:38,260 INFO L290 TraceCheckUtils]: 5: Hoare triple {2128#true} ~x~0 := 0; {2133#(= main_~x~0 0)} is VALID [2022-04-28 03:00:38,260 INFO L290 TraceCheckUtils]: 6: Hoare triple {2133#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2134#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:00:38,264 INFO L290 TraceCheckUtils]: 7: Hoare triple {2134#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2135#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:00:38,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {2135#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2136#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:00:38,265 INFO L290 TraceCheckUtils]: 9: Hoare triple {2136#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2137#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:00:38,266 INFO L290 TraceCheckUtils]: 10: Hoare triple {2137#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2138#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:00:38,266 INFO L290 TraceCheckUtils]: 11: Hoare triple {2138#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2139#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:00:38,267 INFO L290 TraceCheckUtils]: 12: Hoare triple {2139#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2140#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:00:38,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {2140#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2141#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:00:38,267 INFO L290 TraceCheckUtils]: 14: Hoare triple {2141#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2189#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:00:38,268 INFO L290 TraceCheckUtils]: 15: Hoare triple {2189#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {2129#false} is VALID [2022-04-28 03:00:38,268 INFO L272 TraceCheckUtils]: 16: Hoare triple {2129#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2129#false} is VALID [2022-04-28 03:00:38,268 INFO L290 TraceCheckUtils]: 17: Hoare triple {2129#false} ~cond := #in~cond; {2129#false} is VALID [2022-04-28 03:00:38,268 INFO L290 TraceCheckUtils]: 18: Hoare triple {2129#false} assume 0 == ~cond; {2129#false} is VALID [2022-04-28 03:00:38,268 INFO L290 TraceCheckUtils]: 19: Hoare triple {2129#false} assume !false; {2129#false} is VALID [2022-04-28 03:00:38,268 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:00:38,269 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:00:38,496 INFO L290 TraceCheckUtils]: 19: Hoare triple {2129#false} assume !false; {2129#false} is VALID [2022-04-28 03:00:38,496 INFO L290 TraceCheckUtils]: 18: Hoare triple {2129#false} assume 0 == ~cond; {2129#false} is VALID [2022-04-28 03:00:38,496 INFO L290 TraceCheckUtils]: 17: Hoare triple {2129#false} ~cond := #in~cond; {2129#false} is VALID [2022-04-28 03:00:38,496 INFO L272 TraceCheckUtils]: 16: Hoare triple {2129#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2129#false} is VALID [2022-04-28 03:00:38,497 INFO L290 TraceCheckUtils]: 15: Hoare triple {2217#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {2129#false} is VALID [2022-04-28 03:00:38,498 INFO L290 TraceCheckUtils]: 14: Hoare triple {2221#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2217#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:00:38,498 INFO L290 TraceCheckUtils]: 13: Hoare triple {2225#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2221#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 03:00:38,500 INFO L290 TraceCheckUtils]: 12: Hoare triple {2229#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2225#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 03:00:38,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {2233#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2229#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 03:00:38,501 INFO L290 TraceCheckUtils]: 10: Hoare triple {2237#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2233#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 03:00:38,502 INFO L290 TraceCheckUtils]: 9: Hoare triple {2241#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2237#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-28 03:00:38,503 INFO L290 TraceCheckUtils]: 8: Hoare triple {2245#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2241#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-28 03:00:38,503 INFO L290 TraceCheckUtils]: 7: Hoare triple {2249#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2245#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-28 03:00:38,504 INFO L290 TraceCheckUtils]: 6: Hoare triple {2253#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2249#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-28 03:00:38,504 INFO L290 TraceCheckUtils]: 5: Hoare triple {2128#true} ~x~0 := 0; {2253#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-28 03:00:38,504 INFO L272 TraceCheckUtils]: 4: Hoare triple {2128#true} call #t~ret4 := main(); {2128#true} is VALID [2022-04-28 03:00:38,504 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2128#true} {2128#true} #34#return; {2128#true} is VALID [2022-04-28 03:00:38,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {2128#true} assume true; {2128#true} is VALID [2022-04-28 03:00:38,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {2128#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2128#true} is VALID [2022-04-28 03:00:38,504 INFO L272 TraceCheckUtils]: 0: Hoare triple {2128#true} call ULTIMATE.init(); {2128#true} is VALID [2022-04-28 03:00:38,505 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:00:38,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150213057] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:00:38,505 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:00:38,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-28 03:00:38,505 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:00:38,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1036239253] [2022-04-28 03:00:38,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1036239253] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:00:38,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:00:38,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 03:00:38,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217252141] [2022-04-28 03:00:38,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:00:38,506 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:00:38,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:00:38,506 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:00:38,518 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:00:38,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 03:00:38,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:38,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 03:00:38,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=387, Unknown=0, NotChecked=0, Total=552 [2022-04-28 03:00:38,519 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:00:38,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:38,866 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-28 03:00:38,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 03:00:38,866 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:00:38,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:00:38,867 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:00:38,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 27 transitions. [2022-04-28 03:00:38,867 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:00:38,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 27 transitions. [2022-04-28 03:00:38,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 27 transitions. [2022-04-28 03:00:38,898 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:00:38,898 INFO L225 Difference]: With dead ends: 27 [2022-04-28 03:00:38,898 INFO L226 Difference]: Without dead ends: 22 [2022-04-28 03:00:38,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=323, Invalid=799, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 03:00:38,900 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:00:38,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 63 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:00:38,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-28 03:00:38,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-28 03:00:38,913 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:00:38,914 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:00:38,914 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:00:38,914 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:00:38,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:38,915 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 03:00:38,915 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-28 03:00:38,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:38,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:38,915 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:00:38,916 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:00:38,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:38,916 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 03:00:38,916 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-28 03:00:38,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:38,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:38,916 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:00:38,916 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:00:38,926 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:00:38,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-04-28 03:00:38,926 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2022-04-28 03:00:38,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:00:38,928 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-04-28 03:00:38,928 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:00:38,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 22 transitions. [2022-04-28 03:00:38,943 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:00:38,944 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-28 03:00:38,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 03:00:38,944 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:00:38,944 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:00:38,953 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:00:39,153 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:00:39,348 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:00:39,348 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:00:39,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:00:39,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1967633380, now seen corresponding path program 19 times [2022-04-28 03:00:39,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:39,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1648012287] [2022-04-28 03:00:39,482 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:00:39,483 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:00:39,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1335359689, now seen corresponding path program 1 times [2022-04-28 03:00:39,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:39,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619521845] [2022-04-28 03:00:39,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:39,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:39,491 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_10.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_10.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:00:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:00:39,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [228603061] [2022-04-28 03:00:39,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:39,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:39,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:00:39,497 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:00:39,512 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:00:39,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:00:39,553 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:00:39,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:00:39,565 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:00:39,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1967633380, now seen corresponding path program 20 times [2022-04-28 03:00:39,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:39,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457970016] [2022-04-28 03:00:39,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:39,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:39,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:39,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:00:39,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:39,725 INFO L290 TraceCheckUtils]: 0: Hoare triple {2452#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2436#true} is VALID [2022-04-28 03:00:39,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {2436#true} assume true; {2436#true} is VALID [2022-04-28 03:00:39,725 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2436#true} {2436#true} #34#return; {2436#true} is VALID [2022-04-28 03:00:39,726 INFO L272 TraceCheckUtils]: 0: Hoare triple {2436#true} call ULTIMATE.init(); {2452#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:00:39,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {2452#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2436#true} is VALID [2022-04-28 03:00:39,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {2436#true} assume true; {2436#true} is VALID [2022-04-28 03:00:39,726 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2436#true} {2436#true} #34#return; {2436#true} is VALID [2022-04-28 03:00:39,726 INFO L272 TraceCheckUtils]: 4: Hoare triple {2436#true} call #t~ret4 := main(); {2436#true} is VALID [2022-04-28 03:00:39,726 INFO L290 TraceCheckUtils]: 5: Hoare triple {2436#true} ~x~0 := 0; {2441#(= main_~x~0 0)} is VALID [2022-04-28 03:00:39,727 INFO L290 TraceCheckUtils]: 6: Hoare triple {2441#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2442#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:00:39,727 INFO L290 TraceCheckUtils]: 7: Hoare triple {2442#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2443#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:00:39,728 INFO L290 TraceCheckUtils]: 8: Hoare triple {2443#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2444#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:00:39,728 INFO L290 TraceCheckUtils]: 9: Hoare triple {2444#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2445#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:00:39,729 INFO L290 TraceCheckUtils]: 10: Hoare triple {2445#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2446#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:00:39,729 INFO L290 TraceCheckUtils]: 11: Hoare triple {2446#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2447#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:00:39,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {2447#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2448#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:00:39,730 INFO L290 TraceCheckUtils]: 13: Hoare triple {2448#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2449#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:00:39,731 INFO L290 TraceCheckUtils]: 14: Hoare triple {2449#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2450#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:00:39,731 INFO L290 TraceCheckUtils]: 15: Hoare triple {2450#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2451#(and (<= main_~x~0 20) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:00:39,733 INFO L290 TraceCheckUtils]: 16: Hoare triple {2451#(and (<= main_~x~0 20) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {2437#false} is VALID [2022-04-28 03:00:39,733 INFO L272 TraceCheckUtils]: 17: Hoare triple {2437#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2437#false} is VALID [2022-04-28 03:00:39,733 INFO L290 TraceCheckUtils]: 18: Hoare triple {2437#false} ~cond := #in~cond; {2437#false} is VALID [2022-04-28 03:00:39,733 INFO L290 TraceCheckUtils]: 19: Hoare triple {2437#false} assume 0 == ~cond; {2437#false} is VALID [2022-04-28 03:00:39,733 INFO L290 TraceCheckUtils]: 20: Hoare triple {2437#false} assume !false; {2437#false} is VALID [2022-04-28 03:00:39,733 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:00:39,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:00:39,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457970016] [2022-04-28 03:00:39,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457970016] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:00:39,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802800771] [2022-04-28 03:00:39,734 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:00:39,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:39,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:00:39,735 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:00:39,736 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:00:39,766 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:00:39,767 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:00:39,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 03:00:39,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:39,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:00:40,017 INFO L272 TraceCheckUtils]: 0: Hoare triple {2436#true} call ULTIMATE.init(); {2436#true} is VALID [2022-04-28 03:00:40,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {2436#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2436#true} is VALID [2022-04-28 03:00:40,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {2436#true} assume true; {2436#true} is VALID [2022-04-28 03:00:40,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2436#true} {2436#true} #34#return; {2436#true} is VALID [2022-04-28 03:00:40,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {2436#true} call #t~ret4 := main(); {2436#true} is VALID [2022-04-28 03:00:40,018 INFO L290 TraceCheckUtils]: 5: Hoare triple {2436#true} ~x~0 := 0; {2441#(= main_~x~0 0)} is VALID [2022-04-28 03:00:40,018 INFO L290 TraceCheckUtils]: 6: Hoare triple {2441#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2442#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:00:40,019 INFO L290 TraceCheckUtils]: 7: Hoare triple {2442#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2443#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:00:40,020 INFO L290 TraceCheckUtils]: 8: Hoare triple {2443#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2444#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:00:40,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {2444#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2445#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:00:40,021 INFO L290 TraceCheckUtils]: 10: Hoare triple {2445#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2446#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:00:40,021 INFO L290 TraceCheckUtils]: 11: Hoare triple {2446#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2447#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:00:40,022 INFO L290 TraceCheckUtils]: 12: Hoare triple {2447#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2448#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:00:40,022 INFO L290 TraceCheckUtils]: 13: Hoare triple {2448#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2449#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:00:40,023 INFO L290 TraceCheckUtils]: 14: Hoare triple {2449#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2450#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:00:40,023 INFO L290 TraceCheckUtils]: 15: Hoare triple {2450#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2501#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:00:40,024 INFO L290 TraceCheckUtils]: 16: Hoare triple {2501#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {2437#false} is VALID [2022-04-28 03:00:40,024 INFO L272 TraceCheckUtils]: 17: Hoare triple {2437#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2437#false} is VALID [2022-04-28 03:00:40,024 INFO L290 TraceCheckUtils]: 18: Hoare triple {2437#false} ~cond := #in~cond; {2437#false} is VALID [2022-04-28 03:00:40,024 INFO L290 TraceCheckUtils]: 19: Hoare triple {2437#false} assume 0 == ~cond; {2437#false} is VALID [2022-04-28 03:00:40,024 INFO L290 TraceCheckUtils]: 20: Hoare triple {2437#false} assume !false; {2437#false} is VALID [2022-04-28 03:00:40,025 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:00:40,025 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:00:40,308 INFO L290 TraceCheckUtils]: 20: Hoare triple {2437#false} assume !false; {2437#false} is VALID [2022-04-28 03:00:40,308 INFO L290 TraceCheckUtils]: 19: Hoare triple {2437#false} assume 0 == ~cond; {2437#false} is VALID [2022-04-28 03:00:40,308 INFO L290 TraceCheckUtils]: 18: Hoare triple {2437#false} ~cond := #in~cond; {2437#false} is VALID [2022-04-28 03:00:40,308 INFO L272 TraceCheckUtils]: 17: Hoare triple {2437#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2437#false} is VALID [2022-04-28 03:00:40,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {2529#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {2437#false} is VALID [2022-04-28 03:00:40,309 INFO L290 TraceCheckUtils]: 15: Hoare triple {2533#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2529#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:00:40,310 INFO L290 TraceCheckUtils]: 14: Hoare triple {2537#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2533#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 03:00:40,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {2541#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2537#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 03:00:40,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {2545#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2541#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 03:00:40,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {2549#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2545#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 03:00:40,312 INFO L290 TraceCheckUtils]: 10: Hoare triple {2553#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2549#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-28 03:00:40,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {2557#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2553#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-28 03:00:40,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {2561#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2557#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-28 03:00:40,316 INFO L290 TraceCheckUtils]: 7: Hoare triple {2565#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2561#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-28 03:00:40,316 INFO L290 TraceCheckUtils]: 6: Hoare triple {2569#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2565#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-28 03:00:40,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {2436#true} ~x~0 := 0; {2569#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-28 03:00:40,317 INFO L272 TraceCheckUtils]: 4: Hoare triple {2436#true} call #t~ret4 := main(); {2436#true} is VALID [2022-04-28 03:00:40,317 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2436#true} {2436#true} #34#return; {2436#true} is VALID [2022-04-28 03:00:40,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {2436#true} assume true; {2436#true} is VALID [2022-04-28 03:00:40,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {2436#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2436#true} is VALID [2022-04-28 03:00:40,317 INFO L272 TraceCheckUtils]: 0: Hoare triple {2436#true} call ULTIMATE.init(); {2436#true} is VALID [2022-04-28 03:00:40,317 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:00:40,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802800771] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:00:40,318 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:00:40,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-28 03:00:40,318 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:00:40,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1648012287] [2022-04-28 03:00:40,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1648012287] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:00:40,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:00:40,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 03:00:40,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268517389] [2022-04-28 03:00:40,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:00:40,318 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:00:40,319 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:00:40,319 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:00:40,331 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:00:40,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 03:00:40,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:40,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 03:00:40,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=458, Unknown=0, NotChecked=0, Total=650 [2022-04-28 03:00:40,332 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:00:40,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:40,678 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-28 03:00:40,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 03:00:40,679 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:00:40,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:00:40,679 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:00:40,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2022-04-28 03:00:40,680 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:00:40,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 28 transitions. [2022-04-28 03:00:40,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 28 transitions. [2022-04-28 03:00:40,709 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:00:40,710 INFO L225 Difference]: With dead ends: 28 [2022-04-28 03:00:40,710 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 03:00:40,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=377, Invalid=955, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 03:00:40,711 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:00:40,711 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:00:40,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 03:00:40,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 03:00:40,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:00:40,729 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:00:40,729 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:00:40,729 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:00:40,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:40,730 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-28 03:00:40,730 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-28 03:00:40,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:40,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:40,730 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:00:40,730 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:00:40,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:40,731 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-28 03:00:40,731 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-28 03:00:40,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:40,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:40,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:00:40,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:00:40,731 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:00:40,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2022-04-28 03:00:40,731 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2022-04-28 03:00:40,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:00:40,732 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2022-04-28 03:00:40,732 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:00:40,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 23 transitions. [2022-04-28 03:00:40,761 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:00:40,761 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-28 03:00:40,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 03:00:40,761 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:00:40,762 INFO L195 NwaCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:00:40,791 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:00:40,966 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:00:41,162 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:00:41,162 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:00:41,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:00:41,163 INFO L85 PathProgramCache]: Analyzing trace with hash -830631370, now seen corresponding path program 21 times [2022-04-28 03:00:41,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:41,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2010269693] [2022-04-28 03:00:41,304 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:00:41,306 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:00:41,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1276254345, now seen corresponding path program 1 times [2022-04-28 03:00:41,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:41,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386758852] [2022-04-28 03:00:41,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:41,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:41,316 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_11.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_11.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:00:41,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:00:41,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [461424959] [2022-04-28 03:00:41,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:41,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:41,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:00:41,322 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:00:41,323 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:00:41,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:00:41,407 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:00:41,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:00:41,419 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:00:41,420 INFO L85 PathProgramCache]: Analyzing trace with hash -830631370, now seen corresponding path program 22 times [2022-04-28 03:00:41,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:41,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156729725] [2022-04-28 03:00:41,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:41,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:41,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:41,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:00:41,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:41,597 INFO L290 TraceCheckUtils]: 0: Hoare triple {2777#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2760#true} is VALID [2022-04-28 03:00:41,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {2760#true} assume true; {2760#true} is VALID [2022-04-28 03:00:41,597 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2760#true} {2760#true} #34#return; {2760#true} is VALID [2022-04-28 03:00:41,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {2760#true} call ULTIMATE.init(); {2777#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:00:41,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {2777#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2760#true} is VALID [2022-04-28 03:00:41,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {2760#true} assume true; {2760#true} is VALID [2022-04-28 03:00:41,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2760#true} {2760#true} #34#return; {2760#true} is VALID [2022-04-28 03:00:41,598 INFO L272 TraceCheckUtils]: 4: Hoare triple {2760#true} call #t~ret4 := main(); {2760#true} is VALID [2022-04-28 03:00:41,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {2760#true} ~x~0 := 0; {2765#(= main_~x~0 0)} is VALID [2022-04-28 03:00:41,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {2765#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2766#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:00:41,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {2766#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2767#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:00:41,600 INFO L290 TraceCheckUtils]: 8: Hoare triple {2767#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2768#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:00:41,600 INFO L290 TraceCheckUtils]: 9: Hoare triple {2768#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2769#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:00:41,601 INFO L290 TraceCheckUtils]: 10: Hoare triple {2769#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2770#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:00:41,601 INFO L290 TraceCheckUtils]: 11: Hoare triple {2770#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2771#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:00:41,602 INFO L290 TraceCheckUtils]: 12: Hoare triple {2771#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2772#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:00:41,602 INFO L290 TraceCheckUtils]: 13: Hoare triple {2772#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2773#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:00:41,603 INFO L290 TraceCheckUtils]: 14: Hoare triple {2773#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2774#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:00:41,603 INFO L290 TraceCheckUtils]: 15: Hoare triple {2774#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2775#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:00:41,604 INFO L290 TraceCheckUtils]: 16: Hoare triple {2775#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2776#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 22))} is VALID [2022-04-28 03:00:41,604 INFO L290 TraceCheckUtils]: 17: Hoare triple {2776#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 22))} assume !(~x~0 % 4294967296 < 268435455); {2761#false} is VALID [2022-04-28 03:00:41,604 INFO L272 TraceCheckUtils]: 18: Hoare triple {2761#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2761#false} is VALID [2022-04-28 03:00:41,604 INFO L290 TraceCheckUtils]: 19: Hoare triple {2761#false} ~cond := #in~cond; {2761#false} is VALID [2022-04-28 03:00:41,605 INFO L290 TraceCheckUtils]: 20: Hoare triple {2761#false} assume 0 == ~cond; {2761#false} is VALID [2022-04-28 03:00:41,605 INFO L290 TraceCheckUtils]: 21: Hoare triple {2761#false} assume !false; {2761#false} is VALID [2022-04-28 03:00:41,605 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:00:41,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:00:41,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156729725] [2022-04-28 03:00:41,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156729725] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:00:41,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671701193] [2022-04-28 03:00:41,605 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:00:41,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:41,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:00:41,606 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:00:41,607 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:00:41,635 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:00:41,636 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:00:41,636 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 03:00:41,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:41,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:00:41,856 INFO L272 TraceCheckUtils]: 0: Hoare triple {2760#true} call ULTIMATE.init(); {2760#true} is VALID [2022-04-28 03:00:41,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {2760#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2760#true} is VALID [2022-04-28 03:00:41,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {2760#true} assume true; {2760#true} is VALID [2022-04-28 03:00:41,856 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2760#true} {2760#true} #34#return; {2760#true} is VALID [2022-04-28 03:00:41,856 INFO L272 TraceCheckUtils]: 4: Hoare triple {2760#true} call #t~ret4 := main(); {2760#true} is VALID [2022-04-28 03:00:41,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {2760#true} ~x~0 := 0; {2765#(= main_~x~0 0)} is VALID [2022-04-28 03:00:41,857 INFO L290 TraceCheckUtils]: 6: Hoare triple {2765#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2766#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:00:41,858 INFO L290 TraceCheckUtils]: 7: Hoare triple {2766#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2767#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:00:41,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {2767#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2768#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:00:41,859 INFO L290 TraceCheckUtils]: 9: Hoare triple {2768#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2769#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:00:41,859 INFO L290 TraceCheckUtils]: 10: Hoare triple {2769#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2770#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:00:41,860 INFO L290 TraceCheckUtils]: 11: Hoare triple {2770#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2771#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:00:41,860 INFO L290 TraceCheckUtils]: 12: Hoare triple {2771#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2772#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:00:41,861 INFO L290 TraceCheckUtils]: 13: Hoare triple {2772#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2773#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:00:41,861 INFO L290 TraceCheckUtils]: 14: Hoare triple {2773#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2774#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:00:41,862 INFO L290 TraceCheckUtils]: 15: Hoare triple {2774#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2775#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:00:41,862 INFO L290 TraceCheckUtils]: 16: Hoare triple {2775#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2829#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:00:41,863 INFO L290 TraceCheckUtils]: 17: Hoare triple {2829#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !(~x~0 % 4294967296 < 268435455); {2761#false} is VALID [2022-04-28 03:00:41,863 INFO L272 TraceCheckUtils]: 18: Hoare triple {2761#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2761#false} is VALID [2022-04-28 03:00:41,863 INFO L290 TraceCheckUtils]: 19: Hoare triple {2761#false} ~cond := #in~cond; {2761#false} is VALID [2022-04-28 03:00:41,863 INFO L290 TraceCheckUtils]: 20: Hoare triple {2761#false} assume 0 == ~cond; {2761#false} is VALID [2022-04-28 03:00:41,863 INFO L290 TraceCheckUtils]: 21: Hoare triple {2761#false} assume !false; {2761#false} is VALID [2022-04-28 03:00:41,864 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:00:41,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:00:42,156 INFO L290 TraceCheckUtils]: 21: Hoare triple {2761#false} assume !false; {2761#false} is VALID [2022-04-28 03:00:42,156 INFO L290 TraceCheckUtils]: 20: Hoare triple {2761#false} assume 0 == ~cond; {2761#false} is VALID [2022-04-28 03:00:42,156 INFO L290 TraceCheckUtils]: 19: Hoare triple {2761#false} ~cond := #in~cond; {2761#false} is VALID [2022-04-28 03:00:42,156 INFO L272 TraceCheckUtils]: 18: Hoare triple {2761#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {2761#false} is VALID [2022-04-28 03:00:42,158 INFO L290 TraceCheckUtils]: 17: Hoare triple {2857#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {2761#false} is VALID [2022-04-28 03:00:42,159 INFO L290 TraceCheckUtils]: 16: Hoare triple {2861#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2857#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:00:42,160 INFO L290 TraceCheckUtils]: 15: Hoare triple {2865#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2861#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 03:00:42,160 INFO L290 TraceCheckUtils]: 14: Hoare triple {2869#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2865#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 03:00:42,162 INFO L290 TraceCheckUtils]: 13: Hoare triple {2873#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2869#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 03:00:42,162 INFO L290 TraceCheckUtils]: 12: Hoare triple {2877#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2873#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 03:00:42,163 INFO L290 TraceCheckUtils]: 11: Hoare triple {2881#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2877#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-28 03:00:42,163 INFO L290 TraceCheckUtils]: 10: Hoare triple {2885#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2881#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-28 03:00:42,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {2889#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2885#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-28 03:00:42,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {2893#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2889#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-28 03:00:42,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {2897#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2893#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-28 03:00:42,166 INFO L290 TraceCheckUtils]: 6: Hoare triple {2901#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {2897#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-28 03:00:42,166 INFO L290 TraceCheckUtils]: 5: Hoare triple {2760#true} ~x~0 := 0; {2901#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-28 03:00:42,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {2760#true} call #t~ret4 := main(); {2760#true} is VALID [2022-04-28 03:00:42,166 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2760#true} {2760#true} #34#return; {2760#true} is VALID [2022-04-28 03:00:42,166 INFO L290 TraceCheckUtils]: 2: Hoare triple {2760#true} assume true; {2760#true} is VALID [2022-04-28 03:00:42,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {2760#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {2760#true} is VALID [2022-04-28 03:00:42,166 INFO L272 TraceCheckUtils]: 0: Hoare triple {2760#true} call ULTIMATE.init(); {2760#true} is VALID [2022-04-28 03:00:42,167 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:00:42,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671701193] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:00:42,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:00:42,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-28 03:00:42,167 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:00:42,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2010269693] [2022-04-28 03:00:42,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2010269693] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:00:42,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:00:42,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 03:00:42,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643477852] [2022-04-28 03:00:42,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:00:42,168 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:00:42,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:00:42,168 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:00:42,180 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:00:42,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 03:00:42,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:42,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 03:00:42,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=535, Unknown=0, NotChecked=0, Total=756 [2022-04-28 03:00:42,182 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:00:42,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:42,634 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-28 03:00:42,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 03:00:42,634 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:00:42,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:00:42,635 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:00:42,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 29 transitions. [2022-04-28 03:00:42,638 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:00:42,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 29 transitions. [2022-04-28 03:00:42,640 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 29 transitions. [2022-04-28 03:00:42,658 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:00:42,659 INFO L225 Difference]: With dead ends: 29 [2022-04-28 03:00:42,659 INFO L226 Difference]: Without dead ends: 24 [2022-04-28 03:00:42,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=1125, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 03:00:42,660 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:00:42,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 38 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:00:42,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-28 03:00:42,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-04-28 03:00:42,676 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:00:42,676 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:00:42,676 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:00:42,676 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:00:42,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:42,677 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 03:00:42,677 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-28 03:00:42,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:42,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:42,677 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:00:42,677 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:00:42,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:42,678 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-28 03:00:42,678 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-28 03:00:42,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:42,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:42,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:00:42,678 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:00:42,678 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:00:42,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-04-28 03:00:42,678 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2022-04-28 03:00:42,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:00:42,679 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-04-28 03:00:42,679 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:00:42,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 24 transitions. [2022-04-28 03:00:42,697 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:00:42,698 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-04-28 03:00:42,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 03:00:42,698 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:00:42,698 INFO L195 NwaCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:00:42,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-04-28 03:00:42,917 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:00:43,102 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:00:43,102 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:00:43,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:00:43,102 INFO L85 PathProgramCache]: Analyzing trace with hash 56692572, now seen corresponding path program 23 times [2022-04-28 03:00:43,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:43,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [220725741] [2022-04-28 03:00:43,434 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:00:43,436 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:00:43,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1217149001, now seen corresponding path program 1 times [2022-04-28 03:00:43,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:43,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734216185] [2022-04-28 03:00:43,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:43,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:43,444 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_12.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_12.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:00:43,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:00:43,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [691128062] [2022-04-28 03:00:43,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:43,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:43,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:00:43,449 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:00:43,450 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:00:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:00:43,489 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:00:43,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:00:43,500 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:00:43,500 INFO L85 PathProgramCache]: Analyzing trace with hash 56692572, now seen corresponding path program 24 times [2022-04-28 03:00:43,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:43,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413827011] [2022-04-28 03:00:43,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:43,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:43,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:43,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:00:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:43,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {3118#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3100#true} is VALID [2022-04-28 03:00:43,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {3100#true} assume true; {3100#true} is VALID [2022-04-28 03:00:43,683 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3100#true} {3100#true} #34#return; {3100#true} is VALID [2022-04-28 03:00:43,683 INFO L272 TraceCheckUtils]: 0: Hoare triple {3100#true} call ULTIMATE.init(); {3118#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:00:43,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {3118#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3100#true} is VALID [2022-04-28 03:00:43,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {3100#true} assume true; {3100#true} is VALID [2022-04-28 03:00:43,684 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3100#true} {3100#true} #34#return; {3100#true} is VALID [2022-04-28 03:00:43,684 INFO L272 TraceCheckUtils]: 4: Hoare triple {3100#true} call #t~ret4 := main(); {3100#true} is VALID [2022-04-28 03:00:43,684 INFO L290 TraceCheckUtils]: 5: Hoare triple {3100#true} ~x~0 := 0; {3105#(= main_~x~0 0)} is VALID [2022-04-28 03:00:43,684 INFO L290 TraceCheckUtils]: 6: Hoare triple {3105#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3106#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:00:43,685 INFO L290 TraceCheckUtils]: 7: Hoare triple {3106#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3107#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:00:43,686 INFO L290 TraceCheckUtils]: 8: Hoare triple {3107#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3108#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:00:43,686 INFO L290 TraceCheckUtils]: 9: Hoare triple {3108#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3109#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:00:43,686 INFO L290 TraceCheckUtils]: 10: Hoare triple {3109#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3110#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:00:43,687 INFO L290 TraceCheckUtils]: 11: Hoare triple {3110#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3111#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:00:43,687 INFO L290 TraceCheckUtils]: 12: Hoare triple {3111#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3112#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:00:43,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {3112#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3113#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:00:43,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {3113#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3114#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:00:43,689 INFO L290 TraceCheckUtils]: 15: Hoare triple {3114#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3115#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:00:43,689 INFO L290 TraceCheckUtils]: 16: Hoare triple {3115#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3116#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:00:43,690 INFO L290 TraceCheckUtils]: 17: Hoare triple {3116#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3117#(and (<= main_~x~0 24) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:00:43,690 INFO L290 TraceCheckUtils]: 18: Hoare triple {3117#(and (<= main_~x~0 24) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {3101#false} is VALID [2022-04-28 03:00:43,690 INFO L272 TraceCheckUtils]: 19: Hoare triple {3101#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {3101#false} is VALID [2022-04-28 03:00:43,691 INFO L290 TraceCheckUtils]: 20: Hoare triple {3101#false} ~cond := #in~cond; {3101#false} is VALID [2022-04-28 03:00:43,691 INFO L290 TraceCheckUtils]: 21: Hoare triple {3101#false} assume 0 == ~cond; {3101#false} is VALID [2022-04-28 03:00:43,691 INFO L290 TraceCheckUtils]: 22: Hoare triple {3101#false} assume !false; {3101#false} is VALID [2022-04-28 03:00:43,691 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:00:43,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:00:43,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413827011] [2022-04-28 03:00:43,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413827011] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:00:43,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64121614] [2022-04-28 03:00:43,691 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:00:43,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:43,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:00:43,692 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:00:43,693 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:00:43,772 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 03:00:43,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:00:43,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 03:00:43,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:43,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:00:43,938 INFO L272 TraceCheckUtils]: 0: Hoare triple {3100#true} call ULTIMATE.init(); {3100#true} is VALID [2022-04-28 03:00:43,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {3100#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3100#true} is VALID [2022-04-28 03:00:43,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {3100#true} assume true; {3100#true} is VALID [2022-04-28 03:00:43,939 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3100#true} {3100#true} #34#return; {3100#true} is VALID [2022-04-28 03:00:43,939 INFO L272 TraceCheckUtils]: 4: Hoare triple {3100#true} call #t~ret4 := main(); {3100#true} is VALID [2022-04-28 03:00:43,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {3100#true} ~x~0 := 0; {3105#(= main_~x~0 0)} is VALID [2022-04-28 03:00:43,940 INFO L290 TraceCheckUtils]: 6: Hoare triple {3105#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3106#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:00:43,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {3106#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3107#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:00:43,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {3107#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3108#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:00:43,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {3108#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3109#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:00:43,942 INFO L290 TraceCheckUtils]: 10: Hoare triple {3109#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3110#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:00:43,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {3110#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3111#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:00:43,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {3111#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3112#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:00:43,944 INFO L290 TraceCheckUtils]: 13: Hoare triple {3112#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3113#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:00:43,944 INFO L290 TraceCheckUtils]: 14: Hoare triple {3113#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3114#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:00:43,945 INFO L290 TraceCheckUtils]: 15: Hoare triple {3114#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3115#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:00:43,945 INFO L290 TraceCheckUtils]: 16: Hoare triple {3115#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3116#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:00:43,946 INFO L290 TraceCheckUtils]: 17: Hoare triple {3116#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3173#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:00:43,946 INFO L290 TraceCheckUtils]: 18: Hoare triple {3173#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {3101#false} is VALID [2022-04-28 03:00:43,947 INFO L272 TraceCheckUtils]: 19: Hoare triple {3101#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {3101#false} is VALID [2022-04-28 03:00:43,947 INFO L290 TraceCheckUtils]: 20: Hoare triple {3101#false} ~cond := #in~cond; {3101#false} is VALID [2022-04-28 03:00:43,947 INFO L290 TraceCheckUtils]: 21: Hoare triple {3101#false} assume 0 == ~cond; {3101#false} is VALID [2022-04-28 03:00:43,947 INFO L290 TraceCheckUtils]: 22: Hoare triple {3101#false} assume !false; {3101#false} is VALID [2022-04-28 03:00:43,947 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:00:43,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:00:44,505 INFO L290 TraceCheckUtils]: 22: Hoare triple {3101#false} assume !false; {3101#false} is VALID [2022-04-28 03:00:44,506 INFO L290 TraceCheckUtils]: 21: Hoare triple {3192#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3101#false} is VALID [2022-04-28 03:00:44,506 INFO L290 TraceCheckUtils]: 20: Hoare triple {3196#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3192#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:00:44,506 INFO L272 TraceCheckUtils]: 19: Hoare triple {3200#(not (= (mod main_~x~0 2) 0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {3196#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:00:44,507 INFO L290 TraceCheckUtils]: 18: Hoare triple {3204#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !(~x~0 % 4294967296 < 268435455); {3200#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 03:00:44,508 INFO L290 TraceCheckUtils]: 17: Hoare triple {3208#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3204#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:00:44,508 INFO L290 TraceCheckUtils]: 16: Hoare triple {3212#(or (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3208#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:00:44,509 INFO L290 TraceCheckUtils]: 15: Hoare triple {3216#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3212#(or (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:00:44,511 INFO L290 TraceCheckUtils]: 14: Hoare triple {3220#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3216#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} is VALID [2022-04-28 03:00:44,513 INFO L290 TraceCheckUtils]: 13: Hoare triple {3224#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3220#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} is VALID [2022-04-28 03:00:44,517 INFO L290 TraceCheckUtils]: 12: Hoare triple {3228#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3224#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} is VALID [2022-04-28 03:00:44,518 INFO L290 TraceCheckUtils]: 11: Hoare triple {3232#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3228#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} is VALID [2022-04-28 03:00:44,518 INFO L290 TraceCheckUtils]: 10: Hoare triple {3236#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3232#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:00:44,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {3240#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3236#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:00:44,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {3244#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3240#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:00:44,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {3248#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3244#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} is VALID [2022-04-28 03:00:44,524 INFO L290 TraceCheckUtils]: 6: Hoare triple {3252#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3248#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} is VALID [2022-04-28 03:00:44,524 INFO L290 TraceCheckUtils]: 5: Hoare triple {3100#true} ~x~0 := 0; {3252#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} is VALID [2022-04-28 03:00:44,525 INFO L272 TraceCheckUtils]: 4: Hoare triple {3100#true} call #t~ret4 := main(); {3100#true} is VALID [2022-04-28 03:00:44,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3100#true} {3100#true} #34#return; {3100#true} is VALID [2022-04-28 03:00:44,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {3100#true} assume true; {3100#true} is VALID [2022-04-28 03:00:44,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {3100#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3100#true} is VALID [2022-04-28 03:00:44,525 INFO L272 TraceCheckUtils]: 0: Hoare triple {3100#true} call ULTIMATE.init(); {3100#true} is VALID [2022-04-28 03:00:44,525 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:00:44,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64121614] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:00:44,525 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:00:44,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 18] total 33 [2022-04-28 03:00:44,526 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:00:44,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [220725741] [2022-04-28 03:00:44,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [220725741] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:00:44,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:00:44,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 03:00:44,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051117878] [2022-04-28 03:00:44,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:00:44,526 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:00:44,526 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:00:44,527 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:00:44,543 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:00:44,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 03:00:44,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:44,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 03:00:44,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=785, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 03:00:44,544 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:00:44,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:44,994 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-28 03:00:44,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 03:00:44,994 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:00:44,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:00:44,995 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:00:44,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 30 transitions. [2022-04-28 03:00:44,995 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:00:44,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 30 transitions. [2022-04-28 03:00:44,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 30 transitions. [2022-04-28 03:00:45,016 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:00:45,020 INFO L225 Difference]: With dead ends: 30 [2022-04-28 03:00:45,020 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 03:00:45,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=516, Invalid=1554, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 03:00:45,021 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:00:45,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:00:45,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 03:00:45,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-28 03:00:45,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:00:45,042 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:00:45,042 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:00:45,042 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:00:45,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:45,043 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-28 03:00:45,043 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-28 03:00:45,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:45,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:45,043 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:00:45,044 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:00:45,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:45,045 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2022-04-28 03:00:45,045 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-28 03:00:45,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:45,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:45,045 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:00:45,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:00:45,045 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:00:45,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2022-04-28 03:00:45,047 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2022-04-28 03:00:45,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:00:45,047 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2022-04-28 03:00:45,047 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:00:45,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 25 transitions. [2022-04-28 03:00:45,065 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:00:45,066 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2022-04-28 03:00:45,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 03:00:45,066 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:00:45,066 INFO L195 NwaCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:00:45,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-28 03:00:45,273 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:00:45,469 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:00:45,470 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:00:45,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:00:45,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1793930998, now seen corresponding path program 25 times [2022-04-28 03:00:45,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:45,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [719147459] [2022-04-28 03:00:45,619 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:00:45,620 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:00:45,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1158043657, now seen corresponding path program 1 times [2022-04-28 03:00:45,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:45,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531273189] [2022-04-28 03:00:45,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:45,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:45,628 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_13.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_13.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:00:45,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:00:45,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [589985780] [2022-04-28 03:00:45,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:45,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:45,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:00:45,638 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:00:45,639 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:00:45,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:00:45,686 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:00:45,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:00:45,698 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:00:45,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1793930998, now seen corresponding path program 26 times [2022-04-28 03:00:45,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:45,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145820225] [2022-04-28 03:00:45,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:45,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:45,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:45,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:00:45,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:45,911 INFO L290 TraceCheckUtils]: 0: Hoare triple {3478#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3459#true} is VALID [2022-04-28 03:00:45,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {3459#true} assume true; {3459#true} is VALID [2022-04-28 03:00:45,911 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3459#true} {3459#true} #34#return; {3459#true} is VALID [2022-04-28 03:00:45,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {3459#true} call ULTIMATE.init(); {3478#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:00:45,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {3478#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3459#true} is VALID [2022-04-28 03:00:45,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {3459#true} assume true; {3459#true} is VALID [2022-04-28 03:00:45,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3459#true} {3459#true} #34#return; {3459#true} is VALID [2022-04-28 03:00:45,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {3459#true} call #t~ret4 := main(); {3459#true} is VALID [2022-04-28 03:00:45,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {3459#true} ~x~0 := 0; {3464#(= main_~x~0 0)} is VALID [2022-04-28 03:00:45,912 INFO L290 TraceCheckUtils]: 6: Hoare triple {3464#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3465#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:00:45,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {3465#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3466#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:00:45,913 INFO L290 TraceCheckUtils]: 8: Hoare triple {3466#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3467#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:00:45,914 INFO L290 TraceCheckUtils]: 9: Hoare triple {3467#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3468#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:00:45,914 INFO L290 TraceCheckUtils]: 10: Hoare triple {3468#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3469#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:00:45,915 INFO L290 TraceCheckUtils]: 11: Hoare triple {3469#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3470#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:00:45,915 INFO L290 TraceCheckUtils]: 12: Hoare triple {3470#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3471#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:00:45,916 INFO L290 TraceCheckUtils]: 13: Hoare triple {3471#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3472#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:00:45,916 INFO L290 TraceCheckUtils]: 14: Hoare triple {3472#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3473#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:00:45,917 INFO L290 TraceCheckUtils]: 15: Hoare triple {3473#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3474#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:00:45,917 INFO L290 TraceCheckUtils]: 16: Hoare triple {3474#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3475#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:00:45,918 INFO L290 TraceCheckUtils]: 17: Hoare triple {3475#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3476#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:00:45,918 INFO L290 TraceCheckUtils]: 18: Hoare triple {3476#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3477#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 26))} is VALID [2022-04-28 03:00:45,919 INFO L290 TraceCheckUtils]: 19: Hoare triple {3477#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 26))} assume !(~x~0 % 4294967296 < 268435455); {3460#false} is VALID [2022-04-28 03:00:45,919 INFO L272 TraceCheckUtils]: 20: Hoare triple {3460#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {3460#false} is VALID [2022-04-28 03:00:45,919 INFO L290 TraceCheckUtils]: 21: Hoare triple {3460#false} ~cond := #in~cond; {3460#false} is VALID [2022-04-28 03:00:45,919 INFO L290 TraceCheckUtils]: 22: Hoare triple {3460#false} assume 0 == ~cond; {3460#false} is VALID [2022-04-28 03:00:45,919 INFO L290 TraceCheckUtils]: 23: Hoare triple {3460#false} assume !false; {3460#false} is VALID [2022-04-28 03:00:45,919 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:00:45,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:00:45,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145820225] [2022-04-28 03:00:45,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145820225] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:00:45,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483295116] [2022-04-28 03:00:45,920 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:00:45,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:45,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:00:45,921 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:00:45,921 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:00:45,947 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:00:45,947 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:00:45,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 03:00:45,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:45,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:00:46,200 INFO L272 TraceCheckUtils]: 0: Hoare triple {3459#true} call ULTIMATE.init(); {3459#true} is VALID [2022-04-28 03:00:46,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {3459#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3459#true} is VALID [2022-04-28 03:00:46,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {3459#true} assume true; {3459#true} is VALID [2022-04-28 03:00:46,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3459#true} {3459#true} #34#return; {3459#true} is VALID [2022-04-28 03:00:46,200 INFO L272 TraceCheckUtils]: 4: Hoare triple {3459#true} call #t~ret4 := main(); {3459#true} is VALID [2022-04-28 03:00:46,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {3459#true} ~x~0 := 0; {3464#(= main_~x~0 0)} is VALID [2022-04-28 03:00:46,201 INFO L290 TraceCheckUtils]: 6: Hoare triple {3464#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3465#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:00:46,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {3465#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3466#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:00:46,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {3466#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3467#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:00:46,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {3467#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3468#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:00:46,203 INFO L290 TraceCheckUtils]: 10: Hoare triple {3468#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3469#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:00:46,203 INFO L290 TraceCheckUtils]: 11: Hoare triple {3469#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3470#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:00:46,204 INFO L290 TraceCheckUtils]: 12: Hoare triple {3470#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3471#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:00:46,204 INFO L290 TraceCheckUtils]: 13: Hoare triple {3471#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3472#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:00:46,205 INFO L290 TraceCheckUtils]: 14: Hoare triple {3472#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3473#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:00:46,205 INFO L290 TraceCheckUtils]: 15: Hoare triple {3473#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3474#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:00:46,206 INFO L290 TraceCheckUtils]: 16: Hoare triple {3474#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3475#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:00:46,206 INFO L290 TraceCheckUtils]: 17: Hoare triple {3475#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3476#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:00:46,207 INFO L290 TraceCheckUtils]: 18: Hoare triple {3476#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3536#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:00:46,207 INFO L290 TraceCheckUtils]: 19: Hoare triple {3536#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {3460#false} is VALID [2022-04-28 03:00:46,207 INFO L272 TraceCheckUtils]: 20: Hoare triple {3460#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {3460#false} is VALID [2022-04-28 03:00:46,207 INFO L290 TraceCheckUtils]: 21: Hoare triple {3460#false} ~cond := #in~cond; {3460#false} is VALID [2022-04-28 03:00:46,207 INFO L290 TraceCheckUtils]: 22: Hoare triple {3460#false} assume 0 == ~cond; {3460#false} is VALID [2022-04-28 03:00:46,208 INFO L290 TraceCheckUtils]: 23: Hoare triple {3460#false} assume !false; {3460#false} is VALID [2022-04-28 03:00:46,208 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:00:46,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:00:46,583 INFO L290 TraceCheckUtils]: 23: Hoare triple {3460#false} assume !false; {3460#false} is VALID [2022-04-28 03:00:46,583 INFO L290 TraceCheckUtils]: 22: Hoare triple {3460#false} assume 0 == ~cond; {3460#false} is VALID [2022-04-28 03:00:46,583 INFO L290 TraceCheckUtils]: 21: Hoare triple {3460#false} ~cond := #in~cond; {3460#false} is VALID [2022-04-28 03:00:46,583 INFO L272 TraceCheckUtils]: 20: Hoare triple {3460#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {3460#false} is VALID [2022-04-28 03:00:46,583 INFO L290 TraceCheckUtils]: 19: Hoare triple {3564#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {3460#false} is VALID [2022-04-28 03:00:46,584 INFO L290 TraceCheckUtils]: 18: Hoare triple {3568#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3564#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:00:46,585 INFO L290 TraceCheckUtils]: 17: Hoare triple {3572#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3568#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 03:00:46,585 INFO L290 TraceCheckUtils]: 16: Hoare triple {3576#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3572#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 03:00:46,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {3580#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3576#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 03:00:46,586 INFO L290 TraceCheckUtils]: 14: Hoare triple {3584#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3580#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 03:00:46,587 INFO L290 TraceCheckUtils]: 13: Hoare triple {3588#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3584#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-28 03:00:46,588 INFO L290 TraceCheckUtils]: 12: Hoare triple {3592#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3588#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-28 03:00:46,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {3596#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3592#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-28 03:00:46,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {3600#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3596#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-28 03:00:46,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {3604#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3600#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-28 03:00:46,590 INFO L290 TraceCheckUtils]: 8: Hoare triple {3608#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3604#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-28 03:00:46,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {3612#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3608#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-28 03:00:46,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {3616#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3612#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-28 03:00:46,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {3459#true} ~x~0 := 0; {3616#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-28 03:00:46,592 INFO L272 TraceCheckUtils]: 4: Hoare triple {3459#true} call #t~ret4 := main(); {3459#true} is VALID [2022-04-28 03:00:46,592 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3459#true} {3459#true} #34#return; {3459#true} is VALID [2022-04-28 03:00:46,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {3459#true} assume true; {3459#true} is VALID [2022-04-28 03:00:46,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {3459#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3459#true} is VALID [2022-04-28 03:00:46,592 INFO L272 TraceCheckUtils]: 0: Hoare triple {3459#true} call ULTIMATE.init(); {3459#true} is VALID [2022-04-28 03:00:46,592 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:00:46,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483295116] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:00:46,593 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:00:46,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-28 03:00:46,593 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:00:46,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [719147459] [2022-04-28 03:00:46,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [719147459] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:00:46,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:00:46,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 03:00:46,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886187963] [2022-04-28 03:00:46,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:00:46,594 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:00:46,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:00:46,594 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:00:46,613 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:00:46,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 03:00:46,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:46,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 03:00:46,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=707, Unknown=0, NotChecked=0, Total=992 [2022-04-28 03:00:46,614 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:00:47,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:47,138 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-28 03:00:47,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 03:00:47,138 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:00:47,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:00:47,138 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:00:47,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2022-04-28 03:00:47,139 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:00:47,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 31 transitions. [2022-04-28 03:00:47,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 31 transitions. [2022-04-28 03:00:47,160 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:00:47,161 INFO L225 Difference]: With dead ends: 31 [2022-04-28 03:00:47,161 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 03:00:47,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=563, Invalid=1507, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 03:00:47,162 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:00:47,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 63 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:00:47,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 03:00:47,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-28 03:00:47,186 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:00:47,186 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:00:47,187 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:00:47,187 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:00:47,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:47,187 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-28 03:00:47,187 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-28 03:00:47,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:47,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:47,188 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:00:47,188 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:00:47,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:47,188 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-04-28 03:00:47,188 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-28 03:00:47,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:47,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:47,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:00:47,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:00:47,189 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:00:47,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2022-04-28 03:00:47,189 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2022-04-28 03:00:47,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:00:47,189 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2022-04-28 03:00:47,189 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:00:47,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 26 transitions. [2022-04-28 03:00:47,210 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:00:47,211 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-04-28 03:00:47,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 03:00:47,211 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:00:47,212 INFO L195 NwaCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:00:47,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-28 03:00:47,417 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:00:47,616 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:00:47,616 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:00:47,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:00:47,617 INFO L85 PathProgramCache]: Analyzing trace with hash -186252644, now seen corresponding path program 27 times [2022-04-28 03:00:47,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:47,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1644352001] [2022-04-28 03:00:47,844 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:00:47,853 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:00:47,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1098938313, now seen corresponding path program 1 times [2022-04-28 03:00:47,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:47,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975487574] [2022-04-28 03:00:47,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:47,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:47,860 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_14.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_14.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:00:47,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:00:47,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [835443789] [2022-04-28 03:00:47,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:47,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:47,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:00:47,865 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:00:47,866 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:00:47,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:00:47,909 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:00:47,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:00:47,938 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:00:47,938 INFO L85 PathProgramCache]: Analyzing trace with hash -186252644, now seen corresponding path program 28 times [2022-04-28 03:00:47,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:47,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189935913] [2022-04-28 03:00:47,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:47,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:47,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:48,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:00:48,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:48,174 INFO L290 TraceCheckUtils]: 0: Hoare triple {3851#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3831#true} is VALID [2022-04-28 03:00:48,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {3831#true} assume true; {3831#true} is VALID [2022-04-28 03:00:48,174 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3831#true} {3831#true} #34#return; {3831#true} is VALID [2022-04-28 03:00:48,175 INFO L272 TraceCheckUtils]: 0: Hoare triple {3831#true} call ULTIMATE.init(); {3851#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:00:48,175 INFO L290 TraceCheckUtils]: 1: Hoare triple {3851#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3831#true} is VALID [2022-04-28 03:00:48,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {3831#true} assume true; {3831#true} is VALID [2022-04-28 03:00:48,175 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3831#true} {3831#true} #34#return; {3831#true} is VALID [2022-04-28 03:00:48,175 INFO L272 TraceCheckUtils]: 4: Hoare triple {3831#true} call #t~ret4 := main(); {3831#true} is VALID [2022-04-28 03:00:48,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {3831#true} ~x~0 := 0; {3836#(= main_~x~0 0)} is VALID [2022-04-28 03:00:48,176 INFO L290 TraceCheckUtils]: 6: Hoare triple {3836#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3837#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:00:48,176 INFO L290 TraceCheckUtils]: 7: Hoare triple {3837#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3838#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:00:48,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {3838#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3839#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:00:48,177 INFO L290 TraceCheckUtils]: 9: Hoare triple {3839#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3840#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:00:48,178 INFO L290 TraceCheckUtils]: 10: Hoare triple {3840#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3841#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:00:48,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {3841#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3842#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:00:48,179 INFO L290 TraceCheckUtils]: 12: Hoare triple {3842#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3843#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:00:48,179 INFO L290 TraceCheckUtils]: 13: Hoare triple {3843#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3844#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:00:48,180 INFO L290 TraceCheckUtils]: 14: Hoare triple {3844#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3845#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:00:48,180 INFO L290 TraceCheckUtils]: 15: Hoare triple {3845#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3846#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:00:48,181 INFO L290 TraceCheckUtils]: 16: Hoare triple {3846#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3847#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:00:48,181 INFO L290 TraceCheckUtils]: 17: Hoare triple {3847#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3848#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:00:48,182 INFO L290 TraceCheckUtils]: 18: Hoare triple {3848#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3849#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:00:48,182 INFO L290 TraceCheckUtils]: 19: Hoare triple {3849#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3850#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 28))} is VALID [2022-04-28 03:00:48,183 INFO L290 TraceCheckUtils]: 20: Hoare triple {3850#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 28))} assume !(~x~0 % 4294967296 < 268435455); {3832#false} is VALID [2022-04-28 03:00:48,183 INFO L272 TraceCheckUtils]: 21: Hoare triple {3832#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {3832#false} is VALID [2022-04-28 03:00:48,183 INFO L290 TraceCheckUtils]: 22: Hoare triple {3832#false} ~cond := #in~cond; {3832#false} is VALID [2022-04-28 03:00:48,183 INFO L290 TraceCheckUtils]: 23: Hoare triple {3832#false} assume 0 == ~cond; {3832#false} is VALID [2022-04-28 03:00:48,183 INFO L290 TraceCheckUtils]: 24: Hoare triple {3832#false} assume !false; {3832#false} is VALID [2022-04-28 03:00:48,183 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:00:48,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:00:48,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189935913] [2022-04-28 03:00:48,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189935913] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:00:48,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697067341] [2022-04-28 03:00:48,184 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:00:48,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:48,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:00:48,185 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:00:48,200 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:00:48,228 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:00:48,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:00:48,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 03:00:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:48,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:00:48,480 INFO L272 TraceCheckUtils]: 0: Hoare triple {3831#true} call ULTIMATE.init(); {3831#true} is VALID [2022-04-28 03:00:48,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {3831#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3831#true} is VALID [2022-04-28 03:00:48,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {3831#true} assume true; {3831#true} is VALID [2022-04-28 03:00:48,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3831#true} {3831#true} #34#return; {3831#true} is VALID [2022-04-28 03:00:48,480 INFO L272 TraceCheckUtils]: 4: Hoare triple {3831#true} call #t~ret4 := main(); {3831#true} is VALID [2022-04-28 03:00:48,480 INFO L290 TraceCheckUtils]: 5: Hoare triple {3831#true} ~x~0 := 0; {3836#(= main_~x~0 0)} is VALID [2022-04-28 03:00:48,481 INFO L290 TraceCheckUtils]: 6: Hoare triple {3836#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3837#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:00:48,481 INFO L290 TraceCheckUtils]: 7: Hoare triple {3837#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3838#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:00:48,482 INFO L290 TraceCheckUtils]: 8: Hoare triple {3838#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3839#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:00:48,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {3839#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3840#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:00:48,483 INFO L290 TraceCheckUtils]: 10: Hoare triple {3840#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3841#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:00:48,483 INFO L290 TraceCheckUtils]: 11: Hoare triple {3841#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3842#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:00:48,484 INFO L290 TraceCheckUtils]: 12: Hoare triple {3842#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3843#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:00:48,484 INFO L290 TraceCheckUtils]: 13: Hoare triple {3843#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3844#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:00:48,485 INFO L290 TraceCheckUtils]: 14: Hoare triple {3844#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3845#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:00:48,485 INFO L290 TraceCheckUtils]: 15: Hoare triple {3845#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3846#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:00:48,486 INFO L290 TraceCheckUtils]: 16: Hoare triple {3846#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3847#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:00:48,486 INFO L290 TraceCheckUtils]: 17: Hoare triple {3847#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3848#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:00:48,486 INFO L290 TraceCheckUtils]: 18: Hoare triple {3848#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3849#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:00:48,487 INFO L290 TraceCheckUtils]: 19: Hoare triple {3849#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3912#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:00:48,487 INFO L290 TraceCheckUtils]: 20: Hoare triple {3912#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !(~x~0 % 4294967296 < 268435455); {3832#false} is VALID [2022-04-28 03:00:48,488 INFO L272 TraceCheckUtils]: 21: Hoare triple {3832#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {3832#false} is VALID [2022-04-28 03:00:48,488 INFO L290 TraceCheckUtils]: 22: Hoare triple {3832#false} ~cond := #in~cond; {3832#false} is VALID [2022-04-28 03:00:48,488 INFO L290 TraceCheckUtils]: 23: Hoare triple {3832#false} assume 0 == ~cond; {3832#false} is VALID [2022-04-28 03:00:48,488 INFO L290 TraceCheckUtils]: 24: Hoare triple {3832#false} assume !false; {3832#false} is VALID [2022-04-28 03:00:48,488 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:00:48,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:00:48,920 INFO L290 TraceCheckUtils]: 24: Hoare triple {3832#false} assume !false; {3832#false} is VALID [2022-04-28 03:00:48,920 INFO L290 TraceCheckUtils]: 23: Hoare triple {3832#false} assume 0 == ~cond; {3832#false} is VALID [2022-04-28 03:00:48,920 INFO L290 TraceCheckUtils]: 22: Hoare triple {3832#false} ~cond := #in~cond; {3832#false} is VALID [2022-04-28 03:00:48,920 INFO L272 TraceCheckUtils]: 21: Hoare triple {3832#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {3832#false} is VALID [2022-04-28 03:00:48,920 INFO L290 TraceCheckUtils]: 20: Hoare triple {3940#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {3832#false} is VALID [2022-04-28 03:00:48,921 INFO L290 TraceCheckUtils]: 19: Hoare triple {3944#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3940#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:00:48,922 INFO L290 TraceCheckUtils]: 18: Hoare triple {3948#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3944#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 03:00:48,922 INFO L290 TraceCheckUtils]: 17: Hoare triple {3952#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3948#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 03:00:48,923 INFO L290 TraceCheckUtils]: 16: Hoare triple {3956#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3952#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 03:00:48,923 INFO L290 TraceCheckUtils]: 15: Hoare triple {3960#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3956#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 03:00:48,924 INFO L290 TraceCheckUtils]: 14: Hoare triple {3964#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3960#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-28 03:00:48,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {3968#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3964#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-28 03:00:48,925 INFO L290 TraceCheckUtils]: 12: Hoare triple {3972#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3968#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-28 03:00:48,939 INFO L290 TraceCheckUtils]: 11: Hoare triple {3976#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3972#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-28 03:00:48,940 INFO L290 TraceCheckUtils]: 10: Hoare triple {3980#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3976#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-28 03:00:48,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {3984#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3980#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-28 03:00:48,941 INFO L290 TraceCheckUtils]: 8: Hoare triple {3988#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3984#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-28 03:00:48,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {3992#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3988#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-28 03:00:48,943 INFO L290 TraceCheckUtils]: 6: Hoare triple {3996#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {3992#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-28 03:00:48,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {3831#true} ~x~0 := 0; {3996#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-28 03:00:48,943 INFO L272 TraceCheckUtils]: 4: Hoare triple {3831#true} call #t~ret4 := main(); {3831#true} is VALID [2022-04-28 03:00:48,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3831#true} {3831#true} #34#return; {3831#true} is VALID [2022-04-28 03:00:48,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {3831#true} assume true; {3831#true} is VALID [2022-04-28 03:00:48,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {3831#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {3831#true} is VALID [2022-04-28 03:00:48,943 INFO L272 TraceCheckUtils]: 0: Hoare triple {3831#true} call ULTIMATE.init(); {3831#true} is VALID [2022-04-28 03:00:48,944 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:00:48,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697067341] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:00:48,944 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:00:48,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-28 03:00:48,944 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:00:48,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1644352001] [2022-04-28 03:00:48,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1644352001] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:00:48,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:00:48,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 03:00:48,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646242553] [2022-04-28 03:00:48,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:00:48,945 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:00:48,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:00:48,945 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:00:48,961 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:00:48,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 03:00:48,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:48,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 03:00:48,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=802, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 03:00:48,962 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:00:49,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:49,528 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-28 03:00:49,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 03:00:49,528 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:00:49,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:00:49,528 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:00:49,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. [2022-04-28 03:00:49,529 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:00:49,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 32 transitions. [2022-04-28 03:00:49,529 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 32 transitions. [2022-04-28 03:00:49,552 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:00:49,553 INFO L225 Difference]: With dead ends: 32 [2022-04-28 03:00:49,553 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 03:00:49,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=633, Invalid=1719, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 03:00:49,563 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:00:49,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 53 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:00:49,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 03:00:49,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-28 03:00:49,587 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:00:49,587 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:00:49,587 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:00:49,587 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:00:49,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:49,588 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-28 03:00:49,588 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-28 03:00:49,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:49,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:49,588 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:00:49,588 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:00:49,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:49,589 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-28 03:00:49,589 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-28 03:00:49,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:49,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:49,589 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:00:49,589 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:00:49,589 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:00:49,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-04-28 03:00:49,589 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2022-04-28 03:00:49,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:00:49,590 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-04-28 03:00:49,590 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:00:49,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 27 transitions. [2022-04-28 03:00:49,610 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:00:49,610 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-28 03:00:49,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 03:00:49,610 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:00:49,610 INFO L195 NwaCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:00:49,615 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:00:49,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-28 03:00:50,011 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:00:50,011 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:00:50,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:00:50,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1442403402, now seen corresponding path program 29 times [2022-04-28 03:00:50,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:50,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1633042253] [2022-04-28 03:00:50,175 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:00:50,177 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:00:50,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1039832969, now seen corresponding path program 1 times [2022-04-28 03:00:50,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:50,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125102077] [2022-04-28 03:00:50,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:50,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:50,183 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_15.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_15.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:00:50,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:00:50,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1451584367] [2022-04-28 03:00:50,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:50,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:50,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:00:50,189 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:00:50,190 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:00:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:00:50,232 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:00:50,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:00:50,241 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:00:50,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1442403402, now seen corresponding path program 30 times [2022-04-28 03:00:50,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:50,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119452637] [2022-04-28 03:00:50,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:50,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:50,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:50,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:00:50,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:50,504 INFO L290 TraceCheckUtils]: 0: Hoare triple {4240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4219#true} is VALID [2022-04-28 03:00:50,504 INFO L290 TraceCheckUtils]: 1: Hoare triple {4219#true} assume true; {4219#true} is VALID [2022-04-28 03:00:50,504 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4219#true} {4219#true} #34#return; {4219#true} is VALID [2022-04-28 03:00:50,505 INFO L272 TraceCheckUtils]: 0: Hoare triple {4219#true} call ULTIMATE.init(); {4240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:00:50,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {4240#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4219#true} is VALID [2022-04-28 03:00:50,505 INFO L290 TraceCheckUtils]: 2: Hoare triple {4219#true} assume true; {4219#true} is VALID [2022-04-28 03:00:50,505 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4219#true} {4219#true} #34#return; {4219#true} is VALID [2022-04-28 03:00:50,505 INFO L272 TraceCheckUtils]: 4: Hoare triple {4219#true} call #t~ret4 := main(); {4219#true} is VALID [2022-04-28 03:00:50,505 INFO L290 TraceCheckUtils]: 5: Hoare triple {4219#true} ~x~0 := 0; {4224#(= main_~x~0 0)} is VALID [2022-04-28 03:00:50,506 INFO L290 TraceCheckUtils]: 6: Hoare triple {4224#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4225#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:00:50,506 INFO L290 TraceCheckUtils]: 7: Hoare triple {4225#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4226#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:00:50,507 INFO L290 TraceCheckUtils]: 8: Hoare triple {4226#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4227#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:00:50,507 INFO L290 TraceCheckUtils]: 9: Hoare triple {4227#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4228#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:00:50,508 INFO L290 TraceCheckUtils]: 10: Hoare triple {4228#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4229#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:00:50,508 INFO L290 TraceCheckUtils]: 11: Hoare triple {4229#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4230#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:00:50,509 INFO L290 TraceCheckUtils]: 12: Hoare triple {4230#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4231#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:00:50,509 INFO L290 TraceCheckUtils]: 13: Hoare triple {4231#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4232#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:00:50,512 INFO L290 TraceCheckUtils]: 14: Hoare triple {4232#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4233#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:00:50,512 INFO L290 TraceCheckUtils]: 15: Hoare triple {4233#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4234#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:00:50,513 INFO L290 TraceCheckUtils]: 16: Hoare triple {4234#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4235#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:00:50,513 INFO L290 TraceCheckUtils]: 17: Hoare triple {4235#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4236#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:00:50,514 INFO L290 TraceCheckUtils]: 18: Hoare triple {4236#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4237#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:00:50,514 INFO L290 TraceCheckUtils]: 19: Hoare triple {4237#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4238#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:00:50,515 INFO L290 TraceCheckUtils]: 20: Hoare triple {4238#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4239#(and (<= main_~x~0 30) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:00:50,515 INFO L290 TraceCheckUtils]: 21: Hoare triple {4239#(and (<= main_~x~0 30) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {4220#false} is VALID [2022-04-28 03:00:50,515 INFO L272 TraceCheckUtils]: 22: Hoare triple {4220#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {4220#false} is VALID [2022-04-28 03:00:50,516 INFO L290 TraceCheckUtils]: 23: Hoare triple {4220#false} ~cond := #in~cond; {4220#false} is VALID [2022-04-28 03:00:50,516 INFO L290 TraceCheckUtils]: 24: Hoare triple {4220#false} assume 0 == ~cond; {4220#false} is VALID [2022-04-28 03:00:50,516 INFO L290 TraceCheckUtils]: 25: Hoare triple {4220#false} assume !false; {4220#false} is VALID [2022-04-28 03:00:50,516 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:00:50,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:00:50,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119452637] [2022-04-28 03:00:50,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119452637] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:00:50,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635129002] [2022-04-28 03:00:50,516 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:00:50,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:50,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:00:50,517 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:00:50,518 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:00:50,571 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-28 03:00:50,571 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:00:50,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 03:00:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:50,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:00:50,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {4219#true} call ULTIMATE.init(); {4219#true} is VALID [2022-04-28 03:00:50,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {4219#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4219#true} is VALID [2022-04-28 03:00:50,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {4219#true} assume true; {4219#true} is VALID [2022-04-28 03:00:50,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4219#true} {4219#true} #34#return; {4219#true} is VALID [2022-04-28 03:00:50,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {4219#true} call #t~ret4 := main(); {4219#true} is VALID [2022-04-28 03:00:50,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {4219#true} ~x~0 := 0; {4224#(= main_~x~0 0)} is VALID [2022-04-28 03:00:50,739 INFO L290 TraceCheckUtils]: 6: Hoare triple {4224#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4225#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:00:50,740 INFO L290 TraceCheckUtils]: 7: Hoare triple {4225#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4226#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:00:50,740 INFO L290 TraceCheckUtils]: 8: Hoare triple {4226#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4227#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:00:50,741 INFO L290 TraceCheckUtils]: 9: Hoare triple {4227#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4228#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:00:50,741 INFO L290 TraceCheckUtils]: 10: Hoare triple {4228#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4229#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:00:50,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {4229#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4230#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:00:50,742 INFO L290 TraceCheckUtils]: 12: Hoare triple {4230#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4231#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:00:50,743 INFO L290 TraceCheckUtils]: 13: Hoare triple {4231#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4232#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:00:50,743 INFO L290 TraceCheckUtils]: 14: Hoare triple {4232#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4233#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:00:50,743 INFO L290 TraceCheckUtils]: 15: Hoare triple {4233#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4234#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:00:50,744 INFO L290 TraceCheckUtils]: 16: Hoare triple {4234#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4235#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:00:50,744 INFO L290 TraceCheckUtils]: 17: Hoare triple {4235#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4236#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:00:50,745 INFO L290 TraceCheckUtils]: 18: Hoare triple {4236#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4237#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:00:50,745 INFO L290 TraceCheckUtils]: 19: Hoare triple {4237#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4238#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:00:50,746 INFO L290 TraceCheckUtils]: 20: Hoare triple {4238#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4304#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:00:50,746 INFO L290 TraceCheckUtils]: 21: Hoare triple {4304#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !(~x~0 % 4294967296 < 268435455); {4220#false} is VALID [2022-04-28 03:00:50,746 INFO L272 TraceCheckUtils]: 22: Hoare triple {4220#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {4220#false} is VALID [2022-04-28 03:00:50,746 INFO L290 TraceCheckUtils]: 23: Hoare triple {4220#false} ~cond := #in~cond; {4220#false} is VALID [2022-04-28 03:00:50,746 INFO L290 TraceCheckUtils]: 24: Hoare triple {4220#false} assume 0 == ~cond; {4220#false} is VALID [2022-04-28 03:00:50,747 INFO L290 TraceCheckUtils]: 25: Hoare triple {4220#false} assume !false; {4220#false} is VALID [2022-04-28 03:00:50,747 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:00:50,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:00:51,550 INFO L290 TraceCheckUtils]: 25: Hoare triple {4220#false} assume !false; {4220#false} is VALID [2022-04-28 03:00:51,550 INFO L290 TraceCheckUtils]: 24: Hoare triple {4323#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4220#false} is VALID [2022-04-28 03:00:51,551 INFO L290 TraceCheckUtils]: 23: Hoare triple {4327#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4323#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:00:51,551 INFO L272 TraceCheckUtils]: 22: Hoare triple {4331#(< 0 (mod main_~x~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {4327#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:00:51,552 INFO L290 TraceCheckUtils]: 21: Hoare triple {4335#(or (< 0 (mod main_~x~0 2)) (< (mod main_~x~0 4294967296) 268435455))} assume !(~x~0 % 4294967296 < 268435455); {4331#(< 0 (mod main_~x~0 2))} is VALID [2022-04-28 03:00:51,552 INFO L290 TraceCheckUtils]: 20: Hoare triple {4339#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4335#(or (< 0 (mod main_~x~0 2)) (< (mod main_~x~0 4294967296) 268435455))} is VALID [2022-04-28 03:00:51,553 INFO L290 TraceCheckUtils]: 19: Hoare triple {4343#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4339#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} is VALID [2022-04-28 03:00:51,554 INFO L290 TraceCheckUtils]: 18: Hoare triple {4347#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4343#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} is VALID [2022-04-28 03:00:51,560 INFO L290 TraceCheckUtils]: 17: Hoare triple {4351#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4347#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} is VALID [2022-04-28 03:00:51,561 INFO L290 TraceCheckUtils]: 16: Hoare triple {4355#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4351#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} is VALID [2022-04-28 03:00:51,561 INFO L290 TraceCheckUtils]: 15: Hoare triple {4359#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4355#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} is VALID [2022-04-28 03:00:51,562 INFO L290 TraceCheckUtils]: 14: Hoare triple {4363#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4359#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} is VALID [2022-04-28 03:00:51,563 INFO L290 TraceCheckUtils]: 13: Hoare triple {4367#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 16) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4363#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 268435455))} is VALID [2022-04-28 03:00:51,564 INFO L290 TraceCheckUtils]: 12: Hoare triple {4371#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4367#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 16) 4294967296) 268435455))} is VALID [2022-04-28 03:00:51,565 INFO L290 TraceCheckUtils]: 11: Hoare triple {4375#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4371#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 268435455))} is VALID [2022-04-28 03:00:51,571 INFO L290 TraceCheckUtils]: 10: Hoare triple {4379#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4375#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} is VALID [2022-04-28 03:00:51,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {4383#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4379#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} is VALID [2022-04-28 03:00:51,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {4387#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4383#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} is VALID [2022-04-28 03:00:51,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {4391#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 28) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4387#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} is VALID [2022-04-28 03:00:51,577 INFO L290 TraceCheckUtils]: 6: Hoare triple {4395#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 30 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4391#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 28) 4294967296) 268435455))} is VALID [2022-04-28 03:00:51,577 INFO L290 TraceCheckUtils]: 5: Hoare triple {4219#true} ~x~0 := 0; {4395#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 30 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:00:51,577 INFO L272 TraceCheckUtils]: 4: Hoare triple {4219#true} call #t~ret4 := main(); {4219#true} is VALID [2022-04-28 03:00:51,577 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4219#true} {4219#true} #34#return; {4219#true} is VALID [2022-04-28 03:00:51,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {4219#true} assume true; {4219#true} is VALID [2022-04-28 03:00:51,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {4219#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4219#true} is VALID [2022-04-28 03:00:51,577 INFO L272 TraceCheckUtils]: 0: Hoare triple {4219#true} call ULTIMATE.init(); {4219#true} is VALID [2022-04-28 03:00:51,578 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:00:51,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635129002] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:00:51,578 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:00:51,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 21] total 39 [2022-04-28 03:00:51,578 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:00:51,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1633042253] [2022-04-28 03:00:51,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1633042253] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:00:51,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:00:51,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 03:00:51,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054752794] [2022-04-28 03:00:51,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:00:51,579 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:00:51,579 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:00:51,579 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:00:51,593 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:00:51,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 03:00:51,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:51,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 03:00:51,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=1103, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 03:00:51,594 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:00:52,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:52,247 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-28 03:00:52,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 03:00:52,247 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:00:52,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:00:52,248 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:00:52,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 33 transitions. [2022-04-28 03:00:52,248 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:00:52,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 33 transitions. [2022-04-28 03:00:52,249 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 33 transitions. [2022-04-28 03:00:52,280 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:00:52,281 INFO L225 Difference]: With dead ends: 33 [2022-04-28 03:00:52,281 INFO L226 Difference]: Without dead ends: 28 [2022-04-28 03:00:52,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=729, Invalid=2241, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 03:00:52,282 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:00:52,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 63 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:00:52,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-28 03:00:52,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-28 03:00:52,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:00:52,301 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:00:52,302 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:00:52,302 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:00:52,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:52,302 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-28 03:00:52,302 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-28 03:00:52,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:52,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:52,303 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:00:52,303 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:00:52,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:52,303 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-04-28 03:00:52,303 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-28 03:00:52,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:52,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:52,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:00:52,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:00:52,304 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:00:52,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2022-04-28 03:00:52,304 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2022-04-28 03:00:52,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:00:52,304 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2022-04-28 03:00:52,304 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:00:52,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 28 transitions. [2022-04-28 03:00:52,325 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:00:52,325 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-04-28 03:00:52,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 03:00:52,325 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:00:52,325 INFO L195 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:00:52,341 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:00:52,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-28 03:00:52,726 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:00:52,726 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:00:52,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:00:52,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1728371236, now seen corresponding path program 31 times [2022-04-28 03:00:52,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:52,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1417633675] [2022-04-28 03:00:52,915 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:00:52,916 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:00:52,919 INFO L85 PathProgramCache]: Analyzing trace with hash -980727625, now seen corresponding path program 1 times [2022-04-28 03:00:52,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:52,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433481791] [2022-04-28 03:00:52,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:52,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:52,926 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_16.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_16.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:00:52,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:00:52,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [542905201] [2022-04-28 03:00:52,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:52,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:52,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:00:52,931 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:00:52,951 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:00:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:00:52,998 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:00:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:00:53,011 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:00:53,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1728371236, now seen corresponding path program 32 times [2022-04-28 03:00:53,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:53,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857012855] [2022-04-28 03:00:53,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:53,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:53,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:53,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:00:53,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:53,303 INFO L290 TraceCheckUtils]: 0: Hoare triple {4648#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4626#true} is VALID [2022-04-28 03:00:53,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {4626#true} assume true; {4626#true} is VALID [2022-04-28 03:00:53,304 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4626#true} {4626#true} #34#return; {4626#true} is VALID [2022-04-28 03:00:53,304 INFO L272 TraceCheckUtils]: 0: Hoare triple {4626#true} call ULTIMATE.init(); {4648#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:00:53,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {4648#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4626#true} is VALID [2022-04-28 03:00:53,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {4626#true} assume true; {4626#true} is VALID [2022-04-28 03:00:53,304 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4626#true} {4626#true} #34#return; {4626#true} is VALID [2022-04-28 03:00:53,304 INFO L272 TraceCheckUtils]: 4: Hoare triple {4626#true} call #t~ret4 := main(); {4626#true} is VALID [2022-04-28 03:00:53,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {4626#true} ~x~0 := 0; {4631#(= main_~x~0 0)} is VALID [2022-04-28 03:00:53,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {4631#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4632#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:00:53,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {4632#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4633#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:00:53,306 INFO L290 TraceCheckUtils]: 8: Hoare triple {4633#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4634#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:00:53,306 INFO L290 TraceCheckUtils]: 9: Hoare triple {4634#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4635#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:00:53,307 INFO L290 TraceCheckUtils]: 10: Hoare triple {4635#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4636#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:00:53,307 INFO L290 TraceCheckUtils]: 11: Hoare triple {4636#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4637#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:00:53,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {4637#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4638#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:00:53,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {4638#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4639#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:00:53,309 INFO L290 TraceCheckUtils]: 14: Hoare triple {4639#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4640#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:00:53,309 INFO L290 TraceCheckUtils]: 15: Hoare triple {4640#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4641#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:00:53,310 INFO L290 TraceCheckUtils]: 16: Hoare triple {4641#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4642#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:00:53,310 INFO L290 TraceCheckUtils]: 17: Hoare triple {4642#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4643#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:00:53,311 INFO L290 TraceCheckUtils]: 18: Hoare triple {4643#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4644#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:00:53,311 INFO L290 TraceCheckUtils]: 19: Hoare triple {4644#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4645#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:00:53,312 INFO L290 TraceCheckUtils]: 20: Hoare triple {4645#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4646#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:00:53,312 INFO L290 TraceCheckUtils]: 21: Hoare triple {4646#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4647#(and (<= main_~x~0 32) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:00:53,313 INFO L290 TraceCheckUtils]: 22: Hoare triple {4647#(and (<= main_~x~0 32) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {4627#false} is VALID [2022-04-28 03:00:53,313 INFO L272 TraceCheckUtils]: 23: Hoare triple {4627#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {4627#false} is VALID [2022-04-28 03:00:53,313 INFO L290 TraceCheckUtils]: 24: Hoare triple {4627#false} ~cond := #in~cond; {4627#false} is VALID [2022-04-28 03:00:53,313 INFO L290 TraceCheckUtils]: 25: Hoare triple {4627#false} assume 0 == ~cond; {4627#false} is VALID [2022-04-28 03:00:53,313 INFO L290 TraceCheckUtils]: 26: Hoare triple {4627#false} assume !false; {4627#false} is VALID [2022-04-28 03:00:53,313 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:00:53,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:00:53,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857012855] [2022-04-28 03:00:53,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857012855] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:00:53,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247133335] [2022-04-28 03:00:53,313 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:00:53,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:53,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:00:53,314 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:00:53,315 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:00:53,344 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:00:53,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:00:53,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 03:00:53,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:53,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:00:53,590 INFO L272 TraceCheckUtils]: 0: Hoare triple {4626#true} call ULTIMATE.init(); {4626#true} is VALID [2022-04-28 03:00:53,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {4626#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4626#true} is VALID [2022-04-28 03:00:53,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {4626#true} assume true; {4626#true} is VALID [2022-04-28 03:00:53,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4626#true} {4626#true} #34#return; {4626#true} is VALID [2022-04-28 03:00:53,591 INFO L272 TraceCheckUtils]: 4: Hoare triple {4626#true} call #t~ret4 := main(); {4626#true} is VALID [2022-04-28 03:00:53,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {4626#true} ~x~0 := 0; {4631#(= main_~x~0 0)} is VALID [2022-04-28 03:00:53,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {4631#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4632#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:00:53,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {4632#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4633#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:00:53,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {4633#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4634#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:00:53,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {4634#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4635#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:00:53,594 INFO L290 TraceCheckUtils]: 10: Hoare triple {4635#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4636#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:00:53,594 INFO L290 TraceCheckUtils]: 11: Hoare triple {4636#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4637#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:00:53,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {4637#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4638#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:00:53,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {4638#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4639#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:00:53,596 INFO L290 TraceCheckUtils]: 14: Hoare triple {4639#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4640#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:00:53,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {4640#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4641#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:00:53,596 INFO L290 TraceCheckUtils]: 16: Hoare triple {4641#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4642#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:00:53,597 INFO L290 TraceCheckUtils]: 17: Hoare triple {4642#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4643#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:00:53,597 INFO L290 TraceCheckUtils]: 18: Hoare triple {4643#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4644#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:00:53,598 INFO L290 TraceCheckUtils]: 19: Hoare triple {4644#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4645#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:00:53,598 INFO L290 TraceCheckUtils]: 20: Hoare triple {4645#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4646#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:00:53,599 INFO L290 TraceCheckUtils]: 21: Hoare triple {4646#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4715#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:00:53,599 INFO L290 TraceCheckUtils]: 22: Hoare triple {4715#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {4627#false} is VALID [2022-04-28 03:00:53,599 INFO L272 TraceCheckUtils]: 23: Hoare triple {4627#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {4627#false} is VALID [2022-04-28 03:00:53,599 INFO L290 TraceCheckUtils]: 24: Hoare triple {4627#false} ~cond := #in~cond; {4627#false} is VALID [2022-04-28 03:00:53,600 INFO L290 TraceCheckUtils]: 25: Hoare triple {4627#false} assume 0 == ~cond; {4627#false} is VALID [2022-04-28 03:00:53,600 INFO L290 TraceCheckUtils]: 26: Hoare triple {4627#false} assume !false; {4627#false} is VALID [2022-04-28 03:00:53,600 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:00:53,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:00:54,135 INFO L290 TraceCheckUtils]: 26: Hoare triple {4627#false} assume !false; {4627#false} is VALID [2022-04-28 03:00:54,135 INFO L290 TraceCheckUtils]: 25: Hoare triple {4627#false} assume 0 == ~cond; {4627#false} is VALID [2022-04-28 03:00:54,135 INFO L290 TraceCheckUtils]: 24: Hoare triple {4627#false} ~cond := #in~cond; {4627#false} is VALID [2022-04-28 03:00:54,135 INFO L272 TraceCheckUtils]: 23: Hoare triple {4627#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {4627#false} is VALID [2022-04-28 03:00:54,136 INFO L290 TraceCheckUtils]: 22: Hoare triple {4743#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {4627#false} is VALID [2022-04-28 03:00:54,136 INFO L290 TraceCheckUtils]: 21: Hoare triple {4747#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4743#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:00:54,137 INFO L290 TraceCheckUtils]: 20: Hoare triple {4751#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4747#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 03:00:54,138 INFO L290 TraceCheckUtils]: 19: Hoare triple {4755#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4751#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 03:00:54,138 INFO L290 TraceCheckUtils]: 18: Hoare triple {4759#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4755#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 03:00:54,139 INFO L290 TraceCheckUtils]: 17: Hoare triple {4763#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4759#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 03:00:54,139 INFO L290 TraceCheckUtils]: 16: Hoare triple {4767#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4763#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-28 03:00:54,140 INFO L290 TraceCheckUtils]: 15: Hoare triple {4771#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4767#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-28 03:00:54,141 INFO L290 TraceCheckUtils]: 14: Hoare triple {4775#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4771#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-28 03:00:54,141 INFO L290 TraceCheckUtils]: 13: Hoare triple {4779#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4775#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-28 03:00:54,142 INFO L290 TraceCheckUtils]: 12: Hoare triple {4783#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4779#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-28 03:00:54,142 INFO L290 TraceCheckUtils]: 11: Hoare triple {4787#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4783#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-28 03:00:54,143 INFO L290 TraceCheckUtils]: 10: Hoare triple {4791#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4787#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-28 03:00:54,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {4795#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4791#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-28 03:00:54,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {4799#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4795#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-28 03:00:54,145 INFO L290 TraceCheckUtils]: 7: Hoare triple {4803#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4799#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-28 03:00:54,145 INFO L290 TraceCheckUtils]: 6: Hoare triple {4807#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {4803#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:00:54,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {4626#true} ~x~0 := 0; {4807#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:00:54,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {4626#true} call #t~ret4 := main(); {4626#true} is VALID [2022-04-28 03:00:54,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4626#true} {4626#true} #34#return; {4626#true} is VALID [2022-04-28 03:00:54,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {4626#true} assume true; {4626#true} is VALID [2022-04-28 03:00:54,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {4626#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {4626#true} is VALID [2022-04-28 03:00:54,146 INFO L272 TraceCheckUtils]: 0: Hoare triple {4626#true} call ULTIMATE.init(); {4626#true} is VALID [2022-04-28 03:00:54,146 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:00:54,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247133335] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:00:54,146 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:00:54,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-28 03:00:54,147 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:00:54,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1417633675] [2022-04-28 03:00:54,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1417633675] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:00:54,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:00:54,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 03:00:54,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479819367] [2022-04-28 03:00:54,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:00:54,147 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:00:54,148 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:00:54,148 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:00:54,163 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:00:54,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 03:00:54,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:54,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 03:00:54,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=396, Invalid=1010, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 03:00:54,164 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:00:54,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:54,822 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-28 03:00:54,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 03:00:54,823 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.15) internal successors, (23), 19 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-28 03:00:54,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:00:54,823 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:00:54,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. [2022-04-28 03:00:54,824 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:00:54,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. [2022-04-28 03:00:54,824 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 34 transitions. [2022-04-28 03:00:54,846 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:00:54,847 INFO L225 Difference]: With dead ends: 34 [2022-04-28 03:00:54,847 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 03:00:54,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=785, Invalid=2185, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 03:00:54,848 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:00:54,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 28 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:00:54,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 03:00:54,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-28 03:00:54,872 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:00:54,873 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:00:54,873 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:00:54,873 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:00:54,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:54,873 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-28 03:00:54,873 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-28 03:00:54,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:54,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:54,874 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:00:54,874 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:00:54,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:54,874 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-04-28 03:00:54,874 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-28 03:00:54,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:54,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:54,874 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:00:54,875 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:00:54,875 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:00:54,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2022-04-28 03:00:54,875 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2022-04-28 03:00:54,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:00:54,875 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2022-04-28 03:00:54,875 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:00:54,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 29 transitions. [2022-04-28 03:00:54,898 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:00:54,899 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-04-28 03:00:54,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 03:00:54,899 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:00:54,899 INFO L195 NwaCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:00:54,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-04-28 03:00:55,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-04-28 03:00:55,299 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:00:55,300 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:00:55,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:00:55,300 INFO L85 PathProgramCache]: Analyzing trace with hash -2003439498, now seen corresponding path program 33 times [2022-04-28 03:00:55,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:55,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [735908747] [2022-04-28 03:00:55,545 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:00:55,546 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:00:55,548 INFO L85 PathProgramCache]: Analyzing trace with hash -921622281, now seen corresponding path program 1 times [2022-04-28 03:00:55,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:55,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996749936] [2022-04-28 03:00:55,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:55,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:55,553 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_17.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_17.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:00:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:00:55,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1665953597] [2022-04-28 03:00:55,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:55,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:55,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:00:55,557 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:00:55,558 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:00:55,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:00:55,599 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:00:55,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:00:55,617 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:00:55,617 INFO L85 PathProgramCache]: Analyzing trace with hash -2003439498, now seen corresponding path program 34 times [2022-04-28 03:00:55,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:55,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859861857] [2022-04-28 03:00:55,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:55,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:55,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:55,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:00:55,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:55,928 INFO L290 TraceCheckUtils]: 0: Hoare triple {5069#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5046#true} is VALID [2022-04-28 03:00:55,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {5046#true} assume true; {5046#true} is VALID [2022-04-28 03:00:55,928 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5046#true} {5046#true} #34#return; {5046#true} is VALID [2022-04-28 03:00:55,929 INFO L272 TraceCheckUtils]: 0: Hoare triple {5046#true} call ULTIMATE.init(); {5069#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:00:55,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {5069#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5046#true} is VALID [2022-04-28 03:00:55,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {5046#true} assume true; {5046#true} is VALID [2022-04-28 03:00:55,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5046#true} {5046#true} #34#return; {5046#true} is VALID [2022-04-28 03:00:55,929 INFO L272 TraceCheckUtils]: 4: Hoare triple {5046#true} call #t~ret4 := main(); {5046#true} is VALID [2022-04-28 03:00:55,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {5046#true} ~x~0 := 0; {5051#(= main_~x~0 0)} is VALID [2022-04-28 03:00:55,930 INFO L290 TraceCheckUtils]: 6: Hoare triple {5051#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5052#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:00:55,930 INFO L290 TraceCheckUtils]: 7: Hoare triple {5052#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5053#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:00:55,931 INFO L290 TraceCheckUtils]: 8: Hoare triple {5053#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5054#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:00:55,931 INFO L290 TraceCheckUtils]: 9: Hoare triple {5054#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5055#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:00:55,931 INFO L290 TraceCheckUtils]: 10: Hoare triple {5055#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5056#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:00:55,932 INFO L290 TraceCheckUtils]: 11: Hoare triple {5056#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5057#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:00:55,932 INFO L290 TraceCheckUtils]: 12: Hoare triple {5057#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5058#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:00:55,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {5058#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5059#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:00:55,933 INFO L290 TraceCheckUtils]: 14: Hoare triple {5059#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5060#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:00:55,934 INFO L290 TraceCheckUtils]: 15: Hoare triple {5060#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5061#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:00:55,934 INFO L290 TraceCheckUtils]: 16: Hoare triple {5061#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5062#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:00:55,935 INFO L290 TraceCheckUtils]: 17: Hoare triple {5062#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5063#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:00:55,935 INFO L290 TraceCheckUtils]: 18: Hoare triple {5063#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5064#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:00:55,936 INFO L290 TraceCheckUtils]: 19: Hoare triple {5064#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5065#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:00:55,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {5065#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5066#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:00:55,936 INFO L290 TraceCheckUtils]: 21: Hoare triple {5066#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5067#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:00:55,937 INFO L290 TraceCheckUtils]: 22: Hoare triple {5067#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5068#(and (<= main_~x~0 34) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:00:55,937 INFO L290 TraceCheckUtils]: 23: Hoare triple {5068#(and (<= main_~x~0 34) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {5047#false} is VALID [2022-04-28 03:00:55,937 INFO L272 TraceCheckUtils]: 24: Hoare triple {5047#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {5047#false} is VALID [2022-04-28 03:00:55,938 INFO L290 TraceCheckUtils]: 25: Hoare triple {5047#false} ~cond := #in~cond; {5047#false} is VALID [2022-04-28 03:00:55,938 INFO L290 TraceCheckUtils]: 26: Hoare triple {5047#false} assume 0 == ~cond; {5047#false} is VALID [2022-04-28 03:00:55,938 INFO L290 TraceCheckUtils]: 27: Hoare triple {5047#false} assume !false; {5047#false} is VALID [2022-04-28 03:00:55,938 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:00:55,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:00:55,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859861857] [2022-04-28 03:00:55,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859861857] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:00:55,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615977476] [2022-04-28 03:00:55,938 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:00:55,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:55,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:00:55,944 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:00:55,945 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:00:55,981 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:00:55,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:00:55,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 03:00:55,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:55,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:00:56,270 INFO L272 TraceCheckUtils]: 0: Hoare triple {5046#true} call ULTIMATE.init(); {5046#true} is VALID [2022-04-28 03:00:56,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {5046#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5046#true} is VALID [2022-04-28 03:00:56,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {5046#true} assume true; {5046#true} is VALID [2022-04-28 03:00:56,270 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5046#true} {5046#true} #34#return; {5046#true} is VALID [2022-04-28 03:00:56,270 INFO L272 TraceCheckUtils]: 4: Hoare triple {5046#true} call #t~ret4 := main(); {5046#true} is VALID [2022-04-28 03:00:56,271 INFO L290 TraceCheckUtils]: 5: Hoare triple {5046#true} ~x~0 := 0; {5051#(= main_~x~0 0)} is VALID [2022-04-28 03:00:56,271 INFO L290 TraceCheckUtils]: 6: Hoare triple {5051#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5052#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:00:56,272 INFO L290 TraceCheckUtils]: 7: Hoare triple {5052#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5053#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:00:56,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {5053#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5054#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:00:56,273 INFO L290 TraceCheckUtils]: 9: Hoare triple {5054#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5055#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:00:56,273 INFO L290 TraceCheckUtils]: 10: Hoare triple {5055#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5056#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:00:56,274 INFO L290 TraceCheckUtils]: 11: Hoare triple {5056#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5057#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:00:56,274 INFO L290 TraceCheckUtils]: 12: Hoare triple {5057#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5058#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:00:56,275 INFO L290 TraceCheckUtils]: 13: Hoare triple {5058#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5059#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:00:56,275 INFO L290 TraceCheckUtils]: 14: Hoare triple {5059#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5060#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:00:56,276 INFO L290 TraceCheckUtils]: 15: Hoare triple {5060#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5061#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:00:56,276 INFO L290 TraceCheckUtils]: 16: Hoare triple {5061#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5062#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:00:56,277 INFO L290 TraceCheckUtils]: 17: Hoare triple {5062#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5063#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:00:56,277 INFO L290 TraceCheckUtils]: 18: Hoare triple {5063#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5064#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:00:56,278 INFO L290 TraceCheckUtils]: 19: Hoare triple {5064#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5065#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:00:56,278 INFO L290 TraceCheckUtils]: 20: Hoare triple {5065#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5066#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:00:56,279 INFO L290 TraceCheckUtils]: 21: Hoare triple {5066#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5067#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:00:56,279 INFO L290 TraceCheckUtils]: 22: Hoare triple {5067#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5139#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:00:56,280 INFO L290 TraceCheckUtils]: 23: Hoare triple {5139#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {5047#false} is VALID [2022-04-28 03:00:56,280 INFO L272 TraceCheckUtils]: 24: Hoare triple {5047#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {5047#false} is VALID [2022-04-28 03:00:56,280 INFO L290 TraceCheckUtils]: 25: Hoare triple {5047#false} ~cond := #in~cond; {5047#false} is VALID [2022-04-28 03:00:56,280 INFO L290 TraceCheckUtils]: 26: Hoare triple {5047#false} assume 0 == ~cond; {5047#false} is VALID [2022-04-28 03:00:56,280 INFO L290 TraceCheckUtils]: 27: Hoare triple {5047#false} assume !false; {5047#false} is VALID [2022-04-28 03:00:56,280 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:00:56,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:00:56,866 INFO L290 TraceCheckUtils]: 27: Hoare triple {5047#false} assume !false; {5047#false} is VALID [2022-04-28 03:00:56,867 INFO L290 TraceCheckUtils]: 26: Hoare triple {5047#false} assume 0 == ~cond; {5047#false} is VALID [2022-04-28 03:00:56,867 INFO L290 TraceCheckUtils]: 25: Hoare triple {5047#false} ~cond := #in~cond; {5047#false} is VALID [2022-04-28 03:00:56,867 INFO L272 TraceCheckUtils]: 24: Hoare triple {5047#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {5047#false} is VALID [2022-04-28 03:00:56,867 INFO L290 TraceCheckUtils]: 23: Hoare triple {5167#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {5047#false} is VALID [2022-04-28 03:00:56,868 INFO L290 TraceCheckUtils]: 22: Hoare triple {5171#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5167#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:00:56,868 INFO L290 TraceCheckUtils]: 21: Hoare triple {5175#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5171#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 03:00:56,869 INFO L290 TraceCheckUtils]: 20: Hoare triple {5179#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5175#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 03:00:56,870 INFO L290 TraceCheckUtils]: 19: Hoare triple {5183#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5179#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 03:00:56,870 INFO L290 TraceCheckUtils]: 18: Hoare triple {5187#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5183#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 03:00:56,871 INFO L290 TraceCheckUtils]: 17: Hoare triple {5191#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5187#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-28 03:00:56,871 INFO L290 TraceCheckUtils]: 16: Hoare triple {5195#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5191#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-28 03:00:56,872 INFO L290 TraceCheckUtils]: 15: Hoare triple {5199#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5195#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-28 03:00:56,872 INFO L290 TraceCheckUtils]: 14: Hoare triple {5203#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5199#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-28 03:00:56,873 INFO L290 TraceCheckUtils]: 13: Hoare triple {5207#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5203#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-28 03:00:56,874 INFO L290 TraceCheckUtils]: 12: Hoare triple {5211#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5207#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-28 03:00:56,874 INFO L290 TraceCheckUtils]: 11: Hoare triple {5215#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5211#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-28 03:00:56,875 INFO L290 TraceCheckUtils]: 10: Hoare triple {5219#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5215#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-28 03:00:56,875 INFO L290 TraceCheckUtils]: 9: Hoare triple {5223#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5219#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-28 03:00:56,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {5227#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5223#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-28 03:00:56,877 INFO L290 TraceCheckUtils]: 7: Hoare triple {5231#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5227#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:00:56,877 INFO L290 TraceCheckUtils]: 6: Hoare triple {5235#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5231#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:00:56,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {5046#true} ~x~0 := 0; {5235#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-28 03:00:56,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {5046#true} call #t~ret4 := main(); {5046#true} is VALID [2022-04-28 03:00:56,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5046#true} {5046#true} #34#return; {5046#true} is VALID [2022-04-28 03:00:56,878 INFO L290 TraceCheckUtils]: 2: Hoare triple {5046#true} assume true; {5046#true} is VALID [2022-04-28 03:00:56,878 INFO L290 TraceCheckUtils]: 1: Hoare triple {5046#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5046#true} is VALID [2022-04-28 03:00:56,878 INFO L272 TraceCheckUtils]: 0: Hoare triple {5046#true} call ULTIMATE.init(); {5046#true} is VALID [2022-04-28 03:00:56,878 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:00:56,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615977476] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:00:56,878 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:00:56,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-28 03:00:56,879 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:00:56,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [735908747] [2022-04-28 03:00:56,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [735908747] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:00:56,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:00:56,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 03:00:56,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583974695] [2022-04-28 03:00:56,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:00:56,879 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:00:56,879 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:00:56,880 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:00:56,895 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:00:56,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 03:00:56,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:56,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 03:00:56,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=1123, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 03:00:56,896 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:00:57,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:57,679 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-28 03:00:57,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 03:00:57,679 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:00:57,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:00:57,679 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:00:57,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 35 transitions. [2022-04-28 03:00:57,680 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:00:57,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 35 transitions. [2022-04-28 03:00:57,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 35 transitions. [2022-04-28 03:00:57,703 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:00:57,703 INFO L225 Difference]: With dead ends: 35 [2022-04-28 03:00:57,703 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 03:00:57,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=867, Invalid=2439, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 03:00:57,705 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:00:57,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 48 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:00:57,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 03:00:57,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-28 03:00:57,731 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:00:57,731 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:00:57,731 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:00:57,731 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:00:57,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:57,731 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-28 03:00:57,732 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-28 03:00:57,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:57,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:57,732 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:00:57,732 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:00:57,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:00:57,732 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-04-28 03:00:57,732 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-28 03:00:57,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:00:57,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:00:57,733 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:00:57,733 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:00:57,733 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:00:57,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2022-04-28 03:00:57,733 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2022-04-28 03:00:57,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:00:57,733 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2022-04-28 03:00:57,734 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:00:57,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 30 transitions. [2022-04-28 03:00:57,763 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:00:57,763 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-04-28 03:00:57,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 03:00:57,764 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:00:57,764 INFO L195 NwaCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:00:57,767 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:00:57,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2022-04-28 03:00:58,167 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:00:58,168 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:00:58,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:00:58,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1940621028, now seen corresponding path program 35 times [2022-04-28 03:00:58,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:00:58,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1894792929] [2022-04-28 03:00:58,342 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:00:58,343 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:00:58,346 INFO L85 PathProgramCache]: Analyzing trace with hash -862516937, now seen corresponding path program 1 times [2022-04-28 03:00:58,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:58,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920947375] [2022-04-28 03:00:58,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:58,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:58,350 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_18.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_18.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:00:58,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:00:58,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [873633484] [2022-04-28 03:00:58,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:58,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:58,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:00:58,355 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:00:58,359 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:00:58,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:00:58,403 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:00:58,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:00:58,412 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:00:58,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1940621028, now seen corresponding path program 36 times [2022-04-28 03:00:58,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:00:58,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667900147] [2022-04-28 03:00:58,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:00:58,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:00:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:58,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:00:58,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:58,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {5506#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5482#true} is VALID [2022-04-28 03:00:58,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {5482#true} assume true; {5482#true} is VALID [2022-04-28 03:00:58,705 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5482#true} {5482#true} #34#return; {5482#true} is VALID [2022-04-28 03:00:58,705 INFO L272 TraceCheckUtils]: 0: Hoare triple {5482#true} call ULTIMATE.init(); {5506#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:00:58,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {5506#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5482#true} is VALID [2022-04-28 03:00:58,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {5482#true} assume true; {5482#true} is VALID [2022-04-28 03:00:58,705 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5482#true} {5482#true} #34#return; {5482#true} is VALID [2022-04-28 03:00:58,705 INFO L272 TraceCheckUtils]: 4: Hoare triple {5482#true} call #t~ret4 := main(); {5482#true} is VALID [2022-04-28 03:00:58,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {5482#true} ~x~0 := 0; {5487#(= main_~x~0 0)} is VALID [2022-04-28 03:00:58,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {5487#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5488#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:00:58,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {5488#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5489#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:00:58,707 INFO L290 TraceCheckUtils]: 8: Hoare triple {5489#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5490#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:00:58,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {5490#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5491#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:00:58,708 INFO L290 TraceCheckUtils]: 10: Hoare triple {5491#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5492#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:00:58,708 INFO L290 TraceCheckUtils]: 11: Hoare triple {5492#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5493#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:00:58,709 INFO L290 TraceCheckUtils]: 12: Hoare triple {5493#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5494#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:00:58,709 INFO L290 TraceCheckUtils]: 13: Hoare triple {5494#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5495#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:00:58,710 INFO L290 TraceCheckUtils]: 14: Hoare triple {5495#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5496#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:00:58,710 INFO L290 TraceCheckUtils]: 15: Hoare triple {5496#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5497#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:00:58,711 INFO L290 TraceCheckUtils]: 16: Hoare triple {5497#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5498#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:00:58,711 INFO L290 TraceCheckUtils]: 17: Hoare triple {5498#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5499#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:00:58,712 INFO L290 TraceCheckUtils]: 18: Hoare triple {5499#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5500#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:00:58,712 INFO L290 TraceCheckUtils]: 19: Hoare triple {5500#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5501#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:00:58,713 INFO L290 TraceCheckUtils]: 20: Hoare triple {5501#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5502#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:00:58,713 INFO L290 TraceCheckUtils]: 21: Hoare triple {5502#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5503#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:00:58,714 INFO L290 TraceCheckUtils]: 22: Hoare triple {5503#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5504#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:00:58,714 INFO L290 TraceCheckUtils]: 23: Hoare triple {5504#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5505#(and (<= main_~x~0 36) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:00:58,714 INFO L290 TraceCheckUtils]: 24: Hoare triple {5505#(and (<= main_~x~0 36) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {5483#false} is VALID [2022-04-28 03:00:58,715 INFO L272 TraceCheckUtils]: 25: Hoare triple {5483#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {5483#false} is VALID [2022-04-28 03:00:58,715 INFO L290 TraceCheckUtils]: 26: Hoare triple {5483#false} ~cond := #in~cond; {5483#false} is VALID [2022-04-28 03:00:58,715 INFO L290 TraceCheckUtils]: 27: Hoare triple {5483#false} assume 0 == ~cond; {5483#false} is VALID [2022-04-28 03:00:58,715 INFO L290 TraceCheckUtils]: 28: Hoare triple {5483#false} assume !false; {5483#false} is VALID [2022-04-28 03:00:58,715 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:00:58,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:00:58,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667900147] [2022-04-28 03:00:58,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667900147] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:00:58,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222971515] [2022-04-28 03:00:58,715 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:00:58,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:00:58,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:00:58,717 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:00:58,717 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:00:58,842 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-28 03:00:58,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:00:58,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-28 03:00:58,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:00:58,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:00:59,052 INFO L272 TraceCheckUtils]: 0: Hoare triple {5482#true} call ULTIMATE.init(); {5482#true} is VALID [2022-04-28 03:00:59,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {5482#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5482#true} is VALID [2022-04-28 03:00:59,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {5482#true} assume true; {5482#true} is VALID [2022-04-28 03:00:59,052 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5482#true} {5482#true} #34#return; {5482#true} is VALID [2022-04-28 03:00:59,053 INFO L272 TraceCheckUtils]: 4: Hoare triple {5482#true} call #t~ret4 := main(); {5482#true} is VALID [2022-04-28 03:00:59,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {5482#true} ~x~0 := 0; {5487#(= main_~x~0 0)} is VALID [2022-04-28 03:00:59,053 INFO L290 TraceCheckUtils]: 6: Hoare triple {5487#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5488#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:00:59,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {5488#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5489#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:00:59,054 INFO L290 TraceCheckUtils]: 8: Hoare triple {5489#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5490#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:00:59,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {5490#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5491#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:00:59,055 INFO L290 TraceCheckUtils]: 10: Hoare triple {5491#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5492#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:00:59,056 INFO L290 TraceCheckUtils]: 11: Hoare triple {5492#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5493#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:00:59,056 INFO L290 TraceCheckUtils]: 12: Hoare triple {5493#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5494#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:00:59,056 INFO L290 TraceCheckUtils]: 13: Hoare triple {5494#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5495#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:00:59,057 INFO L290 TraceCheckUtils]: 14: Hoare triple {5495#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5496#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:00:59,057 INFO L290 TraceCheckUtils]: 15: Hoare triple {5496#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5497#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:00:59,058 INFO L290 TraceCheckUtils]: 16: Hoare triple {5497#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5498#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:00:59,058 INFO L290 TraceCheckUtils]: 17: Hoare triple {5498#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5499#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:00:59,059 INFO L290 TraceCheckUtils]: 18: Hoare triple {5499#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5500#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:00:59,059 INFO L290 TraceCheckUtils]: 19: Hoare triple {5500#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5501#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:00:59,060 INFO L290 TraceCheckUtils]: 20: Hoare triple {5501#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5502#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:00:59,060 INFO L290 TraceCheckUtils]: 21: Hoare triple {5502#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5503#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:00:59,061 INFO L290 TraceCheckUtils]: 22: Hoare triple {5503#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5504#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:00:59,061 INFO L290 TraceCheckUtils]: 23: Hoare triple {5504#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5579#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:00:59,066 INFO L290 TraceCheckUtils]: 24: Hoare triple {5579#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {5483#false} is VALID [2022-04-28 03:00:59,066 INFO L272 TraceCheckUtils]: 25: Hoare triple {5483#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {5483#false} is VALID [2022-04-28 03:00:59,066 INFO L290 TraceCheckUtils]: 26: Hoare triple {5483#false} ~cond := #in~cond; {5483#false} is VALID [2022-04-28 03:00:59,066 INFO L290 TraceCheckUtils]: 27: Hoare triple {5483#false} assume 0 == ~cond; {5483#false} is VALID [2022-04-28 03:00:59,066 INFO L290 TraceCheckUtils]: 28: Hoare triple {5483#false} assume !false; {5483#false} is VALID [2022-04-28 03:00:59,066 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:00:59,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:01:01,803 INFO L290 TraceCheckUtils]: 28: Hoare triple {5483#false} assume !false; {5483#false} is VALID [2022-04-28 03:01:01,804 INFO L290 TraceCheckUtils]: 27: Hoare triple {5598#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {5483#false} is VALID [2022-04-28 03:01:01,804 INFO L290 TraceCheckUtils]: 26: Hoare triple {5602#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {5598#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:01:01,804 INFO L272 TraceCheckUtils]: 25: Hoare triple {5606#(not (= (mod main_~x~0 2) 0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {5602#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:01:01,805 INFO L290 TraceCheckUtils]: 24: Hoare triple {5610#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !(~x~0 % 4294967296 < 268435455); {5606#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 03:01:01,805 INFO L290 TraceCheckUtils]: 23: Hoare triple {5614#(or (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5610#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:01:01,806 INFO L290 TraceCheckUtils]: 22: Hoare triple {5618#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5614#(or (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:01:01,807 INFO L290 TraceCheckUtils]: 21: Hoare triple {5622#(or (<= 268435455 (mod (+ main_~x~0 4) 4294967296)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5618#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:01:01,808 INFO L290 TraceCheckUtils]: 20: Hoare triple {5626#(or (<= 268435455 (mod (+ main_~x~0 6) 4294967296)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5622#(or (<= 268435455 (mod (+ main_~x~0 4) 4294967296)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} is VALID [2022-04-28 03:01:01,809 INFO L290 TraceCheckUtils]: 19: Hoare triple {5630#(or (<= 268435455 (mod (+ main_~x~0 8) 4294967296)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5626#(or (<= 268435455 (mod (+ main_~x~0 6) 4294967296)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} is VALID [2022-04-28 03:01:01,810 INFO L290 TraceCheckUtils]: 18: Hoare triple {5634#(or (<= 268435455 (mod (+ main_~x~0 10) 4294967296)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5630#(or (<= 268435455 (mod (+ main_~x~0 8) 4294967296)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} is VALID [2022-04-28 03:01:01,811 INFO L290 TraceCheckUtils]: 17: Hoare triple {5638#(or (<= 268435455 (mod (+ main_~x~0 12) 4294967296)) (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5634#(or (<= 268435455 (mod (+ main_~x~0 10) 4294967296)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} is VALID [2022-04-28 03:01:01,812 INFO L290 TraceCheckUtils]: 16: Hoare triple {5642#(or (<= 268435455 (mod (+ main_~x~0 14) 4294967296)) (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5638#(or (<= 268435455 (mod (+ main_~x~0 12) 4294967296)) (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:01:01,813 INFO L290 TraceCheckUtils]: 15: Hoare triple {5646#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)) (<= 268435455 (mod (+ main_~x~0 16) 4294967296)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5642#(or (<= 268435455 (mod (+ main_~x~0 14) 4294967296)) (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:01:01,814 INFO L290 TraceCheckUtils]: 14: Hoare triple {5650#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 18) 4294967296)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5646#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)) (<= 268435455 (mod (+ main_~x~0 16) 4294967296)))} is VALID [2022-04-28 03:01:01,815 INFO L290 TraceCheckUtils]: 13: Hoare triple {5654#(or (not (= (mod main_~x~0 2) 0)) (<= 268435455 (mod (+ main_~x~0 20) 4294967296)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5650#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 18) 4294967296)))} is VALID [2022-04-28 03:01:01,816 INFO L290 TraceCheckUtils]: 12: Hoare triple {5658#(or (<= 268435455 (mod (+ main_~x~0 22) 4294967296)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5654#(or (not (= (mod main_~x~0 2) 0)) (<= 268435455 (mod (+ main_~x~0 20) 4294967296)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} is VALID [2022-04-28 03:01:01,871 INFO L290 TraceCheckUtils]: 11: Hoare triple {5662#(or (not (= (mod main_~x~0 2) 0)) (<= 268435455 (mod (+ main_~x~0 24) 4294967296)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5658#(or (<= 268435455 (mod (+ main_~x~0 22) 4294967296)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} is VALID [2022-04-28 03:01:01,872 INFO L290 TraceCheckUtils]: 10: Hoare triple {5666#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)) (<= 268435455 (mod (+ main_~x~0 26) 4294967296)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5662#(or (not (= (mod main_~x~0 2) 0)) (<= 268435455 (mod (+ main_~x~0 24) 4294967296)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} is VALID [2022-04-28 03:01:01,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {5670#(or (<= 268435455 (mod (+ main_~x~0 28) 4294967296)) (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5666#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)) (<= 268435455 (mod (+ main_~x~0 26) 4294967296)))} is VALID [2022-04-28 03:01:01,874 INFO L290 TraceCheckUtils]: 8: Hoare triple {5674#(or (<= 268435455 (mod (+ 30 main_~x~0) 4294967296)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5670#(or (<= 268435455 (mod (+ main_~x~0 28) 4294967296)) (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:01:01,875 INFO L290 TraceCheckUtils]: 7: Hoare triple {5678#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (<= 268435455 (mod (+ 32 main_~x~0) 4294967296)) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5674#(or (<= 268435455 (mod (+ 30 main_~x~0) 4294967296)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:01:01,876 INFO L290 TraceCheckUtils]: 6: Hoare triple {5682#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 36) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 34) 4294967296)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5678#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (<= 268435455 (mod (+ 32 main_~x~0) 4294967296)) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:01:01,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {5482#true} ~x~0 := 0; {5682#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 36) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 34) 4294967296)))} is VALID [2022-04-28 03:01:01,876 INFO L272 TraceCheckUtils]: 4: Hoare triple {5482#true} call #t~ret4 := main(); {5482#true} is VALID [2022-04-28 03:01:01,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5482#true} {5482#true} #34#return; {5482#true} is VALID [2022-04-28 03:01:01,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {5482#true} assume true; {5482#true} is VALID [2022-04-28 03:01:01,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {5482#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5482#true} is VALID [2022-04-28 03:01:01,876 INFO L272 TraceCheckUtils]: 0: Hoare triple {5482#true} call ULTIMATE.init(); {5482#true} is VALID [2022-04-28 03:01:01,877 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:01:01,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222971515] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:01:01,877 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:01:01,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 24] total 45 [2022-04-28 03:01:01,877 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:01:01,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1894792929] [2022-04-28 03:01:01,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1894792929] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:01:01,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:01:01,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 03:01:01,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551723196] [2022-04-28 03:01:01,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:01:01,878 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:01:01,878 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:01:01,878 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:01:01,894 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:01:01,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 03:01:01,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:01,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 03:01:01,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=1475, Unknown=0, NotChecked=0, Total=1980 [2022-04-28 03:01:01,896 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:01:02,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:02,720 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-28 03:01:02,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 03:01:02,721 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:01:02,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:01:02,721 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:01:02,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 36 transitions. [2022-04-28 03:01:02,721 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:01:02,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 36 transitions. [2022-04-28 03:01:02,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 36 transitions. [2022-04-28 03:01:02,750 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:01:02,751 INFO L225 Difference]: With dead ends: 36 [2022-04-28 03:01:02,751 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 03:01:02,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=978, Invalid=3054, Unknown=0, NotChecked=0, Total=4032 [2022-04-28 03:01:02,752 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:01:02,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 43 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:01:02,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 03:01:02,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-28 03:01:02,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:01:02,781 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:01:02,781 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:01:02,781 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:01:02,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:02,782 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-28 03:01:02,782 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 03:01:02,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:02,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:02,782 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:01:02,782 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:01:02,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:02,783 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-28 03:01:02,783 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 03:01:02,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:02,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:02,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:01:02,783 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:01:02,783 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:01:02,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-28 03:01:02,784 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2022-04-28 03:01:02,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:01:02,784 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-28 03:01:02,784 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:01:02,784 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 31 transitions. [2022-04-28 03:01:02,806 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:01:02,807 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-28 03:01:02,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 03:01:02,807 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:01:02,807 INFO L195 NwaCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:01:02,812 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:01:03,011 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-04-28 03:01:03,208 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:01:03,208 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:01:03,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:01:03,208 INFO L85 PathProgramCache]: Analyzing trace with hash 6751542, now seen corresponding path program 37 times [2022-04-28 03:01:03,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:03,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1013416415] [2022-04-28 03:01:03,361 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:03,362 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:01:03,364 INFO L85 PathProgramCache]: Analyzing trace with hash -803411593, now seen corresponding path program 1 times [2022-04-28 03:01:03,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:03,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942208291] [2022-04-28 03:01:03,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:03,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:03,368 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_19.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_19.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:01:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:01:03,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [776711765] [2022-04-28 03:01:03,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:03,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:03,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:01:03,374 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:01:03,391 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:01:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:01:03,423 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:01:03,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:01:03,452 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:01:03,453 INFO L85 PathProgramCache]: Analyzing trace with hash 6751542, now seen corresponding path program 38 times [2022-04-28 03:01:03,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:03,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181898027] [2022-04-28 03:01:03,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:03,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:03,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:03,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:01:03,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:03,745 INFO L290 TraceCheckUtils]: 0: Hoare triple {5962#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5937#true} is VALID [2022-04-28 03:01:03,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {5937#true} assume true; {5937#true} is VALID [2022-04-28 03:01:03,745 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5937#true} {5937#true} #34#return; {5937#true} is VALID [2022-04-28 03:01:03,745 INFO L272 TraceCheckUtils]: 0: Hoare triple {5937#true} call ULTIMATE.init(); {5962#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:01:03,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {5962#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5937#true} is VALID [2022-04-28 03:01:03,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {5937#true} assume true; {5937#true} is VALID [2022-04-28 03:01:03,746 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5937#true} {5937#true} #34#return; {5937#true} is VALID [2022-04-28 03:01:03,746 INFO L272 TraceCheckUtils]: 4: Hoare triple {5937#true} call #t~ret4 := main(); {5937#true} is VALID [2022-04-28 03:01:03,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {5937#true} ~x~0 := 0; {5942#(= main_~x~0 0)} is VALID [2022-04-28 03:01:03,746 INFO L290 TraceCheckUtils]: 6: Hoare triple {5942#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5943#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:01:03,747 INFO L290 TraceCheckUtils]: 7: Hoare triple {5943#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5944#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:01:03,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {5944#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5945#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:01:03,748 INFO L290 TraceCheckUtils]: 9: Hoare triple {5945#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5946#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:01:03,748 INFO L290 TraceCheckUtils]: 10: Hoare triple {5946#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5947#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:01:03,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {5947#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5948#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:01:03,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {5948#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5949#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:01:03,750 INFO L290 TraceCheckUtils]: 13: Hoare triple {5949#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5950#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:01:03,750 INFO L290 TraceCheckUtils]: 14: Hoare triple {5950#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5951#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:01:03,751 INFO L290 TraceCheckUtils]: 15: Hoare triple {5951#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5952#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:01:03,751 INFO L290 TraceCheckUtils]: 16: Hoare triple {5952#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5953#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:01:03,752 INFO L290 TraceCheckUtils]: 17: Hoare triple {5953#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5954#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:01:03,752 INFO L290 TraceCheckUtils]: 18: Hoare triple {5954#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5955#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:01:03,753 INFO L290 TraceCheckUtils]: 19: Hoare triple {5955#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5956#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:01:03,753 INFO L290 TraceCheckUtils]: 20: Hoare triple {5956#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5957#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:01:03,753 INFO L290 TraceCheckUtils]: 21: Hoare triple {5957#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5958#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:01:03,754 INFO L290 TraceCheckUtils]: 22: Hoare triple {5958#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5959#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:01:03,754 INFO L290 TraceCheckUtils]: 23: Hoare triple {5959#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5960#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:01:03,755 INFO L290 TraceCheckUtils]: 24: Hoare triple {5960#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5961#(and (<= main_~x~0 38) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:01:03,755 INFO L290 TraceCheckUtils]: 25: Hoare triple {5961#(and (<= main_~x~0 38) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {5938#false} is VALID [2022-04-28 03:01:03,755 INFO L272 TraceCheckUtils]: 26: Hoare triple {5938#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {5938#false} is VALID [2022-04-28 03:01:03,756 INFO L290 TraceCheckUtils]: 27: Hoare triple {5938#false} ~cond := #in~cond; {5938#false} is VALID [2022-04-28 03:01:03,756 INFO L290 TraceCheckUtils]: 28: Hoare triple {5938#false} assume 0 == ~cond; {5938#false} is VALID [2022-04-28 03:01:03,756 INFO L290 TraceCheckUtils]: 29: Hoare triple {5938#false} assume !false; {5938#false} is VALID [2022-04-28 03:01:03,756 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:01:03,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:01:03,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181898027] [2022-04-28 03:01:03,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181898027] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:01:03,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [411512825] [2022-04-28 03:01:03,756 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:01:03,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:03,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:01:03,757 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:01:03,758 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:01:03,798 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:01:03,798 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:01:03,799 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 03:01:03,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:03,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:01:04,097 INFO L272 TraceCheckUtils]: 0: Hoare triple {5937#true} call ULTIMATE.init(); {5937#true} is VALID [2022-04-28 03:01:04,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {5937#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5937#true} is VALID [2022-04-28 03:01:04,098 INFO L290 TraceCheckUtils]: 2: Hoare triple {5937#true} assume true; {5937#true} is VALID [2022-04-28 03:01:04,098 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5937#true} {5937#true} #34#return; {5937#true} is VALID [2022-04-28 03:01:04,098 INFO L272 TraceCheckUtils]: 4: Hoare triple {5937#true} call #t~ret4 := main(); {5937#true} is VALID [2022-04-28 03:01:04,098 INFO L290 TraceCheckUtils]: 5: Hoare triple {5937#true} ~x~0 := 0; {5942#(= main_~x~0 0)} is VALID [2022-04-28 03:01:04,099 INFO L290 TraceCheckUtils]: 6: Hoare triple {5942#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5943#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:01:04,099 INFO L290 TraceCheckUtils]: 7: Hoare triple {5943#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5944#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:01:04,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {5944#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5945#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:01:04,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {5945#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5946#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:01:04,101 INFO L290 TraceCheckUtils]: 10: Hoare triple {5946#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5947#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:01:04,101 INFO L290 TraceCheckUtils]: 11: Hoare triple {5947#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5948#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:01:04,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {5948#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5949#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:01:04,102 INFO L290 TraceCheckUtils]: 13: Hoare triple {5949#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5950#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:01:04,102 INFO L290 TraceCheckUtils]: 14: Hoare triple {5950#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5951#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:01:04,103 INFO L290 TraceCheckUtils]: 15: Hoare triple {5951#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5952#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:01:04,103 INFO L290 TraceCheckUtils]: 16: Hoare triple {5952#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5953#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:01:04,104 INFO L290 TraceCheckUtils]: 17: Hoare triple {5953#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5954#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:01:04,104 INFO L290 TraceCheckUtils]: 18: Hoare triple {5954#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5955#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:01:04,105 INFO L290 TraceCheckUtils]: 19: Hoare triple {5955#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5956#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:01:04,105 INFO L290 TraceCheckUtils]: 20: Hoare triple {5956#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5957#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:01:04,106 INFO L290 TraceCheckUtils]: 21: Hoare triple {5957#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5958#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:01:04,106 INFO L290 TraceCheckUtils]: 22: Hoare triple {5958#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5959#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:01:04,107 INFO L290 TraceCheckUtils]: 23: Hoare triple {5959#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {5960#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:01:04,107 INFO L290 TraceCheckUtils]: 24: Hoare triple {5960#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6038#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:01:04,108 INFO L290 TraceCheckUtils]: 25: Hoare triple {6038#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {5938#false} is VALID [2022-04-28 03:01:04,108 INFO L272 TraceCheckUtils]: 26: Hoare triple {5938#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {5938#false} is VALID [2022-04-28 03:01:04,108 INFO L290 TraceCheckUtils]: 27: Hoare triple {5938#false} ~cond := #in~cond; {5938#false} is VALID [2022-04-28 03:01:04,108 INFO L290 TraceCheckUtils]: 28: Hoare triple {5938#false} assume 0 == ~cond; {5938#false} is VALID [2022-04-28 03:01:04,108 INFO L290 TraceCheckUtils]: 29: Hoare triple {5938#false} assume !false; {5938#false} is VALID [2022-04-28 03:01:04,108 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:01:04,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:01:04,776 INFO L290 TraceCheckUtils]: 29: Hoare triple {5938#false} assume !false; {5938#false} is VALID [2022-04-28 03:01:04,776 INFO L290 TraceCheckUtils]: 28: Hoare triple {5938#false} assume 0 == ~cond; {5938#false} is VALID [2022-04-28 03:01:04,776 INFO L290 TraceCheckUtils]: 27: Hoare triple {5938#false} ~cond := #in~cond; {5938#false} is VALID [2022-04-28 03:01:04,776 INFO L272 TraceCheckUtils]: 26: Hoare triple {5938#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {5938#false} is VALID [2022-04-28 03:01:04,776 INFO L290 TraceCheckUtils]: 25: Hoare triple {6066#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {5938#false} is VALID [2022-04-28 03:01:04,777 INFO L290 TraceCheckUtils]: 24: Hoare triple {6070#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6066#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:01:04,778 INFO L290 TraceCheckUtils]: 23: Hoare triple {6074#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6070#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 03:01:04,778 INFO L290 TraceCheckUtils]: 22: Hoare triple {6078#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6074#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 03:01:04,779 INFO L290 TraceCheckUtils]: 21: Hoare triple {6082#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6078#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 03:01:04,779 INFO L290 TraceCheckUtils]: 20: Hoare triple {6086#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6082#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 03:01:04,780 INFO L290 TraceCheckUtils]: 19: Hoare triple {6090#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6086#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-28 03:01:04,780 INFO L290 TraceCheckUtils]: 18: Hoare triple {6094#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6090#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-28 03:01:04,781 INFO L290 TraceCheckUtils]: 17: Hoare triple {6098#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6094#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-28 03:01:04,782 INFO L290 TraceCheckUtils]: 16: Hoare triple {6102#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6098#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-28 03:01:04,782 INFO L290 TraceCheckUtils]: 15: Hoare triple {6106#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6102#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-28 03:01:04,783 INFO L290 TraceCheckUtils]: 14: Hoare triple {6110#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6106#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-28 03:01:04,784 INFO L290 TraceCheckUtils]: 13: Hoare triple {6114#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6110#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-28 03:01:04,784 INFO L290 TraceCheckUtils]: 12: Hoare triple {6118#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6114#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-28 03:01:04,785 INFO L290 TraceCheckUtils]: 11: Hoare triple {6122#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6118#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-28 03:01:04,785 INFO L290 TraceCheckUtils]: 10: Hoare triple {6126#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6122#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-28 03:01:04,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {6130#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6126#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:01:04,786 INFO L290 TraceCheckUtils]: 8: Hoare triple {6134#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6130#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:01:04,787 INFO L290 TraceCheckUtils]: 7: Hoare triple {6138#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6134#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-28 03:01:04,788 INFO L290 TraceCheckUtils]: 6: Hoare triple {6142#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6138#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-28 03:01:04,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {5937#true} ~x~0 := 0; {6142#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-28 03:01:04,788 INFO L272 TraceCheckUtils]: 4: Hoare triple {5937#true} call #t~ret4 := main(); {5937#true} is VALID [2022-04-28 03:01:04,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5937#true} {5937#true} #34#return; {5937#true} is VALID [2022-04-28 03:01:04,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {5937#true} assume true; {5937#true} is VALID [2022-04-28 03:01:04,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {5937#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {5937#true} is VALID [2022-04-28 03:01:04,788 INFO L272 TraceCheckUtils]: 0: Hoare triple {5937#true} call ULTIMATE.init(); {5937#true} is VALID [2022-04-28 03:01:04,789 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:01:04,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [411512825] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:01:04,789 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:01:04,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-28 03:01:04,789 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:01:04,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1013416415] [2022-04-28 03:01:04,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1013416415] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:01:04,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:01:04,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 03:01:04,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805339480] [2022-04-28 03:01:04,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:01:04,790 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:01:04,790 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:01:04,790 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:01:04,807 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:01:04,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 03:01:04,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:04,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 03:01:04,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=525, Invalid=1367, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 03:01:04,808 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:01:05,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:05,738 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-28 03:01:05,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 03:01:05,739 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:01:05,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:01:05,739 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:01:05,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 37 transitions. [2022-04-28 03:01:05,739 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:01:05,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 37 transitions. [2022-04-28 03:01:05,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 37 transitions. [2022-04-28 03:01:05,774 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:01:05,775 INFO L225 Difference]: With dead ends: 37 [2022-04-28 03:01:05,775 INFO L226 Difference]: Without dead ends: 32 [2022-04-28 03:01:05,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1043, Invalid=2989, Unknown=0, NotChecked=0, Total=4032 [2022-04-28 03:01:05,776 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:01:05,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 88 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:01:05,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-28 03:01:05,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-28 03:01:05,806 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:01:05,806 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:01:05,806 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:01:05,806 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:01:05,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:05,807 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-28 03:01:05,807 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-28 03:01:05,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:05,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:05,807 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:01:05,807 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:01:05,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:05,808 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-04-28 03:01:05,808 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-28 03:01:05,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:05,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:05,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:01:05,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:01:05,808 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:01:05,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2022-04-28 03:01:05,809 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2022-04-28 03:01:05,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:01:05,809 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2022-04-28 03:01:05,809 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:01:05,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 32 transitions. [2022-04-28 03:01:05,832 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:05,832 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-04-28 03:01:05,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 03:01:05,832 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:01:05,833 INFO L195 NwaCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:01:05,848 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:01:06,036 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:01:06,233 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:01:06,233 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:01:06,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:01:06,234 INFO L85 PathProgramCache]: Analyzing trace with hash 245759068, now seen corresponding path program 39 times [2022-04-28 03:01:06,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:06,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [734530540] [2022-04-28 03:01:06,459 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:06,461 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:01:06,463 INFO L85 PathProgramCache]: Analyzing trace with hash -744306249, now seen corresponding path program 1 times [2022-04-28 03:01:06,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:06,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584185735] [2022-04-28 03:01:06,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:06,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:06,467 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_20.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_20.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:01:06,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:01:06,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [832004173] [2022-04-28 03:01:06,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:06,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:06,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:01:06,472 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:01:06,496 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:01:06,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:01:06,531 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:01:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:01:06,539 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:01:06,539 INFO L85 PathProgramCache]: Analyzing trace with hash 245759068, now seen corresponding path program 40 times [2022-04-28 03:01:06,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:06,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516815985] [2022-04-28 03:01:06,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:06,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:06,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:06,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:01:06,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:06,893 INFO L290 TraceCheckUtils]: 0: Hoare triple {6431#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {6405#true} is VALID [2022-04-28 03:01:06,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {6405#true} assume true; {6405#true} is VALID [2022-04-28 03:01:06,894 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6405#true} {6405#true} #34#return; {6405#true} is VALID [2022-04-28 03:01:06,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {6405#true} call ULTIMATE.init(); {6431#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:01:06,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {6431#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {6405#true} is VALID [2022-04-28 03:01:06,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {6405#true} assume true; {6405#true} is VALID [2022-04-28 03:01:06,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6405#true} {6405#true} #34#return; {6405#true} is VALID [2022-04-28 03:01:06,895 INFO L272 TraceCheckUtils]: 4: Hoare triple {6405#true} call #t~ret4 := main(); {6405#true} is VALID [2022-04-28 03:01:06,895 INFO L290 TraceCheckUtils]: 5: Hoare triple {6405#true} ~x~0 := 0; {6410#(= main_~x~0 0)} is VALID [2022-04-28 03:01:06,895 INFO L290 TraceCheckUtils]: 6: Hoare triple {6410#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6411#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:01:06,896 INFO L290 TraceCheckUtils]: 7: Hoare triple {6411#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6412#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:01:06,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {6412#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6413#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:01:06,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {6413#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6414#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:01:06,897 INFO L290 TraceCheckUtils]: 10: Hoare triple {6414#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6415#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:01:06,898 INFO L290 TraceCheckUtils]: 11: Hoare triple {6415#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6416#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:01:06,898 INFO L290 TraceCheckUtils]: 12: Hoare triple {6416#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6417#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:01:06,899 INFO L290 TraceCheckUtils]: 13: Hoare triple {6417#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6418#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:01:06,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {6418#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6419#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:01:06,900 INFO L290 TraceCheckUtils]: 15: Hoare triple {6419#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6420#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:01:06,900 INFO L290 TraceCheckUtils]: 16: Hoare triple {6420#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6421#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:01:06,901 INFO L290 TraceCheckUtils]: 17: Hoare triple {6421#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6422#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:01:06,901 INFO L290 TraceCheckUtils]: 18: Hoare triple {6422#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6423#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:01:06,902 INFO L290 TraceCheckUtils]: 19: Hoare triple {6423#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6424#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:01:06,902 INFO L290 TraceCheckUtils]: 20: Hoare triple {6424#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6425#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:01:06,903 INFO L290 TraceCheckUtils]: 21: Hoare triple {6425#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6426#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:01:06,903 INFO L290 TraceCheckUtils]: 22: Hoare triple {6426#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6427#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:01:06,904 INFO L290 TraceCheckUtils]: 23: Hoare triple {6427#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6428#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:01:06,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {6428#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6429#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:01:06,905 INFO L290 TraceCheckUtils]: 25: Hoare triple {6429#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6430#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 40))} is VALID [2022-04-28 03:01:06,905 INFO L290 TraceCheckUtils]: 26: Hoare triple {6430#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 40))} assume !(~x~0 % 4294967296 < 268435455); {6406#false} is VALID [2022-04-28 03:01:06,906 INFO L272 TraceCheckUtils]: 27: Hoare triple {6406#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {6406#false} is VALID [2022-04-28 03:01:06,906 INFO L290 TraceCheckUtils]: 28: Hoare triple {6406#false} ~cond := #in~cond; {6406#false} is VALID [2022-04-28 03:01:06,906 INFO L290 TraceCheckUtils]: 29: Hoare triple {6406#false} assume 0 == ~cond; {6406#false} is VALID [2022-04-28 03:01:06,906 INFO L290 TraceCheckUtils]: 30: Hoare triple {6406#false} assume !false; {6406#false} is VALID [2022-04-28 03:01:06,906 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:01:06,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:01:06,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516815985] [2022-04-28 03:01:06,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516815985] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:01:06,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763408240] [2022-04-28 03:01:06,907 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:01:06,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:06,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:01:06,908 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:01:06,927 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:01:06,961 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:01:06,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:01:06,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-28 03:01:06,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:06,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:01:07,343 INFO L272 TraceCheckUtils]: 0: Hoare triple {6405#true} call ULTIMATE.init(); {6405#true} is VALID [2022-04-28 03:01:07,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {6405#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {6405#true} is VALID [2022-04-28 03:01:07,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {6405#true} assume true; {6405#true} is VALID [2022-04-28 03:01:07,344 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6405#true} {6405#true} #34#return; {6405#true} is VALID [2022-04-28 03:01:07,344 INFO L272 TraceCheckUtils]: 4: Hoare triple {6405#true} call #t~ret4 := main(); {6405#true} is VALID [2022-04-28 03:01:07,344 INFO L290 TraceCheckUtils]: 5: Hoare triple {6405#true} ~x~0 := 0; {6410#(= main_~x~0 0)} is VALID [2022-04-28 03:01:07,345 INFO L290 TraceCheckUtils]: 6: Hoare triple {6410#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6411#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:01:07,345 INFO L290 TraceCheckUtils]: 7: Hoare triple {6411#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6412#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:01:07,346 INFO L290 TraceCheckUtils]: 8: Hoare triple {6412#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6413#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:01:07,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {6413#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6414#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:01:07,346 INFO L290 TraceCheckUtils]: 10: Hoare triple {6414#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6415#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:01:07,347 INFO L290 TraceCheckUtils]: 11: Hoare triple {6415#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6416#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:01:07,347 INFO L290 TraceCheckUtils]: 12: Hoare triple {6416#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6417#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:01:07,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {6417#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6418#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:01:07,348 INFO L290 TraceCheckUtils]: 14: Hoare triple {6418#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6419#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:01:07,349 INFO L290 TraceCheckUtils]: 15: Hoare triple {6419#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6420#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:01:07,349 INFO L290 TraceCheckUtils]: 16: Hoare triple {6420#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6421#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:01:07,350 INFO L290 TraceCheckUtils]: 17: Hoare triple {6421#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6422#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:01:07,350 INFO L290 TraceCheckUtils]: 18: Hoare triple {6422#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6423#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:01:07,351 INFO L290 TraceCheckUtils]: 19: Hoare triple {6423#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6424#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:01:07,351 INFO L290 TraceCheckUtils]: 20: Hoare triple {6424#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6425#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:01:07,352 INFO L290 TraceCheckUtils]: 21: Hoare triple {6425#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6426#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:01:07,366 INFO L290 TraceCheckUtils]: 22: Hoare triple {6426#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6427#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:01:07,367 INFO L290 TraceCheckUtils]: 23: Hoare triple {6427#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6428#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:01:07,367 INFO L290 TraceCheckUtils]: 24: Hoare triple {6428#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6429#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:01:07,368 INFO L290 TraceCheckUtils]: 25: Hoare triple {6429#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6510#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:01:07,368 INFO L290 TraceCheckUtils]: 26: Hoare triple {6510#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {6406#false} is VALID [2022-04-28 03:01:07,368 INFO L272 TraceCheckUtils]: 27: Hoare triple {6406#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {6406#false} is VALID [2022-04-28 03:01:07,368 INFO L290 TraceCheckUtils]: 28: Hoare triple {6406#false} ~cond := #in~cond; {6406#false} is VALID [2022-04-28 03:01:07,368 INFO L290 TraceCheckUtils]: 29: Hoare triple {6406#false} assume 0 == ~cond; {6406#false} is VALID [2022-04-28 03:01:07,368 INFO L290 TraceCheckUtils]: 30: Hoare triple {6406#false} assume !false; {6406#false} is VALID [2022-04-28 03:01:07,369 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:01:07,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:01:08,080 INFO L290 TraceCheckUtils]: 30: Hoare triple {6406#false} assume !false; {6406#false} is VALID [2022-04-28 03:01:08,081 INFO L290 TraceCheckUtils]: 29: Hoare triple {6406#false} assume 0 == ~cond; {6406#false} is VALID [2022-04-28 03:01:08,081 INFO L290 TraceCheckUtils]: 28: Hoare triple {6406#false} ~cond := #in~cond; {6406#false} is VALID [2022-04-28 03:01:08,081 INFO L272 TraceCheckUtils]: 27: Hoare triple {6406#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {6406#false} is VALID [2022-04-28 03:01:08,081 INFO L290 TraceCheckUtils]: 26: Hoare triple {6538#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {6406#false} is VALID [2022-04-28 03:01:08,082 INFO L290 TraceCheckUtils]: 25: Hoare triple {6542#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6538#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:01:08,083 INFO L290 TraceCheckUtils]: 24: Hoare triple {6546#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6542#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 03:01:08,083 INFO L290 TraceCheckUtils]: 23: Hoare triple {6550#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6546#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 03:01:08,084 INFO L290 TraceCheckUtils]: 22: Hoare triple {6554#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6550#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 03:01:08,084 INFO L290 TraceCheckUtils]: 21: Hoare triple {6558#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6554#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 03:01:08,085 INFO L290 TraceCheckUtils]: 20: Hoare triple {6562#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6558#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-28 03:01:08,085 INFO L290 TraceCheckUtils]: 19: Hoare triple {6566#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6562#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-28 03:01:08,086 INFO L290 TraceCheckUtils]: 18: Hoare triple {6570#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6566#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-28 03:01:08,087 INFO L290 TraceCheckUtils]: 17: Hoare triple {6574#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6570#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-28 03:01:08,087 INFO L290 TraceCheckUtils]: 16: Hoare triple {6578#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6574#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-28 03:01:08,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {6582#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6578#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-28 03:01:08,088 INFO L290 TraceCheckUtils]: 14: Hoare triple {6586#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6582#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-28 03:01:08,089 INFO L290 TraceCheckUtils]: 13: Hoare triple {6590#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6586#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-28 03:01:08,089 INFO L290 TraceCheckUtils]: 12: Hoare triple {6594#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6590#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-28 03:01:08,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {6598#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6594#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-28 03:01:08,090 INFO L290 TraceCheckUtils]: 10: Hoare triple {6602#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6598#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:01:08,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {6606#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6602#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:01:08,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {6610#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6606#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-28 03:01:08,092 INFO L290 TraceCheckUtils]: 7: Hoare triple {6614#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6610#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-28 03:01:08,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {6618#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6614#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-28 03:01:08,093 INFO L290 TraceCheckUtils]: 5: Hoare triple {6405#true} ~x~0 := 0; {6618#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:01:08,093 INFO L272 TraceCheckUtils]: 4: Hoare triple {6405#true} call #t~ret4 := main(); {6405#true} is VALID [2022-04-28 03:01:08,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6405#true} {6405#true} #34#return; {6405#true} is VALID [2022-04-28 03:01:08,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {6405#true} assume true; {6405#true} is VALID [2022-04-28 03:01:08,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {6405#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {6405#true} is VALID [2022-04-28 03:01:08,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {6405#true} call ULTIMATE.init(); {6405#true} is VALID [2022-04-28 03:01:08,094 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:01:08,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763408240] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:01:08,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:01:08,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-28 03:01:08,094 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:01:08,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [734530540] [2022-04-28 03:01:08,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [734530540] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:01:08,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:01:08,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 03:01:08,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643320697] [2022-04-28 03:01:08,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:01:08,095 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:01:08,095 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:01:08,095 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:01:08,111 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:01:08,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 03:01:08,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:08,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 03:01:08,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=572, Invalid=1498, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 03:01:08,112 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:01:09,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:09,073 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-28 03:01:09,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 03:01:09,073 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:01:09,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:01:09,074 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:01:09,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 38 transitions. [2022-04-28 03:01:09,075 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:01:09,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 38 transitions. [2022-04-28 03:01:09,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 38 transitions. [2022-04-28 03:01:09,104 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:01:09,105 INFO L225 Difference]: With dead ends: 38 [2022-04-28 03:01:09,105 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 03:01:09,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1137, Invalid=3285, Unknown=0, NotChecked=0, Total=4422 [2022-04-28 03:01:09,106 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:01:09,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 63 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:01:09,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 03:01:09,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-28 03:01:09,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:01:09,135 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:01:09,136 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:01:09,136 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:01:09,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:09,136 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-28 03:01:09,136 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-28 03:01:09,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:09,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:09,137 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:01:09,137 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:01:09,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:09,137 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-28 03:01:09,137 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-28 03:01:09,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:09,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:09,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:01:09,137 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:01:09,138 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:01:09,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2022-04-28 03:01:09,138 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2022-04-28 03:01:09,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:01:09,138 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2022-04-28 03:01:09,138 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:01:09,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 33 transitions. [2022-04-28 03:01:09,167 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:01:09,167 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-28 03:01:09,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 03:01:09,167 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:01:09,167 INFO L195 NwaCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:01:09,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2022-04-28 03:01:09,378 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:01:09,575 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:01:09,575 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:01:09,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:01:09,575 INFO L85 PathProgramCache]: Analyzing trace with hash -934942218, now seen corresponding path program 41 times [2022-04-28 03:01:09,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:09,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [859888774] [2022-04-28 03:01:11,641 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:01:11,776 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:11,778 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:01:11,780 INFO L85 PathProgramCache]: Analyzing trace with hash -685200905, now seen corresponding path program 1 times [2022-04-28 03:01:11,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:11,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941804255] [2022-04-28 03:01:11,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:11,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:11,785 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_21.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_21.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:01:11,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:01:11,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1864842338] [2022-04-28 03:01:11,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:11,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:11,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:01:11,789 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:01:11,790 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:01:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:01:11,839 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:01:11,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:01:11,848 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:01:11,848 INFO L85 PathProgramCache]: Analyzing trace with hash -934942218, now seen corresponding path program 42 times [2022-04-28 03:01:11,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:11,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200894881] [2022-04-28 03:01:11,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:11,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:12,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:01:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:12,215 INFO L290 TraceCheckUtils]: 0: Hoare triple {6916#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {6889#true} is VALID [2022-04-28 03:01:12,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {6889#true} assume true; {6889#true} is VALID [2022-04-28 03:01:12,216 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6889#true} {6889#true} #34#return; {6889#true} is VALID [2022-04-28 03:01:12,216 INFO L272 TraceCheckUtils]: 0: Hoare triple {6889#true} call ULTIMATE.init(); {6916#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:01:12,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {6916#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {6889#true} is VALID [2022-04-28 03:01:12,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {6889#true} assume true; {6889#true} is VALID [2022-04-28 03:01:12,216 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6889#true} {6889#true} #34#return; {6889#true} is VALID [2022-04-28 03:01:12,216 INFO L272 TraceCheckUtils]: 4: Hoare triple {6889#true} call #t~ret4 := main(); {6889#true} is VALID [2022-04-28 03:01:12,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {6889#true} ~x~0 := 0; {6894#(= main_~x~0 0)} is VALID [2022-04-28 03:01:12,217 INFO L290 TraceCheckUtils]: 6: Hoare triple {6894#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6895#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:01:12,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {6895#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6896#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:01:12,218 INFO L290 TraceCheckUtils]: 8: Hoare triple {6896#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6897#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:01:12,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {6897#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6898#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:01:12,219 INFO L290 TraceCheckUtils]: 10: Hoare triple {6898#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6899#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:01:12,220 INFO L290 TraceCheckUtils]: 11: Hoare triple {6899#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6900#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:01:12,220 INFO L290 TraceCheckUtils]: 12: Hoare triple {6900#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6901#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:01:12,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {6901#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6902#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:01:12,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {6902#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6903#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:01:12,222 INFO L290 TraceCheckUtils]: 15: Hoare triple {6903#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6904#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:01:12,222 INFO L290 TraceCheckUtils]: 16: Hoare triple {6904#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6905#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:01:12,223 INFO L290 TraceCheckUtils]: 17: Hoare triple {6905#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6906#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:01:12,223 INFO L290 TraceCheckUtils]: 18: Hoare triple {6906#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6907#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:01:12,224 INFO L290 TraceCheckUtils]: 19: Hoare triple {6907#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6908#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:01:12,224 INFO L290 TraceCheckUtils]: 20: Hoare triple {6908#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6909#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:01:12,225 INFO L290 TraceCheckUtils]: 21: Hoare triple {6909#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6910#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:01:12,225 INFO L290 TraceCheckUtils]: 22: Hoare triple {6910#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6911#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:01:12,226 INFO L290 TraceCheckUtils]: 23: Hoare triple {6911#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6912#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:01:12,226 INFO L290 TraceCheckUtils]: 24: Hoare triple {6912#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6913#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:01:12,226 INFO L290 TraceCheckUtils]: 25: Hoare triple {6913#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6914#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:01:12,227 INFO L290 TraceCheckUtils]: 26: Hoare triple {6914#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6915#(and (<= main_~x~0 42) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:01:12,227 INFO L290 TraceCheckUtils]: 27: Hoare triple {6915#(and (<= main_~x~0 42) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {6890#false} is VALID [2022-04-28 03:01:12,228 INFO L272 TraceCheckUtils]: 28: Hoare triple {6890#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {6890#false} is VALID [2022-04-28 03:01:12,228 INFO L290 TraceCheckUtils]: 29: Hoare triple {6890#false} ~cond := #in~cond; {6890#false} is VALID [2022-04-28 03:01:12,228 INFO L290 TraceCheckUtils]: 30: Hoare triple {6890#false} assume 0 == ~cond; {6890#false} is VALID [2022-04-28 03:01:12,228 INFO L290 TraceCheckUtils]: 31: Hoare triple {6890#false} assume !false; {6890#false} is VALID [2022-04-28 03:01:12,228 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:01:12,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:01:12,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200894881] [2022-04-28 03:01:12,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200894881] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:01:12,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516750565] [2022-04-28 03:01:12,228 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:01:12,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:12,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:01:12,229 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:01:12,230 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:01:12,376 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2022-04-28 03:01:12,376 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:01:12,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-28 03:01:12,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:12,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:01:12,600 INFO L272 TraceCheckUtils]: 0: Hoare triple {6889#true} call ULTIMATE.init(); {6889#true} is VALID [2022-04-28 03:01:12,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {6889#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {6889#true} is VALID [2022-04-28 03:01:12,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {6889#true} assume true; {6889#true} is VALID [2022-04-28 03:01:12,600 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6889#true} {6889#true} #34#return; {6889#true} is VALID [2022-04-28 03:01:12,600 INFO L272 TraceCheckUtils]: 4: Hoare triple {6889#true} call #t~ret4 := main(); {6889#true} is VALID [2022-04-28 03:01:12,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {6889#true} ~x~0 := 0; {6894#(= main_~x~0 0)} is VALID [2022-04-28 03:01:12,601 INFO L290 TraceCheckUtils]: 6: Hoare triple {6894#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6895#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:01:12,601 INFO L290 TraceCheckUtils]: 7: Hoare triple {6895#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6896#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:01:12,602 INFO L290 TraceCheckUtils]: 8: Hoare triple {6896#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6897#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:01:12,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {6897#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6898#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:01:12,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {6898#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6899#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:01:12,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {6899#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6900#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:01:12,604 INFO L290 TraceCheckUtils]: 12: Hoare triple {6900#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6901#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:01:12,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {6901#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6902#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:01:12,605 INFO L290 TraceCheckUtils]: 14: Hoare triple {6902#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6903#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:01:12,605 INFO L290 TraceCheckUtils]: 15: Hoare triple {6903#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6904#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:01:12,606 INFO L290 TraceCheckUtils]: 16: Hoare triple {6904#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6905#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:01:12,606 INFO L290 TraceCheckUtils]: 17: Hoare triple {6905#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6906#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:01:12,606 INFO L290 TraceCheckUtils]: 18: Hoare triple {6906#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6907#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:01:12,607 INFO L290 TraceCheckUtils]: 19: Hoare triple {6907#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6908#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:01:12,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {6908#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6909#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:01:12,620 INFO L290 TraceCheckUtils]: 21: Hoare triple {6909#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6910#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:01:12,621 INFO L290 TraceCheckUtils]: 22: Hoare triple {6910#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6911#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:01:12,621 INFO L290 TraceCheckUtils]: 23: Hoare triple {6911#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6912#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:01:12,622 INFO L290 TraceCheckUtils]: 24: Hoare triple {6912#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6913#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:01:12,622 INFO L290 TraceCheckUtils]: 25: Hoare triple {6913#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6914#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:01:12,623 INFO L290 TraceCheckUtils]: 26: Hoare triple {6914#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {6998#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:01:12,623 INFO L290 TraceCheckUtils]: 27: Hoare triple {6998#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {6890#false} is VALID [2022-04-28 03:01:12,623 INFO L272 TraceCheckUtils]: 28: Hoare triple {6890#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {6890#false} is VALID [2022-04-28 03:01:12,623 INFO L290 TraceCheckUtils]: 29: Hoare triple {6890#false} ~cond := #in~cond; {6890#false} is VALID [2022-04-28 03:01:12,623 INFO L290 TraceCheckUtils]: 30: Hoare triple {6890#false} assume 0 == ~cond; {6890#false} is VALID [2022-04-28 03:01:12,623 INFO L290 TraceCheckUtils]: 31: Hoare triple {6890#false} assume !false; {6890#false} is VALID [2022-04-28 03:01:12,624 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:01:12,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:01:13,826 INFO L290 TraceCheckUtils]: 31: Hoare triple {6890#false} assume !false; {6890#false} is VALID [2022-04-28 03:01:13,827 INFO L290 TraceCheckUtils]: 30: Hoare triple {7017#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {6890#false} is VALID [2022-04-28 03:01:13,827 INFO L290 TraceCheckUtils]: 29: Hoare triple {7021#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {7017#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:01:13,828 INFO L272 TraceCheckUtils]: 28: Hoare triple {7025#(not (= (mod main_~x~0 2) 0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {7021#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:01:13,828 INFO L290 TraceCheckUtils]: 27: Hoare triple {7029#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !(~x~0 % 4294967296 < 268435455); {7025#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 03:01:13,829 INFO L290 TraceCheckUtils]: 26: Hoare triple {7033#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7029#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:01:13,830 INFO L290 TraceCheckUtils]: 25: Hoare triple {7037#(or (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7033#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:01:13,830 INFO L290 TraceCheckUtils]: 24: Hoare triple {7041#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7037#(or (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:01:13,833 INFO L290 TraceCheckUtils]: 23: Hoare triple {7045#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7041#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} is VALID [2022-04-28 03:01:13,834 INFO L290 TraceCheckUtils]: 22: Hoare triple {7049#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7045#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} is VALID [2022-04-28 03:01:13,835 INFO L290 TraceCheckUtils]: 21: Hoare triple {7053#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7049#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} is VALID [2022-04-28 03:01:13,835 INFO L290 TraceCheckUtils]: 20: Hoare triple {7057#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7053#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} is VALID [2022-04-28 03:01:13,836 INFO L290 TraceCheckUtils]: 19: Hoare triple {7061#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7057#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:01:13,837 INFO L290 TraceCheckUtils]: 18: Hoare triple {7065#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7061#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:01:13,838 INFO L290 TraceCheckUtils]: 17: Hoare triple {7069#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7065#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:01:13,839 INFO L290 TraceCheckUtils]: 16: Hoare triple {7073#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7069#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} is VALID [2022-04-28 03:01:13,839 INFO L290 TraceCheckUtils]: 15: Hoare triple {7077#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7073#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} is VALID [2022-04-28 03:01:13,841 INFO L290 TraceCheckUtils]: 14: Hoare triple {7081#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7077#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} is VALID [2022-04-28 03:01:13,842 INFO L290 TraceCheckUtils]: 13: Hoare triple {7085#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7081#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} is VALID [2022-04-28 03:01:13,843 INFO L290 TraceCheckUtils]: 12: Hoare triple {7089#(or (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7085#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:01:13,844 INFO L290 TraceCheckUtils]: 11: Hoare triple {7093#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7089#(or (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:01:13,848 INFO L290 TraceCheckUtils]: 10: Hoare triple {7097#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7093#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:01:13,850 INFO L290 TraceCheckUtils]: 9: Hoare triple {7101#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7097#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:01:13,851 INFO L290 TraceCheckUtils]: 8: Hoare triple {7105#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7101#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} is VALID [2022-04-28 03:01:13,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {7109#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7105#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:01:13,853 INFO L290 TraceCheckUtils]: 6: Hoare triple {7113#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7109#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:01:13,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {6889#true} ~x~0 := 0; {7113#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:01:13,853 INFO L272 TraceCheckUtils]: 4: Hoare triple {6889#true} call #t~ret4 := main(); {6889#true} is VALID [2022-04-28 03:01:13,853 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6889#true} {6889#true} #34#return; {6889#true} is VALID [2022-04-28 03:01:13,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {6889#true} assume true; {6889#true} is VALID [2022-04-28 03:01:13,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {6889#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {6889#true} is VALID [2022-04-28 03:01:13,854 INFO L272 TraceCheckUtils]: 0: Hoare triple {6889#true} call ULTIMATE.init(); {6889#true} is VALID [2022-04-28 03:01:13,854 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:01:13,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516750565] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:01:13,854 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:01:13,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 27] total 51 [2022-04-28 03:01:13,854 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:01:13,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [859888774] [2022-04-28 03:01:13,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [859888774] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:01:13,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:01:13,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 03:01:13,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911734966] [2022-04-28 03:01:13,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:01:13,855 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:01:13,855 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:01:13,855 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:01:13,873 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:13,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 03:01:13,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:13,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 03:01:13,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=649, Invalid=1901, Unknown=0, NotChecked=0, Total=2550 [2022-04-28 03:01:13,874 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:01:14,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:14,894 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-28 03:01:14,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 03:01:14,894 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:01:14,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:01:14,894 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:01:14,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 39 transitions. [2022-04-28 03:01:14,895 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:01:14,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 39 transitions. [2022-04-28 03:01:14,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 39 transitions. [2022-04-28 03:01:14,930 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:01:14,931 INFO L225 Difference]: With dead ends: 39 [2022-04-28 03:01:14,931 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 03:01:14,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1263, Invalid=3993, Unknown=0, NotChecked=0, Total=5256 [2022-04-28 03:01:14,933 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:01:14,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 23 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 03:01:14,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 03:01:14,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-28 03:01:14,962 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:01:14,962 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:01:14,962 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:01:14,962 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:01:14,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:14,963 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-28 03:01:14,963 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-28 03:01:14,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:14,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:14,963 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:01:14,963 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:01:14,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:14,964 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2022-04-28 03:01:14,964 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-28 03:01:14,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:14,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:14,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:01:14,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:01:14,964 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:01:14,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2022-04-28 03:01:14,965 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2022-04-28 03:01:14,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:01:14,965 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2022-04-28 03:01:14,965 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:01:14,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 34 transitions. [2022-04-28 03:01:14,996 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:01:14,996 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2022-04-28 03:01:14,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 03:01:14,996 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:01:14,996 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:01:15,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-04-28 03:01:15,206 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:01:15,400 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:01:15,401 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:01:15,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:01:15,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1118023580, now seen corresponding path program 43 times [2022-04-28 03:01:15,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:15,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1427457525] [2022-04-28 03:01:15,539 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:15,540 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:01:15,542 INFO L85 PathProgramCache]: Analyzing trace with hash -626095561, now seen corresponding path program 1 times [2022-04-28 03:01:15,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:15,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697245373] [2022-04-28 03:01:15,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:15,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:15,546 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_22.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_22.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:01:15,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:01:15,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [165050384] [2022-04-28 03:01:15,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:15,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:15,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:01:15,550 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:01:15,552 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:01:15,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:01:15,592 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:01:15,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:01:15,619 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:01:15,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1118023580, now seen corresponding path program 44 times [2022-04-28 03:01:15,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:15,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627166547] [2022-04-28 03:01:15,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:15,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:15,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:15,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:01:15,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:15,991 INFO L290 TraceCheckUtils]: 0: Hoare triple {7420#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {7392#true} is VALID [2022-04-28 03:01:15,991 INFO L290 TraceCheckUtils]: 1: Hoare triple {7392#true} assume true; {7392#true} is VALID [2022-04-28 03:01:15,991 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7392#true} {7392#true} #34#return; {7392#true} is VALID [2022-04-28 03:01:15,992 INFO L272 TraceCheckUtils]: 0: Hoare triple {7392#true} call ULTIMATE.init(); {7420#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:01:15,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {7420#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {7392#true} is VALID [2022-04-28 03:01:15,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {7392#true} assume true; {7392#true} is VALID [2022-04-28 03:01:15,992 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7392#true} {7392#true} #34#return; {7392#true} is VALID [2022-04-28 03:01:15,992 INFO L272 TraceCheckUtils]: 4: Hoare triple {7392#true} call #t~ret4 := main(); {7392#true} is VALID [2022-04-28 03:01:15,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {7392#true} ~x~0 := 0; {7397#(= main_~x~0 0)} is VALID [2022-04-28 03:01:15,993 INFO L290 TraceCheckUtils]: 6: Hoare triple {7397#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7398#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:01:15,993 INFO L290 TraceCheckUtils]: 7: Hoare triple {7398#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7399#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:01:15,994 INFO L290 TraceCheckUtils]: 8: Hoare triple {7399#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7400#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:01:15,994 INFO L290 TraceCheckUtils]: 9: Hoare triple {7400#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7401#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:01:15,995 INFO L290 TraceCheckUtils]: 10: Hoare triple {7401#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7402#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:01:15,995 INFO L290 TraceCheckUtils]: 11: Hoare triple {7402#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7403#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:01:15,996 INFO L290 TraceCheckUtils]: 12: Hoare triple {7403#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7404#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:01:15,996 INFO L290 TraceCheckUtils]: 13: Hoare triple {7404#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7405#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:01:15,997 INFO L290 TraceCheckUtils]: 14: Hoare triple {7405#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7406#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:01:15,997 INFO L290 TraceCheckUtils]: 15: Hoare triple {7406#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7407#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:01:15,998 INFO L290 TraceCheckUtils]: 16: Hoare triple {7407#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7408#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:01:15,998 INFO L290 TraceCheckUtils]: 17: Hoare triple {7408#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7409#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:01:15,999 INFO L290 TraceCheckUtils]: 18: Hoare triple {7409#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7410#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:01:15,999 INFO L290 TraceCheckUtils]: 19: Hoare triple {7410#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7411#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:01:16,000 INFO L290 TraceCheckUtils]: 20: Hoare triple {7411#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7412#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:01:16,000 INFO L290 TraceCheckUtils]: 21: Hoare triple {7412#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7413#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:01:16,001 INFO L290 TraceCheckUtils]: 22: Hoare triple {7413#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7414#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:01:16,001 INFO L290 TraceCheckUtils]: 23: Hoare triple {7414#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7415#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:01:16,001 INFO L290 TraceCheckUtils]: 24: Hoare triple {7415#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7416#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:01:16,002 INFO L290 TraceCheckUtils]: 25: Hoare triple {7416#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7417#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:01:16,002 INFO L290 TraceCheckUtils]: 26: Hoare triple {7417#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7418#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:01:16,003 INFO L290 TraceCheckUtils]: 27: Hoare triple {7418#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7419#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 44))} is VALID [2022-04-28 03:01:16,003 INFO L290 TraceCheckUtils]: 28: Hoare triple {7419#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 44))} assume !(~x~0 % 4294967296 < 268435455); {7393#false} is VALID [2022-04-28 03:01:16,003 INFO L272 TraceCheckUtils]: 29: Hoare triple {7393#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {7393#false} is VALID [2022-04-28 03:01:16,004 INFO L290 TraceCheckUtils]: 30: Hoare triple {7393#false} ~cond := #in~cond; {7393#false} is VALID [2022-04-28 03:01:16,004 INFO L290 TraceCheckUtils]: 31: Hoare triple {7393#false} assume 0 == ~cond; {7393#false} is VALID [2022-04-28 03:01:16,004 INFO L290 TraceCheckUtils]: 32: Hoare triple {7393#false} assume !false; {7393#false} is VALID [2022-04-28 03:01:16,014 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:01:16,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:01:16,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627166547] [2022-04-28 03:01:16,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627166547] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:01:16,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1150420325] [2022-04-28 03:01:16,014 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:01:16,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:16,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:01:16,015 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:01:16,016 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:01:16,068 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:01:16,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:01:16,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-28 03:01:16,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:16,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:01:16,364 INFO L272 TraceCheckUtils]: 0: Hoare triple {7392#true} call ULTIMATE.init(); {7392#true} is VALID [2022-04-28 03:01:16,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {7392#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {7392#true} is VALID [2022-04-28 03:01:16,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {7392#true} assume true; {7392#true} is VALID [2022-04-28 03:01:16,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7392#true} {7392#true} #34#return; {7392#true} is VALID [2022-04-28 03:01:16,365 INFO L272 TraceCheckUtils]: 4: Hoare triple {7392#true} call #t~ret4 := main(); {7392#true} is VALID [2022-04-28 03:01:16,365 INFO L290 TraceCheckUtils]: 5: Hoare triple {7392#true} ~x~0 := 0; {7397#(= main_~x~0 0)} is VALID [2022-04-28 03:01:16,365 INFO L290 TraceCheckUtils]: 6: Hoare triple {7397#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7398#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:01:16,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {7398#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7399#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:01:16,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {7399#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7400#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:01:16,367 INFO L290 TraceCheckUtils]: 9: Hoare triple {7400#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7401#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:01:16,367 INFO L290 TraceCheckUtils]: 10: Hoare triple {7401#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7402#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:01:16,368 INFO L290 TraceCheckUtils]: 11: Hoare triple {7402#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7403#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:01:16,368 INFO L290 TraceCheckUtils]: 12: Hoare triple {7403#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7404#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:01:16,369 INFO L290 TraceCheckUtils]: 13: Hoare triple {7404#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7405#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:01:16,369 INFO L290 TraceCheckUtils]: 14: Hoare triple {7405#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7406#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:01:16,370 INFO L290 TraceCheckUtils]: 15: Hoare triple {7406#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7407#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:01:16,370 INFO L290 TraceCheckUtils]: 16: Hoare triple {7407#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7408#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:01:16,371 INFO L290 TraceCheckUtils]: 17: Hoare triple {7408#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7409#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:01:16,371 INFO L290 TraceCheckUtils]: 18: Hoare triple {7409#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7410#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:01:16,371 INFO L290 TraceCheckUtils]: 19: Hoare triple {7410#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7411#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:01:16,372 INFO L290 TraceCheckUtils]: 20: Hoare triple {7411#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7412#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:01:16,372 INFO L290 TraceCheckUtils]: 21: Hoare triple {7412#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7413#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:01:16,373 INFO L290 TraceCheckUtils]: 22: Hoare triple {7413#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7414#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:01:16,373 INFO L290 TraceCheckUtils]: 23: Hoare triple {7414#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7415#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:01:16,374 INFO L290 TraceCheckUtils]: 24: Hoare triple {7415#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7416#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:01:16,374 INFO L290 TraceCheckUtils]: 25: Hoare triple {7416#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7417#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:01:16,375 INFO L290 TraceCheckUtils]: 26: Hoare triple {7417#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7418#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:01:16,375 INFO L290 TraceCheckUtils]: 27: Hoare triple {7418#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7505#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:01:16,376 INFO L290 TraceCheckUtils]: 28: Hoare triple {7505#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !(~x~0 % 4294967296 < 268435455); {7393#false} is VALID [2022-04-28 03:01:16,376 INFO L272 TraceCheckUtils]: 29: Hoare triple {7393#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {7393#false} is VALID [2022-04-28 03:01:16,376 INFO L290 TraceCheckUtils]: 30: Hoare triple {7393#false} ~cond := #in~cond; {7393#false} is VALID [2022-04-28 03:01:16,376 INFO L290 TraceCheckUtils]: 31: Hoare triple {7393#false} assume 0 == ~cond; {7393#false} is VALID [2022-04-28 03:01:16,376 INFO L290 TraceCheckUtils]: 32: Hoare triple {7393#false} assume !false; {7393#false} is VALID [2022-04-28 03:01:16,376 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:01:16,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:01:17,261 INFO L290 TraceCheckUtils]: 32: Hoare triple {7393#false} assume !false; {7393#false} is VALID [2022-04-28 03:01:17,261 INFO L290 TraceCheckUtils]: 31: Hoare triple {7393#false} assume 0 == ~cond; {7393#false} is VALID [2022-04-28 03:01:17,262 INFO L290 TraceCheckUtils]: 30: Hoare triple {7393#false} ~cond := #in~cond; {7393#false} is VALID [2022-04-28 03:01:17,262 INFO L272 TraceCheckUtils]: 29: Hoare triple {7393#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {7393#false} is VALID [2022-04-28 03:01:17,262 INFO L290 TraceCheckUtils]: 28: Hoare triple {7533#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {7393#false} is VALID [2022-04-28 03:01:17,264 INFO L290 TraceCheckUtils]: 27: Hoare triple {7537#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7533#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:01:17,264 INFO L290 TraceCheckUtils]: 26: Hoare triple {7541#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7537#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 03:01:17,265 INFO L290 TraceCheckUtils]: 25: Hoare triple {7545#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7541#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 03:01:17,265 INFO L290 TraceCheckUtils]: 24: Hoare triple {7549#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7545#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 03:01:17,266 INFO L290 TraceCheckUtils]: 23: Hoare triple {7553#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7549#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 03:01:17,267 INFO L290 TraceCheckUtils]: 22: Hoare triple {7557#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7553#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-28 03:01:17,267 INFO L290 TraceCheckUtils]: 21: Hoare triple {7561#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7557#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-28 03:01:17,268 INFO L290 TraceCheckUtils]: 20: Hoare triple {7565#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7561#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-28 03:01:17,269 INFO L290 TraceCheckUtils]: 19: Hoare triple {7569#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7565#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-28 03:01:17,269 INFO L290 TraceCheckUtils]: 18: Hoare triple {7573#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7569#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-28 03:01:17,270 INFO L290 TraceCheckUtils]: 17: Hoare triple {7577#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7573#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-28 03:01:17,270 INFO L290 TraceCheckUtils]: 16: Hoare triple {7581#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7577#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-28 03:01:17,271 INFO L290 TraceCheckUtils]: 15: Hoare triple {7585#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7581#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-28 03:01:17,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {7589#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7585#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-28 03:01:17,272 INFO L290 TraceCheckUtils]: 13: Hoare triple {7593#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7589#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-28 03:01:17,273 INFO L290 TraceCheckUtils]: 12: Hoare triple {7597#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7593#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:01:17,273 INFO L290 TraceCheckUtils]: 11: Hoare triple {7601#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7597#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:01:17,274 INFO L290 TraceCheckUtils]: 10: Hoare triple {7605#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7601#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-28 03:01:17,275 INFO L290 TraceCheckUtils]: 9: Hoare triple {7609#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7605#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-28 03:01:17,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {7613#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7609#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-28 03:01:17,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {7617#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7613#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:01:17,276 INFO L290 TraceCheckUtils]: 6: Hoare triple {7621#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7617#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:01:17,277 INFO L290 TraceCheckUtils]: 5: Hoare triple {7392#true} ~x~0 := 0; {7621#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:01:17,277 INFO L272 TraceCheckUtils]: 4: Hoare triple {7392#true} call #t~ret4 := main(); {7392#true} is VALID [2022-04-28 03:01:17,277 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7392#true} {7392#true} #34#return; {7392#true} is VALID [2022-04-28 03:01:17,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {7392#true} assume true; {7392#true} is VALID [2022-04-28 03:01:17,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {7392#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {7392#true} is VALID [2022-04-28 03:01:17,277 INFO L272 TraceCheckUtils]: 0: Hoare triple {7392#true} call ULTIMATE.init(); {7392#true} is VALID [2022-04-28 03:01:17,277 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:01:17,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1150420325] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:01:17,278 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:01:17,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-28 03:01:17,278 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:01:17,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1427457525] [2022-04-28 03:01:17,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1427457525] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:01:17,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:01:17,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 03:01:17,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202938113] [2022-04-28 03:01:17,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:01:17,279 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:01:17,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:01:17,279 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:01:17,298 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:01:17,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 03:01:17,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:17,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 03:01:17,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 03:01:17,299 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:01:18,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:18,551 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-28 03:01:18,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 03:01:18,552 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:01:18,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:01:18,552 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:01:18,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. [2022-04-28 03:01:18,553 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:01:18,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. [2022-04-28 03:01:18,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 40 transitions. [2022-04-28 03:01:18,593 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:01:18,594 INFO L225 Difference]: With dead ends: 40 [2022-04-28 03:01:18,594 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 03:01:18,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1337, Invalid=3919, Unknown=0, NotChecked=0, Total=5256 [2022-04-28 03:01:18,595 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:01:18,595 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:01:18,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 03:01:18,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-28 03:01:18,623 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:01:18,624 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:01:18,624 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:01:18,624 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:01:18,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:18,624 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-28 03:01:18,624 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-28 03:01:18,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:18,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:18,625 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:01:18,625 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:01:18,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:18,625 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-28 03:01:18,625 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-28 03:01:18,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:18,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:18,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:01:18,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:01:18,626 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:01:18,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2022-04-28 03:01:18,626 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2022-04-28 03:01:18,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:01:18,626 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2022-04-28 03:01:18,626 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:01:18,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 35 transitions. [2022-04-28 03:01:18,660 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:01:18,660 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-28 03:01:18,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 03:01:18,661 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:01:18,661 INFO L195 NwaCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:01:18,667 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:01:18,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2022-04-28 03:01:19,065 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:01:19,065 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:01:19,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:01:19,066 INFO L85 PathProgramCache]: Analyzing trace with hash 335453878, now seen corresponding path program 45 times [2022-04-28 03:01:19,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:19,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [199114962] [2022-04-28 03:01:19,210 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:19,211 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:01:19,213 INFO L85 PathProgramCache]: Analyzing trace with hash -566990217, now seen corresponding path program 1 times [2022-04-28 03:01:19,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:19,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472658690] [2022-04-28 03:01:19,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:19,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:19,225 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_23.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_23.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:01:19,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:01:19,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1768442346] [2022-04-28 03:01:19,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:19,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:19,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:01:19,229 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:01:19,230 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:01:19,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:01:19,280 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:01:19,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:01:19,293 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:01:19,293 INFO L85 PathProgramCache]: Analyzing trace with hash 335453878, now seen corresponding path program 46 times [2022-04-28 03:01:19,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:19,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394760400] [2022-04-28 03:01:19,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:19,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:19,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:19,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:01:19,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:19,679 INFO L290 TraceCheckUtils]: 0: Hoare triple {7937#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {7908#true} is VALID [2022-04-28 03:01:19,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {7908#true} assume true; {7908#true} is VALID [2022-04-28 03:01:19,679 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7908#true} {7908#true} #34#return; {7908#true} is VALID [2022-04-28 03:01:19,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {7908#true} call ULTIMATE.init(); {7937#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:01:19,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {7937#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {7908#true} is VALID [2022-04-28 03:01:19,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {7908#true} assume true; {7908#true} is VALID [2022-04-28 03:01:19,680 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7908#true} {7908#true} #34#return; {7908#true} is VALID [2022-04-28 03:01:19,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {7908#true} call #t~ret4 := main(); {7908#true} is VALID [2022-04-28 03:01:19,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {7908#true} ~x~0 := 0; {7913#(= main_~x~0 0)} is VALID [2022-04-28 03:01:19,681 INFO L290 TraceCheckUtils]: 6: Hoare triple {7913#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7914#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:01:19,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {7914#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7915#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:01:19,682 INFO L290 TraceCheckUtils]: 8: Hoare triple {7915#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7916#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:01:19,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {7916#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7917#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:01:19,682 INFO L290 TraceCheckUtils]: 10: Hoare triple {7917#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7918#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:01:19,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {7918#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7919#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:01:19,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {7919#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7920#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:01:19,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {7920#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7921#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:01:19,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {7921#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7922#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:01:19,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {7922#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7923#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:01:19,685 INFO L290 TraceCheckUtils]: 16: Hoare triple {7923#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7924#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:01:19,686 INFO L290 TraceCheckUtils]: 17: Hoare triple {7924#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7925#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:01:19,686 INFO L290 TraceCheckUtils]: 18: Hoare triple {7925#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7926#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:01:19,687 INFO L290 TraceCheckUtils]: 19: Hoare triple {7926#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7927#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:01:19,687 INFO L290 TraceCheckUtils]: 20: Hoare triple {7927#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7928#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:01:19,688 INFO L290 TraceCheckUtils]: 21: Hoare triple {7928#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7929#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:01:19,688 INFO L290 TraceCheckUtils]: 22: Hoare triple {7929#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7930#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:01:19,689 INFO L290 TraceCheckUtils]: 23: Hoare triple {7930#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7931#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:01:19,691 INFO L290 TraceCheckUtils]: 24: Hoare triple {7931#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7932#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:01:19,691 INFO L290 TraceCheckUtils]: 25: Hoare triple {7932#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7933#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:01:19,692 INFO L290 TraceCheckUtils]: 26: Hoare triple {7933#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7934#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:01:19,692 INFO L290 TraceCheckUtils]: 27: Hoare triple {7934#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7935#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:01:19,693 INFO L290 TraceCheckUtils]: 28: Hoare triple {7935#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7936#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 46))} is VALID [2022-04-28 03:01:19,693 INFO L290 TraceCheckUtils]: 29: Hoare triple {7936#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 46))} assume !(~x~0 % 4294967296 < 268435455); {7909#false} is VALID [2022-04-28 03:01:19,693 INFO L272 TraceCheckUtils]: 30: Hoare triple {7909#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {7909#false} is VALID [2022-04-28 03:01:19,693 INFO L290 TraceCheckUtils]: 31: Hoare triple {7909#false} ~cond := #in~cond; {7909#false} is VALID [2022-04-28 03:01:19,693 INFO L290 TraceCheckUtils]: 32: Hoare triple {7909#false} assume 0 == ~cond; {7909#false} is VALID [2022-04-28 03:01:19,693 INFO L290 TraceCheckUtils]: 33: Hoare triple {7909#false} assume !false; {7909#false} is VALID [2022-04-28 03:01:19,694 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:01:19,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:01:19,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394760400] [2022-04-28 03:01:19,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394760400] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:01:19,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554236017] [2022-04-28 03:01:19,694 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:01:19,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:19,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:01:19,695 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:01:19,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-04-28 03:01:19,753 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:01:19,753 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:01:19,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-28 03:01:19,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:19,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:01:20,071 INFO L272 TraceCheckUtils]: 0: Hoare triple {7908#true} call ULTIMATE.init(); {7908#true} is VALID [2022-04-28 03:01:20,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {7908#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {7908#true} is VALID [2022-04-28 03:01:20,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {7908#true} assume true; {7908#true} is VALID [2022-04-28 03:01:20,074 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7908#true} {7908#true} #34#return; {7908#true} is VALID [2022-04-28 03:01:20,074 INFO L272 TraceCheckUtils]: 4: Hoare triple {7908#true} call #t~ret4 := main(); {7908#true} is VALID [2022-04-28 03:01:20,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {7908#true} ~x~0 := 0; {7913#(= main_~x~0 0)} is VALID [2022-04-28 03:01:20,074 INFO L290 TraceCheckUtils]: 6: Hoare triple {7913#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7914#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:01:20,075 INFO L290 TraceCheckUtils]: 7: Hoare triple {7914#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7915#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:01:20,075 INFO L290 TraceCheckUtils]: 8: Hoare triple {7915#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7916#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:01:20,076 INFO L290 TraceCheckUtils]: 9: Hoare triple {7916#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7917#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:01:20,076 INFO L290 TraceCheckUtils]: 10: Hoare triple {7917#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7918#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:01:20,077 INFO L290 TraceCheckUtils]: 11: Hoare triple {7918#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7919#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:01:20,077 INFO L290 TraceCheckUtils]: 12: Hoare triple {7919#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7920#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:01:20,078 INFO L290 TraceCheckUtils]: 13: Hoare triple {7920#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7921#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:01:20,078 INFO L290 TraceCheckUtils]: 14: Hoare triple {7921#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7922#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:01:20,079 INFO L290 TraceCheckUtils]: 15: Hoare triple {7922#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7923#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:01:20,079 INFO L290 TraceCheckUtils]: 16: Hoare triple {7923#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7924#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:01:20,080 INFO L290 TraceCheckUtils]: 17: Hoare triple {7924#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7925#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:01:20,080 INFO L290 TraceCheckUtils]: 18: Hoare triple {7925#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7926#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:01:20,080 INFO L290 TraceCheckUtils]: 19: Hoare triple {7926#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7927#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:01:20,081 INFO L290 TraceCheckUtils]: 20: Hoare triple {7927#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7928#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:01:20,081 INFO L290 TraceCheckUtils]: 21: Hoare triple {7928#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7929#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:01:20,082 INFO L290 TraceCheckUtils]: 22: Hoare triple {7929#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7930#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:01:20,082 INFO L290 TraceCheckUtils]: 23: Hoare triple {7930#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7931#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:01:20,083 INFO L290 TraceCheckUtils]: 24: Hoare triple {7931#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7932#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:01:20,083 INFO L290 TraceCheckUtils]: 25: Hoare triple {7932#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7933#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:01:20,084 INFO L290 TraceCheckUtils]: 26: Hoare triple {7933#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7934#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:01:20,084 INFO L290 TraceCheckUtils]: 27: Hoare triple {7934#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {7935#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:01:20,085 INFO L290 TraceCheckUtils]: 28: Hoare triple {7935#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8025#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:01:20,085 INFO L290 TraceCheckUtils]: 29: Hoare triple {8025#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !(~x~0 % 4294967296 < 268435455); {7909#false} is VALID [2022-04-28 03:01:20,085 INFO L272 TraceCheckUtils]: 30: Hoare triple {7909#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {7909#false} is VALID [2022-04-28 03:01:20,085 INFO L290 TraceCheckUtils]: 31: Hoare triple {7909#false} ~cond := #in~cond; {7909#false} is VALID [2022-04-28 03:01:20,085 INFO L290 TraceCheckUtils]: 32: Hoare triple {7909#false} assume 0 == ~cond; {7909#false} is VALID [2022-04-28 03:01:20,085 INFO L290 TraceCheckUtils]: 33: Hoare triple {7909#false} assume !false; {7909#false} is VALID [2022-04-28 03:01:20,086 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:01:20,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:01:20,995 INFO L290 TraceCheckUtils]: 33: Hoare triple {7909#false} assume !false; {7909#false} is VALID [2022-04-28 03:01:20,995 INFO L290 TraceCheckUtils]: 32: Hoare triple {7909#false} assume 0 == ~cond; {7909#false} is VALID [2022-04-28 03:01:20,995 INFO L290 TraceCheckUtils]: 31: Hoare triple {7909#false} ~cond := #in~cond; {7909#false} is VALID [2022-04-28 03:01:20,996 INFO L272 TraceCheckUtils]: 30: Hoare triple {7909#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {7909#false} is VALID [2022-04-28 03:01:20,996 INFO L290 TraceCheckUtils]: 29: Hoare triple {8053#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {7909#false} is VALID [2022-04-28 03:01:20,996 INFO L290 TraceCheckUtils]: 28: Hoare triple {8057#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8053#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:01:20,997 INFO L290 TraceCheckUtils]: 27: Hoare triple {8061#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8057#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 03:01:20,998 INFO L290 TraceCheckUtils]: 26: Hoare triple {8065#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8061#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 03:01:20,998 INFO L290 TraceCheckUtils]: 25: Hoare triple {8069#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8065#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 03:01:20,999 INFO L290 TraceCheckUtils]: 24: Hoare triple {8073#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8069#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 03:01:20,999 INFO L290 TraceCheckUtils]: 23: Hoare triple {8077#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8073#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-28 03:01:21,000 INFO L290 TraceCheckUtils]: 22: Hoare triple {8081#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8077#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-28 03:01:21,001 INFO L290 TraceCheckUtils]: 21: Hoare triple {8085#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8081#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-28 03:01:21,001 INFO L290 TraceCheckUtils]: 20: Hoare triple {8089#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8085#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-28 03:01:21,002 INFO L290 TraceCheckUtils]: 19: Hoare triple {8093#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8089#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-28 03:01:21,002 INFO L290 TraceCheckUtils]: 18: Hoare triple {8097#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8093#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-28 03:01:21,003 INFO L290 TraceCheckUtils]: 17: Hoare triple {8101#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8097#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-28 03:01:21,003 INFO L290 TraceCheckUtils]: 16: Hoare triple {8105#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8101#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-28 03:01:21,004 INFO L290 TraceCheckUtils]: 15: Hoare triple {8109#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8105#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-28 03:01:21,005 INFO L290 TraceCheckUtils]: 14: Hoare triple {8113#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8109#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-28 03:01:21,005 INFO L290 TraceCheckUtils]: 13: Hoare triple {8117#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8113#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:01:21,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {8121#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8117#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:01:21,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {8125#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8121#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-28 03:01:21,007 INFO L290 TraceCheckUtils]: 10: Hoare triple {8129#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8125#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-28 03:01:21,008 INFO L290 TraceCheckUtils]: 9: Hoare triple {8133#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8129#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-28 03:01:21,008 INFO L290 TraceCheckUtils]: 8: Hoare triple {8137#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8133#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:01:21,009 INFO L290 TraceCheckUtils]: 7: Hoare triple {8141#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8137#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:01:21,009 INFO L290 TraceCheckUtils]: 6: Hoare triple {8145#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8141#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:01:21,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {7908#true} ~x~0 := 0; {8145#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-28 03:01:21,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {7908#true} call #t~ret4 := main(); {7908#true} is VALID [2022-04-28 03:01:21,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7908#true} {7908#true} #34#return; {7908#true} is VALID [2022-04-28 03:01:21,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {7908#true} assume true; {7908#true} is VALID [2022-04-28 03:01:21,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {7908#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {7908#true} is VALID [2022-04-28 03:01:21,010 INFO L272 TraceCheckUtils]: 0: Hoare triple {7908#true} call ULTIMATE.init(); {7908#true} is VALID [2022-04-28 03:01:21,010 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:01:21,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554236017] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:01:21,010 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:01:21,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 52 [2022-04-28 03:01:21,011 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:01:21,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [199114962] [2022-04-28 03:01:21,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [199114962] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:01:21,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:01:21,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-28 03:01:21,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135521485] [2022-04-28 03:01:21,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:01:21,011 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:01:21,011 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:01:21,012 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:01:21,041 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:01:21,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-28 03:01:21,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:21,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-28 03:01:21,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=725, Invalid=1927, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 03:01:21,042 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:01:22,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:22,244 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-28 03:01:22,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 03:01:22,244 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:01:22,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:01:22,244 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:01:22,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 41 transitions. [2022-04-28 03:01:22,245 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:01:22,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 41 transitions. [2022-04-28 03:01:22,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 41 transitions. [2022-04-28 03:01:22,270 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:01:22,271 INFO L225 Difference]: With dead ends: 41 [2022-04-28 03:01:22,271 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 03:01:22,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1443, Invalid=4257, Unknown=0, NotChecked=0, Total=5700 [2022-04-28 03:01:22,272 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:01:22,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 63 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 03:01:22,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 03:01:22,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-28 03:01:22,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:01:22,305 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:01:22,305 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:01:22,305 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:01:22,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:22,306 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-28 03:01:22,306 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-28 03:01:22,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:22,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:22,306 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:01:22,306 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:01:22,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:22,306 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2022-04-28 03:01:22,307 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-28 03:01:22,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:22,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:22,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:01:22,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:01:22,307 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:01:22,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2022-04-28 03:01:22,308 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2022-04-28 03:01:22,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:01:22,308 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2022-04-28 03:01:22,308 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:01:22,308 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 36 transitions. [2022-04-28 03:01:22,335 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:01:22,335 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2022-04-28 03:01:22,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-28 03:01:22,336 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:01:22,336 INFO L195 NwaCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:01:22,342 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-04-28 03:01:22,556 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:01:22,740 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:01:22,740 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:01:22,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:01:22,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1845596892, now seen corresponding path program 47 times [2022-04-28 03:01:22,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:22,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [891248458] [2022-04-28 03:01:22,916 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:01:22,917 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:01:22,919 INFO L85 PathProgramCache]: Analyzing trace with hash -507884873, now seen corresponding path program 1 times [2022-04-28 03:01:22,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:22,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956379459] [2022-04-28 03:01:22,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:22,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:22,932 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 2) .v_it_24.0) (* (- 1) main_~x~0_5) (* 4294967296 (div (+ (* 2 .v_it_24.0) main_~x~0_5) 4294967296)) 268435455) 0)) [2022-04-28 03:01:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:01:22,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [405605153] [2022-04-28 03:01:22,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:22,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:22,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:01:22,936 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:01:22,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-04-28 03:01:22,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:01:22,978 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:01:22,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:01:22,991 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:01:22,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1845596892, now seen corresponding path program 48 times [2022-04-28 03:01:22,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:22,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669708490] [2022-04-28 03:01:22,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:22,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:23,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:23,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:01:23,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:23,424 INFO L290 TraceCheckUtils]: 0: Hoare triple {8470#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {8440#true} is VALID [2022-04-28 03:01:23,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {8440#true} assume true; {8440#true} is VALID [2022-04-28 03:01:23,425 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8440#true} {8440#true} #34#return; {8440#true} is VALID [2022-04-28 03:01:23,425 INFO L272 TraceCheckUtils]: 0: Hoare triple {8440#true} call ULTIMATE.init(); {8470#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:01:23,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {8470#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {8440#true} is VALID [2022-04-28 03:01:23,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {8440#true} assume true; {8440#true} is VALID [2022-04-28 03:01:23,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8440#true} {8440#true} #34#return; {8440#true} is VALID [2022-04-28 03:01:23,426 INFO L272 TraceCheckUtils]: 4: Hoare triple {8440#true} call #t~ret4 := main(); {8440#true} is VALID [2022-04-28 03:01:23,426 INFO L290 TraceCheckUtils]: 5: Hoare triple {8440#true} ~x~0 := 0; {8445#(= main_~x~0 0)} is VALID [2022-04-28 03:01:23,426 INFO L290 TraceCheckUtils]: 6: Hoare triple {8445#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8446#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:01:23,427 INFO L290 TraceCheckUtils]: 7: Hoare triple {8446#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8447#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:01:23,427 INFO L290 TraceCheckUtils]: 8: Hoare triple {8447#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8448#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:01:23,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {8448#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8449#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:01:23,428 INFO L290 TraceCheckUtils]: 10: Hoare triple {8449#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8450#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:01:23,429 INFO L290 TraceCheckUtils]: 11: Hoare triple {8450#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8451#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:01:23,429 INFO L290 TraceCheckUtils]: 12: Hoare triple {8451#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8452#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:01:23,430 INFO L290 TraceCheckUtils]: 13: Hoare triple {8452#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8453#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:01:23,430 INFO L290 TraceCheckUtils]: 14: Hoare triple {8453#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8454#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:01:23,430 INFO L290 TraceCheckUtils]: 15: Hoare triple {8454#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8455#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:01:23,431 INFO L290 TraceCheckUtils]: 16: Hoare triple {8455#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8456#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:01:23,431 INFO L290 TraceCheckUtils]: 17: Hoare triple {8456#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8457#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:01:23,432 INFO L290 TraceCheckUtils]: 18: Hoare triple {8457#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8458#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:01:23,432 INFO L290 TraceCheckUtils]: 19: Hoare triple {8458#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8459#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:01:23,433 INFO L290 TraceCheckUtils]: 20: Hoare triple {8459#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8460#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:01:23,433 INFO L290 TraceCheckUtils]: 21: Hoare triple {8460#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8461#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:01:23,434 INFO L290 TraceCheckUtils]: 22: Hoare triple {8461#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8462#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:01:23,434 INFO L290 TraceCheckUtils]: 23: Hoare triple {8462#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8463#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:01:23,435 INFO L290 TraceCheckUtils]: 24: Hoare triple {8463#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8464#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:01:23,435 INFO L290 TraceCheckUtils]: 25: Hoare triple {8464#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8465#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:01:23,436 INFO L290 TraceCheckUtils]: 26: Hoare triple {8465#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8466#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:01:23,436 INFO L290 TraceCheckUtils]: 27: Hoare triple {8466#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8467#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:01:23,436 INFO L290 TraceCheckUtils]: 28: Hoare triple {8467#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8468#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:01:23,437 INFO L290 TraceCheckUtils]: 29: Hoare triple {8468#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8469#(and (<= main_~x~0 48) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:01:23,437 INFO L290 TraceCheckUtils]: 30: Hoare triple {8469#(and (<= main_~x~0 48) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {8441#false} is VALID [2022-04-28 03:01:23,438 INFO L272 TraceCheckUtils]: 31: Hoare triple {8441#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {8441#false} is VALID [2022-04-28 03:01:23,438 INFO L290 TraceCheckUtils]: 32: Hoare triple {8441#false} ~cond := #in~cond; {8441#false} is VALID [2022-04-28 03:01:23,438 INFO L290 TraceCheckUtils]: 33: Hoare triple {8441#false} assume 0 == ~cond; {8441#false} is VALID [2022-04-28 03:01:23,438 INFO L290 TraceCheckUtils]: 34: Hoare triple {8441#false} assume !false; {8441#false} is VALID [2022-04-28 03:01:23,438 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:01:23,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:01:23,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669708490] [2022-04-28 03:01:23,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669708490] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:01:23,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256204984] [2022-04-28 03:01:23,438 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:01:23,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:23,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:01:23,439 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:01:23,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-04-28 03:01:23,741 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-28 03:01:23,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:01:23,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-28 03:01:23,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:23,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:01:23,983 INFO L272 TraceCheckUtils]: 0: Hoare triple {8440#true} call ULTIMATE.init(); {8440#true} is VALID [2022-04-28 03:01:23,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {8440#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {8440#true} is VALID [2022-04-28 03:01:23,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {8440#true} assume true; {8440#true} is VALID [2022-04-28 03:01:23,984 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8440#true} {8440#true} #34#return; {8440#true} is VALID [2022-04-28 03:01:23,984 INFO L272 TraceCheckUtils]: 4: Hoare triple {8440#true} call #t~ret4 := main(); {8440#true} is VALID [2022-04-28 03:01:23,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {8440#true} ~x~0 := 0; {8445#(= main_~x~0 0)} is VALID [2022-04-28 03:01:23,984 INFO L290 TraceCheckUtils]: 6: Hoare triple {8445#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8446#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:01:23,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {8446#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8447#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:01:23,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {8447#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8448#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:01:23,986 INFO L290 TraceCheckUtils]: 9: Hoare triple {8448#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8449#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:01:23,986 INFO L290 TraceCheckUtils]: 10: Hoare triple {8449#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8450#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:01:23,987 INFO L290 TraceCheckUtils]: 11: Hoare triple {8450#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8451#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:01:23,987 INFO L290 TraceCheckUtils]: 12: Hoare triple {8451#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8452#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:01:23,988 INFO L290 TraceCheckUtils]: 13: Hoare triple {8452#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8453#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:01:23,988 INFO L290 TraceCheckUtils]: 14: Hoare triple {8453#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8454#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:01:23,989 INFO L290 TraceCheckUtils]: 15: Hoare triple {8454#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8455#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:01:23,989 INFO L290 TraceCheckUtils]: 16: Hoare triple {8455#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8456#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:01:23,989 INFO L290 TraceCheckUtils]: 17: Hoare triple {8456#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8457#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:01:23,990 INFO L290 TraceCheckUtils]: 18: Hoare triple {8457#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8458#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:01:23,990 INFO L290 TraceCheckUtils]: 19: Hoare triple {8458#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8459#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:01:23,991 INFO L290 TraceCheckUtils]: 20: Hoare triple {8459#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8460#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:01:23,991 INFO L290 TraceCheckUtils]: 21: Hoare triple {8460#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8461#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:01:23,992 INFO L290 TraceCheckUtils]: 22: Hoare triple {8461#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8462#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:01:23,992 INFO L290 TraceCheckUtils]: 23: Hoare triple {8462#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8463#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:01:23,993 INFO L290 TraceCheckUtils]: 24: Hoare triple {8463#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8464#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:01:23,993 INFO L290 TraceCheckUtils]: 25: Hoare triple {8464#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8465#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:01:23,994 INFO L290 TraceCheckUtils]: 26: Hoare triple {8465#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8466#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:01:23,994 INFO L290 TraceCheckUtils]: 27: Hoare triple {8466#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8467#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:01:23,995 INFO L290 TraceCheckUtils]: 28: Hoare triple {8467#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8468#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:01:23,995 INFO L290 TraceCheckUtils]: 29: Hoare triple {8468#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8561#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:01:23,995 INFO L290 TraceCheckUtils]: 30: Hoare triple {8561#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {8441#false} is VALID [2022-04-28 03:01:23,996 INFO L272 TraceCheckUtils]: 31: Hoare triple {8441#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {8441#false} is VALID [2022-04-28 03:01:23,996 INFO L290 TraceCheckUtils]: 32: Hoare triple {8441#false} ~cond := #in~cond; {8441#false} is VALID [2022-04-28 03:01:23,996 INFO L290 TraceCheckUtils]: 33: Hoare triple {8441#false} assume 0 == ~cond; {8441#false} is VALID [2022-04-28 03:01:23,996 INFO L290 TraceCheckUtils]: 34: Hoare triple {8441#false} assume !false; {8441#false} is VALID [2022-04-28 03:01:23,996 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:01:23,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:01:25,463 INFO L290 TraceCheckUtils]: 34: Hoare triple {8441#false} assume !false; {8441#false} is VALID [2022-04-28 03:01:25,464 INFO L290 TraceCheckUtils]: 33: Hoare triple {8580#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {8441#false} is VALID [2022-04-28 03:01:25,464 INFO L290 TraceCheckUtils]: 32: Hoare triple {8584#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {8580#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:01:25,464 INFO L272 TraceCheckUtils]: 31: Hoare triple {8588#(not (= (mod main_~x~0 2) 0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {8584#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:01:25,465 INFO L290 TraceCheckUtils]: 30: Hoare triple {8592#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !(~x~0 % 4294967296 < 268435455); {8588#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 03:01:25,466 INFO L290 TraceCheckUtils]: 29: Hoare triple {8596#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8592#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:01:25,466 INFO L290 TraceCheckUtils]: 28: Hoare triple {8600#(or (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8596#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:01:25,467 INFO L290 TraceCheckUtils]: 27: Hoare triple {8604#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8600#(or (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:01:25,468 INFO L290 TraceCheckUtils]: 26: Hoare triple {8608#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8604#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} is VALID [2022-04-28 03:01:25,469 INFO L290 TraceCheckUtils]: 25: Hoare triple {8612#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8608#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} is VALID [2022-04-28 03:01:25,469 INFO L290 TraceCheckUtils]: 24: Hoare triple {8616#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8612#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} is VALID [2022-04-28 03:01:25,471 INFO L290 TraceCheckUtils]: 23: Hoare triple {8620#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8616#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} is VALID [2022-04-28 03:01:25,471 INFO L290 TraceCheckUtils]: 22: Hoare triple {8624#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8620#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:01:25,472 INFO L290 TraceCheckUtils]: 21: Hoare triple {8628#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8624#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:01:25,478 INFO L290 TraceCheckUtils]: 20: Hoare triple {8632#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8628#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:01:25,479 INFO L290 TraceCheckUtils]: 19: Hoare triple {8636#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8632#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} is VALID [2022-04-28 03:01:25,480 INFO L290 TraceCheckUtils]: 18: Hoare triple {8640#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8636#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} is VALID [2022-04-28 03:01:25,480 INFO L290 TraceCheckUtils]: 17: Hoare triple {8644#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8640#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} is VALID [2022-04-28 03:01:25,481 INFO L290 TraceCheckUtils]: 16: Hoare triple {8648#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8644#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} is VALID [2022-04-28 03:01:25,482 INFO L290 TraceCheckUtils]: 15: Hoare triple {8652#(or (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8648#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:01:25,482 INFO L290 TraceCheckUtils]: 14: Hoare triple {8656#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8652#(or (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:01:25,486 INFO L290 TraceCheckUtils]: 13: Hoare triple {8660#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8656#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:01:25,486 INFO L290 TraceCheckUtils]: 12: Hoare triple {8664#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8660#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:01:25,487 INFO L290 TraceCheckUtils]: 11: Hoare triple {8668#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8664#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} is VALID [2022-04-28 03:01:25,488 INFO L290 TraceCheckUtils]: 10: Hoare triple {8672#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8668#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:01:25,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {8676#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8672#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:01:25,489 INFO L290 TraceCheckUtils]: 8: Hoare triple {8680#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8676#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:01:25,490 INFO L290 TraceCheckUtils]: 7: Hoare triple {8684#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8680#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:01:25,491 INFO L290 TraceCheckUtils]: 6: Hoare triple {8688#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8684#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} is VALID [2022-04-28 03:01:25,491 INFO L290 TraceCheckUtils]: 5: Hoare triple {8440#true} ~x~0 := 0; {8688#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} is VALID [2022-04-28 03:01:25,491 INFO L272 TraceCheckUtils]: 4: Hoare triple {8440#true} call #t~ret4 := main(); {8440#true} is VALID [2022-04-28 03:01:25,492 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8440#true} {8440#true} #34#return; {8440#true} is VALID [2022-04-28 03:01:25,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {8440#true} assume true; {8440#true} is VALID [2022-04-28 03:01:25,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {8440#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {8440#true} is VALID [2022-04-28 03:01:25,492 INFO L272 TraceCheckUtils]: 0: Hoare triple {8440#true} call ULTIMATE.init(); {8440#true} is VALID [2022-04-28 03:01:25,492 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:01:25,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256204984] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:01:25,492 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:01:25,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 30] total 57 [2022-04-28 03:01:25,493 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:01:25,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [891248458] [2022-04-28 03:01:25,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [891248458] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:01:25,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:01:25,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-28 03:01:25,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997402242] [2022-04-28 03:01:25,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:01:25,493 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:01:25,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:01:25,493 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:01:25,524 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:01:25,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-28 03:01:25,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:25,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-28 03:01:25,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=811, Invalid=2381, Unknown=0, NotChecked=0, Total=3192 [2022-04-28 03:01:25,525 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:01:26,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:26,897 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-28 03:01:26,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 03:01:26,897 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:01:26,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:01:26,897 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:01:26,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2022-04-28 03:01:26,898 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:01:26,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 42 transitions. [2022-04-28 03:01:26,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 42 transitions. [2022-04-28 03:01:26,925 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:01:26,925 INFO L225 Difference]: With dead ends: 42 [2022-04-28 03:01:26,925 INFO L226 Difference]: Without dead ends: 37 [2022-04-28 03:01:26,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1584, Invalid=5058, Unknown=0, NotChecked=0, Total=6642 [2022-04-28 03:01:26,926 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:01:26,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 118 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 03:01:26,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-28 03:01:26,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-28 03:01:26,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:01:26,956 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:01:26,956 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:01:26,956 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:01:26,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:26,957 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-28 03:01:26,957 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-28 03:01:26,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:26,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:26,957 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:01:26,957 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:01:26,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:26,958 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2022-04-28 03:01:26,958 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-28 03:01:26,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:26,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:26,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:01:26,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:01:26,958 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:01:26,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2022-04-28 03:01:26,958 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2022-04-28 03:01:26,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:01:26,959 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2022-04-28 03:01:26,959 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:01:26,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 37 transitions. [2022-04-28 03:01:26,991 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:01:26,992 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2022-04-28 03:01:26,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 03:01:26,992 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:01:26,992 INFO L195 NwaCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:01:26,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-04-28 03:01:27,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2022-04-28 03:01:27,392 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:01:27,393 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:01:27,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:01:27,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1415390070, now seen corresponding path program 49 times [2022-04-28 03:01:27,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:27,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [571040664] [2022-04-28 03:01:27,573 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:27,575 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:01:27,579 INFO L85 PathProgramCache]: Analyzing trace with hash -448779529, now seen corresponding path program 1 times [2022-04-28 03:01:27,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:27,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294712555] [2022-04-28 03:01:27,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:27,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:27,586 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_25.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_25.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:01:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:01:27,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2048296836] [2022-04-28 03:01:27,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:27,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:27,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:01:27,592 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:01:27,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-04-28 03:01:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:01:27,631 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:01:27,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:01:27,641 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:01:27,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1415390070, now seen corresponding path program 50 times [2022-04-28 03:01:27,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:27,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521940990] [2022-04-28 03:01:27,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:27,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:27,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:28,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:01:28,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:28,055 INFO L290 TraceCheckUtils]: 0: Hoare triple {9022#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {8991#true} is VALID [2022-04-28 03:01:28,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {8991#true} assume true; {8991#true} is VALID [2022-04-28 03:01:28,055 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8991#true} {8991#true} #34#return; {8991#true} is VALID [2022-04-28 03:01:28,055 INFO L272 TraceCheckUtils]: 0: Hoare triple {8991#true} call ULTIMATE.init(); {9022#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:01:28,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {9022#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {8991#true} is VALID [2022-04-28 03:01:28,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {8991#true} assume true; {8991#true} is VALID [2022-04-28 03:01:28,055 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8991#true} {8991#true} #34#return; {8991#true} is VALID [2022-04-28 03:01:28,055 INFO L272 TraceCheckUtils]: 4: Hoare triple {8991#true} call #t~ret4 := main(); {8991#true} is VALID [2022-04-28 03:01:28,056 INFO L290 TraceCheckUtils]: 5: Hoare triple {8991#true} ~x~0 := 0; {8996#(= main_~x~0 0)} is VALID [2022-04-28 03:01:28,056 INFO L290 TraceCheckUtils]: 6: Hoare triple {8996#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8997#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:01:28,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {8997#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8998#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:01:28,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {8998#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8999#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:01:28,058 INFO L290 TraceCheckUtils]: 9: Hoare triple {8999#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9000#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:01:28,058 INFO L290 TraceCheckUtils]: 10: Hoare triple {9000#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9001#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:01:28,059 INFO L290 TraceCheckUtils]: 11: Hoare triple {9001#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9002#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:01:28,059 INFO L290 TraceCheckUtils]: 12: Hoare triple {9002#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9003#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:01:28,059 INFO L290 TraceCheckUtils]: 13: Hoare triple {9003#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9004#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:01:28,060 INFO L290 TraceCheckUtils]: 14: Hoare triple {9004#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9005#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:01:28,060 INFO L290 TraceCheckUtils]: 15: Hoare triple {9005#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9006#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:01:28,061 INFO L290 TraceCheckUtils]: 16: Hoare triple {9006#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9007#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:01:28,061 INFO L290 TraceCheckUtils]: 17: Hoare triple {9007#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9008#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:01:28,062 INFO L290 TraceCheckUtils]: 18: Hoare triple {9008#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9009#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:01:28,062 INFO L290 TraceCheckUtils]: 19: Hoare triple {9009#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9010#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:01:28,065 INFO L290 TraceCheckUtils]: 20: Hoare triple {9010#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9011#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:01:28,066 INFO L290 TraceCheckUtils]: 21: Hoare triple {9011#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9012#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:01:28,066 INFO L290 TraceCheckUtils]: 22: Hoare triple {9012#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9013#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:01:28,067 INFO L290 TraceCheckUtils]: 23: Hoare triple {9013#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9014#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:01:28,067 INFO L290 TraceCheckUtils]: 24: Hoare triple {9014#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9015#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:01:28,068 INFO L290 TraceCheckUtils]: 25: Hoare triple {9015#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9016#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:01:28,068 INFO L290 TraceCheckUtils]: 26: Hoare triple {9016#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9017#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:01:28,069 INFO L290 TraceCheckUtils]: 27: Hoare triple {9017#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9018#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:01:28,069 INFO L290 TraceCheckUtils]: 28: Hoare triple {9018#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9019#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:01:28,070 INFO L290 TraceCheckUtils]: 29: Hoare triple {9019#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9020#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:01:28,070 INFO L290 TraceCheckUtils]: 30: Hoare triple {9020#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9021#(and (<= main_~x~0 50) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:01:28,071 INFO L290 TraceCheckUtils]: 31: Hoare triple {9021#(and (<= main_~x~0 50) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {8992#false} is VALID [2022-04-28 03:01:28,071 INFO L272 TraceCheckUtils]: 32: Hoare triple {8992#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {8992#false} is VALID [2022-04-28 03:01:28,071 INFO L290 TraceCheckUtils]: 33: Hoare triple {8992#false} ~cond := #in~cond; {8992#false} is VALID [2022-04-28 03:01:28,071 INFO L290 TraceCheckUtils]: 34: Hoare triple {8992#false} assume 0 == ~cond; {8992#false} is VALID [2022-04-28 03:01:28,071 INFO L290 TraceCheckUtils]: 35: Hoare triple {8992#false} assume !false; {8992#false} is VALID [2022-04-28 03:01:28,071 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:01:28,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:01:28,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521940990] [2022-04-28 03:01:28,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521940990] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:01:28,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1461862868] [2022-04-28 03:01:28,072 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:01:28,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:28,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:01:28,073 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:01:28,073 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:01:28,132 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:01:28,132 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:01:28,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 53 conjunts are in the unsatisfiable core [2022-04-28 03:01:28,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:28,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:01:28,478 INFO L272 TraceCheckUtils]: 0: Hoare triple {8991#true} call ULTIMATE.init(); {8991#true} is VALID [2022-04-28 03:01:28,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {8991#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {8991#true} is VALID [2022-04-28 03:01:28,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {8991#true} assume true; {8991#true} is VALID [2022-04-28 03:01:28,478 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8991#true} {8991#true} #34#return; {8991#true} is VALID [2022-04-28 03:01:28,478 INFO L272 TraceCheckUtils]: 4: Hoare triple {8991#true} call #t~ret4 := main(); {8991#true} is VALID [2022-04-28 03:01:28,478 INFO L290 TraceCheckUtils]: 5: Hoare triple {8991#true} ~x~0 := 0; {8996#(= main_~x~0 0)} is VALID [2022-04-28 03:01:28,479 INFO L290 TraceCheckUtils]: 6: Hoare triple {8996#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8997#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:01:28,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {8997#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8998#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:01:28,480 INFO L290 TraceCheckUtils]: 8: Hoare triple {8998#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {8999#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:01:28,480 INFO L290 TraceCheckUtils]: 9: Hoare triple {8999#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9000#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:01:28,481 INFO L290 TraceCheckUtils]: 10: Hoare triple {9000#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9001#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:01:28,481 INFO L290 TraceCheckUtils]: 11: Hoare triple {9001#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9002#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:01:28,482 INFO L290 TraceCheckUtils]: 12: Hoare triple {9002#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9003#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:01:28,482 INFO L290 TraceCheckUtils]: 13: Hoare triple {9003#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9004#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:01:28,482 INFO L290 TraceCheckUtils]: 14: Hoare triple {9004#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9005#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:01:28,483 INFO L290 TraceCheckUtils]: 15: Hoare triple {9005#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9006#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:01:28,483 INFO L290 TraceCheckUtils]: 16: Hoare triple {9006#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9007#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:01:28,484 INFO L290 TraceCheckUtils]: 17: Hoare triple {9007#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9008#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:01:28,484 INFO L290 TraceCheckUtils]: 18: Hoare triple {9008#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9009#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:01:28,485 INFO L290 TraceCheckUtils]: 19: Hoare triple {9009#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9010#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:01:28,485 INFO L290 TraceCheckUtils]: 20: Hoare triple {9010#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9011#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:01:28,486 INFO L290 TraceCheckUtils]: 21: Hoare triple {9011#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9012#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:01:28,486 INFO L290 TraceCheckUtils]: 22: Hoare triple {9012#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9013#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:01:28,487 INFO L290 TraceCheckUtils]: 23: Hoare triple {9013#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9014#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:01:28,487 INFO L290 TraceCheckUtils]: 24: Hoare triple {9014#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9015#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:01:28,488 INFO L290 TraceCheckUtils]: 25: Hoare triple {9015#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9016#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:01:28,488 INFO L290 TraceCheckUtils]: 26: Hoare triple {9016#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9017#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:01:28,489 INFO L290 TraceCheckUtils]: 27: Hoare triple {9017#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9018#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:01:28,489 INFO L290 TraceCheckUtils]: 28: Hoare triple {9018#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9019#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:01:28,490 INFO L290 TraceCheckUtils]: 29: Hoare triple {9019#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9020#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:01:28,490 INFO L290 TraceCheckUtils]: 30: Hoare triple {9020#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9116#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:01:28,490 INFO L290 TraceCheckUtils]: 31: Hoare triple {9116#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {8992#false} is VALID [2022-04-28 03:01:28,490 INFO L272 TraceCheckUtils]: 32: Hoare triple {8992#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {8992#false} is VALID [2022-04-28 03:01:28,491 INFO L290 TraceCheckUtils]: 33: Hoare triple {8992#false} ~cond := #in~cond; {8992#false} is VALID [2022-04-28 03:01:28,491 INFO L290 TraceCheckUtils]: 34: Hoare triple {8992#false} assume 0 == ~cond; {8992#false} is VALID [2022-04-28 03:01:28,491 INFO L290 TraceCheckUtils]: 35: Hoare triple {8992#false} assume !false; {8992#false} is VALID [2022-04-28 03:01:28,491 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:01:28,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:01:29,537 INFO L290 TraceCheckUtils]: 35: Hoare triple {8992#false} assume !false; {8992#false} is VALID [2022-04-28 03:01:29,538 INFO L290 TraceCheckUtils]: 34: Hoare triple {8992#false} assume 0 == ~cond; {8992#false} is VALID [2022-04-28 03:01:29,538 INFO L290 TraceCheckUtils]: 33: Hoare triple {8992#false} ~cond := #in~cond; {8992#false} is VALID [2022-04-28 03:01:29,538 INFO L272 TraceCheckUtils]: 32: Hoare triple {8992#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {8992#false} is VALID [2022-04-28 03:01:29,538 INFO L290 TraceCheckUtils]: 31: Hoare triple {9144#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {8992#false} is VALID [2022-04-28 03:01:29,539 INFO L290 TraceCheckUtils]: 30: Hoare triple {9148#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9144#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:01:29,539 INFO L290 TraceCheckUtils]: 29: Hoare triple {9152#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9148#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 03:01:29,540 INFO L290 TraceCheckUtils]: 28: Hoare triple {9156#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9152#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 03:01:29,541 INFO L290 TraceCheckUtils]: 27: Hoare triple {9160#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9156#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 03:01:29,541 INFO L290 TraceCheckUtils]: 26: Hoare triple {9164#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9160#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 03:01:29,542 INFO L290 TraceCheckUtils]: 25: Hoare triple {9168#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9164#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-28 03:01:29,542 INFO L290 TraceCheckUtils]: 24: Hoare triple {9172#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9168#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-28 03:01:29,543 INFO L290 TraceCheckUtils]: 23: Hoare triple {9176#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9172#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-28 03:01:29,546 INFO L290 TraceCheckUtils]: 22: Hoare triple {9180#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9176#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-28 03:01:29,547 INFO L290 TraceCheckUtils]: 21: Hoare triple {9184#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9180#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-28 03:01:29,547 INFO L290 TraceCheckUtils]: 20: Hoare triple {9188#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9184#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-28 03:01:29,548 INFO L290 TraceCheckUtils]: 19: Hoare triple {9192#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9188#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-28 03:01:29,548 INFO L290 TraceCheckUtils]: 18: Hoare triple {9196#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9192#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-28 03:01:29,551 INFO L290 TraceCheckUtils]: 17: Hoare triple {9200#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9196#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-28 03:01:29,551 INFO L290 TraceCheckUtils]: 16: Hoare triple {9204#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9200#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-28 03:01:29,552 INFO L290 TraceCheckUtils]: 15: Hoare triple {9208#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9204#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:01:29,552 INFO L290 TraceCheckUtils]: 14: Hoare triple {9212#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9208#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:01:29,553 INFO L290 TraceCheckUtils]: 13: Hoare triple {9216#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9212#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-28 03:01:29,554 INFO L290 TraceCheckUtils]: 12: Hoare triple {9220#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9216#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-28 03:01:29,554 INFO L290 TraceCheckUtils]: 11: Hoare triple {9224#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9220#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-28 03:01:29,555 INFO L290 TraceCheckUtils]: 10: Hoare triple {9228#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9224#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:01:29,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {9232#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9228#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:01:29,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {9236#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9232#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:01:29,557 INFO L290 TraceCheckUtils]: 7: Hoare triple {9240#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9236#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-28 03:01:29,558 INFO L290 TraceCheckUtils]: 6: Hoare triple {9244#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9240#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-28 03:01:29,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {8991#true} ~x~0 := 0; {9244#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-28 03:01:29,558 INFO L272 TraceCheckUtils]: 4: Hoare triple {8991#true} call #t~ret4 := main(); {8991#true} is VALID [2022-04-28 03:01:29,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8991#true} {8991#true} #34#return; {8991#true} is VALID [2022-04-28 03:01:29,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {8991#true} assume true; {8991#true} is VALID [2022-04-28 03:01:29,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {8991#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {8991#true} is VALID [2022-04-28 03:01:29,559 INFO L272 TraceCheckUtils]: 0: Hoare triple {8991#true} call ULTIMATE.init(); {8991#true} is VALID [2022-04-28 03:01:29,559 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:01:29,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1461862868] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:01:29,559 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:01:29,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 56 [2022-04-28 03:01:29,559 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:01:29,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [571040664] [2022-04-28 03:01:29,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [571040664] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:01:29,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:01:29,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-28 03:01:29,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435890203] [2022-04-28 03:01:29,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:01:29,560 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:01:29,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:01:29,560 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:01:29,579 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:01:29,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-28 03:01:29,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:29,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-28 03:01:29,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=837, Invalid=2243, Unknown=0, NotChecked=0, Total=3080 [2022-04-28 03:01:29,580 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:01:31,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:31,018 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-28 03:01:31,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 03:01:31,018 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:01:31,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:01:31,019 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:01:31,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2022-04-28 03:01:31,019 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:01:31,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2022-04-28 03:01:31,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 43 transitions. [2022-04-28 03:01:31,056 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:01:31,057 INFO L225 Difference]: With dead ends: 43 [2022-04-28 03:01:31,057 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 03:01:31,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1667, Invalid=4975, Unknown=0, NotChecked=0, Total=6642 [2022-04-28 03:01:31,058 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:01:31,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 118 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 03:01:31,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 03:01:31,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-28 03:01:31,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:01:31,107 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:01:31,107 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:01:31,107 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:01:31,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:31,108 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-28 03:01:31,108 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-28 03:01:31,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:31,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:31,108 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:01:31,108 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:01:31,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:31,109 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2022-04-28 03:01:31,109 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-28 03:01:31,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:31,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:31,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:01:31,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:01:31,109 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:01:31,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2022-04-28 03:01:31,110 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2022-04-28 03:01:31,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:01:31,110 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2022-04-28 03:01:31,110 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:01:31,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 38 transitions. [2022-04-28 03:01:31,134 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:01:31,135 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-04-28 03:01:31,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 03:01:31,135 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:01:31,135 INFO L195 NwaCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:01:31,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2022-04-28 03:01:31,341 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:01:31,535 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:01:31,536 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:01:31,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:01:31,536 INFO L85 PathProgramCache]: Analyzing trace with hash 963880476, now seen corresponding path program 51 times [2022-04-28 03:01:31,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:31,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [982444887] [2022-04-28 03:01:31,676 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:31,677 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:01:31,679 INFO L85 PathProgramCache]: Analyzing trace with hash -389674185, now seen corresponding path program 1 times [2022-04-28 03:01:31,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:31,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46332468] [2022-04-28 03:01:31,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:31,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:31,683 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_26.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_26.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:01:31,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:01:31,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2111298011] [2022-04-28 03:01:31,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:31,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:31,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:01:31,687 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:01:31,698 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:01:31,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:01:31,773 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:01:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:01:31,785 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:01:31,785 INFO L85 PathProgramCache]: Analyzing trace with hash 963880476, now seen corresponding path program 52 times [2022-04-28 03:01:31,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:31,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971485726] [2022-04-28 03:01:31,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:31,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:31,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:32,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:01:32,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:32,288 INFO L290 TraceCheckUtils]: 0: Hoare triple {9587#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {9555#true} is VALID [2022-04-28 03:01:32,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {9555#true} assume true; {9555#true} is VALID [2022-04-28 03:01:32,288 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9555#true} {9555#true} #34#return; {9555#true} is VALID [2022-04-28 03:01:32,288 INFO L272 TraceCheckUtils]: 0: Hoare triple {9555#true} call ULTIMATE.init(); {9587#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:01:32,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {9587#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {9555#true} is VALID [2022-04-28 03:01:32,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {9555#true} assume true; {9555#true} is VALID [2022-04-28 03:01:32,288 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9555#true} {9555#true} #34#return; {9555#true} is VALID [2022-04-28 03:01:32,289 INFO L272 TraceCheckUtils]: 4: Hoare triple {9555#true} call #t~ret4 := main(); {9555#true} is VALID [2022-04-28 03:01:32,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {9555#true} ~x~0 := 0; {9560#(= main_~x~0 0)} is VALID [2022-04-28 03:01:32,289 INFO L290 TraceCheckUtils]: 6: Hoare triple {9560#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9561#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:01:32,290 INFO L290 TraceCheckUtils]: 7: Hoare triple {9561#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9562#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:01:32,290 INFO L290 TraceCheckUtils]: 8: Hoare triple {9562#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9563#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:01:32,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {9563#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9564#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:01:32,291 INFO L290 TraceCheckUtils]: 10: Hoare triple {9564#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9565#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:01:32,292 INFO L290 TraceCheckUtils]: 11: Hoare triple {9565#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9566#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:01:32,292 INFO L290 TraceCheckUtils]: 12: Hoare triple {9566#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9567#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:01:32,292 INFO L290 TraceCheckUtils]: 13: Hoare triple {9567#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9568#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:01:32,293 INFO L290 TraceCheckUtils]: 14: Hoare triple {9568#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9569#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:01:32,293 INFO L290 TraceCheckUtils]: 15: Hoare triple {9569#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9570#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:01:32,294 INFO L290 TraceCheckUtils]: 16: Hoare triple {9570#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9571#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:01:32,294 INFO L290 TraceCheckUtils]: 17: Hoare triple {9571#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9572#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:01:32,295 INFO L290 TraceCheckUtils]: 18: Hoare triple {9572#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9573#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:01:32,295 INFO L290 TraceCheckUtils]: 19: Hoare triple {9573#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9574#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:01:32,296 INFO L290 TraceCheckUtils]: 20: Hoare triple {9574#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9575#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:01:32,296 INFO L290 TraceCheckUtils]: 21: Hoare triple {9575#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9576#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:01:32,297 INFO L290 TraceCheckUtils]: 22: Hoare triple {9576#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9577#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:01:32,297 INFO L290 TraceCheckUtils]: 23: Hoare triple {9577#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9578#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:01:32,298 INFO L290 TraceCheckUtils]: 24: Hoare triple {9578#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9579#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:01:32,298 INFO L290 TraceCheckUtils]: 25: Hoare triple {9579#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9580#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:01:32,298 INFO L290 TraceCheckUtils]: 26: Hoare triple {9580#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9581#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:01:32,299 INFO L290 TraceCheckUtils]: 27: Hoare triple {9581#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9582#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:01:32,299 INFO L290 TraceCheckUtils]: 28: Hoare triple {9582#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9583#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:01:32,300 INFO L290 TraceCheckUtils]: 29: Hoare triple {9583#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9584#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:01:32,300 INFO L290 TraceCheckUtils]: 30: Hoare triple {9584#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9585#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:01:32,301 INFO L290 TraceCheckUtils]: 31: Hoare triple {9585#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9586#(and (<= main_~x~0 52) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:01:32,301 INFO L290 TraceCheckUtils]: 32: Hoare triple {9586#(and (<= main_~x~0 52) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {9556#false} is VALID [2022-04-28 03:01:32,301 INFO L272 TraceCheckUtils]: 33: Hoare triple {9556#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {9556#false} is VALID [2022-04-28 03:01:32,301 INFO L290 TraceCheckUtils]: 34: Hoare triple {9556#false} ~cond := #in~cond; {9556#false} is VALID [2022-04-28 03:01:32,301 INFO L290 TraceCheckUtils]: 35: Hoare triple {9556#false} assume 0 == ~cond; {9556#false} is VALID [2022-04-28 03:01:32,302 INFO L290 TraceCheckUtils]: 36: Hoare triple {9556#false} assume !false; {9556#false} is VALID [2022-04-28 03:01:32,302 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:01:32,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:01:32,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971485726] [2022-04-28 03:01:32,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971485726] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:01:32,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735184868] [2022-04-28 03:01:32,302 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:01:32,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:32,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:01:32,303 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:01:32,304 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:01:32,368 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:01:32,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:01:32,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 55 conjunts are in the unsatisfiable core [2022-04-28 03:01:32,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:32,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:01:32,707 INFO L272 TraceCheckUtils]: 0: Hoare triple {9555#true} call ULTIMATE.init(); {9555#true} is VALID [2022-04-28 03:01:32,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {9555#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {9555#true} is VALID [2022-04-28 03:01:32,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {9555#true} assume true; {9555#true} is VALID [2022-04-28 03:01:32,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9555#true} {9555#true} #34#return; {9555#true} is VALID [2022-04-28 03:01:32,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {9555#true} call #t~ret4 := main(); {9555#true} is VALID [2022-04-28 03:01:32,708 INFO L290 TraceCheckUtils]: 5: Hoare triple {9555#true} ~x~0 := 0; {9560#(= main_~x~0 0)} is VALID [2022-04-28 03:01:32,708 INFO L290 TraceCheckUtils]: 6: Hoare triple {9560#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9561#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:01:32,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {9561#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9562#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:01:32,709 INFO L290 TraceCheckUtils]: 8: Hoare triple {9562#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9563#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:01:32,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {9563#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9564#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:01:32,710 INFO L290 TraceCheckUtils]: 10: Hoare triple {9564#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9565#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:01:32,710 INFO L290 TraceCheckUtils]: 11: Hoare triple {9565#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9566#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:01:32,711 INFO L290 TraceCheckUtils]: 12: Hoare triple {9566#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9567#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:01:32,711 INFO L290 TraceCheckUtils]: 13: Hoare triple {9567#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9568#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:01:32,712 INFO L290 TraceCheckUtils]: 14: Hoare triple {9568#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9569#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:01:32,712 INFO L290 TraceCheckUtils]: 15: Hoare triple {9569#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9570#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:01:32,713 INFO L290 TraceCheckUtils]: 16: Hoare triple {9570#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9571#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:01:32,713 INFO L290 TraceCheckUtils]: 17: Hoare triple {9571#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9572#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:01:32,714 INFO L290 TraceCheckUtils]: 18: Hoare triple {9572#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9573#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:01:32,714 INFO L290 TraceCheckUtils]: 19: Hoare triple {9573#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9574#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:01:32,715 INFO L290 TraceCheckUtils]: 20: Hoare triple {9574#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9575#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:01:32,715 INFO L290 TraceCheckUtils]: 21: Hoare triple {9575#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9576#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:01:32,716 INFO L290 TraceCheckUtils]: 22: Hoare triple {9576#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9577#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:01:32,716 INFO L290 TraceCheckUtils]: 23: Hoare triple {9577#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9578#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:01:32,717 INFO L290 TraceCheckUtils]: 24: Hoare triple {9578#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9579#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:01:32,717 INFO L290 TraceCheckUtils]: 25: Hoare triple {9579#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9580#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:01:32,718 INFO L290 TraceCheckUtils]: 26: Hoare triple {9580#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9581#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:01:32,718 INFO L290 TraceCheckUtils]: 27: Hoare triple {9581#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9582#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:01:32,719 INFO L290 TraceCheckUtils]: 28: Hoare triple {9582#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9583#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:01:32,719 INFO L290 TraceCheckUtils]: 29: Hoare triple {9583#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9584#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:01:32,720 INFO L290 TraceCheckUtils]: 30: Hoare triple {9584#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9585#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:01:32,720 INFO L290 TraceCheckUtils]: 31: Hoare triple {9585#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9684#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:01:32,721 INFO L290 TraceCheckUtils]: 32: Hoare triple {9684#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {9556#false} is VALID [2022-04-28 03:01:32,721 INFO L272 TraceCheckUtils]: 33: Hoare triple {9556#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {9556#false} is VALID [2022-04-28 03:01:32,721 INFO L290 TraceCheckUtils]: 34: Hoare triple {9556#false} ~cond := #in~cond; {9556#false} is VALID [2022-04-28 03:01:32,721 INFO L290 TraceCheckUtils]: 35: Hoare triple {9556#false} assume 0 == ~cond; {9556#false} is VALID [2022-04-28 03:01:32,721 INFO L290 TraceCheckUtils]: 36: Hoare triple {9556#false} assume !false; {9556#false} is VALID [2022-04-28 03:01:32,721 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:01:32,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:01:33,849 INFO L290 TraceCheckUtils]: 36: Hoare triple {9556#false} assume !false; {9556#false} is VALID [2022-04-28 03:01:33,849 INFO L290 TraceCheckUtils]: 35: Hoare triple {9556#false} assume 0 == ~cond; {9556#false} is VALID [2022-04-28 03:01:33,849 INFO L290 TraceCheckUtils]: 34: Hoare triple {9556#false} ~cond := #in~cond; {9556#false} is VALID [2022-04-28 03:01:33,849 INFO L272 TraceCheckUtils]: 33: Hoare triple {9556#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {9556#false} is VALID [2022-04-28 03:01:33,850 INFO L290 TraceCheckUtils]: 32: Hoare triple {9712#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {9556#false} is VALID [2022-04-28 03:01:33,850 INFO L290 TraceCheckUtils]: 31: Hoare triple {9716#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9712#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:01:33,851 INFO L290 TraceCheckUtils]: 30: Hoare triple {9720#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9716#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 03:01:33,851 INFO L290 TraceCheckUtils]: 29: Hoare triple {9724#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9720#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 03:01:33,852 INFO L290 TraceCheckUtils]: 28: Hoare triple {9728#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9724#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 03:01:33,853 INFO L290 TraceCheckUtils]: 27: Hoare triple {9732#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9728#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 03:01:33,853 INFO L290 TraceCheckUtils]: 26: Hoare triple {9736#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9732#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-28 03:01:33,854 INFO L290 TraceCheckUtils]: 25: Hoare triple {9740#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9736#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-28 03:01:33,854 INFO L290 TraceCheckUtils]: 24: Hoare triple {9744#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9740#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-28 03:01:33,855 INFO L290 TraceCheckUtils]: 23: Hoare triple {9748#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9744#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-28 03:01:33,856 INFO L290 TraceCheckUtils]: 22: Hoare triple {9752#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9748#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-28 03:01:33,856 INFO L290 TraceCheckUtils]: 21: Hoare triple {9756#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9752#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-28 03:01:33,857 INFO L290 TraceCheckUtils]: 20: Hoare triple {9760#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9756#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-28 03:01:33,865 INFO L290 TraceCheckUtils]: 19: Hoare triple {9764#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9760#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-28 03:01:33,866 INFO L290 TraceCheckUtils]: 18: Hoare triple {9768#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9764#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-28 03:01:33,866 INFO L290 TraceCheckUtils]: 17: Hoare triple {9772#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9768#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-28 03:01:33,867 INFO L290 TraceCheckUtils]: 16: Hoare triple {9776#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9772#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:01:33,868 INFO L290 TraceCheckUtils]: 15: Hoare triple {9780#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9776#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:01:33,868 INFO L290 TraceCheckUtils]: 14: Hoare triple {9784#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9780#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-28 03:01:33,869 INFO L290 TraceCheckUtils]: 13: Hoare triple {9788#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9784#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-28 03:01:33,869 INFO L290 TraceCheckUtils]: 12: Hoare triple {9792#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9788#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-28 03:01:33,870 INFO L290 TraceCheckUtils]: 11: Hoare triple {9796#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9792#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:01:33,871 INFO L290 TraceCheckUtils]: 10: Hoare triple {9800#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9796#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:01:33,871 INFO L290 TraceCheckUtils]: 9: Hoare triple {9804#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9800#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:01:33,872 INFO L290 TraceCheckUtils]: 8: Hoare triple {9808#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9804#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-28 03:01:33,872 INFO L290 TraceCheckUtils]: 7: Hoare triple {9812#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9808#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-28 03:01:33,873 INFO L290 TraceCheckUtils]: 6: Hoare triple {9816#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {9812#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-28 03:01:33,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {9555#true} ~x~0 := 0; {9816#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-28 03:01:33,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {9555#true} call #t~ret4 := main(); {9555#true} is VALID [2022-04-28 03:01:33,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9555#true} {9555#true} #34#return; {9555#true} is VALID [2022-04-28 03:01:33,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {9555#true} assume true; {9555#true} is VALID [2022-04-28 03:01:33,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {9555#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {9555#true} is VALID [2022-04-28 03:01:33,874 INFO L272 TraceCheckUtils]: 0: Hoare triple {9555#true} call ULTIMATE.init(); {9555#true} is VALID [2022-04-28 03:01:33,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:01:33,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735184868] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:01:33,874 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:01:33,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 58 [2022-04-28 03:01:33,874 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:01:33,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [982444887] [2022-04-28 03:01:33,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [982444887] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:01:33,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:01:33,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-28 03:01:33,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39571290] [2022-04-28 03:01:33,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:01:33,875 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:01:33,875 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:01:33,875 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:01:33,895 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:01:33,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-28 03:01:33,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:33,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-28 03:01:33,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=896, Invalid=2410, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 03:01:33,896 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:01:35,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:35,449 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-28 03:01:35,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-28 03:01:35,449 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:01:35,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:01:35,449 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:01:35,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2022-04-28 03:01:35,450 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:01:35,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2022-04-28 03:01:35,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 44 transitions. [2022-04-28 03:01:35,478 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:01:35,479 INFO L225 Difference]: With dead ends: 44 [2022-04-28 03:01:35,479 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 03:01:35,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1785, Invalid=5355, Unknown=0, NotChecked=0, Total=7140 [2022-04-28 03:01:35,480 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:01:35,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 128 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 03:01:35,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 03:01:35,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-28 03:01:35,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:01:35,515 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:01:35,515 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:01:35,515 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:01:35,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:35,516 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-28 03:01:35,516 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-28 03:01:35,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:35,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:35,516 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:01:35,516 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:01:35,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:35,517 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-28 03:01:35,517 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-28 03:01:35,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:35,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:35,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:01:35,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:01:35,517 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:01:35,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2022-04-28 03:01:35,518 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2022-04-28 03:01:35,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:01:35,518 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2022-04-28 03:01:35,518 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:01:35,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 39 transitions. [2022-04-28 03:01:35,554 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:01:35,554 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-28 03:01:35,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 03:01:35,554 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:01:35,554 INFO L195 NwaCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:01:35,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2022-04-28 03:01:35,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Forceful destruction successful, exit code 0 [2022-04-28 03:01:35,955 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:01:35,955 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:01:35,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:01:35,955 INFO L85 PathProgramCache]: Analyzing trace with hash -148015050, now seen corresponding path program 53 times [2022-04-28 03:01:35,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:35,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [617857696] [2022-04-28 03:01:36,091 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:36,094 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:01:36,096 INFO L85 PathProgramCache]: Analyzing trace with hash -330568841, now seen corresponding path program 1 times [2022-04-28 03:01:36,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:36,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724001998] [2022-04-28 03:01:36,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:36,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:36,100 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_27.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_27.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:01:36,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:01:36,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [601394903] [2022-04-28 03:01:36,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:36,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:36,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:01:36,104 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:01:36,105 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:01:36,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:01:36,144 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:01:36,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:01:36,151 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:01:36,151 INFO L85 PathProgramCache]: Analyzing trace with hash -148015050, now seen corresponding path program 54 times [2022-04-28 03:01:36,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:36,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381026020] [2022-04-28 03:01:36,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:36,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:36,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:36,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:01:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:36,633 INFO L290 TraceCheckUtils]: 0: Hoare triple {10168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {10135#true} is VALID [2022-04-28 03:01:36,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {10135#true} assume true; {10135#true} is VALID [2022-04-28 03:01:36,634 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10135#true} {10135#true} #34#return; {10135#true} is VALID [2022-04-28 03:01:36,634 INFO L272 TraceCheckUtils]: 0: Hoare triple {10135#true} call ULTIMATE.init(); {10168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:01:36,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {10168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {10135#true} is VALID [2022-04-28 03:01:36,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {10135#true} assume true; {10135#true} is VALID [2022-04-28 03:01:36,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10135#true} {10135#true} #34#return; {10135#true} is VALID [2022-04-28 03:01:36,634 INFO L272 TraceCheckUtils]: 4: Hoare triple {10135#true} call #t~ret4 := main(); {10135#true} is VALID [2022-04-28 03:01:36,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {10135#true} ~x~0 := 0; {10140#(= main_~x~0 0)} is VALID [2022-04-28 03:01:36,639 INFO L290 TraceCheckUtils]: 6: Hoare triple {10140#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10141#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:01:36,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {10141#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10142#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:01:36,640 INFO L290 TraceCheckUtils]: 8: Hoare triple {10142#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10143#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:01:36,640 INFO L290 TraceCheckUtils]: 9: Hoare triple {10143#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10144#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:01:36,641 INFO L290 TraceCheckUtils]: 10: Hoare triple {10144#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10145#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:01:36,641 INFO L290 TraceCheckUtils]: 11: Hoare triple {10145#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10146#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:01:36,642 INFO L290 TraceCheckUtils]: 12: Hoare triple {10146#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10147#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:01:36,642 INFO L290 TraceCheckUtils]: 13: Hoare triple {10147#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10148#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:01:36,643 INFO L290 TraceCheckUtils]: 14: Hoare triple {10148#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10149#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:01:36,643 INFO L290 TraceCheckUtils]: 15: Hoare triple {10149#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10150#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:01:36,644 INFO L290 TraceCheckUtils]: 16: Hoare triple {10150#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10151#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:01:36,644 INFO L290 TraceCheckUtils]: 17: Hoare triple {10151#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10152#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:01:36,645 INFO L290 TraceCheckUtils]: 18: Hoare triple {10152#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10153#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:01:36,645 INFO L290 TraceCheckUtils]: 19: Hoare triple {10153#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10154#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:01:36,646 INFO L290 TraceCheckUtils]: 20: Hoare triple {10154#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10155#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:01:36,646 INFO L290 TraceCheckUtils]: 21: Hoare triple {10155#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10156#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:01:36,646 INFO L290 TraceCheckUtils]: 22: Hoare triple {10156#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10157#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:01:36,647 INFO L290 TraceCheckUtils]: 23: Hoare triple {10157#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10158#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:01:36,647 INFO L290 TraceCheckUtils]: 24: Hoare triple {10158#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10159#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:01:36,648 INFO L290 TraceCheckUtils]: 25: Hoare triple {10159#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10160#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:01:36,648 INFO L290 TraceCheckUtils]: 26: Hoare triple {10160#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10161#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:01:36,649 INFO L290 TraceCheckUtils]: 27: Hoare triple {10161#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10162#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:01:36,649 INFO L290 TraceCheckUtils]: 28: Hoare triple {10162#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10163#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:01:36,650 INFO L290 TraceCheckUtils]: 29: Hoare triple {10163#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10164#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:01:36,650 INFO L290 TraceCheckUtils]: 30: Hoare triple {10164#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10165#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:01:36,651 INFO L290 TraceCheckUtils]: 31: Hoare triple {10165#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10166#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:01:36,651 INFO L290 TraceCheckUtils]: 32: Hoare triple {10166#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10167#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 54))} is VALID [2022-04-28 03:01:36,652 INFO L290 TraceCheckUtils]: 33: Hoare triple {10167#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 54))} assume !(~x~0 % 4294967296 < 268435455); {10136#false} is VALID [2022-04-28 03:01:36,652 INFO L272 TraceCheckUtils]: 34: Hoare triple {10136#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {10136#false} is VALID [2022-04-28 03:01:36,652 INFO L290 TraceCheckUtils]: 35: Hoare triple {10136#false} ~cond := #in~cond; {10136#false} is VALID [2022-04-28 03:01:36,652 INFO L290 TraceCheckUtils]: 36: Hoare triple {10136#false} assume 0 == ~cond; {10136#false} is VALID [2022-04-28 03:01:36,652 INFO L290 TraceCheckUtils]: 37: Hoare triple {10136#false} assume !false; {10136#false} is VALID [2022-04-28 03:01:36,652 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:01:36,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:01:36,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381026020] [2022-04-28 03:01:36,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381026020] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:01:36,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456057421] [2022-04-28 03:01:36,653 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:01:36,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:36,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:01:36,654 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:01:36,654 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:01:37,265 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2022-04-28 03:01:37,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:01:37,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 59 conjunts are in the unsatisfiable core [2022-04-28 03:01:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:37,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:01:37,633 INFO L272 TraceCheckUtils]: 0: Hoare triple {10135#true} call ULTIMATE.init(); {10135#true} is VALID [2022-04-28 03:01:37,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {10135#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {10135#true} is VALID [2022-04-28 03:01:37,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {10135#true} assume true; {10135#true} is VALID [2022-04-28 03:01:37,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10135#true} {10135#true} #34#return; {10135#true} is VALID [2022-04-28 03:01:37,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {10135#true} call #t~ret4 := main(); {10135#true} is VALID [2022-04-28 03:01:37,634 INFO L290 TraceCheckUtils]: 5: Hoare triple {10135#true} ~x~0 := 0; {10140#(= main_~x~0 0)} is VALID [2022-04-28 03:01:37,634 INFO L290 TraceCheckUtils]: 6: Hoare triple {10140#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10141#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:01:37,634 INFO L290 TraceCheckUtils]: 7: Hoare triple {10141#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10142#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:01:37,635 INFO L290 TraceCheckUtils]: 8: Hoare triple {10142#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10143#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:01:37,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {10143#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10144#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:01:37,636 INFO L290 TraceCheckUtils]: 10: Hoare triple {10144#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10145#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:01:37,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {10145#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10146#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:01:37,637 INFO L290 TraceCheckUtils]: 12: Hoare triple {10146#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10147#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:01:37,637 INFO L290 TraceCheckUtils]: 13: Hoare triple {10147#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10148#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:01:37,638 INFO L290 TraceCheckUtils]: 14: Hoare triple {10148#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10149#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:01:37,638 INFO L290 TraceCheckUtils]: 15: Hoare triple {10149#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10150#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:01:37,639 INFO L290 TraceCheckUtils]: 16: Hoare triple {10150#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10151#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:01:37,639 INFO L290 TraceCheckUtils]: 17: Hoare triple {10151#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10152#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:01:37,640 INFO L290 TraceCheckUtils]: 18: Hoare triple {10152#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10153#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:01:37,640 INFO L290 TraceCheckUtils]: 19: Hoare triple {10153#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10154#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:01:37,641 INFO L290 TraceCheckUtils]: 20: Hoare triple {10154#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10155#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:01:37,641 INFO L290 TraceCheckUtils]: 21: Hoare triple {10155#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10156#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:01:37,642 INFO L290 TraceCheckUtils]: 22: Hoare triple {10156#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10157#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:01:37,642 INFO L290 TraceCheckUtils]: 23: Hoare triple {10157#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10158#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:01:37,642 INFO L290 TraceCheckUtils]: 24: Hoare triple {10158#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10159#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:01:37,643 INFO L290 TraceCheckUtils]: 25: Hoare triple {10159#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10160#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:01:37,643 INFO L290 TraceCheckUtils]: 26: Hoare triple {10160#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10161#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:01:37,644 INFO L290 TraceCheckUtils]: 27: Hoare triple {10161#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10162#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:01:37,644 INFO L290 TraceCheckUtils]: 28: Hoare triple {10162#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10163#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:01:37,645 INFO L290 TraceCheckUtils]: 29: Hoare triple {10163#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10164#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:01:37,645 INFO L290 TraceCheckUtils]: 30: Hoare triple {10164#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10165#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:01:37,646 INFO L290 TraceCheckUtils]: 31: Hoare triple {10165#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10166#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:01:37,646 INFO L290 TraceCheckUtils]: 32: Hoare triple {10166#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10268#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:01:37,647 INFO L290 TraceCheckUtils]: 33: Hoare triple {10268#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {10136#false} is VALID [2022-04-28 03:01:37,647 INFO L272 TraceCheckUtils]: 34: Hoare triple {10136#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {10136#false} is VALID [2022-04-28 03:01:37,647 INFO L290 TraceCheckUtils]: 35: Hoare triple {10136#false} ~cond := #in~cond; {10136#false} is VALID [2022-04-28 03:01:37,647 INFO L290 TraceCheckUtils]: 36: Hoare triple {10136#false} assume 0 == ~cond; {10136#false} is VALID [2022-04-28 03:01:37,647 INFO L290 TraceCheckUtils]: 37: Hoare triple {10136#false} assume !false; {10136#false} is VALID [2022-04-28 03:01:37,647 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:01:37,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:01:42,081 INFO L290 TraceCheckUtils]: 37: Hoare triple {10136#false} assume !false; {10136#false} is VALID [2022-04-28 03:01:42,082 INFO L290 TraceCheckUtils]: 36: Hoare triple {10136#false} assume 0 == ~cond; {10136#false} is VALID [2022-04-28 03:01:42,082 INFO L290 TraceCheckUtils]: 35: Hoare triple {10136#false} ~cond := #in~cond; {10136#false} is VALID [2022-04-28 03:01:42,082 INFO L272 TraceCheckUtils]: 34: Hoare triple {10136#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {10136#false} is VALID [2022-04-28 03:01:42,088 INFO L290 TraceCheckUtils]: 33: Hoare triple {10296#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {10136#false} is VALID [2022-04-28 03:01:42,089 INFO L290 TraceCheckUtils]: 32: Hoare triple {10300#(or (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10296#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:01:42,090 INFO L290 TraceCheckUtils]: 31: Hoare triple {10304#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10300#(or (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} is VALID [2022-04-28 03:01:42,091 INFO L290 TraceCheckUtils]: 30: Hoare triple {10308#(or (<= 268435455 (mod (+ main_~x~0 4) 4294967296)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10304#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} is VALID [2022-04-28 03:01:42,091 INFO L290 TraceCheckUtils]: 29: Hoare triple {10312#(or (<= 268435455 (mod (+ main_~x~0 6) 4294967296)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10308#(or (<= 268435455 (mod (+ main_~x~0 4) 4294967296)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} is VALID [2022-04-28 03:01:42,092 INFO L290 TraceCheckUtils]: 28: Hoare triple {10316#(or (<= 268435455 (mod (+ main_~x~0 8) 4294967296)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10312#(or (<= 268435455 (mod (+ main_~x~0 6) 4294967296)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} is VALID [2022-04-28 03:01:42,093 INFO L290 TraceCheckUtils]: 27: Hoare triple {10320#(or (<= 268435455 (mod (+ main_~x~0 10) 4294967296)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10316#(or (<= 268435455 (mod (+ main_~x~0 8) 4294967296)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} is VALID [2022-04-28 03:01:42,094 INFO L290 TraceCheckUtils]: 26: Hoare triple {10324#(or (<= 268435455 (mod (+ main_~x~0 12) 4294967296)) (< (mod (+ main_~x~0 14) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10320#(or (<= 268435455 (mod (+ main_~x~0 10) 4294967296)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} is VALID [2022-04-28 03:01:42,094 INFO L290 TraceCheckUtils]: 25: Hoare triple {10328#(or (<= 268435455 (mod (+ main_~x~0 14) 4294967296)) (< (mod (+ main_~x~0 16) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10324#(or (<= 268435455 (mod (+ main_~x~0 12) 4294967296)) (< (mod (+ main_~x~0 14) 4294967296) 268435455))} is VALID [2022-04-28 03:01:42,095 INFO L290 TraceCheckUtils]: 24: Hoare triple {10332#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 16) 4294967296)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10328#(or (<= 268435455 (mod (+ main_~x~0 14) 4294967296)) (< (mod (+ main_~x~0 16) 4294967296) 268435455))} is VALID [2022-04-28 03:01:42,096 INFO L290 TraceCheckUtils]: 23: Hoare triple {10336#(or (< (mod (+ main_~x~0 20) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 18) 4294967296)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10332#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 16) 4294967296)))} is VALID [2022-04-28 03:01:42,097 INFO L290 TraceCheckUtils]: 22: Hoare triple {10340#(or (<= 268435455 (mod (+ main_~x~0 20) 4294967296)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10336#(or (< (mod (+ main_~x~0 20) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 18) 4294967296)))} is VALID [2022-04-28 03:01:42,098 INFO L290 TraceCheckUtils]: 21: Hoare triple {10344#(or (<= 268435455 (mod (+ main_~x~0 22) 4294967296)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10340#(or (<= 268435455 (mod (+ main_~x~0 20) 4294967296)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} is VALID [2022-04-28 03:01:42,098 INFO L290 TraceCheckUtils]: 20: Hoare triple {10348#(or (<= 268435455 (mod (+ main_~x~0 24) 4294967296)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10344#(or (<= 268435455 (mod (+ main_~x~0 22) 4294967296)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} is VALID [2022-04-28 03:01:42,099 INFO L290 TraceCheckUtils]: 19: Hoare triple {10352#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 26) 4294967296)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10348#(or (<= 268435455 (mod (+ main_~x~0 24) 4294967296)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} is VALID [2022-04-28 03:01:42,100 INFO L290 TraceCheckUtils]: 18: Hoare triple {10356#(or (<= 268435455 (mod (+ main_~x~0 28) 4294967296)) (< (mod (+ 30 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10352#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 26) 4294967296)))} is VALID [2022-04-28 03:01:42,101 INFO L290 TraceCheckUtils]: 17: Hoare triple {10360#(or (<= 268435455 (mod (+ 30 main_~x~0) 4294967296)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10356#(or (<= 268435455 (mod (+ main_~x~0 28) 4294967296)) (< (mod (+ 30 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:01:42,101 INFO L290 TraceCheckUtils]: 16: Hoare triple {10364#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (<= 268435455 (mod (+ 32 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10360#(or (<= 268435455 (mod (+ 30 main_~x~0) 4294967296)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:01:42,102 INFO L290 TraceCheckUtils]: 15: Hoare triple {10368#(or (< (mod (+ main_~x~0 36) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 34) 4294967296)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10364#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (<= 268435455 (mod (+ 32 main_~x~0) 4294967296)))} is VALID [2022-04-28 03:01:42,103 INFO L290 TraceCheckUtils]: 14: Hoare triple {10372#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 36) 4294967296)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10368#(or (< (mod (+ main_~x~0 36) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 34) 4294967296)))} is VALID [2022-04-28 03:01:42,104 INFO L290 TraceCheckUtils]: 13: Hoare triple {10376#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 38) 4294967296)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10372#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 36) 4294967296)))} is VALID [2022-04-28 03:01:42,104 INFO L290 TraceCheckUtils]: 12: Hoare triple {10380#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (<= 268435455 (mod (+ 40 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10376#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (<= 268435455 (mod (+ main_~x~0 38) 4294967296)))} is VALID [2022-04-28 03:01:42,105 INFO L290 TraceCheckUtils]: 11: Hoare triple {10384#(or (<= 268435455 (mod (+ 42 main_~x~0) 4294967296)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10380#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (<= 268435455 (mod (+ 40 main_~x~0) 4294967296)))} is VALID [2022-04-28 03:01:42,106 INFO L290 TraceCheckUtils]: 10: Hoare triple {10388#(or (<= 268435455 (mod (+ 44 main_~x~0) 4294967296)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10384#(or (<= 268435455 (mod (+ 42 main_~x~0) 4294967296)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:01:42,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {10392#(or (<= 268435455 (mod (+ main_~x~0 46) 4294967296)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10388#(or (<= 268435455 (mod (+ 44 main_~x~0) 4294967296)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} is VALID [2022-04-28 03:01:42,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {10396#(or (<= 268435455 (mod (+ main_~x~0 48) 4294967296)) (< (mod (+ main_~x~0 50) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10392#(or (<= 268435455 (mod (+ main_~x~0 46) 4294967296)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} is VALID [2022-04-28 03:01:42,108 INFO L290 TraceCheckUtils]: 7: Hoare triple {10400#(or (<= 268435455 (mod (+ main_~x~0 50) 4294967296)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10396#(or (<= 268435455 (mod (+ main_~x~0 48) 4294967296)) (< (mod (+ main_~x~0 50) 4294967296) 268435455))} is VALID [2022-04-28 03:01:42,109 INFO L290 TraceCheckUtils]: 6: Hoare triple {10404#(or (<= 268435455 (mod (+ main_~x~0 52) 4294967296)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10400#(or (<= 268435455 (mod (+ main_~x~0 50) 4294967296)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} is VALID [2022-04-28 03:01:42,109 INFO L290 TraceCheckUtils]: 5: Hoare triple {10135#true} ~x~0 := 0; {10404#(or (<= 268435455 (mod (+ main_~x~0 52) 4294967296)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} is VALID [2022-04-28 03:01:42,109 INFO L272 TraceCheckUtils]: 4: Hoare triple {10135#true} call #t~ret4 := main(); {10135#true} is VALID [2022-04-28 03:01:42,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10135#true} {10135#true} #34#return; {10135#true} is VALID [2022-04-28 03:01:42,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {10135#true} assume true; {10135#true} is VALID [2022-04-28 03:01:42,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {10135#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {10135#true} is VALID [2022-04-28 03:01:42,110 INFO L272 TraceCheckUtils]: 0: Hoare triple {10135#true} call ULTIMATE.init(); {10135#true} is VALID [2022-04-28 03:01:42,110 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:01:42,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456057421] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:01:42,110 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:01:42,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 60 [2022-04-28 03:01:42,111 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:01:42,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [617857696] [2022-04-28 03:01:42,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [617857696] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:01:42,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:01:42,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-28 03:01:42,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569778021] [2022-04-28 03:01:42,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:01:42,111 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:01:42,111 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:01:42,111 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:01:42,131 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:01:42,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-28 03:01:42,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:42,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-28 03:01:42,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=957, Invalid=2583, Unknown=0, NotChecked=0, Total=3540 [2022-04-28 03:01:42,135 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:01:43,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:43,799 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-28 03:01:43,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-28 03:01:43,799 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:01:43,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:01:43,800 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:01:43,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2022-04-28 03:01:43,800 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:01:43,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2022-04-28 03:01:43,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 45 transitions. [2022-04-28 03:01:43,829 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:01:43,829 INFO L225 Difference]: With dead ends: 45 [2022-04-28 03:01:43,829 INFO L226 Difference]: Without dead ends: 40 [2022-04-28 03:01:43,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1907, Invalid=5749, Unknown=0, NotChecked=0, Total=7656 [2022-04-28 03:01:43,840 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 843 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 843 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:01:43,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 98 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 843 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 03:01:43,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-28 03:01:43,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-28 03:01:43,877 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:01:43,877 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:01:43,877 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:01:43,877 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:01:43,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:43,878 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-28 03:01:43,878 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-28 03:01:43,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:43,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:43,878 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:01:43,878 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:01:43,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:43,878 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-04-28 03:01:43,879 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-28 03:01:43,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:43,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:43,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:01:43,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:01:43,879 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:01:43,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2022-04-28 03:01:43,879 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2022-04-28 03:01:43,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:01:43,880 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2022-04-28 03:01:43,880 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:01:43,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 40 transitions. [2022-04-28 03:01:43,919 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:01:43,919 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2022-04-28 03:01:43,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 03:01:43,919 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:01:43,919 INFO L195 NwaCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:01:43,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2022-04-28 03:01:44,127 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:01:44,323 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:01:44,323 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:01:44,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:01:44,324 INFO L85 PathProgramCache]: Analyzing trace with hash -257037988, now seen corresponding path program 55 times [2022-04-28 03:01:44,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:44,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1842018908] [2022-04-28 03:01:44,463 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:44,464 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:01:44,467 INFO L85 PathProgramCache]: Analyzing trace with hash -271463497, now seen corresponding path program 1 times [2022-04-28 03:01:44,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:44,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274324556] [2022-04-28 03:01:44,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:44,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:44,472 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_28.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_28.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:01:44,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:01:44,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [80850489] [2022-04-28 03:01:44,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:44,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:44,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:01:44,477 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:01:44,478 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:01:44,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:01:44,517 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:01:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:01:44,525 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:01:44,526 INFO L85 PathProgramCache]: Analyzing trace with hash -257037988, now seen corresponding path program 56 times [2022-04-28 03:01:44,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:44,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190653104] [2022-04-28 03:01:44,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:44,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:44,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:45,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:01:45,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:45,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {10765#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {10731#true} is VALID [2022-04-28 03:01:45,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {10731#true} assume true; {10731#true} is VALID [2022-04-28 03:01:45,045 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10731#true} {10731#true} #34#return; {10731#true} is VALID [2022-04-28 03:01:45,045 INFO L272 TraceCheckUtils]: 0: Hoare triple {10731#true} call ULTIMATE.init(); {10765#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:01:45,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {10765#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {10731#true} is VALID [2022-04-28 03:01:45,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {10731#true} assume true; {10731#true} is VALID [2022-04-28 03:01:45,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10731#true} {10731#true} #34#return; {10731#true} is VALID [2022-04-28 03:01:45,046 INFO L272 TraceCheckUtils]: 4: Hoare triple {10731#true} call #t~ret4 := main(); {10731#true} is VALID [2022-04-28 03:01:45,046 INFO L290 TraceCheckUtils]: 5: Hoare triple {10731#true} ~x~0 := 0; {10736#(= main_~x~0 0)} is VALID [2022-04-28 03:01:45,046 INFO L290 TraceCheckUtils]: 6: Hoare triple {10736#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10737#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:01:45,047 INFO L290 TraceCheckUtils]: 7: Hoare triple {10737#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10738#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:01:45,047 INFO L290 TraceCheckUtils]: 8: Hoare triple {10738#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10739#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:01:45,048 INFO L290 TraceCheckUtils]: 9: Hoare triple {10739#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10740#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:01:45,048 INFO L290 TraceCheckUtils]: 10: Hoare triple {10740#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10741#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:01:45,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {10741#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10742#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:01:45,049 INFO L290 TraceCheckUtils]: 12: Hoare triple {10742#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10743#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:01:45,050 INFO L290 TraceCheckUtils]: 13: Hoare triple {10743#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10744#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:01:45,050 INFO L290 TraceCheckUtils]: 14: Hoare triple {10744#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10745#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:01:45,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {10745#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10746#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:01:45,051 INFO L290 TraceCheckUtils]: 16: Hoare triple {10746#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10747#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:01:45,052 INFO L290 TraceCheckUtils]: 17: Hoare triple {10747#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10748#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:01:45,052 INFO L290 TraceCheckUtils]: 18: Hoare triple {10748#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10749#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:01:45,053 INFO L290 TraceCheckUtils]: 19: Hoare triple {10749#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10750#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:01:45,053 INFO L290 TraceCheckUtils]: 20: Hoare triple {10750#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10751#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:01:45,054 INFO L290 TraceCheckUtils]: 21: Hoare triple {10751#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10752#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:01:45,054 INFO L290 TraceCheckUtils]: 22: Hoare triple {10752#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10753#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:01:45,055 INFO L290 TraceCheckUtils]: 23: Hoare triple {10753#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10754#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:01:45,055 INFO L290 TraceCheckUtils]: 24: Hoare triple {10754#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10755#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:01:45,055 INFO L290 TraceCheckUtils]: 25: Hoare triple {10755#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10756#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:01:45,056 INFO L290 TraceCheckUtils]: 26: Hoare triple {10756#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10757#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:01:45,056 INFO L290 TraceCheckUtils]: 27: Hoare triple {10757#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10758#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:01:45,057 INFO L290 TraceCheckUtils]: 28: Hoare triple {10758#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10759#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:01:45,057 INFO L290 TraceCheckUtils]: 29: Hoare triple {10759#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10760#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:01:45,058 INFO L290 TraceCheckUtils]: 30: Hoare triple {10760#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10761#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:01:45,058 INFO L290 TraceCheckUtils]: 31: Hoare triple {10761#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10762#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:01:45,059 INFO L290 TraceCheckUtils]: 32: Hoare triple {10762#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10763#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:01:45,059 INFO L290 TraceCheckUtils]: 33: Hoare triple {10763#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10764#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 56))} is VALID [2022-04-28 03:01:45,060 INFO L290 TraceCheckUtils]: 34: Hoare triple {10764#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 56))} assume !(~x~0 % 4294967296 < 268435455); {10732#false} is VALID [2022-04-28 03:01:45,060 INFO L272 TraceCheckUtils]: 35: Hoare triple {10732#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {10732#false} is VALID [2022-04-28 03:01:45,060 INFO L290 TraceCheckUtils]: 36: Hoare triple {10732#false} ~cond := #in~cond; {10732#false} is VALID [2022-04-28 03:01:45,060 INFO L290 TraceCheckUtils]: 37: Hoare triple {10732#false} assume 0 == ~cond; {10732#false} is VALID [2022-04-28 03:01:45,060 INFO L290 TraceCheckUtils]: 38: Hoare triple {10732#false} assume !false; {10732#false} is VALID [2022-04-28 03:01:45,060 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:01:45,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:01:45,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190653104] [2022-04-28 03:01:45,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190653104] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:01:45,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75049013] [2022-04-28 03:01:45,061 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:01:45,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:45,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:01:45,062 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:01:45,063 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:01:45,109 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:01:45,109 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:01:45,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 59 conjunts are in the unsatisfiable core [2022-04-28 03:01:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:45,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:01:45,464 INFO L272 TraceCheckUtils]: 0: Hoare triple {10731#true} call ULTIMATE.init(); {10731#true} is VALID [2022-04-28 03:01:45,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {10731#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {10731#true} is VALID [2022-04-28 03:01:45,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {10731#true} assume true; {10731#true} is VALID [2022-04-28 03:01:45,465 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10731#true} {10731#true} #34#return; {10731#true} is VALID [2022-04-28 03:01:45,465 INFO L272 TraceCheckUtils]: 4: Hoare triple {10731#true} call #t~ret4 := main(); {10731#true} is VALID [2022-04-28 03:01:45,465 INFO L290 TraceCheckUtils]: 5: Hoare triple {10731#true} ~x~0 := 0; {10736#(= main_~x~0 0)} is VALID [2022-04-28 03:01:45,466 INFO L290 TraceCheckUtils]: 6: Hoare triple {10736#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10737#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:01:45,466 INFO L290 TraceCheckUtils]: 7: Hoare triple {10737#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10738#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:01:45,466 INFO L290 TraceCheckUtils]: 8: Hoare triple {10738#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10739#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:01:45,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {10739#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10740#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:01:45,467 INFO L290 TraceCheckUtils]: 10: Hoare triple {10740#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10741#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:01:45,468 INFO L290 TraceCheckUtils]: 11: Hoare triple {10741#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10742#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:01:45,468 INFO L290 TraceCheckUtils]: 12: Hoare triple {10742#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10743#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:01:45,469 INFO L290 TraceCheckUtils]: 13: Hoare triple {10743#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10744#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:01:45,469 INFO L290 TraceCheckUtils]: 14: Hoare triple {10744#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10745#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:01:45,470 INFO L290 TraceCheckUtils]: 15: Hoare triple {10745#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10746#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:01:45,470 INFO L290 TraceCheckUtils]: 16: Hoare triple {10746#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10747#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:01:45,471 INFO L290 TraceCheckUtils]: 17: Hoare triple {10747#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10748#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:01:45,471 INFO L290 TraceCheckUtils]: 18: Hoare triple {10748#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10749#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:01:45,472 INFO L290 TraceCheckUtils]: 19: Hoare triple {10749#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10750#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:01:45,472 INFO L290 TraceCheckUtils]: 20: Hoare triple {10750#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10751#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:01:45,473 INFO L290 TraceCheckUtils]: 21: Hoare triple {10751#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10752#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:01:45,473 INFO L290 TraceCheckUtils]: 22: Hoare triple {10752#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10753#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:01:45,474 INFO L290 TraceCheckUtils]: 23: Hoare triple {10753#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10754#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:01:45,474 INFO L290 TraceCheckUtils]: 24: Hoare triple {10754#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10755#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:01:45,475 INFO L290 TraceCheckUtils]: 25: Hoare triple {10755#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10756#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:01:45,475 INFO L290 TraceCheckUtils]: 26: Hoare triple {10756#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10757#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:01:45,476 INFO L290 TraceCheckUtils]: 27: Hoare triple {10757#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10758#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:01:45,476 INFO L290 TraceCheckUtils]: 28: Hoare triple {10758#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10759#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:01:45,477 INFO L290 TraceCheckUtils]: 29: Hoare triple {10759#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10760#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:01:45,477 INFO L290 TraceCheckUtils]: 30: Hoare triple {10760#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10761#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:01:45,477 INFO L290 TraceCheckUtils]: 31: Hoare triple {10761#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10762#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:01:45,478 INFO L290 TraceCheckUtils]: 32: Hoare triple {10762#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10763#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:01:45,478 INFO L290 TraceCheckUtils]: 33: Hoare triple {10763#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10868#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:01:45,479 INFO L290 TraceCheckUtils]: 34: Hoare triple {10868#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {10732#false} is VALID [2022-04-28 03:01:45,479 INFO L272 TraceCheckUtils]: 35: Hoare triple {10732#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {10732#false} is VALID [2022-04-28 03:01:45,479 INFO L290 TraceCheckUtils]: 36: Hoare triple {10732#false} ~cond := #in~cond; {10732#false} is VALID [2022-04-28 03:01:45,479 INFO L290 TraceCheckUtils]: 37: Hoare triple {10732#false} assume 0 == ~cond; {10732#false} is VALID [2022-04-28 03:01:45,479 INFO L290 TraceCheckUtils]: 38: Hoare triple {10732#false} assume !false; {10732#false} is VALID [2022-04-28 03:01:45,480 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:01:45,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:01:46,783 INFO L290 TraceCheckUtils]: 38: Hoare triple {10732#false} assume !false; {10732#false} is VALID [2022-04-28 03:01:46,783 INFO L290 TraceCheckUtils]: 37: Hoare triple {10732#false} assume 0 == ~cond; {10732#false} is VALID [2022-04-28 03:01:46,783 INFO L290 TraceCheckUtils]: 36: Hoare triple {10732#false} ~cond := #in~cond; {10732#false} is VALID [2022-04-28 03:01:46,783 INFO L272 TraceCheckUtils]: 35: Hoare triple {10732#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {10732#false} is VALID [2022-04-28 03:01:46,784 INFO L290 TraceCheckUtils]: 34: Hoare triple {10896#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {10732#false} is VALID [2022-04-28 03:01:46,785 INFO L290 TraceCheckUtils]: 33: Hoare triple {10900#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10896#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:01:46,786 INFO L290 TraceCheckUtils]: 32: Hoare triple {10904#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10900#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 03:01:46,786 INFO L290 TraceCheckUtils]: 31: Hoare triple {10908#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10904#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 03:01:46,787 INFO L290 TraceCheckUtils]: 30: Hoare triple {10912#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10908#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 03:01:46,787 INFO L290 TraceCheckUtils]: 29: Hoare triple {10916#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10912#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 03:01:46,788 INFO L290 TraceCheckUtils]: 28: Hoare triple {10920#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10916#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-28 03:01:46,789 INFO L290 TraceCheckUtils]: 27: Hoare triple {10924#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10920#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-28 03:01:46,789 INFO L290 TraceCheckUtils]: 26: Hoare triple {10928#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10924#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-28 03:01:46,790 INFO L290 TraceCheckUtils]: 25: Hoare triple {10932#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10928#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-28 03:01:46,790 INFO L290 TraceCheckUtils]: 24: Hoare triple {10936#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10932#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-28 03:01:46,791 INFO L290 TraceCheckUtils]: 23: Hoare triple {10940#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10936#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-28 03:01:46,791 INFO L290 TraceCheckUtils]: 22: Hoare triple {10944#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10940#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-28 03:01:46,792 INFO L290 TraceCheckUtils]: 21: Hoare triple {10948#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10944#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-28 03:01:46,793 INFO L290 TraceCheckUtils]: 20: Hoare triple {10952#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10948#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-28 03:01:46,794 INFO L290 TraceCheckUtils]: 19: Hoare triple {10956#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10952#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-28 03:01:46,794 INFO L290 TraceCheckUtils]: 18: Hoare triple {10960#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10956#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:01:46,795 INFO L290 TraceCheckUtils]: 17: Hoare triple {10964#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10960#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:01:46,795 INFO L290 TraceCheckUtils]: 16: Hoare triple {10968#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10964#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-28 03:01:46,796 INFO L290 TraceCheckUtils]: 15: Hoare triple {10972#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10968#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-28 03:01:46,797 INFO L290 TraceCheckUtils]: 14: Hoare triple {10976#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10972#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-28 03:01:46,797 INFO L290 TraceCheckUtils]: 13: Hoare triple {10980#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10976#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:01:46,798 INFO L290 TraceCheckUtils]: 12: Hoare triple {10984#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10980#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:01:46,801 INFO L290 TraceCheckUtils]: 11: Hoare triple {10988#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10984#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:01:46,802 INFO L290 TraceCheckUtils]: 10: Hoare triple {10992#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10988#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-28 03:01:46,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {10996#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10992#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-28 03:01:46,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {11000#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {10996#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-28 03:01:46,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {11004#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11000#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-28 03:01:46,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {11008#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11004#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-28 03:01:46,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {10731#true} ~x~0 := 0; {11008#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:01:46,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {10731#true} call #t~ret4 := main(); {10731#true} is VALID [2022-04-28 03:01:46,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10731#true} {10731#true} #34#return; {10731#true} is VALID [2022-04-28 03:01:46,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {10731#true} assume true; {10731#true} is VALID [2022-04-28 03:01:46,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {10731#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {10731#true} is VALID [2022-04-28 03:01:46,805 INFO L272 TraceCheckUtils]: 0: Hoare triple {10731#true} call ULTIMATE.init(); {10731#true} is VALID [2022-04-28 03:01:46,805 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:01:46,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75049013] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:01:46,805 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:01:46,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 62 [2022-04-28 03:01:46,806 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:01:46,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1842018908] [2022-04-28 03:01:46,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1842018908] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:01:46,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:01:46,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-28 03:01:46,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064428853] [2022-04-28 03:01:46,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:01:46,809 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:01:46,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:01:46,809 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:01:46,831 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:01:46,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-28 03:01:46,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:46,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-28 03:01:46,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1020, Invalid=2762, Unknown=0, NotChecked=0, Total=3782 [2022-04-28 03:01:46,832 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:01:48,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:48,566 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-28 03:01:48,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-28 03:01:48,567 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:01:48,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:01:48,567 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:01:48,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2022-04-28 03:01:48,568 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:01:48,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2022-04-28 03:01:48,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 46 transitions. [2022-04-28 03:01:48,610 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:01:48,610 INFO L225 Difference]: With dead ends: 46 [2022-04-28 03:01:48,610 INFO L226 Difference]: Without dead ends: 41 [2022-04-28 03:01:48,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2033, Invalid=6157, Unknown=0, NotChecked=0, Total=8190 [2022-04-28 03:01:48,611 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:01:48,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 88 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 03:01:48,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-28 03:01:48,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-28 03:01:48,659 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:01:48,659 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:01:48,659 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:01:48,659 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:01:48,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:48,660 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-28 03:01:48,660 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-28 03:01:48,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:48,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:48,660 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:01:48,660 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:01:48,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:48,661 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2022-04-28 03:01:48,661 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-28 03:01:48,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:48,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:48,661 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:01:48,661 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:01:48,661 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:01:48,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2022-04-28 03:01:48,662 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2022-04-28 03:01:48,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:01:48,662 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2022-04-28 03:01:48,662 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:01:48,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 41 transitions. [2022-04-28 03:01:48,698 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:01:48,698 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2022-04-28 03:01:48,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 03:01:48,698 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:01:48,698 INFO L195 NwaCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:01:48,717 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:01:48,921 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:01:49,117 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:01:49,118 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:01:49,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:01:49,118 INFO L85 PathProgramCache]: Analyzing trace with hash 658218230, now seen corresponding path program 57 times [2022-04-28 03:01:49,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:49,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1254693044] [2022-04-28 03:01:51,589 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,590 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:01:51,592 INFO L85 PathProgramCache]: Analyzing trace with hash -212358153, now seen corresponding path program 1 times [2022-04-28 03:01:51,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:51,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952053478] [2022-04-28 03:01:51,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:51,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:51,596 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_29.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_29.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:01:51,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:01:51,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [417739339] [2022-04-28 03:01:51,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:51,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:51,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:01:51,601 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:01:51,643 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:01:51,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:01:51,648 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:01:51,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:01:51,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:01:51,661 INFO L85 PathProgramCache]: Analyzing trace with hash 658218230, now seen corresponding path program 58 times [2022-04-28 03:01:51,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:51,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122915483] [2022-04-28 03:01:51,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:51,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:51,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:52,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:01:52,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:52,218 INFO L290 TraceCheckUtils]: 0: Hoare triple {11378#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {11343#true} is VALID [2022-04-28 03:01:52,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {11343#true} assume true; {11343#true} is VALID [2022-04-28 03:01:52,218 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11343#true} {11343#true} #34#return; {11343#true} is VALID [2022-04-28 03:01:52,219 INFO L272 TraceCheckUtils]: 0: Hoare triple {11343#true} call ULTIMATE.init(); {11378#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:01:52,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {11378#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {11343#true} is VALID [2022-04-28 03:01:52,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {11343#true} assume true; {11343#true} is VALID [2022-04-28 03:01:52,219 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11343#true} {11343#true} #34#return; {11343#true} is VALID [2022-04-28 03:01:52,219 INFO L272 TraceCheckUtils]: 4: Hoare triple {11343#true} call #t~ret4 := main(); {11343#true} is VALID [2022-04-28 03:01:52,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {11343#true} ~x~0 := 0; {11348#(= main_~x~0 0)} is VALID [2022-04-28 03:01:52,220 INFO L290 TraceCheckUtils]: 6: Hoare triple {11348#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11349#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:01:52,220 INFO L290 TraceCheckUtils]: 7: Hoare triple {11349#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11350#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:01:52,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {11350#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11351#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:01:52,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {11351#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11352#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:01:52,222 INFO L290 TraceCheckUtils]: 10: Hoare triple {11352#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11353#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:01:52,222 INFO L290 TraceCheckUtils]: 11: Hoare triple {11353#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11354#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:01:52,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {11354#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11355#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:01:52,223 INFO L290 TraceCheckUtils]: 13: Hoare triple {11355#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11356#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:01:52,224 INFO L290 TraceCheckUtils]: 14: Hoare triple {11356#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11357#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:01:52,224 INFO L290 TraceCheckUtils]: 15: Hoare triple {11357#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11358#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:01:52,225 INFO L290 TraceCheckUtils]: 16: Hoare triple {11358#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11359#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:01:52,225 INFO L290 TraceCheckUtils]: 17: Hoare triple {11359#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11360#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:01:52,226 INFO L290 TraceCheckUtils]: 18: Hoare triple {11360#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11361#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:01:52,226 INFO L290 TraceCheckUtils]: 19: Hoare triple {11361#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11362#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:01:52,227 INFO L290 TraceCheckUtils]: 20: Hoare triple {11362#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11363#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:01:52,227 INFO L290 TraceCheckUtils]: 21: Hoare triple {11363#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11364#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:01:52,228 INFO L290 TraceCheckUtils]: 22: Hoare triple {11364#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11365#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:01:52,228 INFO L290 TraceCheckUtils]: 23: Hoare triple {11365#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11366#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:01:52,228 INFO L290 TraceCheckUtils]: 24: Hoare triple {11366#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11367#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:01:52,229 INFO L290 TraceCheckUtils]: 25: Hoare triple {11367#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11368#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:01:52,229 INFO L290 TraceCheckUtils]: 26: Hoare triple {11368#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11369#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:01:52,230 INFO L290 TraceCheckUtils]: 27: Hoare triple {11369#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11370#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:01:52,230 INFO L290 TraceCheckUtils]: 28: Hoare triple {11370#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11371#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:01:52,231 INFO L290 TraceCheckUtils]: 29: Hoare triple {11371#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11372#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:01:52,231 INFO L290 TraceCheckUtils]: 30: Hoare triple {11372#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11373#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:01:52,232 INFO L290 TraceCheckUtils]: 31: Hoare triple {11373#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11374#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:01:52,232 INFO L290 TraceCheckUtils]: 32: Hoare triple {11374#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11375#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:01:52,233 INFO L290 TraceCheckUtils]: 33: Hoare triple {11375#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11376#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:01:52,233 INFO L290 TraceCheckUtils]: 34: Hoare triple {11376#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11377#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 58))} is VALID [2022-04-28 03:01:52,234 INFO L290 TraceCheckUtils]: 35: Hoare triple {11377#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 58))} assume !(~x~0 % 4294967296 < 268435455); {11344#false} is VALID [2022-04-28 03:01:52,234 INFO L272 TraceCheckUtils]: 36: Hoare triple {11344#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {11344#false} is VALID [2022-04-28 03:01:52,234 INFO L290 TraceCheckUtils]: 37: Hoare triple {11344#false} ~cond := #in~cond; {11344#false} is VALID [2022-04-28 03:01:52,234 INFO L290 TraceCheckUtils]: 38: Hoare triple {11344#false} assume 0 == ~cond; {11344#false} is VALID [2022-04-28 03:01:52,234 INFO L290 TraceCheckUtils]: 39: Hoare triple {11344#false} assume !false; {11344#false} is VALID [2022-04-28 03:01:52,234 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:01:52,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:01:52,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122915483] [2022-04-28 03:01:52,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122915483] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:01:52,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142949759] [2022-04-28 03:01:52,235 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:01:52,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:52,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:01:52,236 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:01:52,239 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:01:52,313 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:01:52,313 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:01:52,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 61 conjunts are in the unsatisfiable core [2022-04-28 03:01:52,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:52,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:01:52,684 INFO L272 TraceCheckUtils]: 0: Hoare triple {11343#true} call ULTIMATE.init(); {11343#true} is VALID [2022-04-28 03:01:52,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {11343#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {11343#true} is VALID [2022-04-28 03:01:52,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {11343#true} assume true; {11343#true} is VALID [2022-04-28 03:01:52,685 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11343#true} {11343#true} #34#return; {11343#true} is VALID [2022-04-28 03:01:52,685 INFO L272 TraceCheckUtils]: 4: Hoare triple {11343#true} call #t~ret4 := main(); {11343#true} is VALID [2022-04-28 03:01:52,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {11343#true} ~x~0 := 0; {11348#(= main_~x~0 0)} is VALID [2022-04-28 03:01:52,685 INFO L290 TraceCheckUtils]: 6: Hoare triple {11348#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11349#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:01:52,686 INFO L290 TraceCheckUtils]: 7: Hoare triple {11349#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11350#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:01:52,686 INFO L290 TraceCheckUtils]: 8: Hoare triple {11350#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11351#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:01:52,687 INFO L290 TraceCheckUtils]: 9: Hoare triple {11351#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11352#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:01:52,687 INFO L290 TraceCheckUtils]: 10: Hoare triple {11352#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11353#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:01:52,688 INFO L290 TraceCheckUtils]: 11: Hoare triple {11353#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11354#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:01:52,688 INFO L290 TraceCheckUtils]: 12: Hoare triple {11354#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11355#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:01:52,689 INFO L290 TraceCheckUtils]: 13: Hoare triple {11355#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11356#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:01:52,689 INFO L290 TraceCheckUtils]: 14: Hoare triple {11356#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11357#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:01:52,690 INFO L290 TraceCheckUtils]: 15: Hoare triple {11357#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11358#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:01:52,690 INFO L290 TraceCheckUtils]: 16: Hoare triple {11358#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11359#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:01:52,691 INFO L290 TraceCheckUtils]: 17: Hoare triple {11359#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11360#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:01:52,691 INFO L290 TraceCheckUtils]: 18: Hoare triple {11360#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11361#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:01:52,692 INFO L290 TraceCheckUtils]: 19: Hoare triple {11361#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11362#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:01:52,692 INFO L290 TraceCheckUtils]: 20: Hoare triple {11362#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11363#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:01:52,693 INFO L290 TraceCheckUtils]: 21: Hoare triple {11363#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11364#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:01:52,693 INFO L290 TraceCheckUtils]: 22: Hoare triple {11364#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11365#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:01:52,693 INFO L290 TraceCheckUtils]: 23: Hoare triple {11365#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11366#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:01:52,694 INFO L290 TraceCheckUtils]: 24: Hoare triple {11366#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11367#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:01:52,694 INFO L290 TraceCheckUtils]: 25: Hoare triple {11367#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11368#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:01:52,695 INFO L290 TraceCheckUtils]: 26: Hoare triple {11368#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11369#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:01:52,695 INFO L290 TraceCheckUtils]: 27: Hoare triple {11369#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11370#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:01:52,696 INFO L290 TraceCheckUtils]: 28: Hoare triple {11370#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11371#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:01:52,696 INFO L290 TraceCheckUtils]: 29: Hoare triple {11371#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11372#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:01:52,697 INFO L290 TraceCheckUtils]: 30: Hoare triple {11372#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11373#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:01:52,697 INFO L290 TraceCheckUtils]: 31: Hoare triple {11373#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11374#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:01:52,698 INFO L290 TraceCheckUtils]: 32: Hoare triple {11374#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11375#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:01:52,698 INFO L290 TraceCheckUtils]: 33: Hoare triple {11375#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11376#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:01:52,699 INFO L290 TraceCheckUtils]: 34: Hoare triple {11376#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11484#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:01:52,699 INFO L290 TraceCheckUtils]: 35: Hoare triple {11484#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !(~x~0 % 4294967296 < 268435455); {11344#false} is VALID [2022-04-28 03:01:52,699 INFO L272 TraceCheckUtils]: 36: Hoare triple {11344#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {11344#false} is VALID [2022-04-28 03:01:52,699 INFO L290 TraceCheckUtils]: 37: Hoare triple {11344#false} ~cond := #in~cond; {11344#false} is VALID [2022-04-28 03:01:52,699 INFO L290 TraceCheckUtils]: 38: Hoare triple {11344#false} assume 0 == ~cond; {11344#false} is VALID [2022-04-28 03:01:52,699 INFO L290 TraceCheckUtils]: 39: Hoare triple {11344#false} assume !false; {11344#false} is VALID [2022-04-28 03:01:52,700 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:01:52,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:01:54,091 INFO L290 TraceCheckUtils]: 39: Hoare triple {11344#false} assume !false; {11344#false} is VALID [2022-04-28 03:01:54,091 INFO L290 TraceCheckUtils]: 38: Hoare triple {11344#false} assume 0 == ~cond; {11344#false} is VALID [2022-04-28 03:01:54,091 INFO L290 TraceCheckUtils]: 37: Hoare triple {11344#false} ~cond := #in~cond; {11344#false} is VALID [2022-04-28 03:01:54,091 INFO L272 TraceCheckUtils]: 36: Hoare triple {11344#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {11344#false} is VALID [2022-04-28 03:01:54,091 INFO L290 TraceCheckUtils]: 35: Hoare triple {11512#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {11344#false} is VALID [2022-04-28 03:01:54,092 INFO L290 TraceCheckUtils]: 34: Hoare triple {11516#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11512#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:01:54,093 INFO L290 TraceCheckUtils]: 33: Hoare triple {11520#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11516#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 03:01:54,094 INFO L290 TraceCheckUtils]: 32: Hoare triple {11524#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11520#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 03:01:54,094 INFO L290 TraceCheckUtils]: 31: Hoare triple {11528#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11524#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 03:01:54,095 INFO L290 TraceCheckUtils]: 30: Hoare triple {11532#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11528#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 03:01:54,095 INFO L290 TraceCheckUtils]: 29: Hoare triple {11536#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11532#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-28 03:01:54,096 INFO L290 TraceCheckUtils]: 28: Hoare triple {11540#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11536#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-28 03:01:54,096 INFO L290 TraceCheckUtils]: 27: Hoare triple {11544#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11540#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-28 03:01:54,097 INFO L290 TraceCheckUtils]: 26: Hoare triple {11548#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11544#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-28 03:01:54,098 INFO L290 TraceCheckUtils]: 25: Hoare triple {11552#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11548#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-28 03:01:54,098 INFO L290 TraceCheckUtils]: 24: Hoare triple {11556#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11552#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-28 03:01:54,099 INFO L290 TraceCheckUtils]: 23: Hoare triple {11560#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11556#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-28 03:01:54,099 INFO L290 TraceCheckUtils]: 22: Hoare triple {11564#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11560#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-28 03:01:54,100 INFO L290 TraceCheckUtils]: 21: Hoare triple {11568#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11564#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-28 03:01:54,101 INFO L290 TraceCheckUtils]: 20: Hoare triple {11572#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11568#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-28 03:01:54,101 INFO L290 TraceCheckUtils]: 19: Hoare triple {11576#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11572#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:01:54,102 INFO L290 TraceCheckUtils]: 18: Hoare triple {11580#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11576#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:01:54,102 INFO L290 TraceCheckUtils]: 17: Hoare triple {11584#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11580#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-28 03:01:54,103 INFO L290 TraceCheckUtils]: 16: Hoare triple {11588#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11584#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-28 03:01:54,103 INFO L290 TraceCheckUtils]: 15: Hoare triple {11592#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11588#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-28 03:01:54,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {11596#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11592#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:01:54,105 INFO L290 TraceCheckUtils]: 13: Hoare triple {11600#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11596#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:01:54,105 INFO L290 TraceCheckUtils]: 12: Hoare triple {11604#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11600#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:01:54,106 INFO L290 TraceCheckUtils]: 11: Hoare triple {11608#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11604#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-28 03:01:54,106 INFO L290 TraceCheckUtils]: 10: Hoare triple {11612#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11608#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-28 03:01:54,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {11616#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11612#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-28 03:01:54,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {11620#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11616#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-28 03:01:54,108 INFO L290 TraceCheckUtils]: 7: Hoare triple {11624#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11620#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-28 03:01:54,109 INFO L290 TraceCheckUtils]: 6: Hoare triple {11628#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11624#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:01:54,109 INFO L290 TraceCheckUtils]: 5: Hoare triple {11343#true} ~x~0 := 0; {11628#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-28 03:01:54,109 INFO L272 TraceCheckUtils]: 4: Hoare triple {11343#true} call #t~ret4 := main(); {11343#true} is VALID [2022-04-28 03:01:54,109 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11343#true} {11343#true} #34#return; {11343#true} is VALID [2022-04-28 03:01:54,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {11343#true} assume true; {11343#true} is VALID [2022-04-28 03:01:54,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {11343#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {11343#true} is VALID [2022-04-28 03:01:54,110 INFO L272 TraceCheckUtils]: 0: Hoare triple {11343#true} call ULTIMATE.init(); {11343#true} is VALID [2022-04-28 03:01:54,110 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:01:54,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142949759] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:01:54,110 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:01:54,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 64 [2022-04-28 03:01:54,110 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:01:54,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1254693044] [2022-04-28 03:01:54,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1254693044] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:01:54,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:01:54,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-28 03:01:54,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304746380] [2022-04-28 03:01:54,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:01:54,111 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:01:54,111 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:01:54,111 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:01:54,132 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:01:54,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-28 03:01:54,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:54,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-28 03:01:54,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1085, Invalid=2947, Unknown=0, NotChecked=0, Total=4032 [2022-04-28 03:01:54,133 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:01:56,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:56,049 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-28 03:01:56,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-28 03:01:56,049 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:01:56,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:01:56,049 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:01:56,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2022-04-28 03:01:56,050 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:01:56,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2022-04-28 03:01:56,051 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 47 transitions. [2022-04-28 03:01:56,082 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:01:56,083 INFO L225 Difference]: With dead ends: 47 [2022-04-28 03:01:56,083 INFO L226 Difference]: Without dead ends: 42 [2022-04-28 03:01:56,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2163, Invalid=6579, Unknown=0, NotChecked=0, Total=8742 [2022-04-28 03:01:56,084 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 1012 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 1073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1012 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:01:56,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 153 Invalid, 1073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1012 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 03:01:56,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-28 03:01:56,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-28 03:01:56,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:01:56,124 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:01:56,124 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:01:56,124 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:01:56,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:56,125 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-28 03:01:56,125 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-28 03:01:56,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:56,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:56,125 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:01:56,125 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:01:56,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:01:56,126 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2022-04-28 03:01:56,126 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-28 03:01:56,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:01:56,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:01:56,126 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:01:56,126 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:01:56,126 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:01:56,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2022-04-28 03:01:56,126 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2022-04-28 03:01:56,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:01:56,127 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2022-04-28 03:01:56,127 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:01:56,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 42 transitions. [2022-04-28 03:01:56,158 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:01:56,158 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-04-28 03:01:56,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 03:01:56,159 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:01:56,159 INFO L195 NwaCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:01:56,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2022-04-28 03:01:56,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Ended with exit code 0 [2022-04-28 03:01:56,560 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:01:56,560 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:01:56,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:01:56,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1033610084, now seen corresponding path program 59 times [2022-04-28 03:01:56,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:01:56,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1546037719] [2022-04-28 03:01:56,708 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:56,710 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:01:56,711 INFO L85 PathProgramCache]: Analyzing trace with hash -153252809, now seen corresponding path program 1 times [2022-04-28 03:01:56,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:56,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393189369] [2022-04-28 03:01:56,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:56,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:56,715 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_30.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_30.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:01:56,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:01:56,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1156923019] [2022-04-28 03:01:56,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:56,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:56,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:01:56,720 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:01:56,721 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:01:56,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:01:56,758 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:01:56,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:01:56,765 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:01:56,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1033610084, now seen corresponding path program 60 times [2022-04-28 03:01:56,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:01:56,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134443390] [2022-04-28 03:01:56,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:01:56,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:01:56,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:57,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:01:57,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:57,338 INFO L290 TraceCheckUtils]: 0: Hoare triple {12007#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {11971#true} is VALID [2022-04-28 03:01:57,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-28 03:01:57,338 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11971#true} {11971#true} #34#return; {11971#true} is VALID [2022-04-28 03:01:57,338 INFO L272 TraceCheckUtils]: 0: Hoare triple {11971#true} call ULTIMATE.init(); {12007#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:01:57,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {12007#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {11971#true} is VALID [2022-04-28 03:01:57,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-28 03:01:57,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11971#true} {11971#true} #34#return; {11971#true} is VALID [2022-04-28 03:01:57,339 INFO L272 TraceCheckUtils]: 4: Hoare triple {11971#true} call #t~ret4 := main(); {11971#true} is VALID [2022-04-28 03:01:57,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {11971#true} ~x~0 := 0; {11976#(= main_~x~0 0)} is VALID [2022-04-28 03:01:57,339 INFO L290 TraceCheckUtils]: 6: Hoare triple {11976#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11977#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:01:57,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {11977#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11978#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:01:57,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {11978#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11979#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:01:57,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {11979#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11980#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:01:57,348 INFO L290 TraceCheckUtils]: 10: Hoare triple {11980#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11981#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:01:57,349 INFO L290 TraceCheckUtils]: 11: Hoare triple {11981#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11982#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:01:57,349 INFO L290 TraceCheckUtils]: 12: Hoare triple {11982#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11983#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:01:57,350 INFO L290 TraceCheckUtils]: 13: Hoare triple {11983#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11984#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:01:57,350 INFO L290 TraceCheckUtils]: 14: Hoare triple {11984#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11985#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:01:57,351 INFO L290 TraceCheckUtils]: 15: Hoare triple {11985#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11986#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:01:57,351 INFO L290 TraceCheckUtils]: 16: Hoare triple {11986#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11987#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:01:57,352 INFO L290 TraceCheckUtils]: 17: Hoare triple {11987#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11988#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:01:57,352 INFO L290 TraceCheckUtils]: 18: Hoare triple {11988#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11989#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:01:57,353 INFO L290 TraceCheckUtils]: 19: Hoare triple {11989#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11990#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:01:57,353 INFO L290 TraceCheckUtils]: 20: Hoare triple {11990#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11991#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:01:57,354 INFO L290 TraceCheckUtils]: 21: Hoare triple {11991#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11992#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:01:57,354 INFO L290 TraceCheckUtils]: 22: Hoare triple {11992#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11993#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:01:57,355 INFO L290 TraceCheckUtils]: 23: Hoare triple {11993#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11994#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:01:57,355 INFO L290 TraceCheckUtils]: 24: Hoare triple {11994#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11995#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:01:57,355 INFO L290 TraceCheckUtils]: 25: Hoare triple {11995#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11996#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:01:57,356 INFO L290 TraceCheckUtils]: 26: Hoare triple {11996#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11997#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:01:57,356 INFO L290 TraceCheckUtils]: 27: Hoare triple {11997#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11998#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:01:57,357 INFO L290 TraceCheckUtils]: 28: Hoare triple {11998#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11999#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:01:57,357 INFO L290 TraceCheckUtils]: 29: Hoare triple {11999#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12000#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:01:57,358 INFO L290 TraceCheckUtils]: 30: Hoare triple {12000#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12001#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:01:57,358 INFO L290 TraceCheckUtils]: 31: Hoare triple {12001#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12002#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:01:57,359 INFO L290 TraceCheckUtils]: 32: Hoare triple {12002#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12003#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:01:57,359 INFO L290 TraceCheckUtils]: 33: Hoare triple {12003#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12004#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:01:57,360 INFO L290 TraceCheckUtils]: 34: Hoare triple {12004#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12005#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:01:57,360 INFO L290 TraceCheckUtils]: 35: Hoare triple {12005#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12006#(and (<= main_~x~0 60) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:01:57,361 INFO L290 TraceCheckUtils]: 36: Hoare triple {12006#(and (<= main_~x~0 60) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {11972#false} is VALID [2022-04-28 03:01:57,361 INFO L272 TraceCheckUtils]: 37: Hoare triple {11972#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {11972#false} is VALID [2022-04-28 03:01:57,361 INFO L290 TraceCheckUtils]: 38: Hoare triple {11972#false} ~cond := #in~cond; {11972#false} is VALID [2022-04-28 03:01:57,361 INFO L290 TraceCheckUtils]: 39: Hoare triple {11972#false} assume 0 == ~cond; {11972#false} is VALID [2022-04-28 03:01:57,361 INFO L290 TraceCheckUtils]: 40: Hoare triple {11972#false} assume !false; {11972#false} is VALID [2022-04-28 03:01:57,361 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:01:57,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:01:57,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134443390] [2022-04-28 03:01:57,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134443390] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:01:57,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233666278] [2022-04-28 03:01:57,362 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:01:57,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:01:57,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:01:57,363 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:01:57,364 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:01:58,238 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2022-04-28 03:01:58,239 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:01:58,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 70 conjunts are in the unsatisfiable core [2022-04-28 03:01:58,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:01:58,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:01:58,540 INFO L272 TraceCheckUtils]: 0: Hoare triple {11971#true} call ULTIMATE.init(); {11971#true} is VALID [2022-04-28 03:01:58,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {11971#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {11971#true} is VALID [2022-04-28 03:01:58,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-28 03:01:58,540 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11971#true} {11971#true} #34#return; {11971#true} is VALID [2022-04-28 03:01:58,540 INFO L272 TraceCheckUtils]: 4: Hoare triple {11971#true} call #t~ret4 := main(); {11971#true} is VALID [2022-04-28 03:01:58,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {11971#true} ~x~0 := 0; {11976#(= main_~x~0 0)} is VALID [2022-04-28 03:01:58,541 INFO L290 TraceCheckUtils]: 6: Hoare triple {11976#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11977#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:01:58,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {11977#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11978#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:01:58,542 INFO L290 TraceCheckUtils]: 8: Hoare triple {11978#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11979#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:01:58,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {11979#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11980#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:01:58,543 INFO L290 TraceCheckUtils]: 10: Hoare triple {11980#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11981#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:01:58,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {11981#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11982#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:01:58,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {11982#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11983#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:01:58,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {11983#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11984#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:01:58,545 INFO L290 TraceCheckUtils]: 14: Hoare triple {11984#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11985#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:01:58,545 INFO L290 TraceCheckUtils]: 15: Hoare triple {11985#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11986#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:01:58,546 INFO L290 TraceCheckUtils]: 16: Hoare triple {11986#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11987#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:01:58,546 INFO L290 TraceCheckUtils]: 17: Hoare triple {11987#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11988#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:01:58,547 INFO L290 TraceCheckUtils]: 18: Hoare triple {11988#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11989#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:01:58,547 INFO L290 TraceCheckUtils]: 19: Hoare triple {11989#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11990#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:01:58,548 INFO L290 TraceCheckUtils]: 20: Hoare triple {11990#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11991#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:01:58,548 INFO L290 TraceCheckUtils]: 21: Hoare triple {11991#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11992#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:01:58,549 INFO L290 TraceCheckUtils]: 22: Hoare triple {11992#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11993#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:01:58,549 INFO L290 TraceCheckUtils]: 23: Hoare triple {11993#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11994#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:01:58,550 INFO L290 TraceCheckUtils]: 24: Hoare triple {11994#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11995#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:01:58,550 INFO L290 TraceCheckUtils]: 25: Hoare triple {11995#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11996#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:01:58,550 INFO L290 TraceCheckUtils]: 26: Hoare triple {11996#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11997#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:01:58,551 INFO L290 TraceCheckUtils]: 27: Hoare triple {11997#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11998#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:01:58,551 INFO L290 TraceCheckUtils]: 28: Hoare triple {11998#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {11999#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:01:58,552 INFO L290 TraceCheckUtils]: 29: Hoare triple {11999#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12000#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:01:58,552 INFO L290 TraceCheckUtils]: 30: Hoare triple {12000#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12001#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:01:58,553 INFO L290 TraceCheckUtils]: 31: Hoare triple {12001#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12002#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:01:58,553 INFO L290 TraceCheckUtils]: 32: Hoare triple {12002#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12003#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:01:58,554 INFO L290 TraceCheckUtils]: 33: Hoare triple {12003#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12004#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:01:58,554 INFO L290 TraceCheckUtils]: 34: Hoare triple {12004#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12005#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:01:58,555 INFO L290 TraceCheckUtils]: 35: Hoare triple {12005#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12116#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:01:58,555 INFO L290 TraceCheckUtils]: 36: Hoare triple {12116#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {11972#false} is VALID [2022-04-28 03:01:58,555 INFO L272 TraceCheckUtils]: 37: Hoare triple {11972#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {11972#false} is VALID [2022-04-28 03:01:58,555 INFO L290 TraceCheckUtils]: 38: Hoare triple {11972#false} ~cond := #in~cond; {11972#false} is VALID [2022-04-28 03:01:58,555 INFO L290 TraceCheckUtils]: 39: Hoare triple {11972#false} assume 0 == ~cond; {11972#false} is VALID [2022-04-28 03:01:58,555 INFO L290 TraceCheckUtils]: 40: Hoare triple {11972#false} assume !false; {11972#false} is VALID [2022-04-28 03:01:58,556 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:01:58,556 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:02:05,329 INFO L290 TraceCheckUtils]: 40: Hoare triple {11972#false} assume !false; {11972#false} is VALID [2022-04-28 03:02:05,330 INFO L290 TraceCheckUtils]: 39: Hoare triple {12135#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {11972#false} is VALID [2022-04-28 03:02:05,330 INFO L290 TraceCheckUtils]: 38: Hoare triple {12139#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {12135#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:02:05,330 INFO L272 TraceCheckUtils]: 37: Hoare triple {12143#(not (= (mod main_~x~0 2) 0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {12139#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:02:05,331 INFO L290 TraceCheckUtils]: 36: Hoare triple {12147#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !(~x~0 % 4294967296 < 268435455); {12143#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 03:02:05,332 INFO L290 TraceCheckUtils]: 35: Hoare triple {12151#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12147#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:02:05,332 INFO L290 TraceCheckUtils]: 34: Hoare triple {12155#(or (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (< (mod main_~x~0 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12151#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:02:05,333 INFO L290 TraceCheckUtils]: 33: Hoare triple {12159#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12155#(or (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (< (mod main_~x~0 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:02:05,334 INFO L290 TraceCheckUtils]: 32: Hoare triple {12163#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12159#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} is VALID [2022-04-28 03:02:05,335 INFO L290 TraceCheckUtils]: 31: Hoare triple {12167#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455) (not (< (mod (+ main_~x~0 6) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12163#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)))} is VALID [2022-04-28 03:02:05,336 INFO L290 TraceCheckUtils]: 30: Hoare triple {12171#(or (not (< (mod (+ main_~x~0 8) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12167#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455) (not (< (mod (+ main_~x~0 6) 4294967296) 268435455)))} is VALID [2022-04-28 03:02:05,337 INFO L290 TraceCheckUtils]: 29: Hoare triple {12175#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)) (not (< (mod (+ main_~x~0 10) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12171#(or (not (< (mod (+ main_~x~0 8) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} is VALID [2022-04-28 03:02:05,338 INFO L290 TraceCheckUtils]: 28: Hoare triple {12179#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)) (not (< (mod (+ main_~x~0 12) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12175#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)) (not (< (mod (+ main_~x~0 10) 4294967296) 268435455)))} is VALID [2022-04-28 03:02:05,339 INFO L290 TraceCheckUtils]: 27: Hoare triple {12183#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)) (not (< (mod (+ main_~x~0 14) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12179#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)) (not (< (mod (+ main_~x~0 12) 4294967296) 268435455)))} is VALID [2022-04-28 03:02:05,340 INFO L290 TraceCheckUtils]: 26: Hoare triple {12187#(or (not (< (mod (+ main_~x~0 16) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12183#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)) (not (< (mod (+ main_~x~0 14) 4294967296) 268435455)))} is VALID [2022-04-28 03:02:05,341 INFO L290 TraceCheckUtils]: 25: Hoare triple {12191#(or (not (< (mod (+ main_~x~0 18) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12187#(or (not (< (mod (+ main_~x~0 16) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} is VALID [2022-04-28 03:02:05,342 INFO L290 TraceCheckUtils]: 24: Hoare triple {12195#(or (not (< (mod (+ main_~x~0 20) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12191#(or (not (< (mod (+ main_~x~0 18) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} is VALID [2022-04-28 03:02:05,343 INFO L290 TraceCheckUtils]: 23: Hoare triple {12199#(or (not (< (mod (+ main_~x~0 22) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12195#(or (not (< (mod (+ main_~x~0 20) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} is VALID [2022-04-28 03:02:05,344 INFO L290 TraceCheckUtils]: 22: Hoare triple {12203#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)) (not (< (mod (+ main_~x~0 24) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12199#(or (not (< (mod (+ main_~x~0 22) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} is VALID [2022-04-28 03:02:05,344 INFO L290 TraceCheckUtils]: 21: Hoare triple {12207#(or (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (< (mod (+ main_~x~0 26) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12203#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)) (not (< (mod (+ main_~x~0 24) 4294967296) 268435455)))} is VALID [2022-04-28 03:02:05,345 INFO L290 TraceCheckUtils]: 20: Hoare triple {12211#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455) (not (< (mod (+ main_~x~0 28) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12207#(or (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (< (mod (+ main_~x~0 26) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:02:05,346 INFO L290 TraceCheckUtils]: 19: Hoare triple {12215#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (not (< (mod (+ 30 main_~x~0) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12211#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455) (not (< (mod (+ main_~x~0 28) 4294967296) 268435455)))} is VALID [2022-04-28 03:02:05,347 INFO L290 TraceCheckUtils]: 18: Hoare triple {12219#(or (not (< (mod (+ 32 main_~x~0) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12215#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (not (< (mod (+ 30 main_~x~0) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:02:05,348 INFO L290 TraceCheckUtils]: 17: Hoare triple {12223#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)) (not (< (mod (+ main_~x~0 34) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12219#(or (not (< (mod (+ 32 main_~x~0) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} is VALID [2022-04-28 03:02:05,349 INFO L290 TraceCheckUtils]: 16: Hoare triple {12227#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (not (< (mod (+ main_~x~0 36) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12223#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)) (not (< (mod (+ main_~x~0 34) 4294967296) 268435455)))} is VALID [2022-04-28 03:02:05,350 INFO L290 TraceCheckUtils]: 15: Hoare triple {12231#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (not (< (mod (+ main_~x~0 38) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12227#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (not (< (mod (+ main_~x~0 36) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:02:05,351 INFO L290 TraceCheckUtils]: 14: Hoare triple {12235#(or (not (< (mod (+ 40 main_~x~0) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12231#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (not (< (mod (+ main_~x~0 38) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:02:05,352 INFO L290 TraceCheckUtils]: 13: Hoare triple {12239#(or (not (= (mod main_~x~0 2) 0)) (not (< (mod (+ 42 main_~x~0) 4294967296) 268435455)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12235#(or (not (< (mod (+ 40 main_~x~0) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:02:05,353 INFO L290 TraceCheckUtils]: 12: Hoare triple {12243#(or (not (< (mod (+ 44 main_~x~0) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12239#(or (not (= (mod main_~x~0 2) 0)) (not (< (mod (+ 42 main_~x~0) 4294967296) 268435455)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} is VALID [2022-04-28 03:02:05,353 INFO L290 TraceCheckUtils]: 11: Hoare triple {12247#(or (< (mod (+ main_~x~0 50) 4294967296) 268435455) (not (< (mod (+ main_~x~0 46) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12243#(or (not (< (mod (+ 44 main_~x~0) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} is VALID [2022-04-28 03:02:05,354 INFO L290 TraceCheckUtils]: 10: Hoare triple {12251#(or (not (< (mod (+ main_~x~0 48) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12247#(or (< (mod (+ main_~x~0 50) 4294967296) 268435455) (not (< (mod (+ main_~x~0 46) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:02:05,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {12255#(or (not (< (mod (+ main_~x~0 50) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12251#(or (not (< (mod (+ main_~x~0 48) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} is VALID [2022-04-28 03:02:05,356 INFO L290 TraceCheckUtils]: 8: Hoare triple {12259#(or (not (< (mod (+ main_~x~0 52) 4294967296) 268435455)) (< (mod (+ 56 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12255#(or (not (< (mod (+ main_~x~0 50) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} is VALID [2022-04-28 03:02:05,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {12263#(or (not (< (mod (+ main_~x~0 54) 4294967296) 268435455)) (< (mod (+ main_~x~0 58) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12259#(or (not (< (mod (+ main_~x~0 52) 4294967296) 268435455)) (< (mod (+ 56 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:02:05,358 INFO L290 TraceCheckUtils]: 6: Hoare triple {12267#(or (< (mod (+ main_~x~0 60) 4294967296) 268435455) (not (< (mod (+ 56 main_~x~0) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12263#(or (not (< (mod (+ main_~x~0 54) 4294967296) 268435455)) (< (mod (+ main_~x~0 58) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:02:05,358 INFO L290 TraceCheckUtils]: 5: Hoare triple {11971#true} ~x~0 := 0; {12267#(or (< (mod (+ main_~x~0 60) 4294967296) 268435455) (not (< (mod (+ 56 main_~x~0) 4294967296) 268435455)) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:02:05,358 INFO L272 TraceCheckUtils]: 4: Hoare triple {11971#true} call #t~ret4 := main(); {11971#true} is VALID [2022-04-28 03:02:05,359 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11971#true} {11971#true} #34#return; {11971#true} is VALID [2022-04-28 03:02:05,359 INFO L290 TraceCheckUtils]: 2: Hoare triple {11971#true} assume true; {11971#true} is VALID [2022-04-28 03:02:05,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {11971#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {11971#true} is VALID [2022-04-28 03:02:05,359 INFO L272 TraceCheckUtils]: 0: Hoare triple {11971#true} call ULTIMATE.init(); {11971#true} is VALID [2022-04-28 03:02:05,359 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:02:05,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233666278] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:02:05,359 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:02:05,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 36] total 69 [2022-04-28 03:02:05,360 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:02:05,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1546037719] [2022-04-28 03:02:05,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1546037719] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:02:05,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:02:05,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-28 03:02:05,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748960095] [2022-04-28 03:02:05,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:02:05,360 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:02:05,360 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:02:05,361 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:02:05,381 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:05,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-28 03:02:05,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:05,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-28 03:02:05,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1189, Invalid=3503, Unknown=0, NotChecked=0, Total=4692 [2022-04-28 03:02:05,383 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:02:07,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:07,413 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-28 03:02:07,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-28 03:02:07,413 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:02:07,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:02:07,413 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:02:07,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2022-04-28 03:02:07,414 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:02:07,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2022-04-28 03:02:07,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 48 transitions. [2022-04-28 03:02:07,456 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:02:07,456 INFO L225 Difference]: With dead ends: 48 [2022-04-28 03:02:07,456 INFO L226 Difference]: Without dead ends: 43 [2022-04-28 03:02:07,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=2334, Invalid=7566, Unknown=0, NotChecked=0, Total=9900 [2022-04-28 03:02:07,457 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 03:02:07,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 153 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1072 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 03:02:07,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-28 03:02:07,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-28 03:02:07,494 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:02:07,494 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:02:07,495 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:02:07,495 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:02:07,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:07,495 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-28 03:02:07,495 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-28 03:02:07,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:07,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:07,496 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:02:07,496 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:02:07,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:07,496 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-28 03:02:07,496 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-28 03:02:07,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:07,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:07,496 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:02:07,496 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:02:07,497 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:02:07,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2022-04-28 03:02:07,497 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2022-04-28 03:02:07,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:02:07,497 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2022-04-28 03:02:07,497 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:02:07,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 43 transitions. [2022-04-28 03:02:07,537 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:07,537 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-28 03:02:07,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 03:02:07,537 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:02:07,537 INFO L195 NwaCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:02:07,543 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:02:07,741 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:02:07,941 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:02:07,941 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:02:07,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:02:07,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1940680266, now seen corresponding path program 61 times [2022-04-28 03:02:07,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:07,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [791805586] [2022-04-28 03:02:08,116 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:08,117 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:02:08,119 INFO L85 PathProgramCache]: Analyzing trace with hash -94147465, now seen corresponding path program 1 times [2022-04-28 03:02:08,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:08,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043353041] [2022-04-28 03:02:08,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:08,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:08,123 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_31.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_31.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:02:08,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:02:08,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [246890942] [2022-04-28 03:02:08,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:08,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:08,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:08,127 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:02:08,128 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:02:08,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:08,175 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:02:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:08,187 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:02:08,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1940680266, now seen corresponding path program 62 times [2022-04-28 03:02:08,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:08,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876909963] [2022-04-28 03:02:08,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:08,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:08,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:02:08,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:08,798 INFO L290 TraceCheckUtils]: 0: Hoare triple {12655#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {12618#true} is VALID [2022-04-28 03:02:08,798 INFO L290 TraceCheckUtils]: 1: Hoare triple {12618#true} assume true; {12618#true} is VALID [2022-04-28 03:02:08,798 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12618#true} {12618#true} #34#return; {12618#true} is VALID [2022-04-28 03:02:08,798 INFO L272 TraceCheckUtils]: 0: Hoare triple {12618#true} call ULTIMATE.init(); {12655#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:02:08,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {12655#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {12618#true} is VALID [2022-04-28 03:02:08,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {12618#true} assume true; {12618#true} is VALID [2022-04-28 03:02:08,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12618#true} {12618#true} #34#return; {12618#true} is VALID [2022-04-28 03:02:08,799 INFO L272 TraceCheckUtils]: 4: Hoare triple {12618#true} call #t~ret4 := main(); {12618#true} is VALID [2022-04-28 03:02:08,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {12618#true} ~x~0 := 0; {12623#(= main_~x~0 0)} is VALID [2022-04-28 03:02:08,799 INFO L290 TraceCheckUtils]: 6: Hoare triple {12623#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12624#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:02:08,800 INFO L290 TraceCheckUtils]: 7: Hoare triple {12624#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12625#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:02:08,800 INFO L290 TraceCheckUtils]: 8: Hoare triple {12625#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12626#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:02:08,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {12626#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12627#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:02:08,801 INFO L290 TraceCheckUtils]: 10: Hoare triple {12627#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12628#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:02:08,802 INFO L290 TraceCheckUtils]: 11: Hoare triple {12628#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12629#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:02:08,802 INFO L290 TraceCheckUtils]: 12: Hoare triple {12629#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12630#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:02:08,803 INFO L290 TraceCheckUtils]: 13: Hoare triple {12630#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12631#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:02:08,803 INFO L290 TraceCheckUtils]: 14: Hoare triple {12631#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12632#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:02:08,804 INFO L290 TraceCheckUtils]: 15: Hoare triple {12632#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12633#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:02:08,804 INFO L290 TraceCheckUtils]: 16: Hoare triple {12633#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12634#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:02:08,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {12634#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12635#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:02:08,805 INFO L290 TraceCheckUtils]: 18: Hoare triple {12635#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12636#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:02:08,806 INFO L290 TraceCheckUtils]: 19: Hoare triple {12636#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12637#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:02:08,806 INFO L290 TraceCheckUtils]: 20: Hoare triple {12637#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12638#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:02:08,806 INFO L290 TraceCheckUtils]: 21: Hoare triple {12638#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12639#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:02:08,807 INFO L290 TraceCheckUtils]: 22: Hoare triple {12639#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12640#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:02:08,807 INFO L290 TraceCheckUtils]: 23: Hoare triple {12640#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12641#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:02:08,808 INFO L290 TraceCheckUtils]: 24: Hoare triple {12641#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12642#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:02:08,808 INFO L290 TraceCheckUtils]: 25: Hoare triple {12642#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12643#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:02:08,809 INFO L290 TraceCheckUtils]: 26: Hoare triple {12643#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12644#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:02:08,809 INFO L290 TraceCheckUtils]: 27: Hoare triple {12644#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12645#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:02:08,810 INFO L290 TraceCheckUtils]: 28: Hoare triple {12645#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12646#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:02:08,810 INFO L290 TraceCheckUtils]: 29: Hoare triple {12646#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12647#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:02:08,811 INFO L290 TraceCheckUtils]: 30: Hoare triple {12647#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12648#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:02:08,811 INFO L290 TraceCheckUtils]: 31: Hoare triple {12648#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12649#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:02:08,812 INFO L290 TraceCheckUtils]: 32: Hoare triple {12649#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12650#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:02:08,812 INFO L290 TraceCheckUtils]: 33: Hoare triple {12650#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12651#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:02:08,812 INFO L290 TraceCheckUtils]: 34: Hoare triple {12651#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12652#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:02:08,813 INFO L290 TraceCheckUtils]: 35: Hoare triple {12652#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12653#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:02:08,813 INFO L290 TraceCheckUtils]: 36: Hoare triple {12653#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12654#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 62))} is VALID [2022-04-28 03:02:08,814 INFO L290 TraceCheckUtils]: 37: Hoare triple {12654#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 62))} assume !(~x~0 % 4294967296 < 268435455); {12619#false} is VALID [2022-04-28 03:02:08,814 INFO L272 TraceCheckUtils]: 38: Hoare triple {12619#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {12619#false} is VALID [2022-04-28 03:02:08,814 INFO L290 TraceCheckUtils]: 39: Hoare triple {12619#false} ~cond := #in~cond; {12619#false} is VALID [2022-04-28 03:02:08,814 INFO L290 TraceCheckUtils]: 40: Hoare triple {12619#false} assume 0 == ~cond; {12619#false} is VALID [2022-04-28 03:02:08,814 INFO L290 TraceCheckUtils]: 41: Hoare triple {12619#false} assume !false; {12619#false} is VALID [2022-04-28 03:02:08,815 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:02:08,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:02:08,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876909963] [2022-04-28 03:02:08,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876909963] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:02:08,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047579258] [2022-04-28 03:02:08,815 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:02:08,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:08,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:08,816 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:02:08,817 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:02:08,882 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:02:08,882 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:02:08,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 65 conjunts are in the unsatisfiable core [2022-04-28 03:02:08,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:08,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:02:09,271 INFO L272 TraceCheckUtils]: 0: Hoare triple {12618#true} call ULTIMATE.init(); {12618#true} is VALID [2022-04-28 03:02:09,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {12618#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {12618#true} is VALID [2022-04-28 03:02:09,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {12618#true} assume true; {12618#true} is VALID [2022-04-28 03:02:09,271 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12618#true} {12618#true} #34#return; {12618#true} is VALID [2022-04-28 03:02:09,272 INFO L272 TraceCheckUtils]: 4: Hoare triple {12618#true} call #t~ret4 := main(); {12618#true} is VALID [2022-04-28 03:02:09,272 INFO L290 TraceCheckUtils]: 5: Hoare triple {12618#true} ~x~0 := 0; {12623#(= main_~x~0 0)} is VALID [2022-04-28 03:02:09,272 INFO L290 TraceCheckUtils]: 6: Hoare triple {12623#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12624#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:02:09,273 INFO L290 TraceCheckUtils]: 7: Hoare triple {12624#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12625#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:02:09,273 INFO L290 TraceCheckUtils]: 8: Hoare triple {12625#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12626#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:02:09,274 INFO L290 TraceCheckUtils]: 9: Hoare triple {12626#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12627#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:02:09,274 INFO L290 TraceCheckUtils]: 10: Hoare triple {12627#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12628#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:02:09,275 INFO L290 TraceCheckUtils]: 11: Hoare triple {12628#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12629#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:02:09,276 INFO L290 TraceCheckUtils]: 12: Hoare triple {12629#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12630#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:02:09,276 INFO L290 TraceCheckUtils]: 13: Hoare triple {12630#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12631#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:02:09,277 INFO L290 TraceCheckUtils]: 14: Hoare triple {12631#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12632#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:02:09,277 INFO L290 TraceCheckUtils]: 15: Hoare triple {12632#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12633#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:02:09,278 INFO L290 TraceCheckUtils]: 16: Hoare triple {12633#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12634#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:02:09,278 INFO L290 TraceCheckUtils]: 17: Hoare triple {12634#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12635#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:02:09,279 INFO L290 TraceCheckUtils]: 18: Hoare triple {12635#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12636#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:02:09,279 INFO L290 TraceCheckUtils]: 19: Hoare triple {12636#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12637#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:02:09,280 INFO L290 TraceCheckUtils]: 20: Hoare triple {12637#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12638#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:02:09,280 INFO L290 TraceCheckUtils]: 21: Hoare triple {12638#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12639#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:02:09,281 INFO L290 TraceCheckUtils]: 22: Hoare triple {12639#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12640#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:02:09,281 INFO L290 TraceCheckUtils]: 23: Hoare triple {12640#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12641#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:02:09,282 INFO L290 TraceCheckUtils]: 24: Hoare triple {12641#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12642#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:02:09,282 INFO L290 TraceCheckUtils]: 25: Hoare triple {12642#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12643#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:02:09,283 INFO L290 TraceCheckUtils]: 26: Hoare triple {12643#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12644#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:02:09,283 INFO L290 TraceCheckUtils]: 27: Hoare triple {12644#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12645#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:02:09,284 INFO L290 TraceCheckUtils]: 28: Hoare triple {12645#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12646#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:02:09,284 INFO L290 TraceCheckUtils]: 29: Hoare triple {12646#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12647#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:02:09,285 INFO L290 TraceCheckUtils]: 30: Hoare triple {12647#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12648#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:02:09,285 INFO L290 TraceCheckUtils]: 31: Hoare triple {12648#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12649#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:02:09,286 INFO L290 TraceCheckUtils]: 32: Hoare triple {12649#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12650#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:02:09,286 INFO L290 TraceCheckUtils]: 33: Hoare triple {12650#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12651#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:02:09,287 INFO L290 TraceCheckUtils]: 34: Hoare triple {12651#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12652#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:02:09,287 INFO L290 TraceCheckUtils]: 35: Hoare triple {12652#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12653#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:02:09,288 INFO L290 TraceCheckUtils]: 36: Hoare triple {12653#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12767#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:02:09,288 INFO L290 TraceCheckUtils]: 37: Hoare triple {12767#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !(~x~0 % 4294967296 < 268435455); {12619#false} is VALID [2022-04-28 03:02:09,288 INFO L272 TraceCheckUtils]: 38: Hoare triple {12619#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {12619#false} is VALID [2022-04-28 03:02:09,288 INFO L290 TraceCheckUtils]: 39: Hoare triple {12619#false} ~cond := #in~cond; {12619#false} is VALID [2022-04-28 03:02:09,288 INFO L290 TraceCheckUtils]: 40: Hoare triple {12619#false} assume 0 == ~cond; {12619#false} is VALID [2022-04-28 03:02:09,288 INFO L290 TraceCheckUtils]: 41: Hoare triple {12619#false} assume !false; {12619#false} is VALID [2022-04-28 03:02:09,289 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:02:09,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:02:10,857 INFO L290 TraceCheckUtils]: 41: Hoare triple {12619#false} assume !false; {12619#false} is VALID [2022-04-28 03:02:10,858 INFO L290 TraceCheckUtils]: 40: Hoare triple {12619#false} assume 0 == ~cond; {12619#false} is VALID [2022-04-28 03:02:10,858 INFO L290 TraceCheckUtils]: 39: Hoare triple {12619#false} ~cond := #in~cond; {12619#false} is VALID [2022-04-28 03:02:10,858 INFO L272 TraceCheckUtils]: 38: Hoare triple {12619#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {12619#false} is VALID [2022-04-28 03:02:10,858 INFO L290 TraceCheckUtils]: 37: Hoare triple {12795#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {12619#false} is VALID [2022-04-28 03:02:10,859 INFO L290 TraceCheckUtils]: 36: Hoare triple {12799#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12795#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:02:10,860 INFO L290 TraceCheckUtils]: 35: Hoare triple {12803#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12799#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 03:02:10,860 INFO L290 TraceCheckUtils]: 34: Hoare triple {12807#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12803#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 03:02:10,861 INFO L290 TraceCheckUtils]: 33: Hoare triple {12811#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12807#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 03:02:10,862 INFO L290 TraceCheckUtils]: 32: Hoare triple {12815#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12811#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 03:02:10,862 INFO L290 TraceCheckUtils]: 31: Hoare triple {12819#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12815#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-28 03:02:10,863 INFO L290 TraceCheckUtils]: 30: Hoare triple {12823#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12819#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-28 03:02:10,864 INFO L290 TraceCheckUtils]: 29: Hoare triple {12827#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12823#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-28 03:02:10,864 INFO L290 TraceCheckUtils]: 28: Hoare triple {12831#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12827#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-28 03:02:10,865 INFO L290 TraceCheckUtils]: 27: Hoare triple {12835#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12831#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-28 03:02:10,865 INFO L290 TraceCheckUtils]: 26: Hoare triple {12839#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12835#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-28 03:02:10,866 INFO L290 TraceCheckUtils]: 25: Hoare triple {12843#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12839#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-28 03:02:10,866 INFO L290 TraceCheckUtils]: 24: Hoare triple {12847#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12843#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-28 03:02:10,867 INFO L290 TraceCheckUtils]: 23: Hoare triple {12851#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12847#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-28 03:02:10,868 INFO L290 TraceCheckUtils]: 22: Hoare triple {12855#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12851#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-28 03:02:10,868 INFO L290 TraceCheckUtils]: 21: Hoare triple {12859#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12855#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:02:10,869 INFO L290 TraceCheckUtils]: 20: Hoare triple {12863#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12859#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:02:10,869 INFO L290 TraceCheckUtils]: 19: Hoare triple {12867#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12863#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-28 03:02:10,870 INFO L290 TraceCheckUtils]: 18: Hoare triple {12871#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12867#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-28 03:02:10,871 INFO L290 TraceCheckUtils]: 17: Hoare triple {12875#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12871#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-28 03:02:10,871 INFO L290 TraceCheckUtils]: 16: Hoare triple {12879#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12875#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:02:10,872 INFO L290 TraceCheckUtils]: 15: Hoare triple {12883#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12879#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:02:10,872 INFO L290 TraceCheckUtils]: 14: Hoare triple {12887#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12883#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:02:10,873 INFO L290 TraceCheckUtils]: 13: Hoare triple {12891#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12887#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-28 03:02:10,874 INFO L290 TraceCheckUtils]: 12: Hoare triple {12895#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12891#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-28 03:02:10,874 INFO L290 TraceCheckUtils]: 11: Hoare triple {12899#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12895#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-28 03:02:10,875 INFO L290 TraceCheckUtils]: 10: Hoare triple {12903#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12899#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-28 03:02:10,875 INFO L290 TraceCheckUtils]: 9: Hoare triple {12907#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12903#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-28 03:02:10,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {12911#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12907#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:02:10,877 INFO L290 TraceCheckUtils]: 7: Hoare triple {12915#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12911#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-28 03:02:10,882 INFO L290 TraceCheckUtils]: 6: Hoare triple {12919#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {12915#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-28 03:02:10,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {12618#true} ~x~0 := 0; {12919#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-28 03:02:10,883 INFO L272 TraceCheckUtils]: 4: Hoare triple {12618#true} call #t~ret4 := main(); {12618#true} is VALID [2022-04-28 03:02:10,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12618#true} {12618#true} #34#return; {12618#true} is VALID [2022-04-28 03:02:10,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {12618#true} assume true; {12618#true} is VALID [2022-04-28 03:02:10,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {12618#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {12618#true} is VALID [2022-04-28 03:02:10,883 INFO L272 TraceCheckUtils]: 0: Hoare triple {12618#true} call ULTIMATE.init(); {12618#true} is VALID [2022-04-28 03:02:10,884 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:02:10,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047579258] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:02:10,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:02:10,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 68 [2022-04-28 03:02:10,884 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:02:10,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [791805586] [2022-04-28 03:02:10,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [791805586] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:02:10,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:02:10,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-28 03:02:10,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695543275] [2022-04-28 03:02:10,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:02:10,885 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:02:10,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:02:10,885 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:02:10,909 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:10,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-28 03:02:10,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:10,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-28 03:02:10,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1221, Invalid=3335, Unknown=0, NotChecked=0, Total=4556 [2022-04-28 03:02:10,910 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:02:13,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:13,040 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-28 03:02:13,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-28 03:02:13,040 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:02:13,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:02:13,040 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:02:13,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2022-04-28 03:02:13,041 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:02:13,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2022-04-28 03:02:13,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 49 transitions. [2022-04-28 03:02:13,070 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:02:13,070 INFO L225 Difference]: With dead ends: 49 [2022-04-28 03:02:13,070 INFO L226 Difference]: Without dead ends: 44 [2022-04-28 03:02:13,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2435, Invalid=7465, Unknown=0, NotChecked=0, Total=9900 [2022-04-28 03:02:13,071 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 03:02:13,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 158 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1139 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 03:02:13,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-28 03:02:13,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-28 03:02:13,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:02:13,110 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:02:13,110 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:02:13,111 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:02:13,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:13,111 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-28 03:02:13,111 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-28 03:02:13,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:13,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:13,111 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:02:13,112 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:02:13,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:13,112 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-04-28 03:02:13,112 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-28 03:02:13,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:13,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:13,112 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:02:13,112 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:02:13,112 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:02:13,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2022-04-28 03:02:13,113 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2022-04-28 03:02:13,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:02:13,113 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2022-04-28 03:02:13,113 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:02:13,113 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 44 transitions. [2022-04-28 03:02:13,143 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:02:13,144 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-04-28 03:02:13,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 03:02:13,144 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:02:13,144 INFO L195 NwaCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:02:13,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Ended with exit code 0 [2022-04-28 03:02:13,354 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:02:13,551 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:02:13,551 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:02:13,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:02:13,552 INFO L85 PathProgramCache]: Analyzing trace with hash 4915164, now seen corresponding path program 63 times [2022-04-28 03:02:13,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:13,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1023319430] [2022-04-28 03:02:13,724 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:13,725 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:02:13,727 INFO L85 PathProgramCache]: Analyzing trace with hash -35042121, now seen corresponding path program 1 times [2022-04-28 03:02:13,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:13,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98773543] [2022-04-28 03:02:13,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:13,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:13,731 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_32.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_32.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:02:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:02:13,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [224517429] [2022-04-28 03:02:13,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:13,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:13,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:13,735 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:02:13,736 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:02:13,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:13,774 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:02:13,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:13,780 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:02:13,780 INFO L85 PathProgramCache]: Analyzing trace with hash 4915164, now seen corresponding path program 64 times [2022-04-28 03:02:13,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:13,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183625472] [2022-04-28 03:02:13,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:13,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:13,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:14,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:02:14,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:14,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {13316#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {13278#true} is VALID [2022-04-28 03:02:14,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {13278#true} assume true; {13278#true} is VALID [2022-04-28 03:02:14,397 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13278#true} {13278#true} #34#return; {13278#true} is VALID [2022-04-28 03:02:14,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {13278#true} call ULTIMATE.init(); {13316#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:02:14,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {13316#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {13278#true} is VALID [2022-04-28 03:02:14,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {13278#true} assume true; {13278#true} is VALID [2022-04-28 03:02:14,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13278#true} {13278#true} #34#return; {13278#true} is VALID [2022-04-28 03:02:14,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {13278#true} call #t~ret4 := main(); {13278#true} is VALID [2022-04-28 03:02:14,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {13278#true} ~x~0 := 0; {13283#(= main_~x~0 0)} is VALID [2022-04-28 03:02:14,398 INFO L290 TraceCheckUtils]: 6: Hoare triple {13283#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13284#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:02:14,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {13284#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13285#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:02:14,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {13285#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13286#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:02:14,400 INFO L290 TraceCheckUtils]: 9: Hoare triple {13286#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13287#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:02:14,400 INFO L290 TraceCheckUtils]: 10: Hoare triple {13287#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13288#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:02:14,401 INFO L290 TraceCheckUtils]: 11: Hoare triple {13288#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13289#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:02:14,401 INFO L290 TraceCheckUtils]: 12: Hoare triple {13289#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13290#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:02:14,402 INFO L290 TraceCheckUtils]: 13: Hoare triple {13290#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13291#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:02:14,402 INFO L290 TraceCheckUtils]: 14: Hoare triple {13291#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13292#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:02:14,403 INFO L290 TraceCheckUtils]: 15: Hoare triple {13292#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13293#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:02:14,403 INFO L290 TraceCheckUtils]: 16: Hoare triple {13293#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13294#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:02:14,404 INFO L290 TraceCheckUtils]: 17: Hoare triple {13294#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13295#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:02:14,404 INFO L290 TraceCheckUtils]: 18: Hoare triple {13295#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13296#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:02:14,404 INFO L290 TraceCheckUtils]: 19: Hoare triple {13296#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13297#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:02:14,405 INFO L290 TraceCheckUtils]: 20: Hoare triple {13297#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13298#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:02:14,405 INFO L290 TraceCheckUtils]: 21: Hoare triple {13298#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13299#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:02:14,406 INFO L290 TraceCheckUtils]: 22: Hoare triple {13299#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13300#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:02:14,406 INFO L290 TraceCheckUtils]: 23: Hoare triple {13300#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13301#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:02:14,407 INFO L290 TraceCheckUtils]: 24: Hoare triple {13301#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13302#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:02:14,407 INFO L290 TraceCheckUtils]: 25: Hoare triple {13302#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13303#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:02:14,408 INFO L290 TraceCheckUtils]: 26: Hoare triple {13303#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13304#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:02:14,408 INFO L290 TraceCheckUtils]: 27: Hoare triple {13304#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13305#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:02:14,409 INFO L290 TraceCheckUtils]: 28: Hoare triple {13305#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13306#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:02:14,409 INFO L290 TraceCheckUtils]: 29: Hoare triple {13306#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13307#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:02:14,410 INFO L290 TraceCheckUtils]: 30: Hoare triple {13307#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13308#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:02:14,410 INFO L290 TraceCheckUtils]: 31: Hoare triple {13308#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13309#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:02:14,410 INFO L290 TraceCheckUtils]: 32: Hoare triple {13309#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13310#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:02:14,411 INFO L290 TraceCheckUtils]: 33: Hoare triple {13310#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13311#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:02:14,411 INFO L290 TraceCheckUtils]: 34: Hoare triple {13311#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13312#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:02:14,412 INFO L290 TraceCheckUtils]: 35: Hoare triple {13312#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13313#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:02:14,412 INFO L290 TraceCheckUtils]: 36: Hoare triple {13313#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13314#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:02:14,413 INFO L290 TraceCheckUtils]: 37: Hoare triple {13314#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13315#(and (<= main_~x~0 64) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:02:14,413 INFO L290 TraceCheckUtils]: 38: Hoare triple {13315#(and (<= main_~x~0 64) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {13279#false} is VALID [2022-04-28 03:02:14,413 INFO L272 TraceCheckUtils]: 39: Hoare triple {13279#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {13279#false} is VALID [2022-04-28 03:02:14,413 INFO L290 TraceCheckUtils]: 40: Hoare triple {13279#false} ~cond := #in~cond; {13279#false} is VALID [2022-04-28 03:02:14,413 INFO L290 TraceCheckUtils]: 41: Hoare triple {13279#false} assume 0 == ~cond; {13279#false} is VALID [2022-04-28 03:02:14,414 INFO L290 TraceCheckUtils]: 42: Hoare triple {13279#false} assume !false; {13279#false} is VALID [2022-04-28 03:02:14,414 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:02:14,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:02:14,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183625472] [2022-04-28 03:02:14,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183625472] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:02:14,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172967796] [2022-04-28 03:02:14,414 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:02:14,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:14,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:14,415 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:02:14,416 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:02:14,501 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:02:14,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:02:14,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 67 conjunts are in the unsatisfiable core [2022-04-28 03:02:14,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:14,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:02:14,888 INFO L272 TraceCheckUtils]: 0: Hoare triple {13278#true} call ULTIMATE.init(); {13278#true} is VALID [2022-04-28 03:02:14,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {13278#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {13278#true} is VALID [2022-04-28 03:02:14,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {13278#true} assume true; {13278#true} is VALID [2022-04-28 03:02:14,888 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13278#true} {13278#true} #34#return; {13278#true} is VALID [2022-04-28 03:02:14,888 INFO L272 TraceCheckUtils]: 4: Hoare triple {13278#true} call #t~ret4 := main(); {13278#true} is VALID [2022-04-28 03:02:14,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {13278#true} ~x~0 := 0; {13283#(= main_~x~0 0)} is VALID [2022-04-28 03:02:14,890 INFO L290 TraceCheckUtils]: 6: Hoare triple {13283#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13284#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:02:14,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {13284#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13285#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:02:14,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {13285#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13286#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:02:14,891 INFO L290 TraceCheckUtils]: 9: Hoare triple {13286#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13287#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:02:14,892 INFO L290 TraceCheckUtils]: 10: Hoare triple {13287#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13288#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:02:14,892 INFO L290 TraceCheckUtils]: 11: Hoare triple {13288#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13289#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:02:14,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {13289#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13290#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:02:14,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {13290#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13291#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:02:14,894 INFO L290 TraceCheckUtils]: 14: Hoare triple {13291#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13292#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:02:14,894 INFO L290 TraceCheckUtils]: 15: Hoare triple {13292#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13293#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:02:14,895 INFO L290 TraceCheckUtils]: 16: Hoare triple {13293#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13294#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:02:14,895 INFO L290 TraceCheckUtils]: 17: Hoare triple {13294#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13295#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:02:14,896 INFO L290 TraceCheckUtils]: 18: Hoare triple {13295#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13296#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:02:14,896 INFO L290 TraceCheckUtils]: 19: Hoare triple {13296#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13297#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:02:14,896 INFO L290 TraceCheckUtils]: 20: Hoare triple {13297#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13298#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:02:14,897 INFO L290 TraceCheckUtils]: 21: Hoare triple {13298#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13299#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:02:14,897 INFO L290 TraceCheckUtils]: 22: Hoare triple {13299#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13300#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:02:14,898 INFO L290 TraceCheckUtils]: 23: Hoare triple {13300#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13301#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:02:14,898 INFO L290 TraceCheckUtils]: 24: Hoare triple {13301#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13302#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:02:14,899 INFO L290 TraceCheckUtils]: 25: Hoare triple {13302#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13303#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:02:14,899 INFO L290 TraceCheckUtils]: 26: Hoare triple {13303#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13304#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:02:14,900 INFO L290 TraceCheckUtils]: 27: Hoare triple {13304#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13305#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:02:14,900 INFO L290 TraceCheckUtils]: 28: Hoare triple {13305#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13306#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:02:14,901 INFO L290 TraceCheckUtils]: 29: Hoare triple {13306#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13307#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:02:14,901 INFO L290 TraceCheckUtils]: 30: Hoare triple {13307#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13308#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:02:14,902 INFO L290 TraceCheckUtils]: 31: Hoare triple {13308#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13309#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:02:14,902 INFO L290 TraceCheckUtils]: 32: Hoare triple {13309#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13310#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:02:14,902 INFO L290 TraceCheckUtils]: 33: Hoare triple {13310#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13311#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:02:14,903 INFO L290 TraceCheckUtils]: 34: Hoare triple {13311#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13312#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:02:14,903 INFO L290 TraceCheckUtils]: 35: Hoare triple {13312#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13313#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:02:14,904 INFO L290 TraceCheckUtils]: 36: Hoare triple {13313#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13314#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:02:14,904 INFO L290 TraceCheckUtils]: 37: Hoare triple {13314#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13431#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:02:14,905 INFO L290 TraceCheckUtils]: 38: Hoare triple {13431#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {13279#false} is VALID [2022-04-28 03:02:14,905 INFO L272 TraceCheckUtils]: 39: Hoare triple {13279#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {13279#false} is VALID [2022-04-28 03:02:14,905 INFO L290 TraceCheckUtils]: 40: Hoare triple {13279#false} ~cond := #in~cond; {13279#false} is VALID [2022-04-28 03:02:14,905 INFO L290 TraceCheckUtils]: 41: Hoare triple {13279#false} assume 0 == ~cond; {13279#false} is VALID [2022-04-28 03:02:14,905 INFO L290 TraceCheckUtils]: 42: Hoare triple {13279#false} assume !false; {13279#false} is VALID [2022-04-28 03:02:14,905 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:02:14,906 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:02:16,537 INFO L290 TraceCheckUtils]: 42: Hoare triple {13279#false} assume !false; {13279#false} is VALID [2022-04-28 03:02:16,538 INFO L290 TraceCheckUtils]: 41: Hoare triple {13279#false} assume 0 == ~cond; {13279#false} is VALID [2022-04-28 03:02:16,538 INFO L290 TraceCheckUtils]: 40: Hoare triple {13279#false} ~cond := #in~cond; {13279#false} is VALID [2022-04-28 03:02:16,538 INFO L272 TraceCheckUtils]: 39: Hoare triple {13279#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {13279#false} is VALID [2022-04-28 03:02:16,538 INFO L290 TraceCheckUtils]: 38: Hoare triple {13459#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {13279#false} is VALID [2022-04-28 03:02:16,539 INFO L290 TraceCheckUtils]: 37: Hoare triple {13463#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13459#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:02:16,539 INFO L290 TraceCheckUtils]: 36: Hoare triple {13467#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13463#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 03:02:16,540 INFO L290 TraceCheckUtils]: 35: Hoare triple {13471#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13467#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 03:02:16,541 INFO L290 TraceCheckUtils]: 34: Hoare triple {13475#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13471#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 03:02:16,541 INFO L290 TraceCheckUtils]: 33: Hoare triple {13479#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13475#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 03:02:16,542 INFO L290 TraceCheckUtils]: 32: Hoare triple {13483#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13479#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-28 03:02:16,542 INFO L290 TraceCheckUtils]: 31: Hoare triple {13487#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13483#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-28 03:02:16,543 INFO L290 TraceCheckUtils]: 30: Hoare triple {13491#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13487#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-28 03:02:16,544 INFO L290 TraceCheckUtils]: 29: Hoare triple {13495#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13491#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-28 03:02:16,544 INFO L290 TraceCheckUtils]: 28: Hoare triple {13499#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13495#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-28 03:02:16,545 INFO L290 TraceCheckUtils]: 27: Hoare triple {13503#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13499#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-28 03:02:16,545 INFO L290 TraceCheckUtils]: 26: Hoare triple {13507#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13503#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-28 03:02:16,546 INFO L290 TraceCheckUtils]: 25: Hoare triple {13511#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13507#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-28 03:02:16,546 INFO L290 TraceCheckUtils]: 24: Hoare triple {13515#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13511#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-28 03:02:16,547 INFO L290 TraceCheckUtils]: 23: Hoare triple {13519#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13515#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-28 03:02:16,548 INFO L290 TraceCheckUtils]: 22: Hoare triple {13523#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13519#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:02:16,548 INFO L290 TraceCheckUtils]: 21: Hoare triple {13527#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13523#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:02:16,549 INFO L290 TraceCheckUtils]: 20: Hoare triple {13531#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13527#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-28 03:02:16,550 INFO L290 TraceCheckUtils]: 19: Hoare triple {13535#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13531#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-28 03:02:16,550 INFO L290 TraceCheckUtils]: 18: Hoare triple {13539#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13535#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-28 03:02:16,551 INFO L290 TraceCheckUtils]: 17: Hoare triple {13543#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13539#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:02:16,551 INFO L290 TraceCheckUtils]: 16: Hoare triple {13547#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13543#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:02:16,553 INFO L290 TraceCheckUtils]: 15: Hoare triple {13551#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13547#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:02:16,553 INFO L290 TraceCheckUtils]: 14: Hoare triple {13555#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13551#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-28 03:02:16,554 INFO L290 TraceCheckUtils]: 13: Hoare triple {13559#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13555#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-28 03:02:16,555 INFO L290 TraceCheckUtils]: 12: Hoare triple {13563#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13559#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-28 03:02:16,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {13567#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13563#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-28 03:02:16,556 INFO L290 TraceCheckUtils]: 10: Hoare triple {13571#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13567#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-28 03:02:16,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {13575#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13571#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:02:16,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {13579#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13575#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-28 03:02:16,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {13583#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13579#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-28 03:02:16,560 INFO L290 TraceCheckUtils]: 6: Hoare triple {13587#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13583#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-28 03:02:16,560 INFO L290 TraceCheckUtils]: 5: Hoare triple {13278#true} ~x~0 := 0; {13587#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:02:16,560 INFO L272 TraceCheckUtils]: 4: Hoare triple {13278#true} call #t~ret4 := main(); {13278#true} is VALID [2022-04-28 03:02:16,560 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13278#true} {13278#true} #34#return; {13278#true} is VALID [2022-04-28 03:02:16,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {13278#true} assume true; {13278#true} is VALID [2022-04-28 03:02:16,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {13278#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {13278#true} is VALID [2022-04-28 03:02:16,561 INFO L272 TraceCheckUtils]: 0: Hoare triple {13278#true} call ULTIMATE.init(); {13278#true} is VALID [2022-04-28 03:02:16,561 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:02:16,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172967796] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:02:16,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:02:16,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 70 [2022-04-28 03:02:16,562 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:02:16,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1023319430] [2022-04-28 03:02:16,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1023319430] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:02:16,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:02:16,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-28 03:02:16,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830224053] [2022-04-28 03:02:16,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:02:16,562 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:02:16,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:02:16,562 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:02:16,587 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:16,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-28 03:02:16,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:16,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-28 03:02:16,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1292, Invalid=3538, Unknown=0, NotChecked=0, Total=4830 [2022-04-28 03:02:16,588 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:02:18,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:18,791 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-28 03:02:18,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-28 03:02:18,791 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:02:18,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:02:18,791 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:02:18,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2022-04-28 03:02:18,792 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:02:18,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 50 transitions. [2022-04-28 03:02:18,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 50 transitions. [2022-04-28 03:02:18,823 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:02:18,823 INFO L225 Difference]: With dead ends: 50 [2022-04-28 03:02:18,824 INFO L226 Difference]: Without dead ends: 45 [2022-04-28 03:02:18,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2577, Invalid=7929, Unknown=0, NotChecked=0, Total=10506 [2022-04-28 03:02:18,825 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 1178 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 1245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:02:18,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 133 Invalid, 1245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1178 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 03:02:18,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-28 03:02:18,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-04-28 03:02:18,867 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:02:18,867 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:02:18,867 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:02:18,867 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:02:18,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:18,868 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-28 03:02:18,868 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-28 03:02:18,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:18,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:18,868 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:02:18,868 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:02:18,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:18,869 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-04-28 03:02:18,869 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-28 03:02:18,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:18,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:18,869 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:02:18,869 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:02:18,869 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:02:18,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2022-04-28 03:02:18,870 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2022-04-28 03:02:18,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:02:18,870 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2022-04-28 03:02:18,870 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:02:18,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 45 transitions. [2022-04-28 03:02:18,908 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:02:18,909 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-04-28 03:02:18,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-28 03:02:18,909 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:02:18,909 INFO L195 NwaCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:02:18,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Ended with exit code 0 [2022-04-28 03:02:19,143 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:02:19,310 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:02:19,310 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:02:19,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:02:19,310 INFO L85 PathProgramCache]: Analyzing trace with hash 188831350, now seen corresponding path program 65 times [2022-04-28 03:02:19,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:19,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [442943251] [2022-04-28 03:02:19,476 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,477 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:02:19,479 INFO L85 PathProgramCache]: Analyzing trace with hash 24063223, now seen corresponding path program 1 times [2022-04-28 03:02:19,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:19,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307413352] [2022-04-28 03:02:19,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:19,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:19,482 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_33.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_33.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:02:19,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:02:19,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1845823309] [2022-04-28 03:02:19,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:19,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:19,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:19,486 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:02:19,492 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:02:19,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:19,530 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:02:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:19,537 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:02:19,537 INFO L85 PathProgramCache]: Analyzing trace with hash 188831350, now seen corresponding path program 66 times [2022-04-28 03:02:19,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:19,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390526129] [2022-04-28 03:02:19,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:19,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:19,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:20,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:02:20,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:20,217 INFO L290 TraceCheckUtils]: 0: Hoare triple {13993#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {13954#true} is VALID [2022-04-28 03:02:20,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {13954#true} assume true; {13954#true} is VALID [2022-04-28 03:02:20,217 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13954#true} {13954#true} #34#return; {13954#true} is VALID [2022-04-28 03:02:20,218 INFO L272 TraceCheckUtils]: 0: Hoare triple {13954#true} call ULTIMATE.init(); {13993#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:02:20,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {13993#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {13954#true} is VALID [2022-04-28 03:02:20,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {13954#true} assume true; {13954#true} is VALID [2022-04-28 03:02:20,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13954#true} {13954#true} #34#return; {13954#true} is VALID [2022-04-28 03:02:20,218 INFO L272 TraceCheckUtils]: 4: Hoare triple {13954#true} call #t~ret4 := main(); {13954#true} is VALID [2022-04-28 03:02:20,218 INFO L290 TraceCheckUtils]: 5: Hoare triple {13954#true} ~x~0 := 0; {13959#(= main_~x~0 0)} is VALID [2022-04-28 03:02:20,219 INFO L290 TraceCheckUtils]: 6: Hoare triple {13959#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13960#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:02:20,219 INFO L290 TraceCheckUtils]: 7: Hoare triple {13960#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13961#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:02:20,220 INFO L290 TraceCheckUtils]: 8: Hoare triple {13961#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13962#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:02:20,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {13962#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13963#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:02:20,221 INFO L290 TraceCheckUtils]: 10: Hoare triple {13963#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13964#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:02:20,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {13964#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13965#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:02:20,222 INFO L290 TraceCheckUtils]: 12: Hoare triple {13965#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13966#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:02:20,222 INFO L290 TraceCheckUtils]: 13: Hoare triple {13966#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13967#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:02:20,223 INFO L290 TraceCheckUtils]: 14: Hoare triple {13967#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13968#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:02:20,223 INFO L290 TraceCheckUtils]: 15: Hoare triple {13968#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13969#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:02:20,223 INFO L290 TraceCheckUtils]: 16: Hoare triple {13969#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13970#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:02:20,224 INFO L290 TraceCheckUtils]: 17: Hoare triple {13970#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13971#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:02:20,224 INFO L290 TraceCheckUtils]: 18: Hoare triple {13971#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13972#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:02:20,225 INFO L290 TraceCheckUtils]: 19: Hoare triple {13972#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13973#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:02:20,225 INFO L290 TraceCheckUtils]: 20: Hoare triple {13973#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13974#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:02:20,226 INFO L290 TraceCheckUtils]: 21: Hoare triple {13974#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13975#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:02:20,226 INFO L290 TraceCheckUtils]: 22: Hoare triple {13975#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13976#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:02:20,227 INFO L290 TraceCheckUtils]: 23: Hoare triple {13976#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13977#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:02:20,227 INFO L290 TraceCheckUtils]: 24: Hoare triple {13977#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13978#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:02:20,228 INFO L290 TraceCheckUtils]: 25: Hoare triple {13978#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13979#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:02:20,228 INFO L290 TraceCheckUtils]: 26: Hoare triple {13979#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13980#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:02:20,229 INFO L290 TraceCheckUtils]: 27: Hoare triple {13980#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13981#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:02:20,229 INFO L290 TraceCheckUtils]: 28: Hoare triple {13981#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13982#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:02:20,230 INFO L290 TraceCheckUtils]: 29: Hoare triple {13982#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13983#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:02:20,230 INFO L290 TraceCheckUtils]: 30: Hoare triple {13983#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13984#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:02:20,230 INFO L290 TraceCheckUtils]: 31: Hoare triple {13984#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13985#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:02:20,231 INFO L290 TraceCheckUtils]: 32: Hoare triple {13985#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13986#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:02:20,231 INFO L290 TraceCheckUtils]: 33: Hoare triple {13986#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13987#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:02:20,232 INFO L290 TraceCheckUtils]: 34: Hoare triple {13987#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13988#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:02:20,232 INFO L290 TraceCheckUtils]: 35: Hoare triple {13988#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13989#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:02:20,233 INFO L290 TraceCheckUtils]: 36: Hoare triple {13989#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13990#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:02:20,233 INFO L290 TraceCheckUtils]: 37: Hoare triple {13990#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13991#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:02:20,234 INFO L290 TraceCheckUtils]: 38: Hoare triple {13991#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13992#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 66))} is VALID [2022-04-28 03:02:20,234 INFO L290 TraceCheckUtils]: 39: Hoare triple {13992#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 66))} assume !(~x~0 % 4294967296 < 268435455); {13955#false} is VALID [2022-04-28 03:02:20,234 INFO L272 TraceCheckUtils]: 40: Hoare triple {13955#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {13955#false} is VALID [2022-04-28 03:02:20,234 INFO L290 TraceCheckUtils]: 41: Hoare triple {13955#false} ~cond := #in~cond; {13955#false} is VALID [2022-04-28 03:02:20,234 INFO L290 TraceCheckUtils]: 42: Hoare triple {13955#false} assume 0 == ~cond; {13955#false} is VALID [2022-04-28 03:02:20,234 INFO L290 TraceCheckUtils]: 43: Hoare triple {13955#false} assume !false; {13955#false} is VALID [2022-04-28 03:02:20,235 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:02:20,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:02:20,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390526129] [2022-04-28 03:02:20,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390526129] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:02:20,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550307378] [2022-04-28 03:02:20,235 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:02:20,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:20,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:20,236 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:02:20,238 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:02:21,562 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2022-04-28 03:02:21,562 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:02:21,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 72 conjunts are in the unsatisfiable core [2022-04-28 03:02:21,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:21,574 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:02:21,895 INFO L272 TraceCheckUtils]: 0: Hoare triple {13954#true} call ULTIMATE.init(); {13954#true} is VALID [2022-04-28 03:02:21,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {13954#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {13954#true} is VALID [2022-04-28 03:02:21,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {13954#true} assume true; {13954#true} is VALID [2022-04-28 03:02:21,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13954#true} {13954#true} #34#return; {13954#true} is VALID [2022-04-28 03:02:21,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {13954#true} call #t~ret4 := main(); {13954#true} is VALID [2022-04-28 03:02:21,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {13954#true} ~x~0 := 0; {13959#(= main_~x~0 0)} is VALID [2022-04-28 03:02:21,896 INFO L290 TraceCheckUtils]: 6: Hoare triple {13959#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13960#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:02:21,897 INFO L290 TraceCheckUtils]: 7: Hoare triple {13960#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13961#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:02:21,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {13961#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13962#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:02:21,898 INFO L290 TraceCheckUtils]: 9: Hoare triple {13962#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13963#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:02:21,898 INFO L290 TraceCheckUtils]: 10: Hoare triple {13963#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13964#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:02:21,899 INFO L290 TraceCheckUtils]: 11: Hoare triple {13964#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13965#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:02:21,899 INFO L290 TraceCheckUtils]: 12: Hoare triple {13965#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13966#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:02:21,900 INFO L290 TraceCheckUtils]: 13: Hoare triple {13966#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13967#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:02:21,900 INFO L290 TraceCheckUtils]: 14: Hoare triple {13967#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13968#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:02:21,901 INFO L290 TraceCheckUtils]: 15: Hoare triple {13968#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13969#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:02:21,901 INFO L290 TraceCheckUtils]: 16: Hoare triple {13969#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13970#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:02:21,902 INFO L290 TraceCheckUtils]: 17: Hoare triple {13970#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13971#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:02:21,902 INFO L290 TraceCheckUtils]: 18: Hoare triple {13971#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13972#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:02:21,903 INFO L290 TraceCheckUtils]: 19: Hoare triple {13972#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13973#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:02:21,903 INFO L290 TraceCheckUtils]: 20: Hoare triple {13973#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13974#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:02:21,903 INFO L290 TraceCheckUtils]: 21: Hoare triple {13974#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13975#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:02:21,904 INFO L290 TraceCheckUtils]: 22: Hoare triple {13975#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13976#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:02:21,904 INFO L290 TraceCheckUtils]: 23: Hoare triple {13976#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13977#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:02:21,905 INFO L290 TraceCheckUtils]: 24: Hoare triple {13977#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13978#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:02:21,905 INFO L290 TraceCheckUtils]: 25: Hoare triple {13978#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13979#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:02:21,906 INFO L290 TraceCheckUtils]: 26: Hoare triple {13979#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13980#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:02:21,906 INFO L290 TraceCheckUtils]: 27: Hoare triple {13980#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13981#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:02:21,907 INFO L290 TraceCheckUtils]: 28: Hoare triple {13981#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13982#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:02:21,907 INFO L290 TraceCheckUtils]: 29: Hoare triple {13982#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13983#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:02:21,908 INFO L290 TraceCheckUtils]: 30: Hoare triple {13983#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13984#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:02:21,908 INFO L290 TraceCheckUtils]: 31: Hoare triple {13984#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13985#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:02:21,909 INFO L290 TraceCheckUtils]: 32: Hoare triple {13985#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13986#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:02:21,909 INFO L290 TraceCheckUtils]: 33: Hoare triple {13986#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13987#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:02:21,909 INFO L290 TraceCheckUtils]: 34: Hoare triple {13987#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13988#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:02:21,910 INFO L290 TraceCheckUtils]: 35: Hoare triple {13988#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13989#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:02:21,910 INFO L290 TraceCheckUtils]: 36: Hoare triple {13989#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13990#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:02:21,911 INFO L290 TraceCheckUtils]: 37: Hoare triple {13990#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {13991#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:02:21,911 INFO L290 TraceCheckUtils]: 38: Hoare triple {13991#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14111#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:02:21,912 INFO L290 TraceCheckUtils]: 39: Hoare triple {14111#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !(~x~0 % 4294967296 < 268435455); {13955#false} is VALID [2022-04-28 03:02:21,912 INFO L272 TraceCheckUtils]: 40: Hoare triple {13955#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {13955#false} is VALID [2022-04-28 03:02:21,912 INFO L290 TraceCheckUtils]: 41: Hoare triple {13955#false} ~cond := #in~cond; {13955#false} is VALID [2022-04-28 03:02:21,912 INFO L290 TraceCheckUtils]: 42: Hoare triple {13955#false} assume 0 == ~cond; {13955#false} is VALID [2022-04-28 03:02:21,912 INFO L290 TraceCheckUtils]: 43: Hoare triple {13955#false} assume !false; {13955#false} is VALID [2022-04-28 03:02:21,913 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:02:21,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:02:24,411 INFO L290 TraceCheckUtils]: 43: Hoare triple {13955#false} assume !false; {13955#false} is VALID [2022-04-28 03:02:24,411 INFO L290 TraceCheckUtils]: 42: Hoare triple {14130#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {13955#false} is VALID [2022-04-28 03:02:24,411 INFO L290 TraceCheckUtils]: 41: Hoare triple {14134#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {14130#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:02:24,412 INFO L272 TraceCheckUtils]: 40: Hoare triple {14138#(< 0 (mod main_~x~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {14134#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:02:24,412 INFO L290 TraceCheckUtils]: 39: Hoare triple {14142#(or (< 0 (mod main_~x~0 2)) (< (mod main_~x~0 4294967296) 268435455))} assume !(~x~0 % 4294967296 < 268435455); {14138#(< 0 (mod main_~x~0 2))} is VALID [2022-04-28 03:02:24,413 INFO L290 TraceCheckUtils]: 38: Hoare triple {14146#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14142#(or (< 0 (mod main_~x~0 2)) (< (mod main_~x~0 4294967296) 268435455))} is VALID [2022-04-28 03:02:24,414 INFO L290 TraceCheckUtils]: 37: Hoare triple {14150#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14146#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} is VALID [2022-04-28 03:02:24,415 INFO L290 TraceCheckUtils]: 36: Hoare triple {14154#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14150#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} is VALID [2022-04-28 03:02:24,416 INFO L290 TraceCheckUtils]: 35: Hoare triple {14158#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14154#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} is VALID [2022-04-28 03:02:24,418 INFO L290 TraceCheckUtils]: 34: Hoare triple {14162#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14158#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} is VALID [2022-04-28 03:02:24,419 INFO L290 TraceCheckUtils]: 33: Hoare triple {14166#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14162#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} is VALID [2022-04-28 03:02:24,420 INFO L290 TraceCheckUtils]: 32: Hoare triple {14170#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14166#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} is VALID [2022-04-28 03:02:24,425 INFO L290 TraceCheckUtils]: 31: Hoare triple {14174#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 16) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14170#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 268435455))} is VALID [2022-04-28 03:02:24,436 INFO L290 TraceCheckUtils]: 30: Hoare triple {14178#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14174#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 16) 4294967296) 268435455))} is VALID [2022-04-28 03:02:24,437 INFO L290 TraceCheckUtils]: 29: Hoare triple {14182#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14178#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 268435455))} is VALID [2022-04-28 03:02:24,437 INFO L290 TraceCheckUtils]: 28: Hoare triple {14186#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14182#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} is VALID [2022-04-28 03:02:24,438 INFO L290 TraceCheckUtils]: 27: Hoare triple {14190#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14186#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} is VALID [2022-04-28 03:02:24,439 INFO L290 TraceCheckUtils]: 26: Hoare triple {14194#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14190#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} is VALID [2022-04-28 03:02:24,442 INFO L290 TraceCheckUtils]: 25: Hoare triple {14198#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 28) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14194#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} is VALID [2022-04-28 03:02:24,444 INFO L290 TraceCheckUtils]: 24: Hoare triple {14202#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 30 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14198#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 28) 4294967296) 268435455))} is VALID [2022-04-28 03:02:24,445 INFO L290 TraceCheckUtils]: 23: Hoare triple {14206#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14202#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 30 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:02:24,446 INFO L290 TraceCheckUtils]: 22: Hoare triple {14210#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 34) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14206#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:02:24,448 INFO L290 TraceCheckUtils]: 21: Hoare triple {14214#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14210#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 34) 4294967296) 268435455))} is VALID [2022-04-28 03:02:24,451 INFO L290 TraceCheckUtils]: 20: Hoare triple {14218#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 38) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14214#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} is VALID [2022-04-28 03:02:24,452 INFO L290 TraceCheckUtils]: 19: Hoare triple {14222#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (< 0 (mod main_~x~0 2)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14218#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 38) 4294967296) 268435455))} is VALID [2022-04-28 03:02:24,452 INFO L290 TraceCheckUtils]: 18: Hoare triple {14226#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 42 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14222#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (< 0 (mod main_~x~0 2)))} is VALID [2022-04-28 03:02:24,455 INFO L290 TraceCheckUtils]: 17: Hoare triple {14230#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14226#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 42 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:02:24,458 INFO L290 TraceCheckUtils]: 16: Hoare triple {14234#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14230#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:02:24,459 INFO L290 TraceCheckUtils]: 15: Hoare triple {14238#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14234#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} is VALID [2022-04-28 03:02:24,460 INFO L290 TraceCheckUtils]: 14: Hoare triple {14242#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 50) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14238#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} is VALID [2022-04-28 03:02:24,461 INFO L290 TraceCheckUtils]: 13: Hoare triple {14246#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14242#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 50) 4294967296) 268435455))} is VALID [2022-04-28 03:02:24,462 INFO L290 TraceCheckUtils]: 12: Hoare triple {14250#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14246#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} is VALID [2022-04-28 03:02:24,462 INFO L290 TraceCheckUtils]: 11: Hoare triple {14254#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 56 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14250#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} is VALID [2022-04-28 03:02:24,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {14258#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 58) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14254#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 56 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:02:24,469 INFO L290 TraceCheckUtils]: 9: Hoare triple {14262#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 60) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14258#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 58) 4294967296) 268435455))} is VALID [2022-04-28 03:02:24,470 INFO L290 TraceCheckUtils]: 8: Hoare triple {14266#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 62) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14262#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 60) 4294967296) 268435455))} is VALID [2022-04-28 03:02:24,471 INFO L290 TraceCheckUtils]: 7: Hoare triple {14270#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 64 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14266#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 62) 4294967296) 268435455))} is VALID [2022-04-28 03:02:24,473 INFO L290 TraceCheckUtils]: 6: Hoare triple {14274#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 66 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14270#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 64 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:02:24,473 INFO L290 TraceCheckUtils]: 5: Hoare triple {13954#true} ~x~0 := 0; {14274#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 66 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:02:24,473 INFO L272 TraceCheckUtils]: 4: Hoare triple {13954#true} call #t~ret4 := main(); {13954#true} is VALID [2022-04-28 03:02:24,473 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13954#true} {13954#true} #34#return; {13954#true} is VALID [2022-04-28 03:02:24,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {13954#true} assume true; {13954#true} is VALID [2022-04-28 03:02:24,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {13954#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {13954#true} is VALID [2022-04-28 03:02:24,474 INFO L272 TraceCheckUtils]: 0: Hoare triple {13954#true} call ULTIMATE.init(); {13954#true} is VALID [2022-04-28 03:02:24,474 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:02:24,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550307378] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:02:24,474 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:02:24,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36, 39] total 75 [2022-04-28 03:02:24,475 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:02:24,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [442943251] [2022-04-28 03:02:24,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [442943251] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:02:24,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:02:24,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-28 03:02:24,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604850051] [2022-04-28 03:02:24,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:02:24,475 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:02:24,475 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:02:24,476 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:02:24,501 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:02:24,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-28 03:02:24,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:24,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-28 03:02:24,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1405, Invalid=4145, Unknown=0, NotChecked=0, Total=5550 [2022-04-28 03:02:24,502 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:02:26,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:26,710 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-28 03:02:26,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-28 03:02:26,710 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:02:26,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:02:26,711 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:02:26,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2022-04-28 03:02:26,711 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:02:26,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2022-04-28 03:02:26,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 51 transitions. [2022-04-28 03:02:26,748 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:02:26,749 INFO L225 Difference]: With dead ends: 51 [2022-04-28 03:02:26,749 INFO L226 Difference]: Without dead ends: 46 [2022-04-28 03:02:26,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 639 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2763, Invalid=9009, Unknown=0, NotChecked=0, Total=11772 [2022-04-28 03:02:26,750 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1144 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 03:02:26,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 33 Invalid, 1213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1144 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 03:02:26,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-28 03:02:26,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-28 03:02:26,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:02:26,790 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:02:26,790 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:02:26,790 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:02:26,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:26,791 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-28 03:02:26,791 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-28 03:02:26,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:26,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:26,791 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:02:26,791 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:02:26,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:26,792 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2022-04-28 03:02:26,792 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-28 03:02:26,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:26,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:26,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:02:26,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:02:26,792 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:02:26,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2022-04-28 03:02:26,793 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2022-04-28 03:02:26,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:02:26,793 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2022-04-28 03:02:26,793 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:02:26,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 46 transitions. [2022-04-28 03:02:26,835 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:02:26,836 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2022-04-28 03:02:26,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 03:02:26,836 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:02:26,836 INFO L195 NwaCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:02:26,845 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:02:27,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Ended with exit code 0 [2022-04-28 03:02:27,236 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:02:27,237 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:02:27,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:02:27,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1595265820, now seen corresponding path program 67 times [2022-04-28 03:02:27,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:27,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1228158734] [2022-04-28 03:02:27,464 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:27,466 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:02:27,467 INFO L85 PathProgramCache]: Analyzing trace with hash 83168567, now seen corresponding path program 1 times [2022-04-28 03:02:27,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:27,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424206485] [2022-04-28 03:02:27,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:27,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:27,472 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_34.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_34.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:02:27,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:02:27,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [744374565] [2022-04-28 03:02:27,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:27,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:27,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:27,476 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:02:27,476 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:02:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:27,520 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:02:27,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:27,529 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:02:27,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1595265820, now seen corresponding path program 68 times [2022-04-28 03:02:27,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:27,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985668521] [2022-04-28 03:02:27,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:27,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:27,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:28,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:02:28,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:28,240 INFO L290 TraceCheckUtils]: 0: Hoare triple {14689#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {14649#true} is VALID [2022-04-28 03:02:28,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {14649#true} assume true; {14649#true} is VALID [2022-04-28 03:02:28,240 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14649#true} {14649#true} #34#return; {14649#true} is VALID [2022-04-28 03:02:28,241 INFO L272 TraceCheckUtils]: 0: Hoare triple {14649#true} call ULTIMATE.init(); {14689#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:02:28,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {14689#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {14649#true} is VALID [2022-04-28 03:02:28,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {14649#true} assume true; {14649#true} is VALID [2022-04-28 03:02:28,241 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14649#true} {14649#true} #34#return; {14649#true} is VALID [2022-04-28 03:02:28,241 INFO L272 TraceCheckUtils]: 4: Hoare triple {14649#true} call #t~ret4 := main(); {14649#true} is VALID [2022-04-28 03:02:28,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {14649#true} ~x~0 := 0; {14654#(= main_~x~0 0)} is VALID [2022-04-28 03:02:28,241 INFO L290 TraceCheckUtils]: 6: Hoare triple {14654#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14655#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:02:28,242 INFO L290 TraceCheckUtils]: 7: Hoare triple {14655#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14656#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:02:28,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {14656#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14657#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:02:28,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {14657#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14658#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:02:28,243 INFO L290 TraceCheckUtils]: 10: Hoare triple {14658#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14659#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:02:28,244 INFO L290 TraceCheckUtils]: 11: Hoare triple {14659#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14660#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:02:28,244 INFO L290 TraceCheckUtils]: 12: Hoare triple {14660#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14661#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:02:28,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {14661#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14662#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:02:28,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {14662#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14663#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:02:28,246 INFO L290 TraceCheckUtils]: 15: Hoare triple {14663#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14664#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:02:28,246 INFO L290 TraceCheckUtils]: 16: Hoare triple {14664#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14665#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:02:28,247 INFO L290 TraceCheckUtils]: 17: Hoare triple {14665#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14666#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:02:28,247 INFO L290 TraceCheckUtils]: 18: Hoare triple {14666#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14667#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:02:28,248 INFO L290 TraceCheckUtils]: 19: Hoare triple {14667#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14668#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:02:28,248 INFO L290 TraceCheckUtils]: 20: Hoare triple {14668#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14669#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:02:28,248 INFO L290 TraceCheckUtils]: 21: Hoare triple {14669#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14670#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:02:28,249 INFO L290 TraceCheckUtils]: 22: Hoare triple {14670#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14671#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:02:28,249 INFO L290 TraceCheckUtils]: 23: Hoare triple {14671#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14672#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:02:28,250 INFO L290 TraceCheckUtils]: 24: Hoare triple {14672#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14673#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:02:28,250 INFO L290 TraceCheckUtils]: 25: Hoare triple {14673#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14674#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:02:28,251 INFO L290 TraceCheckUtils]: 26: Hoare triple {14674#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14675#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:02:28,251 INFO L290 TraceCheckUtils]: 27: Hoare triple {14675#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14676#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:02:28,252 INFO L290 TraceCheckUtils]: 28: Hoare triple {14676#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14677#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:02:28,252 INFO L290 TraceCheckUtils]: 29: Hoare triple {14677#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14678#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:02:28,253 INFO L290 TraceCheckUtils]: 30: Hoare triple {14678#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14679#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:02:28,253 INFO L290 TraceCheckUtils]: 31: Hoare triple {14679#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14680#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:02:28,254 INFO L290 TraceCheckUtils]: 32: Hoare triple {14680#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14681#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:02:28,254 INFO L290 TraceCheckUtils]: 33: Hoare triple {14681#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14682#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:02:28,255 INFO L290 TraceCheckUtils]: 34: Hoare triple {14682#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14683#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:02:28,255 INFO L290 TraceCheckUtils]: 35: Hoare triple {14683#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14684#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:02:28,255 INFO L290 TraceCheckUtils]: 36: Hoare triple {14684#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14685#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:02:28,256 INFO L290 TraceCheckUtils]: 37: Hoare triple {14685#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14686#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:02:28,256 INFO L290 TraceCheckUtils]: 38: Hoare triple {14686#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14687#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:02:28,257 INFO L290 TraceCheckUtils]: 39: Hoare triple {14687#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14688#(and (<= main_~x~0 68) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:02:28,257 INFO L290 TraceCheckUtils]: 40: Hoare triple {14688#(and (<= main_~x~0 68) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {14650#false} is VALID [2022-04-28 03:02:28,257 INFO L272 TraceCheckUtils]: 41: Hoare triple {14650#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {14650#false} is VALID [2022-04-28 03:02:28,257 INFO L290 TraceCheckUtils]: 42: Hoare triple {14650#false} ~cond := #in~cond; {14650#false} is VALID [2022-04-28 03:02:28,258 INFO L290 TraceCheckUtils]: 43: Hoare triple {14650#false} assume 0 == ~cond; {14650#false} is VALID [2022-04-28 03:02:28,258 INFO L290 TraceCheckUtils]: 44: Hoare triple {14650#false} assume !false; {14650#false} is VALID [2022-04-28 03:02:28,258 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:02:28,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:02:28,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985668521] [2022-04-28 03:02:28,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985668521] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:02:28,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258224882] [2022-04-28 03:02:28,258 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:02:28,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:28,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:28,260 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:02:28,260 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:02:28,359 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:02:28,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:02:28,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 71 conjunts are in the unsatisfiable core [2022-04-28 03:02:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:28,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:02:28,818 INFO L272 TraceCheckUtils]: 0: Hoare triple {14649#true} call ULTIMATE.init(); {14649#true} is VALID [2022-04-28 03:02:28,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {14649#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {14649#true} is VALID [2022-04-28 03:02:28,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {14649#true} assume true; {14649#true} is VALID [2022-04-28 03:02:28,819 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14649#true} {14649#true} #34#return; {14649#true} is VALID [2022-04-28 03:02:28,819 INFO L272 TraceCheckUtils]: 4: Hoare triple {14649#true} call #t~ret4 := main(); {14649#true} is VALID [2022-04-28 03:02:28,819 INFO L290 TraceCheckUtils]: 5: Hoare triple {14649#true} ~x~0 := 0; {14654#(= main_~x~0 0)} is VALID [2022-04-28 03:02:28,820 INFO L290 TraceCheckUtils]: 6: Hoare triple {14654#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14655#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:02:28,820 INFO L290 TraceCheckUtils]: 7: Hoare triple {14655#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14656#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:02:28,821 INFO L290 TraceCheckUtils]: 8: Hoare triple {14656#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14657#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:02:28,821 INFO L290 TraceCheckUtils]: 9: Hoare triple {14657#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14658#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:02:28,821 INFO L290 TraceCheckUtils]: 10: Hoare triple {14658#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14659#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:02:28,822 INFO L290 TraceCheckUtils]: 11: Hoare triple {14659#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14660#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:02:28,822 INFO L290 TraceCheckUtils]: 12: Hoare triple {14660#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14661#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:02:28,823 INFO L290 TraceCheckUtils]: 13: Hoare triple {14661#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14662#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:02:28,823 INFO L290 TraceCheckUtils]: 14: Hoare triple {14662#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14663#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:02:28,824 INFO L290 TraceCheckUtils]: 15: Hoare triple {14663#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14664#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:02:28,824 INFO L290 TraceCheckUtils]: 16: Hoare triple {14664#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14665#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:02:28,825 INFO L290 TraceCheckUtils]: 17: Hoare triple {14665#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14666#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:02:28,825 INFO L290 TraceCheckUtils]: 18: Hoare triple {14666#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14667#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:02:28,826 INFO L290 TraceCheckUtils]: 19: Hoare triple {14667#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14668#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:02:28,826 INFO L290 TraceCheckUtils]: 20: Hoare triple {14668#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14669#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:02:28,827 INFO L290 TraceCheckUtils]: 21: Hoare triple {14669#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14670#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:02:28,827 INFO L290 TraceCheckUtils]: 22: Hoare triple {14670#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14671#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:02:28,828 INFO L290 TraceCheckUtils]: 23: Hoare triple {14671#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14672#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:02:28,829 INFO L290 TraceCheckUtils]: 24: Hoare triple {14672#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14673#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:02:28,830 INFO L290 TraceCheckUtils]: 25: Hoare triple {14673#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14674#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:02:28,830 INFO L290 TraceCheckUtils]: 26: Hoare triple {14674#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14675#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:02:28,830 INFO L290 TraceCheckUtils]: 27: Hoare triple {14675#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14676#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:02:28,831 INFO L290 TraceCheckUtils]: 28: Hoare triple {14676#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14677#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:02:28,831 INFO L290 TraceCheckUtils]: 29: Hoare triple {14677#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14678#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:02:28,832 INFO L290 TraceCheckUtils]: 30: Hoare triple {14678#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14679#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:02:28,832 INFO L290 TraceCheckUtils]: 31: Hoare triple {14679#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14680#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:02:28,833 INFO L290 TraceCheckUtils]: 32: Hoare triple {14680#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14681#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:02:28,833 INFO L290 TraceCheckUtils]: 33: Hoare triple {14681#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14682#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:02:28,834 INFO L290 TraceCheckUtils]: 34: Hoare triple {14682#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14683#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:02:28,834 INFO L290 TraceCheckUtils]: 35: Hoare triple {14683#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14684#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:02:28,835 INFO L290 TraceCheckUtils]: 36: Hoare triple {14684#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14685#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:02:28,835 INFO L290 TraceCheckUtils]: 37: Hoare triple {14685#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14686#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:02:28,836 INFO L290 TraceCheckUtils]: 38: Hoare triple {14686#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14687#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:02:28,836 INFO L290 TraceCheckUtils]: 39: Hoare triple {14687#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14810#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:02:28,837 INFO L290 TraceCheckUtils]: 40: Hoare triple {14810#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {14650#false} is VALID [2022-04-28 03:02:28,837 INFO L272 TraceCheckUtils]: 41: Hoare triple {14650#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {14650#false} is VALID [2022-04-28 03:02:28,837 INFO L290 TraceCheckUtils]: 42: Hoare triple {14650#false} ~cond := #in~cond; {14650#false} is VALID [2022-04-28 03:02:28,837 INFO L290 TraceCheckUtils]: 43: Hoare triple {14650#false} assume 0 == ~cond; {14650#false} is VALID [2022-04-28 03:02:28,837 INFO L290 TraceCheckUtils]: 44: Hoare triple {14650#false} assume !false; {14650#false} is VALID [2022-04-28 03:02:28,837 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:02:28,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:02:30,671 INFO L290 TraceCheckUtils]: 44: Hoare triple {14650#false} assume !false; {14650#false} is VALID [2022-04-28 03:02:30,671 INFO L290 TraceCheckUtils]: 43: Hoare triple {14650#false} assume 0 == ~cond; {14650#false} is VALID [2022-04-28 03:02:30,672 INFO L290 TraceCheckUtils]: 42: Hoare triple {14650#false} ~cond := #in~cond; {14650#false} is VALID [2022-04-28 03:02:30,672 INFO L272 TraceCheckUtils]: 41: Hoare triple {14650#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {14650#false} is VALID [2022-04-28 03:02:30,672 INFO L290 TraceCheckUtils]: 40: Hoare triple {14838#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {14650#false} is VALID [2022-04-28 03:02:30,673 INFO L290 TraceCheckUtils]: 39: Hoare triple {14842#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14838#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:02:30,673 INFO L290 TraceCheckUtils]: 38: Hoare triple {14846#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14842#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 03:02:30,674 INFO L290 TraceCheckUtils]: 37: Hoare triple {14850#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14846#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 03:02:30,674 INFO L290 TraceCheckUtils]: 36: Hoare triple {14854#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14850#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 03:02:30,675 INFO L290 TraceCheckUtils]: 35: Hoare triple {14858#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14854#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 03:02:30,676 INFO L290 TraceCheckUtils]: 34: Hoare triple {14862#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14858#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-28 03:02:30,676 INFO L290 TraceCheckUtils]: 33: Hoare triple {14866#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14862#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-28 03:02:30,677 INFO L290 TraceCheckUtils]: 32: Hoare triple {14870#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14866#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-28 03:02:30,677 INFO L290 TraceCheckUtils]: 31: Hoare triple {14874#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14870#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-28 03:02:30,678 INFO L290 TraceCheckUtils]: 30: Hoare triple {14878#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14874#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-28 03:02:30,679 INFO L290 TraceCheckUtils]: 29: Hoare triple {14882#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14878#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-28 03:02:30,679 INFO L290 TraceCheckUtils]: 28: Hoare triple {14886#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14882#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-28 03:02:30,680 INFO L290 TraceCheckUtils]: 27: Hoare triple {14890#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14886#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-28 03:02:30,680 INFO L290 TraceCheckUtils]: 26: Hoare triple {14894#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14890#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-28 03:02:30,681 INFO L290 TraceCheckUtils]: 25: Hoare triple {14898#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14894#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-28 03:02:30,681 INFO L290 TraceCheckUtils]: 24: Hoare triple {14902#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14898#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:02:30,682 INFO L290 TraceCheckUtils]: 23: Hoare triple {14906#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14902#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:02:30,683 INFO L290 TraceCheckUtils]: 22: Hoare triple {14910#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14906#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-28 03:02:30,683 INFO L290 TraceCheckUtils]: 21: Hoare triple {14914#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14910#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-28 03:02:30,684 INFO L290 TraceCheckUtils]: 20: Hoare triple {14918#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14914#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-28 03:02:30,684 INFO L290 TraceCheckUtils]: 19: Hoare triple {14922#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14918#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:02:30,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {14926#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14922#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:02:30,685 INFO L290 TraceCheckUtils]: 17: Hoare triple {14930#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14926#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:02:30,686 INFO L290 TraceCheckUtils]: 16: Hoare triple {14934#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14930#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-28 03:02:30,687 INFO L290 TraceCheckUtils]: 15: Hoare triple {14938#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14934#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-28 03:02:30,687 INFO L290 TraceCheckUtils]: 14: Hoare triple {14942#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14938#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-28 03:02:30,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {14946#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14942#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-28 03:02:30,688 INFO L290 TraceCheckUtils]: 12: Hoare triple {14950#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14946#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-28 03:02:30,689 INFO L290 TraceCheckUtils]: 11: Hoare triple {14954#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14950#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:02:30,690 INFO L290 TraceCheckUtils]: 10: Hoare triple {14958#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14954#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-28 03:02:30,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {14962#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14958#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-28 03:02:30,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {14966#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14962#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-28 03:02:30,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {14970#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14966#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:02:30,692 INFO L290 TraceCheckUtils]: 6: Hoare triple {14974#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {14970#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:02:30,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {14649#true} ~x~0 := 0; {14974#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:02:30,692 INFO L272 TraceCheckUtils]: 4: Hoare triple {14649#true} call #t~ret4 := main(); {14649#true} is VALID [2022-04-28 03:02:30,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14649#true} {14649#true} #34#return; {14649#true} is VALID [2022-04-28 03:02:30,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {14649#true} assume true; {14649#true} is VALID [2022-04-28 03:02:30,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {14649#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {14649#true} is VALID [2022-04-28 03:02:30,693 INFO L272 TraceCheckUtils]: 0: Hoare triple {14649#true} call ULTIMATE.init(); {14649#true} is VALID [2022-04-28 03:02:30,693 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:02:30,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258224882] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:02:30,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:02:30,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37, 37] total 74 [2022-04-28 03:02:30,693 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:02:30,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1228158734] [2022-04-28 03:02:30,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1228158734] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:02:30,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:02:30,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-28 03:02:30,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198674218] [2022-04-28 03:02:30,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:02:30,694 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:02:30,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:02:30,694 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:02:30,740 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:02:30,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-28 03:02:30,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:30,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-28 03:02:30,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1440, Invalid=3962, Unknown=0, NotChecked=0, Total=5402 [2022-04-28 03:02:30,741 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:02:33,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:33,163 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-28 03:02:33,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-28 03:02:33,163 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:02:33,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:02:33,163 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:02:33,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2022-04-28 03:02:33,164 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:02:33,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 52 transitions. [2022-04-28 03:02:33,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 52 transitions. [2022-04-28 03:02:33,201 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:02:33,201 INFO L225 Difference]: With dead ends: 52 [2022-04-28 03:02:33,201 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 03:02:33,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 669 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2873, Invalid=8899, Unknown=0, NotChecked=0, Total=11772 [2022-04-28 03:02:33,202 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 1388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:02:33,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 138 Invalid, 1388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1317 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 03:02:33,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 03:02:33,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-28 03:02:33,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:02:33,250 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:02:33,250 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:02:33,250 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:02:33,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:33,250 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-28 03:02:33,250 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-28 03:02:33,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:33,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:33,251 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:02:33,251 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:02:33,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:33,251 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-28 03:02:33,251 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-28 03:02:33,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:33,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:33,252 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:02:33,252 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:02:33,252 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:02:33,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2022-04-28 03:02:33,252 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2022-04-28 03:02:33,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:02:33,252 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2022-04-28 03:02:33,253 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:02:33,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 47 transitions. [2022-04-28 03:02:33,291 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:02:33,292 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-28 03:02:33,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-28 03:02:33,292 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:02:33,292 INFO L195 NwaCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:02:33,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Ended with exit code 0 [2022-04-28 03:02:33,510 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:02:33,707 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:02:33,707 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:02:33,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:02:33,708 INFO L85 PathProgramCache]: Analyzing trace with hash -2049905866, now seen corresponding path program 69 times [2022-04-28 03:02:33,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:33,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1533702875] [2022-04-28 03:02:33,851 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:33,852 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:02:33,854 INFO L85 PathProgramCache]: Analyzing trace with hash 142273911, now seen corresponding path program 1 times [2022-04-28 03:02:33,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:33,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280647404] [2022-04-28 03:02:33,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:33,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:33,860 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_35.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_35.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:02:33,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:02:33,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1533154144] [2022-04-28 03:02:33,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:33,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:33,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:33,864 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:02:33,865 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:02:33,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:33,905 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:02:33,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:33,913 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:02:33,913 INFO L85 PathProgramCache]: Analyzing trace with hash -2049905866, now seen corresponding path program 70 times [2022-04-28 03:02:33,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:33,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140575665] [2022-04-28 03:02:33,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:33,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:33,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:34,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:02:34,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:34,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {15398#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {15357#true} is VALID [2022-04-28 03:02:34,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {15357#true} assume true; {15357#true} is VALID [2022-04-28 03:02:34,626 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15357#true} {15357#true} #34#return; {15357#true} is VALID [2022-04-28 03:02:34,627 INFO L272 TraceCheckUtils]: 0: Hoare triple {15357#true} call ULTIMATE.init(); {15398#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:02:34,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {15398#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {15357#true} is VALID [2022-04-28 03:02:34,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {15357#true} assume true; {15357#true} is VALID [2022-04-28 03:02:34,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15357#true} {15357#true} #34#return; {15357#true} is VALID [2022-04-28 03:02:34,627 INFO L272 TraceCheckUtils]: 4: Hoare triple {15357#true} call #t~ret4 := main(); {15357#true} is VALID [2022-04-28 03:02:34,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {15357#true} ~x~0 := 0; {15362#(= main_~x~0 0)} is VALID [2022-04-28 03:02:34,628 INFO L290 TraceCheckUtils]: 6: Hoare triple {15362#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15363#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:02:34,628 INFO L290 TraceCheckUtils]: 7: Hoare triple {15363#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15364#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:02:34,629 INFO L290 TraceCheckUtils]: 8: Hoare triple {15364#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15365#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:02:34,629 INFO L290 TraceCheckUtils]: 9: Hoare triple {15365#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15366#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:02:34,629 INFO L290 TraceCheckUtils]: 10: Hoare triple {15366#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15367#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:02:34,630 INFO L290 TraceCheckUtils]: 11: Hoare triple {15367#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15368#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:02:34,630 INFO L290 TraceCheckUtils]: 12: Hoare triple {15368#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15369#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:02:34,631 INFO L290 TraceCheckUtils]: 13: Hoare triple {15369#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15370#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:02:34,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {15370#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15371#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:02:34,632 INFO L290 TraceCheckUtils]: 15: Hoare triple {15371#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15372#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:02:34,632 INFO L290 TraceCheckUtils]: 16: Hoare triple {15372#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15373#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:02:34,633 INFO L290 TraceCheckUtils]: 17: Hoare triple {15373#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15374#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:02:34,633 INFO L290 TraceCheckUtils]: 18: Hoare triple {15374#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15375#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:02:34,634 INFO L290 TraceCheckUtils]: 19: Hoare triple {15375#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15376#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:02:34,634 INFO L290 TraceCheckUtils]: 20: Hoare triple {15376#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15377#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:02:34,635 INFO L290 TraceCheckUtils]: 21: Hoare triple {15377#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15378#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:02:34,635 INFO L290 TraceCheckUtils]: 22: Hoare triple {15378#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15379#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:02:34,636 INFO L290 TraceCheckUtils]: 23: Hoare triple {15379#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15380#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:02:34,636 INFO L290 TraceCheckUtils]: 24: Hoare triple {15380#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15381#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:02:34,636 INFO L290 TraceCheckUtils]: 25: Hoare triple {15381#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15382#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:02:34,637 INFO L290 TraceCheckUtils]: 26: Hoare triple {15382#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15383#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:02:34,637 INFO L290 TraceCheckUtils]: 27: Hoare triple {15383#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15384#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:02:34,638 INFO L290 TraceCheckUtils]: 28: Hoare triple {15384#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15385#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:02:34,638 INFO L290 TraceCheckUtils]: 29: Hoare triple {15385#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15386#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:02:34,639 INFO L290 TraceCheckUtils]: 30: Hoare triple {15386#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15387#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:02:34,639 INFO L290 TraceCheckUtils]: 31: Hoare triple {15387#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15388#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:02:34,640 INFO L290 TraceCheckUtils]: 32: Hoare triple {15388#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15389#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:02:34,640 INFO L290 TraceCheckUtils]: 33: Hoare triple {15389#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15390#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:02:34,641 INFO L290 TraceCheckUtils]: 34: Hoare triple {15390#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15391#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:02:34,641 INFO L290 TraceCheckUtils]: 35: Hoare triple {15391#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15392#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:02:34,642 INFO L290 TraceCheckUtils]: 36: Hoare triple {15392#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15393#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:02:34,642 INFO L290 TraceCheckUtils]: 37: Hoare triple {15393#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15394#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:02:34,642 INFO L290 TraceCheckUtils]: 38: Hoare triple {15394#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15395#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:02:34,643 INFO L290 TraceCheckUtils]: 39: Hoare triple {15395#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15396#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:02:34,643 INFO L290 TraceCheckUtils]: 40: Hoare triple {15396#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15397#(and (<= main_~x~0 70) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:02:34,644 INFO L290 TraceCheckUtils]: 41: Hoare triple {15397#(and (<= main_~x~0 70) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {15358#false} is VALID [2022-04-28 03:02:34,644 INFO L272 TraceCheckUtils]: 42: Hoare triple {15358#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {15358#false} is VALID [2022-04-28 03:02:34,644 INFO L290 TraceCheckUtils]: 43: Hoare triple {15358#false} ~cond := #in~cond; {15358#false} is VALID [2022-04-28 03:02:34,644 INFO L290 TraceCheckUtils]: 44: Hoare triple {15358#false} assume 0 == ~cond; {15358#false} is VALID [2022-04-28 03:02:34,644 INFO L290 TraceCheckUtils]: 45: Hoare triple {15358#false} assume !false; {15358#false} is VALID [2022-04-28 03:02:34,645 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:02:34,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:02:34,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140575665] [2022-04-28 03:02:34,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140575665] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:02:34,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888116853] [2022-04-28 03:02:34,645 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:02:34,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:34,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:34,646 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:02:34,646 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:02:34,741 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:02:34,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:02:34,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 73 conjunts are in the unsatisfiable core [2022-04-28 03:02:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:34,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:02:35,175 INFO L272 TraceCheckUtils]: 0: Hoare triple {15357#true} call ULTIMATE.init(); {15357#true} is VALID [2022-04-28 03:02:35,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {15357#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {15357#true} is VALID [2022-04-28 03:02:35,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {15357#true} assume true; {15357#true} is VALID [2022-04-28 03:02:35,176 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15357#true} {15357#true} #34#return; {15357#true} is VALID [2022-04-28 03:02:35,176 INFO L272 TraceCheckUtils]: 4: Hoare triple {15357#true} call #t~ret4 := main(); {15357#true} is VALID [2022-04-28 03:02:35,176 INFO L290 TraceCheckUtils]: 5: Hoare triple {15357#true} ~x~0 := 0; {15362#(= main_~x~0 0)} is VALID [2022-04-28 03:02:35,177 INFO L290 TraceCheckUtils]: 6: Hoare triple {15362#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15363#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:02:35,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {15363#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15364#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:02:35,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {15364#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15365#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:02:35,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {15365#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15366#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:02:35,178 INFO L290 TraceCheckUtils]: 10: Hoare triple {15366#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15367#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:02:35,179 INFO L290 TraceCheckUtils]: 11: Hoare triple {15367#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15368#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:02:35,179 INFO L290 TraceCheckUtils]: 12: Hoare triple {15368#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15369#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:02:35,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {15369#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15370#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:02:35,180 INFO L290 TraceCheckUtils]: 14: Hoare triple {15370#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15371#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:02:35,181 INFO L290 TraceCheckUtils]: 15: Hoare triple {15371#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15372#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:02:35,181 INFO L290 TraceCheckUtils]: 16: Hoare triple {15372#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15373#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:02:35,182 INFO L290 TraceCheckUtils]: 17: Hoare triple {15373#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15374#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:02:35,182 INFO L290 TraceCheckUtils]: 18: Hoare triple {15374#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15375#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:02:35,183 INFO L290 TraceCheckUtils]: 19: Hoare triple {15375#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15376#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:02:35,183 INFO L290 TraceCheckUtils]: 20: Hoare triple {15376#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15377#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:02:35,184 INFO L290 TraceCheckUtils]: 21: Hoare triple {15377#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15378#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:02:35,184 INFO L290 TraceCheckUtils]: 22: Hoare triple {15378#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15379#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:02:35,185 INFO L290 TraceCheckUtils]: 23: Hoare triple {15379#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15380#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:02:35,185 INFO L290 TraceCheckUtils]: 24: Hoare triple {15380#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15381#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:02:35,185 INFO L290 TraceCheckUtils]: 25: Hoare triple {15381#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15382#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:02:35,186 INFO L290 TraceCheckUtils]: 26: Hoare triple {15382#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15383#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:02:35,186 INFO L290 TraceCheckUtils]: 27: Hoare triple {15383#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15384#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:02:35,187 INFO L290 TraceCheckUtils]: 28: Hoare triple {15384#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15385#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:02:35,187 INFO L290 TraceCheckUtils]: 29: Hoare triple {15385#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15386#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:02:35,188 INFO L290 TraceCheckUtils]: 30: Hoare triple {15386#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15387#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:02:35,198 INFO L290 TraceCheckUtils]: 31: Hoare triple {15387#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15388#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:02:35,199 INFO L290 TraceCheckUtils]: 32: Hoare triple {15388#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15389#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:02:35,200 INFO L290 TraceCheckUtils]: 33: Hoare triple {15389#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15390#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:02:35,200 INFO L290 TraceCheckUtils]: 34: Hoare triple {15390#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15391#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:02:35,201 INFO L290 TraceCheckUtils]: 35: Hoare triple {15391#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15392#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:02:35,201 INFO L290 TraceCheckUtils]: 36: Hoare triple {15392#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15393#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:02:35,202 INFO L290 TraceCheckUtils]: 37: Hoare triple {15393#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15394#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:02:35,202 INFO L290 TraceCheckUtils]: 38: Hoare triple {15394#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15395#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:02:35,203 INFO L290 TraceCheckUtils]: 39: Hoare triple {15395#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15396#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:02:35,203 INFO L290 TraceCheckUtils]: 40: Hoare triple {15396#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15522#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:02:35,204 INFO L290 TraceCheckUtils]: 41: Hoare triple {15522#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {15358#false} is VALID [2022-04-28 03:02:35,204 INFO L272 TraceCheckUtils]: 42: Hoare triple {15358#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {15358#false} is VALID [2022-04-28 03:02:35,204 INFO L290 TraceCheckUtils]: 43: Hoare triple {15358#false} ~cond := #in~cond; {15358#false} is VALID [2022-04-28 03:02:35,204 INFO L290 TraceCheckUtils]: 44: Hoare triple {15358#false} assume 0 == ~cond; {15358#false} is VALID [2022-04-28 03:02:35,204 INFO L290 TraceCheckUtils]: 45: Hoare triple {15358#false} assume !false; {15358#false} is VALID [2022-04-28 03:02:35,204 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:02:35,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:02:37,120 INFO L290 TraceCheckUtils]: 45: Hoare triple {15358#false} assume !false; {15358#false} is VALID [2022-04-28 03:02:37,121 INFO L290 TraceCheckUtils]: 44: Hoare triple {15358#false} assume 0 == ~cond; {15358#false} is VALID [2022-04-28 03:02:37,121 INFO L290 TraceCheckUtils]: 43: Hoare triple {15358#false} ~cond := #in~cond; {15358#false} is VALID [2022-04-28 03:02:37,121 INFO L272 TraceCheckUtils]: 42: Hoare triple {15358#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {15358#false} is VALID [2022-04-28 03:02:37,121 INFO L290 TraceCheckUtils]: 41: Hoare triple {15550#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {15358#false} is VALID [2022-04-28 03:02:37,125 INFO L290 TraceCheckUtils]: 40: Hoare triple {15554#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15550#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:02:37,126 INFO L290 TraceCheckUtils]: 39: Hoare triple {15558#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15554#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 03:02:37,127 INFO L290 TraceCheckUtils]: 38: Hoare triple {15562#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15558#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 03:02:37,127 INFO L290 TraceCheckUtils]: 37: Hoare triple {15566#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15562#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 03:02:37,128 INFO L290 TraceCheckUtils]: 36: Hoare triple {15570#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15566#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 03:02:37,128 INFO L290 TraceCheckUtils]: 35: Hoare triple {15574#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15570#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-28 03:02:37,129 INFO L290 TraceCheckUtils]: 34: Hoare triple {15578#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15574#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-28 03:02:37,130 INFO L290 TraceCheckUtils]: 33: Hoare triple {15582#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15578#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-28 03:02:37,130 INFO L290 TraceCheckUtils]: 32: Hoare triple {15586#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15582#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-28 03:02:37,131 INFO L290 TraceCheckUtils]: 31: Hoare triple {15590#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15586#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-28 03:02:37,131 INFO L290 TraceCheckUtils]: 30: Hoare triple {15594#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15590#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-28 03:02:37,132 INFO L290 TraceCheckUtils]: 29: Hoare triple {15598#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15594#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-28 03:02:37,133 INFO L290 TraceCheckUtils]: 28: Hoare triple {15602#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15598#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-28 03:02:37,133 INFO L290 TraceCheckUtils]: 27: Hoare triple {15606#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15602#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-28 03:02:37,134 INFO L290 TraceCheckUtils]: 26: Hoare triple {15610#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15606#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-28 03:02:37,134 INFO L290 TraceCheckUtils]: 25: Hoare triple {15614#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15610#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:02:37,135 INFO L290 TraceCheckUtils]: 24: Hoare triple {15618#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15614#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:02:37,135 INFO L290 TraceCheckUtils]: 23: Hoare triple {15622#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15618#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-28 03:02:37,136 INFO L290 TraceCheckUtils]: 22: Hoare triple {15626#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15622#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-28 03:02:37,137 INFO L290 TraceCheckUtils]: 21: Hoare triple {15630#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15626#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-28 03:02:37,137 INFO L290 TraceCheckUtils]: 20: Hoare triple {15634#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15630#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:02:37,138 INFO L290 TraceCheckUtils]: 19: Hoare triple {15638#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15634#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:02:37,138 INFO L290 TraceCheckUtils]: 18: Hoare triple {15642#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15638#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:02:37,139 INFO L290 TraceCheckUtils]: 17: Hoare triple {15646#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15642#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-28 03:02:37,139 INFO L290 TraceCheckUtils]: 16: Hoare triple {15650#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15646#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-28 03:02:37,140 INFO L290 TraceCheckUtils]: 15: Hoare triple {15654#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15650#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-28 03:02:37,141 INFO L290 TraceCheckUtils]: 14: Hoare triple {15658#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15654#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-28 03:02:37,141 INFO L290 TraceCheckUtils]: 13: Hoare triple {15662#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15658#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-28 03:02:37,142 INFO L290 TraceCheckUtils]: 12: Hoare triple {15666#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15662#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:02:37,142 INFO L290 TraceCheckUtils]: 11: Hoare triple {15670#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15666#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-28 03:02:37,143 INFO L290 TraceCheckUtils]: 10: Hoare triple {15674#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15670#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-28 03:02:37,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {15678#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15674#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-28 03:02:37,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {15682#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15678#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:02:37,145 INFO L290 TraceCheckUtils]: 7: Hoare triple {15686#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15682#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:02:37,145 INFO L290 TraceCheckUtils]: 6: Hoare triple {15690#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {15686#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:02:37,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {15357#true} ~x~0 := 0; {15690#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} is VALID [2022-04-28 03:02:37,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {15357#true} call #t~ret4 := main(); {15357#true} is VALID [2022-04-28 03:02:37,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15357#true} {15357#true} #34#return; {15357#true} is VALID [2022-04-28 03:02:37,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {15357#true} assume true; {15357#true} is VALID [2022-04-28 03:02:37,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {15357#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {15357#true} is VALID [2022-04-28 03:02:37,146 INFO L272 TraceCheckUtils]: 0: Hoare triple {15357#true} call ULTIMATE.init(); {15357#true} is VALID [2022-04-28 03:02:37,146 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:02:37,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888116853] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:02:37,146 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:02:37,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 76 [2022-04-28 03:02:37,147 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:02:37,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1533702875] [2022-04-28 03:02:37,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1533702875] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:02:37,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:02:37,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-28 03:02:37,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469184218] [2022-04-28 03:02:37,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:02:37,147 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:02:37,147 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:02:37,148 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:02:37,170 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:02:37,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-28 03:02:37,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:37,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-28 03:02:37,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1517, Invalid=4183, Unknown=0, NotChecked=0, Total=5700 [2022-04-28 03:02:37,171 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:02:39,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:39,735 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2022-04-28 03:02:39,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-28 03:02:39,735 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:02:39,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:02:39,735 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:02:39,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2022-04-28 03:02:39,736 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:02:39,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2022-04-28 03:02:39,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 53 transitions. [2022-04-28 03:02:39,766 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:02:39,767 INFO L225 Difference]: With dead ends: 53 [2022-04-28 03:02:39,767 INFO L226 Difference]: Without dead ends: 48 [2022-04-28 03:02:39,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3027, Invalid=9405, Unknown=0, NotChecked=0, Total=12432 [2022-04-28 03:02:39,768 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 1432 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 1505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:02:39,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 183 Invalid, 1505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1432 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 03:02:39,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-28 03:02:39,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-04-28 03:02:39,810 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:02:39,810 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:02:39,810 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:02:39,810 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:02:39,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:39,810 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-28 03:02:39,811 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-28 03:02:39,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:39,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:39,811 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:02:39,811 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:02:39,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:39,811 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2022-04-28 03:02:39,811 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-28 03:02:39,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:39,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:39,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:02:39,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:02:39,812 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:02:39,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2022-04-28 03:02:39,812 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2022-04-28 03:02:39,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:02:39,812 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2022-04-28 03:02:39,813 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:02:39,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 48 transitions. [2022-04-28 03:02:39,853 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:02:39,853 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2022-04-28 03:02:39,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 03:02:39,853 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:02:39,853 INFO L195 NwaCegarLoop]: trace histogram [36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:02:39,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Ended with exit code 0 [2022-04-28 03:02:40,059 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:02:40,254 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:02:40,254 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:02:40,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:02:40,254 INFO L85 PathProgramCache]: Analyzing trace with hash 913888860, now seen corresponding path program 71 times [2022-04-28 03:02:40,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:40,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [50274206] [2022-04-28 03:02:40,565 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:02:40,567 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:02:40,568 INFO L85 PathProgramCache]: Analyzing trace with hash 201379255, now seen corresponding path program 1 times [2022-04-28 03:02:40,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:40,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258370059] [2022-04-28 03:02:40,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:40,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:40,572 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_36.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_36.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:02:40,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:02:40,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1949305604] [2022-04-28 03:02:40,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:40,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:40,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:40,576 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:02:40,577 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:02:40,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:40,614 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:02:40,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:40,625 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:02:40,625 INFO L85 PathProgramCache]: Analyzing trace with hash 913888860, now seen corresponding path program 72 times [2022-04-28 03:02:40,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:40,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199315239] [2022-04-28 03:02:40,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:40,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:40,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:41,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:02:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:41,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {16123#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {16081#true} is VALID [2022-04-28 03:02:41,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {16081#true} assume true; {16081#true} is VALID [2022-04-28 03:02:41,344 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16081#true} {16081#true} #34#return; {16081#true} is VALID [2022-04-28 03:02:41,345 INFO L272 TraceCheckUtils]: 0: Hoare triple {16081#true} call ULTIMATE.init(); {16123#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:02:41,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {16123#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {16081#true} is VALID [2022-04-28 03:02:41,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {16081#true} assume true; {16081#true} is VALID [2022-04-28 03:02:41,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16081#true} {16081#true} #34#return; {16081#true} is VALID [2022-04-28 03:02:41,345 INFO L272 TraceCheckUtils]: 4: Hoare triple {16081#true} call #t~ret4 := main(); {16081#true} is VALID [2022-04-28 03:02:41,345 INFO L290 TraceCheckUtils]: 5: Hoare triple {16081#true} ~x~0 := 0; {16086#(= main_~x~0 0)} is VALID [2022-04-28 03:02:41,346 INFO L290 TraceCheckUtils]: 6: Hoare triple {16086#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16087#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:02:41,346 INFO L290 TraceCheckUtils]: 7: Hoare triple {16087#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16088#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:02:41,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {16088#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16089#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:02:41,347 INFO L290 TraceCheckUtils]: 9: Hoare triple {16089#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16090#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:02:41,348 INFO L290 TraceCheckUtils]: 10: Hoare triple {16090#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16091#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:02:41,348 INFO L290 TraceCheckUtils]: 11: Hoare triple {16091#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16092#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:02:41,349 INFO L290 TraceCheckUtils]: 12: Hoare triple {16092#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16093#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:02:41,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {16093#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16094#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:02:41,349 INFO L290 TraceCheckUtils]: 14: Hoare triple {16094#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16095#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:02:41,350 INFO L290 TraceCheckUtils]: 15: Hoare triple {16095#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16096#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:02:41,350 INFO L290 TraceCheckUtils]: 16: Hoare triple {16096#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16097#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:02:41,351 INFO L290 TraceCheckUtils]: 17: Hoare triple {16097#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16098#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:02:41,351 INFO L290 TraceCheckUtils]: 18: Hoare triple {16098#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16099#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:02:41,352 INFO L290 TraceCheckUtils]: 19: Hoare triple {16099#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16100#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:02:41,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {16100#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16101#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:02:41,353 INFO L290 TraceCheckUtils]: 21: Hoare triple {16101#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16102#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:02:41,353 INFO L290 TraceCheckUtils]: 22: Hoare triple {16102#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16103#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:02:41,354 INFO L290 TraceCheckUtils]: 23: Hoare triple {16103#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16104#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:02:41,354 INFO L290 TraceCheckUtils]: 24: Hoare triple {16104#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16105#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:02:41,354 INFO L290 TraceCheckUtils]: 25: Hoare triple {16105#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16106#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:02:41,355 INFO L290 TraceCheckUtils]: 26: Hoare triple {16106#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16107#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:02:41,355 INFO L290 TraceCheckUtils]: 27: Hoare triple {16107#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16108#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:02:41,356 INFO L290 TraceCheckUtils]: 28: Hoare triple {16108#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16109#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:02:41,356 INFO L290 TraceCheckUtils]: 29: Hoare triple {16109#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16110#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:02:41,357 INFO L290 TraceCheckUtils]: 30: Hoare triple {16110#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16111#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:02:41,357 INFO L290 TraceCheckUtils]: 31: Hoare triple {16111#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16112#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:02:41,358 INFO L290 TraceCheckUtils]: 32: Hoare triple {16112#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16113#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:02:41,358 INFO L290 TraceCheckUtils]: 33: Hoare triple {16113#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16114#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:02:41,359 INFO L290 TraceCheckUtils]: 34: Hoare triple {16114#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16115#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:02:41,359 INFO L290 TraceCheckUtils]: 35: Hoare triple {16115#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16116#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:02:41,360 INFO L290 TraceCheckUtils]: 36: Hoare triple {16116#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16117#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:02:41,360 INFO L290 TraceCheckUtils]: 37: Hoare triple {16117#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16118#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:02:41,360 INFO L290 TraceCheckUtils]: 38: Hoare triple {16118#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16119#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:02:41,361 INFO L290 TraceCheckUtils]: 39: Hoare triple {16119#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16120#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:02:41,361 INFO L290 TraceCheckUtils]: 40: Hoare triple {16120#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16121#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:02:41,362 INFO L290 TraceCheckUtils]: 41: Hoare triple {16121#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16122#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 72))} is VALID [2022-04-28 03:02:41,362 INFO L290 TraceCheckUtils]: 42: Hoare triple {16122#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 72))} assume !(~x~0 % 4294967296 < 268435455); {16082#false} is VALID [2022-04-28 03:02:41,362 INFO L272 TraceCheckUtils]: 43: Hoare triple {16082#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {16082#false} is VALID [2022-04-28 03:02:41,362 INFO L290 TraceCheckUtils]: 44: Hoare triple {16082#false} ~cond := #in~cond; {16082#false} is VALID [2022-04-28 03:02:41,362 INFO L290 TraceCheckUtils]: 45: Hoare triple {16082#false} assume 0 == ~cond; {16082#false} is VALID [2022-04-28 03:02:41,363 INFO L290 TraceCheckUtils]: 46: Hoare triple {16082#false} assume !false; {16082#false} is VALID [2022-04-28 03:02:41,363 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:02:41,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:02:41,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199315239] [2022-04-28 03:02:41,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199315239] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:02:41,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716140853] [2022-04-28 03:02:41,363 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:02:41,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:41,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:41,364 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:02:41,365 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:02:43,863 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-04-28 03:02:43,864 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:02:43,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 78 conjunts are in the unsatisfiable core [2022-04-28 03:02:43,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:43,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:02:44,213 INFO L272 TraceCheckUtils]: 0: Hoare triple {16081#true} call ULTIMATE.init(); {16081#true} is VALID [2022-04-28 03:02:44,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {16081#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {16081#true} is VALID [2022-04-28 03:02:44,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {16081#true} assume true; {16081#true} is VALID [2022-04-28 03:02:44,214 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16081#true} {16081#true} #34#return; {16081#true} is VALID [2022-04-28 03:02:44,214 INFO L272 TraceCheckUtils]: 4: Hoare triple {16081#true} call #t~ret4 := main(); {16081#true} is VALID [2022-04-28 03:02:44,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {16081#true} ~x~0 := 0; {16086#(= main_~x~0 0)} is VALID [2022-04-28 03:02:44,214 INFO L290 TraceCheckUtils]: 6: Hoare triple {16086#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16087#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:02:44,215 INFO L290 TraceCheckUtils]: 7: Hoare triple {16087#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16088#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:02:44,215 INFO L290 TraceCheckUtils]: 8: Hoare triple {16088#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16089#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:02:44,216 INFO L290 TraceCheckUtils]: 9: Hoare triple {16089#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16090#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:02:44,216 INFO L290 TraceCheckUtils]: 10: Hoare triple {16090#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16091#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:02:44,217 INFO L290 TraceCheckUtils]: 11: Hoare triple {16091#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16092#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:02:44,217 INFO L290 TraceCheckUtils]: 12: Hoare triple {16092#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16093#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:02:44,218 INFO L290 TraceCheckUtils]: 13: Hoare triple {16093#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16094#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:02:44,218 INFO L290 TraceCheckUtils]: 14: Hoare triple {16094#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16095#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:02:44,219 INFO L290 TraceCheckUtils]: 15: Hoare triple {16095#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16096#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:02:44,219 INFO L290 TraceCheckUtils]: 16: Hoare triple {16096#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16097#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:02:44,219 INFO L290 TraceCheckUtils]: 17: Hoare triple {16097#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16098#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:02:44,220 INFO L290 TraceCheckUtils]: 18: Hoare triple {16098#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16099#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:02:44,220 INFO L290 TraceCheckUtils]: 19: Hoare triple {16099#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16100#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:02:44,221 INFO L290 TraceCheckUtils]: 20: Hoare triple {16100#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16101#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:02:44,221 INFO L290 TraceCheckUtils]: 21: Hoare triple {16101#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16102#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:02:44,222 INFO L290 TraceCheckUtils]: 22: Hoare triple {16102#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16103#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:02:44,222 INFO L290 TraceCheckUtils]: 23: Hoare triple {16103#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16104#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:02:44,223 INFO L290 TraceCheckUtils]: 24: Hoare triple {16104#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16105#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:02:44,223 INFO L290 TraceCheckUtils]: 25: Hoare triple {16105#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16106#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:02:44,224 INFO L290 TraceCheckUtils]: 26: Hoare triple {16106#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16107#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:02:44,224 INFO L290 TraceCheckUtils]: 27: Hoare triple {16107#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16108#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:02:44,224 INFO L290 TraceCheckUtils]: 28: Hoare triple {16108#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16109#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:02:44,225 INFO L290 TraceCheckUtils]: 29: Hoare triple {16109#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16110#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:02:44,225 INFO L290 TraceCheckUtils]: 30: Hoare triple {16110#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16111#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:02:44,226 INFO L290 TraceCheckUtils]: 31: Hoare triple {16111#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16112#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:02:44,226 INFO L290 TraceCheckUtils]: 32: Hoare triple {16112#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16113#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:02:44,227 INFO L290 TraceCheckUtils]: 33: Hoare triple {16113#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16114#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:02:44,227 INFO L290 TraceCheckUtils]: 34: Hoare triple {16114#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16115#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:02:44,229 INFO L290 TraceCheckUtils]: 35: Hoare triple {16115#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16116#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:02:44,230 INFO L290 TraceCheckUtils]: 36: Hoare triple {16116#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16117#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:02:44,230 INFO L290 TraceCheckUtils]: 37: Hoare triple {16117#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16118#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:02:44,231 INFO L290 TraceCheckUtils]: 38: Hoare triple {16118#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16119#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:02:44,231 INFO L290 TraceCheckUtils]: 39: Hoare triple {16119#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16120#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:02:44,232 INFO L290 TraceCheckUtils]: 40: Hoare triple {16120#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16121#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:02:44,232 INFO L290 TraceCheckUtils]: 41: Hoare triple {16121#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16250#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:02:44,233 INFO L290 TraceCheckUtils]: 42: Hoare triple {16250#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !(~x~0 % 4294967296 < 268435455); {16082#false} is VALID [2022-04-28 03:02:44,233 INFO L272 TraceCheckUtils]: 43: Hoare triple {16082#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {16082#false} is VALID [2022-04-28 03:02:44,233 INFO L290 TraceCheckUtils]: 44: Hoare triple {16082#false} ~cond := #in~cond; {16082#false} is VALID [2022-04-28 03:02:44,233 INFO L290 TraceCheckUtils]: 45: Hoare triple {16082#false} assume 0 == ~cond; {16082#false} is VALID [2022-04-28 03:02:44,233 INFO L290 TraceCheckUtils]: 46: Hoare triple {16082#false} assume !false; {16082#false} is VALID [2022-04-28 03:02:44,233 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:02:44,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:02:47,120 INFO L290 TraceCheckUtils]: 46: Hoare triple {16082#false} assume !false; {16082#false} is VALID [2022-04-28 03:02:47,120 INFO L290 TraceCheckUtils]: 45: Hoare triple {16269#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {16082#false} is VALID [2022-04-28 03:02:47,121 INFO L290 TraceCheckUtils]: 44: Hoare triple {16273#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16269#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:02:47,121 INFO L272 TraceCheckUtils]: 43: Hoare triple {16277#(< 0 (mod main_~x~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {16273#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:02:47,122 INFO L290 TraceCheckUtils]: 42: Hoare triple {16281#(or (< 0 (mod main_~x~0 2)) (< (mod main_~x~0 4294967296) 268435455))} assume !(~x~0 % 4294967296 < 268435455); {16277#(< 0 (mod main_~x~0 2))} is VALID [2022-04-28 03:02:47,122 INFO L290 TraceCheckUtils]: 41: Hoare triple {16285#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16281#(or (< 0 (mod main_~x~0 2)) (< (mod main_~x~0 4294967296) 268435455))} is VALID [2022-04-28 03:02:47,123 INFO L290 TraceCheckUtils]: 40: Hoare triple {16289#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16285#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} is VALID [2022-04-28 03:02:47,124 INFO L290 TraceCheckUtils]: 39: Hoare triple {16293#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16289#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} is VALID [2022-04-28 03:02:47,124 INFO L290 TraceCheckUtils]: 38: Hoare triple {16297#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16293#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} is VALID [2022-04-28 03:02:47,128 INFO L290 TraceCheckUtils]: 37: Hoare triple {16301#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16297#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} is VALID [2022-04-28 03:02:47,129 INFO L290 TraceCheckUtils]: 36: Hoare triple {16305#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16301#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} is VALID [2022-04-28 03:02:47,130 INFO L290 TraceCheckUtils]: 35: Hoare triple {16309#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16305#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} is VALID [2022-04-28 03:02:47,130 INFO L290 TraceCheckUtils]: 34: Hoare triple {16313#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 16) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16309#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 268435455))} is VALID [2022-04-28 03:02:47,131 INFO L290 TraceCheckUtils]: 33: Hoare triple {16317#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16313#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 16) 4294967296) 268435455))} is VALID [2022-04-28 03:02:47,132 INFO L290 TraceCheckUtils]: 32: Hoare triple {16321#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16317#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 268435455))} is VALID [2022-04-28 03:02:47,132 INFO L290 TraceCheckUtils]: 31: Hoare triple {16325#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16321#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} is VALID [2022-04-28 03:02:47,133 INFO L290 TraceCheckUtils]: 30: Hoare triple {16329#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16325#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} is VALID [2022-04-28 03:02:47,135 INFO L290 TraceCheckUtils]: 29: Hoare triple {16333#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16329#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} is VALID [2022-04-28 03:02:47,136 INFO L290 TraceCheckUtils]: 28: Hoare triple {16337#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 28) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16333#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} is VALID [2022-04-28 03:02:47,137 INFO L290 TraceCheckUtils]: 27: Hoare triple {16341#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 30 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16337#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 28) 4294967296) 268435455))} is VALID [2022-04-28 03:02:47,139 INFO L290 TraceCheckUtils]: 26: Hoare triple {16345#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16341#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 30 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:02:47,141 INFO L290 TraceCheckUtils]: 25: Hoare triple {16349#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 34) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16345#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:02:47,142 INFO L290 TraceCheckUtils]: 24: Hoare triple {16353#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16349#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 34) 4294967296) 268435455))} is VALID [2022-04-28 03:02:47,142 INFO L290 TraceCheckUtils]: 23: Hoare triple {16357#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 38) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16353#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} is VALID [2022-04-28 03:02:47,143 INFO L290 TraceCheckUtils]: 22: Hoare triple {16361#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (< 0 (mod main_~x~0 2)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16357#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 38) 4294967296) 268435455))} is VALID [2022-04-28 03:02:47,144 INFO L290 TraceCheckUtils]: 21: Hoare triple {16365#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 42 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16361#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (< 0 (mod main_~x~0 2)))} is VALID [2022-04-28 03:02:47,145 INFO L290 TraceCheckUtils]: 20: Hoare triple {16369#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16365#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 42 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:02:47,149 INFO L290 TraceCheckUtils]: 19: Hoare triple {16373#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16369#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:02:47,150 INFO L290 TraceCheckUtils]: 18: Hoare triple {16377#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16373#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} is VALID [2022-04-28 03:02:47,151 INFO L290 TraceCheckUtils]: 17: Hoare triple {16381#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 50) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16377#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} is VALID [2022-04-28 03:02:47,152 INFO L290 TraceCheckUtils]: 16: Hoare triple {16385#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16381#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 50) 4294967296) 268435455))} is VALID [2022-04-28 03:02:47,153 INFO L290 TraceCheckUtils]: 15: Hoare triple {16389#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16385#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} is VALID [2022-04-28 03:02:47,153 INFO L290 TraceCheckUtils]: 14: Hoare triple {16393#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 56 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16389#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} is VALID [2022-04-28 03:02:47,154 INFO L290 TraceCheckUtils]: 13: Hoare triple {16397#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 58) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16393#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 56 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:02:47,158 INFO L290 TraceCheckUtils]: 12: Hoare triple {16401#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 60) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16397#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 58) 4294967296) 268435455))} is VALID [2022-04-28 03:02:47,159 INFO L290 TraceCheckUtils]: 11: Hoare triple {16405#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 62) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16401#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 60) 4294967296) 268435455))} is VALID [2022-04-28 03:02:47,160 INFO L290 TraceCheckUtils]: 10: Hoare triple {16409#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 64 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16405#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 62) 4294967296) 268435455))} is VALID [2022-04-28 03:02:47,161 INFO L290 TraceCheckUtils]: 9: Hoare triple {16413#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 66 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16409#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 64 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:02:47,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {16417#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 68 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16413#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 66 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:02:47,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {16421#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 70) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16417#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 68 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:02:47,169 INFO L290 TraceCheckUtils]: 6: Hoare triple {16425#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 72 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16421#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 70) 4294967296) 268435455))} is VALID [2022-04-28 03:02:47,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {16081#true} ~x~0 := 0; {16425#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 72 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:02:47,169 INFO L272 TraceCheckUtils]: 4: Hoare triple {16081#true} call #t~ret4 := main(); {16081#true} is VALID [2022-04-28 03:02:47,169 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16081#true} {16081#true} #34#return; {16081#true} is VALID [2022-04-28 03:02:47,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {16081#true} assume true; {16081#true} is VALID [2022-04-28 03:02:47,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {16081#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {16081#true} is VALID [2022-04-28 03:02:47,169 INFO L272 TraceCheckUtils]: 0: Hoare triple {16081#true} call ULTIMATE.init(); {16081#true} is VALID [2022-04-28 03:02:47,170 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:02:47,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716140853] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:02:47,170 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:02:47,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39, 42] total 81 [2022-04-28 03:02:47,170 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:02:47,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [50274206] [2022-04-28 03:02:47,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [50274206] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:02:47,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:02:47,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-28 03:02:47,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132263189] [2022-04-28 03:02:47,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:02:47,171 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:02:47,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:02:47,172 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:02:47,200 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:02:47,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-28 03:02:47,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:47,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-28 03:02:47,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1639, Invalid=4841, Unknown=0, NotChecked=0, Total=6480 [2022-04-28 03:02:47,201 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:02:49,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:49,755 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-28 03:02:49,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-28 03:02:49,755 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:02:49,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:02:49,756 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:02:49,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2022-04-28 03:02:49,756 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:02:49,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2022-04-28 03:02:49,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 54 transitions. [2022-04-28 03:02:49,788 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:02:49,788 INFO L225 Difference]: With dead ends: 54 [2022-04-28 03:02:49,788 INFO L226 Difference]: Without dead ends: 49 [2022-04-28 03:02:49,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3228, Invalid=10578, Unknown=0, NotChecked=0, Total=13806 [2022-04-28 03:02:49,789 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1369 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:02:49,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 48 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1369 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 03:02:49,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-28 03:02:49,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-04-28 03:02:49,838 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:02:49,839 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:02:49,839 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:02:49,839 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:02:49,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:49,839 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-28 03:02:49,840 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-28 03:02:49,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:49,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:49,840 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:02:49,840 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:02:49,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:49,840 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2022-04-28 03:02:49,840 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-28 03:02:49,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:49,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:49,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:02:49,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:02:49,841 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:02:49,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2022-04-28 03:02:49,841 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2022-04-28 03:02:49,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:02:49,841 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2022-04-28 03:02:49,842 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:02:49,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 49 transitions. [2022-04-28 03:02:49,879 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:02:49,879 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2022-04-28 03:02:49,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-28 03:02:49,879 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:02:49,879 INFO L195 NwaCegarLoop]: trace histogram [37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:02:49,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Ended with exit code 0 [2022-04-28 03:02:50,083 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:02:50,280 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:02:50,280 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:02:50,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:02:50,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1697755146, now seen corresponding path program 73 times [2022-04-28 03:02:50,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:50,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1250899019] [2022-04-28 03:02:50,629 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:50,631 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:02:50,633 INFO L85 PathProgramCache]: Analyzing trace with hash 260484599, now seen corresponding path program 1 times [2022-04-28 03:02:50,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:50,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543034092] [2022-04-28 03:02:50,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:50,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:50,637 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_37.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_37.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:02:50,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:02:50,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1144715736] [2022-04-28 03:02:50,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:50,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:50,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:50,641 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:02:50,641 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:02:50,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:50,678 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:02:50,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:50,687 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:02:50,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1697755146, now seen corresponding path program 74 times [2022-04-28 03:02:50,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:50,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542525151] [2022-04-28 03:02:50,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:50,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:50,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:51,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:02:51,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:51,490 INFO L290 TraceCheckUtils]: 0: Hoare triple {16867#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {16824#true} is VALID [2022-04-28 03:02:51,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {16824#true} assume true; {16824#true} is VALID [2022-04-28 03:02:51,491 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16824#true} {16824#true} #34#return; {16824#true} is VALID [2022-04-28 03:02:51,491 INFO L272 TraceCheckUtils]: 0: Hoare triple {16824#true} call ULTIMATE.init(); {16867#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:02:51,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {16867#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {16824#true} is VALID [2022-04-28 03:02:51,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {16824#true} assume true; {16824#true} is VALID [2022-04-28 03:02:51,491 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16824#true} {16824#true} #34#return; {16824#true} is VALID [2022-04-28 03:02:51,491 INFO L272 TraceCheckUtils]: 4: Hoare triple {16824#true} call #t~ret4 := main(); {16824#true} is VALID [2022-04-28 03:02:51,492 INFO L290 TraceCheckUtils]: 5: Hoare triple {16824#true} ~x~0 := 0; {16829#(= main_~x~0 0)} is VALID [2022-04-28 03:02:51,492 INFO L290 TraceCheckUtils]: 6: Hoare triple {16829#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16830#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:02:51,492 INFO L290 TraceCheckUtils]: 7: Hoare triple {16830#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16831#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:02:51,493 INFO L290 TraceCheckUtils]: 8: Hoare triple {16831#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16832#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:02:51,493 INFO L290 TraceCheckUtils]: 9: Hoare triple {16832#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16833#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:02:51,494 INFO L290 TraceCheckUtils]: 10: Hoare triple {16833#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16834#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:02:51,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {16834#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16835#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:02:51,495 INFO L290 TraceCheckUtils]: 12: Hoare triple {16835#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16836#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:02:51,495 INFO L290 TraceCheckUtils]: 13: Hoare triple {16836#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16837#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:02:51,496 INFO L290 TraceCheckUtils]: 14: Hoare triple {16837#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16838#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:02:51,496 INFO L290 TraceCheckUtils]: 15: Hoare triple {16838#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16839#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:02:51,497 INFO L290 TraceCheckUtils]: 16: Hoare triple {16839#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16840#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:02:51,497 INFO L290 TraceCheckUtils]: 17: Hoare triple {16840#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16841#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:02:51,498 INFO L290 TraceCheckUtils]: 18: Hoare triple {16841#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16842#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:02:51,498 INFO L290 TraceCheckUtils]: 19: Hoare triple {16842#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16843#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:02:51,498 INFO L290 TraceCheckUtils]: 20: Hoare triple {16843#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16844#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:02:51,499 INFO L290 TraceCheckUtils]: 21: Hoare triple {16844#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16845#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:02:51,499 INFO L290 TraceCheckUtils]: 22: Hoare triple {16845#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16846#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:02:51,500 INFO L290 TraceCheckUtils]: 23: Hoare triple {16846#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16847#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:02:51,500 INFO L290 TraceCheckUtils]: 24: Hoare triple {16847#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16848#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:02:51,501 INFO L290 TraceCheckUtils]: 25: Hoare triple {16848#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16849#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:02:51,501 INFO L290 TraceCheckUtils]: 26: Hoare triple {16849#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16850#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:02:51,502 INFO L290 TraceCheckUtils]: 27: Hoare triple {16850#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16851#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:02:51,502 INFO L290 TraceCheckUtils]: 28: Hoare triple {16851#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16852#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:02:51,503 INFO L290 TraceCheckUtils]: 29: Hoare triple {16852#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16853#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:02:51,503 INFO L290 TraceCheckUtils]: 30: Hoare triple {16853#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16854#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:02:51,504 INFO L290 TraceCheckUtils]: 31: Hoare triple {16854#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16855#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:02:51,504 INFO L290 TraceCheckUtils]: 32: Hoare triple {16855#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16856#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:02:51,504 INFO L290 TraceCheckUtils]: 33: Hoare triple {16856#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16857#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:02:51,505 INFO L290 TraceCheckUtils]: 34: Hoare triple {16857#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16858#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:02:51,505 INFO L290 TraceCheckUtils]: 35: Hoare triple {16858#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16859#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:02:51,506 INFO L290 TraceCheckUtils]: 36: Hoare triple {16859#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16860#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:02:51,506 INFO L290 TraceCheckUtils]: 37: Hoare triple {16860#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16861#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:02:51,507 INFO L290 TraceCheckUtils]: 38: Hoare triple {16861#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16862#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:02:51,507 INFO L290 TraceCheckUtils]: 39: Hoare triple {16862#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16863#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:02:51,508 INFO L290 TraceCheckUtils]: 40: Hoare triple {16863#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16864#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:02:51,508 INFO L290 TraceCheckUtils]: 41: Hoare triple {16864#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16865#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:02:51,509 INFO L290 TraceCheckUtils]: 42: Hoare triple {16865#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16866#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 74))} is VALID [2022-04-28 03:02:51,509 INFO L290 TraceCheckUtils]: 43: Hoare triple {16866#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 74))} assume !(~x~0 % 4294967296 < 268435455); {16825#false} is VALID [2022-04-28 03:02:51,509 INFO L272 TraceCheckUtils]: 44: Hoare triple {16825#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {16825#false} is VALID [2022-04-28 03:02:51,509 INFO L290 TraceCheckUtils]: 45: Hoare triple {16825#false} ~cond := #in~cond; {16825#false} is VALID [2022-04-28 03:02:51,509 INFO L290 TraceCheckUtils]: 46: Hoare triple {16825#false} assume 0 == ~cond; {16825#false} is VALID [2022-04-28 03:02:51,509 INFO L290 TraceCheckUtils]: 47: Hoare triple {16825#false} assume !false; {16825#false} is VALID [2022-04-28 03:02:51,510 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:02:51,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:02:51,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542525151] [2022-04-28 03:02:51,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542525151] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:02:51,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880284143] [2022-04-28 03:02:51,510 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:02:51,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:51,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:51,511 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:02:51,511 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:02:51,591 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:02:51,592 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:02:51,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 77 conjunts are in the unsatisfiable core [2022-04-28 03:02:51,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:51,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:02:52,017 INFO L272 TraceCheckUtils]: 0: Hoare triple {16824#true} call ULTIMATE.init(); {16824#true} is VALID [2022-04-28 03:02:52,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {16824#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {16824#true} is VALID [2022-04-28 03:02:52,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {16824#true} assume true; {16824#true} is VALID [2022-04-28 03:02:52,018 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16824#true} {16824#true} #34#return; {16824#true} is VALID [2022-04-28 03:02:52,018 INFO L272 TraceCheckUtils]: 4: Hoare triple {16824#true} call #t~ret4 := main(); {16824#true} is VALID [2022-04-28 03:02:52,018 INFO L290 TraceCheckUtils]: 5: Hoare triple {16824#true} ~x~0 := 0; {16829#(= main_~x~0 0)} is VALID [2022-04-28 03:02:52,018 INFO L290 TraceCheckUtils]: 6: Hoare triple {16829#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16830#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:02:52,019 INFO L290 TraceCheckUtils]: 7: Hoare triple {16830#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16831#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:02:52,019 INFO L290 TraceCheckUtils]: 8: Hoare triple {16831#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16832#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:02:52,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {16832#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16833#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:02:52,020 INFO L290 TraceCheckUtils]: 10: Hoare triple {16833#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16834#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:02:52,021 INFO L290 TraceCheckUtils]: 11: Hoare triple {16834#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16835#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:02:52,021 INFO L290 TraceCheckUtils]: 12: Hoare triple {16835#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16836#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:02:52,022 INFO L290 TraceCheckUtils]: 13: Hoare triple {16836#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16837#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:02:52,022 INFO L290 TraceCheckUtils]: 14: Hoare triple {16837#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16838#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:02:52,023 INFO L290 TraceCheckUtils]: 15: Hoare triple {16838#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16839#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:02:52,023 INFO L290 TraceCheckUtils]: 16: Hoare triple {16839#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16840#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:02:52,024 INFO L290 TraceCheckUtils]: 17: Hoare triple {16840#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16841#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:02:52,024 INFO L290 TraceCheckUtils]: 18: Hoare triple {16841#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16842#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:02:52,025 INFO L290 TraceCheckUtils]: 19: Hoare triple {16842#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16843#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:02:52,025 INFO L290 TraceCheckUtils]: 20: Hoare triple {16843#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16844#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:02:52,025 INFO L290 TraceCheckUtils]: 21: Hoare triple {16844#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16845#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:02:52,026 INFO L290 TraceCheckUtils]: 22: Hoare triple {16845#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16846#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:02:52,026 INFO L290 TraceCheckUtils]: 23: Hoare triple {16846#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16847#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:02:52,027 INFO L290 TraceCheckUtils]: 24: Hoare triple {16847#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16848#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:02:52,027 INFO L290 TraceCheckUtils]: 25: Hoare triple {16848#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16849#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:02:52,028 INFO L290 TraceCheckUtils]: 26: Hoare triple {16849#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16850#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:02:52,028 INFO L290 TraceCheckUtils]: 27: Hoare triple {16850#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16851#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:02:52,029 INFO L290 TraceCheckUtils]: 28: Hoare triple {16851#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16852#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:02:52,029 INFO L290 TraceCheckUtils]: 29: Hoare triple {16852#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16853#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:02:52,030 INFO L290 TraceCheckUtils]: 30: Hoare triple {16853#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16854#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:02:52,030 INFO L290 TraceCheckUtils]: 31: Hoare triple {16854#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16855#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:02:52,031 INFO L290 TraceCheckUtils]: 32: Hoare triple {16855#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16856#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:02:52,031 INFO L290 TraceCheckUtils]: 33: Hoare triple {16856#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16857#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:02:52,032 INFO L290 TraceCheckUtils]: 34: Hoare triple {16857#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16858#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:02:52,032 INFO L290 TraceCheckUtils]: 35: Hoare triple {16858#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16859#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:02:52,033 INFO L290 TraceCheckUtils]: 36: Hoare triple {16859#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16860#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:02:52,033 INFO L290 TraceCheckUtils]: 37: Hoare triple {16860#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16861#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:02:52,034 INFO L290 TraceCheckUtils]: 38: Hoare triple {16861#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16862#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:02:52,034 INFO L290 TraceCheckUtils]: 39: Hoare triple {16862#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16863#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:02:52,034 INFO L290 TraceCheckUtils]: 40: Hoare triple {16863#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16864#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:02:52,035 INFO L290 TraceCheckUtils]: 41: Hoare triple {16864#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16865#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:02:52,035 INFO L290 TraceCheckUtils]: 42: Hoare triple {16865#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {16997#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:02:52,036 INFO L290 TraceCheckUtils]: 43: Hoare triple {16997#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !(~x~0 % 4294967296 < 268435455); {16825#false} is VALID [2022-04-28 03:02:52,036 INFO L272 TraceCheckUtils]: 44: Hoare triple {16825#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {16825#false} is VALID [2022-04-28 03:02:52,036 INFO L290 TraceCheckUtils]: 45: Hoare triple {16825#false} ~cond := #in~cond; {16825#false} is VALID [2022-04-28 03:02:52,036 INFO L290 TraceCheckUtils]: 46: Hoare triple {16825#false} assume 0 == ~cond; {16825#false} is VALID [2022-04-28 03:02:52,036 INFO L290 TraceCheckUtils]: 47: Hoare triple {16825#false} assume !false; {16825#false} is VALID [2022-04-28 03:02:52,036 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:02:52,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:02:54,119 INFO L290 TraceCheckUtils]: 47: Hoare triple {16825#false} assume !false; {16825#false} is VALID [2022-04-28 03:02:54,119 INFO L290 TraceCheckUtils]: 46: Hoare triple {16825#false} assume 0 == ~cond; {16825#false} is VALID [2022-04-28 03:02:54,119 INFO L290 TraceCheckUtils]: 45: Hoare triple {16825#false} ~cond := #in~cond; {16825#false} is VALID [2022-04-28 03:02:54,119 INFO L272 TraceCheckUtils]: 44: Hoare triple {16825#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {16825#false} is VALID [2022-04-28 03:02:54,119 INFO L290 TraceCheckUtils]: 43: Hoare triple {17025#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {16825#false} is VALID [2022-04-28 03:02:54,120 INFO L290 TraceCheckUtils]: 42: Hoare triple {17029#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17025#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:02:54,121 INFO L290 TraceCheckUtils]: 41: Hoare triple {17033#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17029#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 03:02:54,121 INFO L290 TraceCheckUtils]: 40: Hoare triple {17037#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17033#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 03:02:54,122 INFO L290 TraceCheckUtils]: 39: Hoare triple {17041#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17037#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 03:02:54,123 INFO L290 TraceCheckUtils]: 38: Hoare triple {17045#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17041#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 03:02:54,123 INFO L290 TraceCheckUtils]: 37: Hoare triple {17049#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17045#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-28 03:02:54,124 INFO L290 TraceCheckUtils]: 36: Hoare triple {17053#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17049#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-28 03:02:54,124 INFO L290 TraceCheckUtils]: 35: Hoare triple {17057#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17053#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-28 03:02:54,125 INFO L290 TraceCheckUtils]: 34: Hoare triple {17061#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17057#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-28 03:02:54,126 INFO L290 TraceCheckUtils]: 33: Hoare triple {17065#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17061#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-28 03:02:54,127 INFO L290 TraceCheckUtils]: 32: Hoare triple {17069#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17065#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-28 03:02:54,127 INFO L290 TraceCheckUtils]: 31: Hoare triple {17073#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17069#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-28 03:02:54,128 INFO L290 TraceCheckUtils]: 30: Hoare triple {17077#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17073#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-28 03:02:54,128 INFO L290 TraceCheckUtils]: 29: Hoare triple {17081#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17077#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-28 03:02:54,129 INFO L290 TraceCheckUtils]: 28: Hoare triple {17085#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17081#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-28 03:02:54,129 INFO L290 TraceCheckUtils]: 27: Hoare triple {17089#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17085#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:02:54,130 INFO L290 TraceCheckUtils]: 26: Hoare triple {17093#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17089#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:02:54,131 INFO L290 TraceCheckUtils]: 25: Hoare triple {17097#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17093#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-28 03:02:54,131 INFO L290 TraceCheckUtils]: 24: Hoare triple {17101#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17097#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-28 03:02:54,132 INFO L290 TraceCheckUtils]: 23: Hoare triple {17105#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17101#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-28 03:02:54,132 INFO L290 TraceCheckUtils]: 22: Hoare triple {17109#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17105#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:02:54,133 INFO L290 TraceCheckUtils]: 21: Hoare triple {17113#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17109#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:02:54,133 INFO L290 TraceCheckUtils]: 20: Hoare triple {17117#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17113#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:02:54,134 INFO L290 TraceCheckUtils]: 19: Hoare triple {17121#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17117#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-28 03:02:54,135 INFO L290 TraceCheckUtils]: 18: Hoare triple {17125#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17121#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-28 03:02:54,135 INFO L290 TraceCheckUtils]: 17: Hoare triple {17129#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17125#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-28 03:02:54,136 INFO L290 TraceCheckUtils]: 16: Hoare triple {17133#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17129#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-28 03:02:54,136 INFO L290 TraceCheckUtils]: 15: Hoare triple {17137#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17133#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-28 03:02:54,137 INFO L290 TraceCheckUtils]: 14: Hoare triple {17141#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17137#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:02:54,137 INFO L290 TraceCheckUtils]: 13: Hoare triple {17145#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17141#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-28 03:02:54,138 INFO L290 TraceCheckUtils]: 12: Hoare triple {17149#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17145#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-28 03:02:54,138 INFO L290 TraceCheckUtils]: 11: Hoare triple {17153#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17149#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-28 03:02:54,139 INFO L290 TraceCheckUtils]: 10: Hoare triple {17157#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17153#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:02:54,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {17161#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17157#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:02:54,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {17165#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17161#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:02:54,141 INFO L290 TraceCheckUtils]: 7: Hoare triple {17169#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17165#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} is VALID [2022-04-28 03:02:54,141 INFO L290 TraceCheckUtils]: 6: Hoare triple {17173#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17169#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:02:54,142 INFO L290 TraceCheckUtils]: 5: Hoare triple {16824#true} ~x~0 := 0; {17173#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} is VALID [2022-04-28 03:02:54,142 INFO L272 TraceCheckUtils]: 4: Hoare triple {16824#true} call #t~ret4 := main(); {16824#true} is VALID [2022-04-28 03:02:54,142 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16824#true} {16824#true} #34#return; {16824#true} is VALID [2022-04-28 03:02:54,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {16824#true} assume true; {16824#true} is VALID [2022-04-28 03:02:54,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {16824#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {16824#true} is VALID [2022-04-28 03:02:54,142 INFO L272 TraceCheckUtils]: 0: Hoare triple {16824#true} call ULTIMATE.init(); {16824#true} is VALID [2022-04-28 03:02:54,142 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:02:54,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880284143] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:02:54,142 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:02:54,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40, 40] total 80 [2022-04-28 03:02:54,143 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:02:54,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1250899019] [2022-04-28 03:02:54,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1250899019] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:02:54,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:02:54,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-28 03:02:54,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863217280] [2022-04-28 03:02:54,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:02:54,143 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:02:54,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:02:54,144 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:02:54,167 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:02:54,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-28 03:02:54,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:54,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-28 03:02:54,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1677, Invalid=4643, Unknown=0, NotChecked=0, Total=6320 [2022-04-28 03:02:54,168 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:02:56,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:56,930 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2022-04-28 03:02:56,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-28 03:02:56,930 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:02:56,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:02:56,931 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:02:56,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2022-04-28 03:02:56,931 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:02:56,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2022-04-28 03:02:56,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 55 transitions. [2022-04-28 03:02:56,995 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:02:56,995 INFO L225 Difference]: With dead ends: 55 [2022-04-28 03:02:56,995 INFO L226 Difference]: Without dead ends: 50 [2022-04-28 03:02:56,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3347, Invalid=10459, Unknown=0, NotChecked=0, Total=13806 [2022-04-28 03:02:56,997 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 1538 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 1615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:02:56,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 143 Invalid, 1615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1538 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 03:02:56,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-28 03:02:57,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-28 03:02:57,044 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:02:57,045 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:02:57,045 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:02:57,045 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:02:57,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:57,045 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-28 03:02:57,045 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-28 03:02:57,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:57,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:57,046 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:02:57,047 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:02:57,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:02:57,048 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2022-04-28 03:02:57,048 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-28 03:02:57,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:02:57,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:02:57,048 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:02:57,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:02:57,049 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:02:57,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2022-04-28 03:02:57,049 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2022-04-28 03:02:57,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:02:57,049 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2022-04-28 03:02:57,049 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:02:57,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 50 transitions. [2022-04-28 03:02:57,087 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:02:57,087 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-04-28 03:02:57,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 03:02:57,088 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:02:57,088 INFO L195 NwaCegarLoop]: trace histogram [38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:02:57,093 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:02:57,304 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:02:57,488 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:02:57,489 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:02:57,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:02:57,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1054340708, now seen corresponding path program 75 times [2022-04-28 03:02:57,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:02:57,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [734247736] [2022-04-28 03:02:57,641 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:57,642 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:02:57,644 INFO L85 PathProgramCache]: Analyzing trace with hash 319589943, now seen corresponding path program 1 times [2022-04-28 03:02:57,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:57,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132945462] [2022-04-28 03:02:57,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:57,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:57,648 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_38.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_38.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:02:57,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:02:57,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [706799308] [2022-04-28 03:02:57,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:57,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:57,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:57,656 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:02:57,678 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:02:57,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:57,711 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:02:57,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:02:57,718 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:02:57,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1054340708, now seen corresponding path program 76 times [2022-04-28 03:02:57,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:02:57,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548122564] [2022-04-28 03:02:57,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:02:57,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:02:57,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:58,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:02:58,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:58,499 INFO L290 TraceCheckUtils]: 0: Hoare triple {17624#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {17580#true} is VALID [2022-04-28 03:02:58,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {17580#true} assume true; {17580#true} is VALID [2022-04-28 03:02:58,499 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17580#true} {17580#true} #34#return; {17580#true} is VALID [2022-04-28 03:02:58,500 INFO L272 TraceCheckUtils]: 0: Hoare triple {17580#true} call ULTIMATE.init(); {17624#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:02:58,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {17624#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {17580#true} is VALID [2022-04-28 03:02:58,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {17580#true} assume true; {17580#true} is VALID [2022-04-28 03:02:58,500 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17580#true} {17580#true} #34#return; {17580#true} is VALID [2022-04-28 03:02:58,500 INFO L272 TraceCheckUtils]: 4: Hoare triple {17580#true} call #t~ret4 := main(); {17580#true} is VALID [2022-04-28 03:02:58,500 INFO L290 TraceCheckUtils]: 5: Hoare triple {17580#true} ~x~0 := 0; {17585#(= main_~x~0 0)} is VALID [2022-04-28 03:02:58,501 INFO L290 TraceCheckUtils]: 6: Hoare triple {17585#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17586#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:02:58,501 INFO L290 TraceCheckUtils]: 7: Hoare triple {17586#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17587#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:02:58,502 INFO L290 TraceCheckUtils]: 8: Hoare triple {17587#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17588#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:02:58,502 INFO L290 TraceCheckUtils]: 9: Hoare triple {17588#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17589#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:02:58,502 INFO L290 TraceCheckUtils]: 10: Hoare triple {17589#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17590#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:02:58,503 INFO L290 TraceCheckUtils]: 11: Hoare triple {17590#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17591#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:02:58,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {17591#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17592#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:02:58,504 INFO L290 TraceCheckUtils]: 13: Hoare triple {17592#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17593#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:02:58,504 INFO L290 TraceCheckUtils]: 14: Hoare triple {17593#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17594#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:02:58,505 INFO L290 TraceCheckUtils]: 15: Hoare triple {17594#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17595#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:02:58,505 INFO L290 TraceCheckUtils]: 16: Hoare triple {17595#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17596#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:02:58,506 INFO L290 TraceCheckUtils]: 17: Hoare triple {17596#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17597#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:02:58,506 INFO L290 TraceCheckUtils]: 18: Hoare triple {17597#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17598#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:02:58,507 INFO L290 TraceCheckUtils]: 19: Hoare triple {17598#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17599#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:02:58,507 INFO L290 TraceCheckUtils]: 20: Hoare triple {17599#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17600#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:02:58,508 INFO L290 TraceCheckUtils]: 21: Hoare triple {17600#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17601#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:02:58,508 INFO L290 TraceCheckUtils]: 22: Hoare triple {17601#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17602#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:02:58,508 INFO L290 TraceCheckUtils]: 23: Hoare triple {17602#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17603#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:02:58,509 INFO L290 TraceCheckUtils]: 24: Hoare triple {17603#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17604#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:02:58,509 INFO L290 TraceCheckUtils]: 25: Hoare triple {17604#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17605#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:02:58,510 INFO L290 TraceCheckUtils]: 26: Hoare triple {17605#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17606#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:02:58,510 INFO L290 TraceCheckUtils]: 27: Hoare triple {17606#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17607#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:02:58,511 INFO L290 TraceCheckUtils]: 28: Hoare triple {17607#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17608#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:02:58,511 INFO L290 TraceCheckUtils]: 29: Hoare triple {17608#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17609#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:02:58,512 INFO L290 TraceCheckUtils]: 30: Hoare triple {17609#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17610#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:02:58,512 INFO L290 TraceCheckUtils]: 31: Hoare triple {17610#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17611#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:02:58,513 INFO L290 TraceCheckUtils]: 32: Hoare triple {17611#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17612#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:02:58,513 INFO L290 TraceCheckUtils]: 33: Hoare triple {17612#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17613#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:02:58,513 INFO L290 TraceCheckUtils]: 34: Hoare triple {17613#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17614#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:02:58,514 INFO L290 TraceCheckUtils]: 35: Hoare triple {17614#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17615#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:02:58,514 INFO L290 TraceCheckUtils]: 36: Hoare triple {17615#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17616#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:02:58,515 INFO L290 TraceCheckUtils]: 37: Hoare triple {17616#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17617#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:02:58,515 INFO L290 TraceCheckUtils]: 38: Hoare triple {17617#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17618#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:02:58,516 INFO L290 TraceCheckUtils]: 39: Hoare triple {17618#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17619#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:02:58,516 INFO L290 TraceCheckUtils]: 40: Hoare triple {17619#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17620#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:02:58,517 INFO L290 TraceCheckUtils]: 41: Hoare triple {17620#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17621#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:02:58,517 INFO L290 TraceCheckUtils]: 42: Hoare triple {17621#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17622#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:02:58,518 INFO L290 TraceCheckUtils]: 43: Hoare triple {17622#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17623#(and (<= main_~x~0 76) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:02:58,518 INFO L290 TraceCheckUtils]: 44: Hoare triple {17623#(and (<= main_~x~0 76) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {17581#false} is VALID [2022-04-28 03:02:58,518 INFO L272 TraceCheckUtils]: 45: Hoare triple {17581#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {17581#false} is VALID [2022-04-28 03:02:58,518 INFO L290 TraceCheckUtils]: 46: Hoare triple {17581#false} ~cond := #in~cond; {17581#false} is VALID [2022-04-28 03:02:58,518 INFO L290 TraceCheckUtils]: 47: Hoare triple {17581#false} assume 0 == ~cond; {17581#false} is VALID [2022-04-28 03:02:58,518 INFO L290 TraceCheckUtils]: 48: Hoare triple {17581#false} assume !false; {17581#false} is VALID [2022-04-28 03:02:58,519 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:02:58,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:02:58,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548122564] [2022-04-28 03:02:58,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548122564] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:02:58,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881290320] [2022-04-28 03:02:58,519 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:02:58,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:02:58,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:02:58,520 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:02:58,520 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:02:58,594 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:02:58,594 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:02:58,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 79 conjunts are in the unsatisfiable core [2022-04-28 03:02:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:02:58,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:02:59,028 INFO L272 TraceCheckUtils]: 0: Hoare triple {17580#true} call ULTIMATE.init(); {17580#true} is VALID [2022-04-28 03:02:59,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {17580#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {17580#true} is VALID [2022-04-28 03:02:59,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {17580#true} assume true; {17580#true} is VALID [2022-04-28 03:02:59,029 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17580#true} {17580#true} #34#return; {17580#true} is VALID [2022-04-28 03:02:59,029 INFO L272 TraceCheckUtils]: 4: Hoare triple {17580#true} call #t~ret4 := main(); {17580#true} is VALID [2022-04-28 03:02:59,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {17580#true} ~x~0 := 0; {17585#(= main_~x~0 0)} is VALID [2022-04-28 03:02:59,030 INFO L290 TraceCheckUtils]: 6: Hoare triple {17585#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17586#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:02:59,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {17586#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17587#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:02:59,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {17587#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17588#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:02:59,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {17588#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17589#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:02:59,031 INFO L290 TraceCheckUtils]: 10: Hoare triple {17589#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17590#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:02:59,032 INFO L290 TraceCheckUtils]: 11: Hoare triple {17590#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17591#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:02:59,032 INFO L290 TraceCheckUtils]: 12: Hoare triple {17591#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17592#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:02:59,033 INFO L290 TraceCheckUtils]: 13: Hoare triple {17592#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17593#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:02:59,033 INFO L290 TraceCheckUtils]: 14: Hoare triple {17593#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17594#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:02:59,034 INFO L290 TraceCheckUtils]: 15: Hoare triple {17594#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17595#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:02:59,034 INFO L290 TraceCheckUtils]: 16: Hoare triple {17595#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17596#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:02:59,035 INFO L290 TraceCheckUtils]: 17: Hoare triple {17596#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17597#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:02:59,042 INFO L290 TraceCheckUtils]: 18: Hoare triple {17597#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17598#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:02:59,042 INFO L290 TraceCheckUtils]: 19: Hoare triple {17598#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17599#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:02:59,043 INFO L290 TraceCheckUtils]: 20: Hoare triple {17599#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17600#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:02:59,043 INFO L290 TraceCheckUtils]: 21: Hoare triple {17600#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17601#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:02:59,044 INFO L290 TraceCheckUtils]: 22: Hoare triple {17601#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17602#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:02:59,044 INFO L290 TraceCheckUtils]: 23: Hoare triple {17602#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17603#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:02:59,045 INFO L290 TraceCheckUtils]: 24: Hoare triple {17603#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17604#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:02:59,045 INFO L290 TraceCheckUtils]: 25: Hoare triple {17604#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17605#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:02:59,045 INFO L290 TraceCheckUtils]: 26: Hoare triple {17605#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17606#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:02:59,046 INFO L290 TraceCheckUtils]: 27: Hoare triple {17606#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17607#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:02:59,046 INFO L290 TraceCheckUtils]: 28: Hoare triple {17607#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17608#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:02:59,047 INFO L290 TraceCheckUtils]: 29: Hoare triple {17608#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17609#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:02:59,047 INFO L290 TraceCheckUtils]: 30: Hoare triple {17609#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17610#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:02:59,048 INFO L290 TraceCheckUtils]: 31: Hoare triple {17610#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17611#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:02:59,048 INFO L290 TraceCheckUtils]: 32: Hoare triple {17611#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17612#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:02:59,049 INFO L290 TraceCheckUtils]: 33: Hoare triple {17612#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17613#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:02:59,049 INFO L290 TraceCheckUtils]: 34: Hoare triple {17613#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17614#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:02:59,050 INFO L290 TraceCheckUtils]: 35: Hoare triple {17614#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17615#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:02:59,050 INFO L290 TraceCheckUtils]: 36: Hoare triple {17615#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17616#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:02:59,051 INFO L290 TraceCheckUtils]: 37: Hoare triple {17616#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17617#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:02:59,051 INFO L290 TraceCheckUtils]: 38: Hoare triple {17617#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17618#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:02:59,051 INFO L290 TraceCheckUtils]: 39: Hoare triple {17618#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17619#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:02:59,052 INFO L290 TraceCheckUtils]: 40: Hoare triple {17619#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17620#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:02:59,052 INFO L290 TraceCheckUtils]: 41: Hoare triple {17620#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17621#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:02:59,053 INFO L290 TraceCheckUtils]: 42: Hoare triple {17621#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17622#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:02:59,053 INFO L290 TraceCheckUtils]: 43: Hoare triple {17622#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17757#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:02:59,054 INFO L290 TraceCheckUtils]: 44: Hoare triple {17757#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !(~x~0 % 4294967296 < 268435455); {17581#false} is VALID [2022-04-28 03:02:59,054 INFO L272 TraceCheckUtils]: 45: Hoare triple {17581#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {17581#false} is VALID [2022-04-28 03:02:59,054 INFO L290 TraceCheckUtils]: 46: Hoare triple {17581#false} ~cond := #in~cond; {17581#false} is VALID [2022-04-28 03:02:59,054 INFO L290 TraceCheckUtils]: 47: Hoare triple {17581#false} assume 0 == ~cond; {17581#false} is VALID [2022-04-28 03:02:59,054 INFO L290 TraceCheckUtils]: 48: Hoare triple {17581#false} assume !false; {17581#false} is VALID [2022-04-28 03:02:59,054 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:02:59,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:03:01,272 INFO L290 TraceCheckUtils]: 48: Hoare triple {17581#false} assume !false; {17581#false} is VALID [2022-04-28 03:03:01,272 INFO L290 TraceCheckUtils]: 47: Hoare triple {17581#false} assume 0 == ~cond; {17581#false} is VALID [2022-04-28 03:03:01,272 INFO L290 TraceCheckUtils]: 46: Hoare triple {17581#false} ~cond := #in~cond; {17581#false} is VALID [2022-04-28 03:03:01,273 INFO L272 TraceCheckUtils]: 45: Hoare triple {17581#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {17581#false} is VALID [2022-04-28 03:03:01,273 INFO L290 TraceCheckUtils]: 44: Hoare triple {17785#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {17581#false} is VALID [2022-04-28 03:03:01,273 INFO L290 TraceCheckUtils]: 43: Hoare triple {17789#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17785#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:03:01,274 INFO L290 TraceCheckUtils]: 42: Hoare triple {17793#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17789#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 03:03:01,275 INFO L290 TraceCheckUtils]: 41: Hoare triple {17797#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17793#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 03:03:01,275 INFO L290 TraceCheckUtils]: 40: Hoare triple {17801#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17797#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 03:03:01,276 INFO L290 TraceCheckUtils]: 39: Hoare triple {17805#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17801#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 03:03:01,277 INFO L290 TraceCheckUtils]: 38: Hoare triple {17809#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17805#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-28 03:03:01,277 INFO L290 TraceCheckUtils]: 37: Hoare triple {17813#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17809#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-28 03:03:01,278 INFO L290 TraceCheckUtils]: 36: Hoare triple {17817#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17813#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-28 03:03:01,278 INFO L290 TraceCheckUtils]: 35: Hoare triple {17821#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17817#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-28 03:03:01,279 INFO L290 TraceCheckUtils]: 34: Hoare triple {17825#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17821#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-28 03:03:01,279 INFO L290 TraceCheckUtils]: 33: Hoare triple {17829#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17825#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-28 03:03:01,280 INFO L290 TraceCheckUtils]: 32: Hoare triple {17833#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17829#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-28 03:03:01,281 INFO L290 TraceCheckUtils]: 31: Hoare triple {17837#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17833#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-28 03:03:01,281 INFO L290 TraceCheckUtils]: 30: Hoare triple {17841#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17837#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-28 03:03:01,282 INFO L290 TraceCheckUtils]: 29: Hoare triple {17845#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17841#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-28 03:03:01,282 INFO L290 TraceCheckUtils]: 28: Hoare triple {17849#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17845#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:03:01,283 INFO L290 TraceCheckUtils]: 27: Hoare triple {17853#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17849#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:03:01,283 INFO L290 TraceCheckUtils]: 26: Hoare triple {17857#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17853#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-28 03:03:01,284 INFO L290 TraceCheckUtils]: 25: Hoare triple {17861#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17857#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-28 03:03:01,285 INFO L290 TraceCheckUtils]: 24: Hoare triple {17865#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17861#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-28 03:03:01,285 INFO L290 TraceCheckUtils]: 23: Hoare triple {17869#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17865#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:03:01,286 INFO L290 TraceCheckUtils]: 22: Hoare triple {17873#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17869#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:03:01,286 INFO L290 TraceCheckUtils]: 21: Hoare triple {17877#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17873#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:03:01,287 INFO L290 TraceCheckUtils]: 20: Hoare triple {17881#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17877#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-28 03:03:01,288 INFO L290 TraceCheckUtils]: 19: Hoare triple {17885#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17881#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-28 03:03:01,288 INFO L290 TraceCheckUtils]: 18: Hoare triple {17889#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17885#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-28 03:03:01,289 INFO L290 TraceCheckUtils]: 17: Hoare triple {17893#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17889#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-28 03:03:01,289 INFO L290 TraceCheckUtils]: 16: Hoare triple {17897#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17893#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-28 03:03:01,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {17901#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17897#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:03:01,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {17905#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17901#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-28 03:03:01,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {17909#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17905#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-28 03:03:01,292 INFO L290 TraceCheckUtils]: 12: Hoare triple {17913#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17909#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-28 03:03:01,292 INFO L290 TraceCheckUtils]: 11: Hoare triple {17917#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17913#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:03:01,293 INFO L290 TraceCheckUtils]: 10: Hoare triple {17921#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17917#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:03:01,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {17925#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17921#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:03:01,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {17929#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17925#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} is VALID [2022-04-28 03:03:01,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {17933#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17929#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:03:01,295 INFO L290 TraceCheckUtils]: 6: Hoare triple {17937#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {17933#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} is VALID [2022-04-28 03:03:01,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {17580#true} ~x~0 := 0; {17937#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:03:01,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {17580#true} call #t~ret4 := main(); {17580#true} is VALID [2022-04-28 03:03:01,296 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17580#true} {17580#true} #34#return; {17580#true} is VALID [2022-04-28 03:03:01,296 INFO L290 TraceCheckUtils]: 2: Hoare triple {17580#true} assume true; {17580#true} is VALID [2022-04-28 03:03:01,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {17580#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {17580#true} is VALID [2022-04-28 03:03:01,296 INFO L272 TraceCheckUtils]: 0: Hoare triple {17580#true} call ULTIMATE.init(); {17580#true} is VALID [2022-04-28 03:03:01,296 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:03:01,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881290320] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:03:01,296 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:03:01,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 41, 41] total 82 [2022-04-28 03:03:01,296 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:03:01,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [734247736] [2022-04-28 03:03:01,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [734247736] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:03:01,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:03:01,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-28 03:03:01,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765592792] [2022-04-28 03:03:01,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:03:01,297 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:03:01,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:03:01,297 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:03:01,323 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:01,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-28 03:03:01,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:03:01,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-28 03:03:01,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1760, Invalid=4882, Unknown=0, NotChecked=0, Total=6642 [2022-04-28 03:03:01,324 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:03:04,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:04,302 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-28 03:03:04,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-28 03:03:04,302 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 41 states have internal predecessors, (45), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-28 03:03:04,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:03:04,302 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:03:04,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2022-04-28 03:03:04,303 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:03:04,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2022-04-28 03:03:04,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 56 transitions. [2022-04-28 03:03:04,351 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:03:04,351 INFO L225 Difference]: With dead ends: 56 [2022-04-28 03:03:04,352 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 03:03:04,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 823 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3513, Invalid=11007, Unknown=0, NotChecked=0, Total=14520 [2022-04-28 03:03:04,352 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 1674 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 1753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:03:04,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 203 Invalid, 1753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1674 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 03:03:04,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 03:03:04,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-28 03:03:04,415 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:03:04,416 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:03:04,416 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:03:04,416 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:03:04,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:04,416 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-28 03:03:04,417 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-28 03:03:04,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:03:04,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:03:04,417 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:03:04,417 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:03:04,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:04,417 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-28 03:03:04,417 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-28 03:03:04,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:03:04,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:03:04,418 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:03:04,418 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:03:04,418 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:03:04,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2022-04-28 03:03:04,418 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2022-04-28 03:03:04,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:03:04,418 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2022-04-28 03:03:04,419 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:03:04,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 51 transitions. [2022-04-28 03:03:04,458 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:04,458 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-28 03:03:04,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 03:03:04,458 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:03:04,458 INFO L195 NwaCegarLoop]: trace histogram [39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:03:04,463 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:03:04,674 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:03:04,859 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:03:04,859 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:03:04,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:03:04,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1711637686, now seen corresponding path program 77 times [2022-04-28 03:03:04,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:03:04,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1043041816] [2022-04-28 03:03:05,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:03:05,046 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:03:05,048 INFO L85 PathProgramCache]: Analyzing trace with hash 378695287, now seen corresponding path program 1 times [2022-04-28 03:03:05,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:03:05,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181672270] [2022-04-28 03:03:05,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:05,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:03:05,052 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 2) .v_it_39.0) (* (- 1) main_~x~0_5) (* 4294967296 (div (+ (* 2 .v_it_39.0) main_~x~0_5) 4294967296)) 268435455) 0)) [2022-04-28 03:03:05,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:03:05,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1343059525] [2022-04-28 03:03:05,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:05,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:03:05,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:03:05,055 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:03:05,056 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:03:05,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:03:05,096 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:03:05,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:03:05,105 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:03:05,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1711637686, now seen corresponding path program 78 times [2022-04-28 03:03:05,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:03:05,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909721171] [2022-04-28 03:03:05,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:05,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:03:05,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:05,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:03:05,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:05,961 INFO L290 TraceCheckUtils]: 0: Hoare triple {18397#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {18352#true} is VALID [2022-04-28 03:03:05,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 03:03:05,961 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18352#true} {18352#true} #34#return; {18352#true} is VALID [2022-04-28 03:03:05,961 INFO L272 TraceCheckUtils]: 0: Hoare triple {18352#true} call ULTIMATE.init(); {18397#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:03:05,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {18397#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {18352#true} is VALID [2022-04-28 03:03:05,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 03:03:05,961 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18352#true} {18352#true} #34#return; {18352#true} is VALID [2022-04-28 03:03:05,962 INFO L272 TraceCheckUtils]: 4: Hoare triple {18352#true} call #t~ret4 := main(); {18352#true} is VALID [2022-04-28 03:03:05,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {18352#true} ~x~0 := 0; {18357#(= main_~x~0 0)} is VALID [2022-04-28 03:03:05,962 INFO L290 TraceCheckUtils]: 6: Hoare triple {18357#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18358#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:03:05,963 INFO L290 TraceCheckUtils]: 7: Hoare triple {18358#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18359#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:03:05,963 INFO L290 TraceCheckUtils]: 8: Hoare triple {18359#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18360#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:03:05,964 INFO L290 TraceCheckUtils]: 9: Hoare triple {18360#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18361#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:03:05,964 INFO L290 TraceCheckUtils]: 10: Hoare triple {18361#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18362#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:03:05,964 INFO L290 TraceCheckUtils]: 11: Hoare triple {18362#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18363#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:03:05,965 INFO L290 TraceCheckUtils]: 12: Hoare triple {18363#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18364#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:03:05,965 INFO L290 TraceCheckUtils]: 13: Hoare triple {18364#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18365#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:03:05,966 INFO L290 TraceCheckUtils]: 14: Hoare triple {18365#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18366#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:03:05,966 INFO L290 TraceCheckUtils]: 15: Hoare triple {18366#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18367#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:03:05,967 INFO L290 TraceCheckUtils]: 16: Hoare triple {18367#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18368#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:03:05,967 INFO L290 TraceCheckUtils]: 17: Hoare triple {18368#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18369#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:03:05,968 INFO L290 TraceCheckUtils]: 18: Hoare triple {18369#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18370#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:03:05,968 INFO L290 TraceCheckUtils]: 19: Hoare triple {18370#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18371#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:03:05,969 INFO L290 TraceCheckUtils]: 20: Hoare triple {18371#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18372#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:03:05,969 INFO L290 TraceCheckUtils]: 21: Hoare triple {18372#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18373#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:03:05,970 INFO L290 TraceCheckUtils]: 22: Hoare triple {18373#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18374#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:03:05,970 INFO L290 TraceCheckUtils]: 23: Hoare triple {18374#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18375#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:03:05,970 INFO L290 TraceCheckUtils]: 24: Hoare triple {18375#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18376#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:03:05,971 INFO L290 TraceCheckUtils]: 25: Hoare triple {18376#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18377#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:03:05,971 INFO L290 TraceCheckUtils]: 26: Hoare triple {18377#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18378#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:03:05,972 INFO L290 TraceCheckUtils]: 27: Hoare triple {18378#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18379#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:03:05,972 INFO L290 TraceCheckUtils]: 28: Hoare triple {18379#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18380#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:03:05,973 INFO L290 TraceCheckUtils]: 29: Hoare triple {18380#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18381#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:03:05,973 INFO L290 TraceCheckUtils]: 30: Hoare triple {18381#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18382#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:03:05,974 INFO L290 TraceCheckUtils]: 31: Hoare triple {18382#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18383#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:03:05,974 INFO L290 TraceCheckUtils]: 32: Hoare triple {18383#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18384#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:03:05,975 INFO L290 TraceCheckUtils]: 33: Hoare triple {18384#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18385#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:03:05,975 INFO L290 TraceCheckUtils]: 34: Hoare triple {18385#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18386#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:03:05,975 INFO L290 TraceCheckUtils]: 35: Hoare triple {18386#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18387#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:03:05,976 INFO L290 TraceCheckUtils]: 36: Hoare triple {18387#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18388#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:03:05,976 INFO L290 TraceCheckUtils]: 37: Hoare triple {18388#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18389#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:03:05,977 INFO L290 TraceCheckUtils]: 38: Hoare triple {18389#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18390#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:03:05,977 INFO L290 TraceCheckUtils]: 39: Hoare triple {18390#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18391#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:03:05,978 INFO L290 TraceCheckUtils]: 40: Hoare triple {18391#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18392#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:03:05,978 INFO L290 TraceCheckUtils]: 41: Hoare triple {18392#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18393#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:03:05,979 INFO L290 TraceCheckUtils]: 42: Hoare triple {18393#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18394#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:03:05,979 INFO L290 TraceCheckUtils]: 43: Hoare triple {18394#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18395#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:03:05,980 INFO L290 TraceCheckUtils]: 44: Hoare triple {18395#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18396#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 78))} is VALID [2022-04-28 03:03:05,980 INFO L290 TraceCheckUtils]: 45: Hoare triple {18396#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 78))} assume !(~x~0 % 4294967296 < 268435455); {18353#false} is VALID [2022-04-28 03:03:05,980 INFO L272 TraceCheckUtils]: 46: Hoare triple {18353#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {18353#false} is VALID [2022-04-28 03:03:05,980 INFO L290 TraceCheckUtils]: 47: Hoare triple {18353#false} ~cond := #in~cond; {18353#false} is VALID [2022-04-28 03:03:05,980 INFO L290 TraceCheckUtils]: 48: Hoare triple {18353#false} assume 0 == ~cond; {18353#false} is VALID [2022-04-28 03:03:05,980 INFO L290 TraceCheckUtils]: 49: Hoare triple {18353#false} assume !false; {18353#false} is VALID [2022-04-28 03:03:05,981 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:03:05,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:03:05,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909721171] [2022-04-28 03:03:05,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909721171] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:03:05,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762820313] [2022-04-28 03:03:05,981 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:03:05,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:03:05,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:03:05,982 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:03:05,983 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:03:10,339 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2022-04-28 03:03:10,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:03:10,346 WARN L261 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 87 conjunts are in the unsatisfiable core [2022-04-28 03:03:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:10,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:03:10,721 INFO L272 TraceCheckUtils]: 0: Hoare triple {18352#true} call ULTIMATE.init(); {18352#true} is VALID [2022-04-28 03:03:10,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {18352#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {18352#true} is VALID [2022-04-28 03:03:10,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 03:03:10,721 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18352#true} {18352#true} #34#return; {18352#true} is VALID [2022-04-28 03:03:10,721 INFO L272 TraceCheckUtils]: 4: Hoare triple {18352#true} call #t~ret4 := main(); {18352#true} is VALID [2022-04-28 03:03:10,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {18352#true} ~x~0 := 0; {18357#(= main_~x~0 0)} is VALID [2022-04-28 03:03:10,722 INFO L290 TraceCheckUtils]: 6: Hoare triple {18357#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18358#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:03:10,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {18358#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18359#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:03:10,723 INFO L290 TraceCheckUtils]: 8: Hoare triple {18359#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18360#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:03:10,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {18360#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18361#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:03:10,724 INFO L290 TraceCheckUtils]: 10: Hoare triple {18361#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18362#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:03:10,724 INFO L290 TraceCheckUtils]: 11: Hoare triple {18362#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18363#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:03:10,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {18363#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18364#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:03:10,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {18364#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18365#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:03:10,726 INFO L290 TraceCheckUtils]: 14: Hoare triple {18365#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18366#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:03:10,726 INFO L290 TraceCheckUtils]: 15: Hoare triple {18366#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18367#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:03:10,727 INFO L290 TraceCheckUtils]: 16: Hoare triple {18367#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18368#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:03:10,727 INFO L290 TraceCheckUtils]: 17: Hoare triple {18368#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18369#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:03:10,727 INFO L290 TraceCheckUtils]: 18: Hoare triple {18369#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18370#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:03:10,728 INFO L290 TraceCheckUtils]: 19: Hoare triple {18370#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18371#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:03:10,728 INFO L290 TraceCheckUtils]: 20: Hoare triple {18371#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18372#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:03:10,729 INFO L290 TraceCheckUtils]: 21: Hoare triple {18372#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18373#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:03:10,729 INFO L290 TraceCheckUtils]: 22: Hoare triple {18373#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18374#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:03:10,730 INFO L290 TraceCheckUtils]: 23: Hoare triple {18374#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18375#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:03:10,730 INFO L290 TraceCheckUtils]: 24: Hoare triple {18375#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18376#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:03:10,731 INFO L290 TraceCheckUtils]: 25: Hoare triple {18376#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18377#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:03:10,731 INFO L290 TraceCheckUtils]: 26: Hoare triple {18377#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18378#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:03:10,732 INFO L290 TraceCheckUtils]: 27: Hoare triple {18378#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18379#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:03:10,732 INFO L290 TraceCheckUtils]: 28: Hoare triple {18379#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18380#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:03:10,733 INFO L290 TraceCheckUtils]: 29: Hoare triple {18380#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18381#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:03:10,733 INFO L290 TraceCheckUtils]: 30: Hoare triple {18381#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18382#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:03:10,734 INFO L290 TraceCheckUtils]: 31: Hoare triple {18382#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18383#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:03:10,734 INFO L290 TraceCheckUtils]: 32: Hoare triple {18383#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18384#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:03:10,734 INFO L290 TraceCheckUtils]: 33: Hoare triple {18384#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18385#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:03:10,735 INFO L290 TraceCheckUtils]: 34: Hoare triple {18385#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18386#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:03:10,735 INFO L290 TraceCheckUtils]: 35: Hoare triple {18386#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18387#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:03:10,736 INFO L290 TraceCheckUtils]: 36: Hoare triple {18387#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18388#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:03:10,736 INFO L290 TraceCheckUtils]: 37: Hoare triple {18388#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18389#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:03:10,737 INFO L290 TraceCheckUtils]: 38: Hoare triple {18389#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18390#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:03:10,737 INFO L290 TraceCheckUtils]: 39: Hoare triple {18390#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18391#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:03:10,738 INFO L290 TraceCheckUtils]: 40: Hoare triple {18391#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18392#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:03:10,738 INFO L290 TraceCheckUtils]: 41: Hoare triple {18392#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18393#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:03:10,739 INFO L290 TraceCheckUtils]: 42: Hoare triple {18393#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18394#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:03:10,739 INFO L290 TraceCheckUtils]: 43: Hoare triple {18394#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18395#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:03:10,740 INFO L290 TraceCheckUtils]: 44: Hoare triple {18395#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18533#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:03:10,740 INFO L290 TraceCheckUtils]: 45: Hoare triple {18533#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !(~x~0 % 4294967296 < 268435455); {18353#false} is VALID [2022-04-28 03:03:10,740 INFO L272 TraceCheckUtils]: 46: Hoare triple {18353#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {18353#false} is VALID [2022-04-28 03:03:10,740 INFO L290 TraceCheckUtils]: 47: Hoare triple {18353#false} ~cond := #in~cond; {18353#false} is VALID [2022-04-28 03:03:10,740 INFO L290 TraceCheckUtils]: 48: Hoare triple {18353#false} assume 0 == ~cond; {18353#false} is VALID [2022-04-28 03:03:10,740 INFO L290 TraceCheckUtils]: 49: Hoare triple {18353#false} assume !false; {18353#false} is VALID [2022-04-28 03:03:10,741 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:03:10,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:03:14,124 INFO L290 TraceCheckUtils]: 49: Hoare triple {18353#false} assume !false; {18353#false} is VALID [2022-04-28 03:03:14,124 INFO L290 TraceCheckUtils]: 48: Hoare triple {18552#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {18353#false} is VALID [2022-04-28 03:03:14,124 INFO L290 TraceCheckUtils]: 47: Hoare triple {18556#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {18552#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:03:14,125 INFO L272 TraceCheckUtils]: 46: Hoare triple {18560#(not (= (mod main_~x~0 2) 0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {18556#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:03:14,125 INFO L290 TraceCheckUtils]: 45: Hoare triple {18564#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !(~x~0 % 4294967296 < 268435455); {18560#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 03:03:14,126 INFO L290 TraceCheckUtils]: 44: Hoare triple {18568#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18564#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:03:14,127 INFO L290 TraceCheckUtils]: 43: Hoare triple {18572#(or (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18568#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:03:14,127 INFO L290 TraceCheckUtils]: 42: Hoare triple {18576#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18572#(or (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:03:14,128 INFO L290 TraceCheckUtils]: 41: Hoare triple {18580#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18576#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} is VALID [2022-04-28 03:03:14,129 INFO L290 TraceCheckUtils]: 40: Hoare triple {18584#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18580#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} is VALID [2022-04-28 03:03:14,130 INFO L290 TraceCheckUtils]: 39: Hoare triple {18588#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18584#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} is VALID [2022-04-28 03:03:14,134 INFO L290 TraceCheckUtils]: 38: Hoare triple {18592#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18588#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} is VALID [2022-04-28 03:03:14,134 INFO L290 TraceCheckUtils]: 37: Hoare triple {18596#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18592#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:03:14,136 INFO L290 TraceCheckUtils]: 36: Hoare triple {18600#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18596#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:03:14,136 INFO L290 TraceCheckUtils]: 35: Hoare triple {18604#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18600#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:03:14,137 INFO L290 TraceCheckUtils]: 34: Hoare triple {18608#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18604#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} is VALID [2022-04-28 03:03:14,138 INFO L290 TraceCheckUtils]: 33: Hoare triple {18612#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18608#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} is VALID [2022-04-28 03:03:14,139 INFO L290 TraceCheckUtils]: 32: Hoare triple {18616#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18612#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} is VALID [2022-04-28 03:03:14,141 INFO L290 TraceCheckUtils]: 31: Hoare triple {18620#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18616#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} is VALID [2022-04-28 03:03:14,153 INFO L290 TraceCheckUtils]: 30: Hoare triple {18624#(or (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18620#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:03:14,154 INFO L290 TraceCheckUtils]: 29: Hoare triple {18628#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18624#(or (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:03:14,155 INFO L290 TraceCheckUtils]: 28: Hoare triple {18632#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18628#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:03:14,156 INFO L290 TraceCheckUtils]: 27: Hoare triple {18636#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18632#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:03:14,157 INFO L290 TraceCheckUtils]: 26: Hoare triple {18640#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18636#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} is VALID [2022-04-28 03:03:14,157 INFO L290 TraceCheckUtils]: 25: Hoare triple {18644#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18640#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:03:14,158 INFO L290 TraceCheckUtils]: 24: Hoare triple {18648#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18644#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:03:14,168 INFO L290 TraceCheckUtils]: 23: Hoare triple {18652#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18648#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:03:14,169 INFO L290 TraceCheckUtils]: 22: Hoare triple {18656#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18652#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:03:14,170 INFO L290 TraceCheckUtils]: 21: Hoare triple {18660#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18656#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} is VALID [2022-04-28 03:03:14,171 INFO L290 TraceCheckUtils]: 20: Hoare triple {18664#(or (< (mod (+ main_~x~0 50) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18660#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} is VALID [2022-04-28 03:03:14,172 INFO L290 TraceCheckUtils]: 19: Hoare triple {18668#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18664#(or (< (mod (+ main_~x~0 50) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:03:14,173 INFO L290 TraceCheckUtils]: 18: Hoare triple {18672#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18668#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} is VALID [2022-04-28 03:03:14,174 INFO L290 TraceCheckUtils]: 17: Hoare triple {18676#(or (< (mod (+ 56 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18672#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} is VALID [2022-04-28 03:03:14,175 INFO L290 TraceCheckUtils]: 16: Hoare triple {18680#(or (< (mod (+ main_~x~0 58) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18676#(or (< (mod (+ 56 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:03:14,175 INFO L290 TraceCheckUtils]: 15: Hoare triple {18684#(or (< (mod (+ main_~x~0 60) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18680#(or (< (mod (+ main_~x~0 58) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:03:14,176 INFO L290 TraceCheckUtils]: 14: Hoare triple {18688#(or (< (mod (+ main_~x~0 62) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18684#(or (< (mod (+ main_~x~0 60) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:03:14,177 INFO L290 TraceCheckUtils]: 13: Hoare triple {18692#(or (< (mod (+ 64 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18688#(or (< (mod (+ main_~x~0 62) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:03:14,177 INFO L290 TraceCheckUtils]: 12: Hoare triple {18696#(or (< (mod (+ 66 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18692#(or (< (mod (+ 64 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:03:14,180 INFO L290 TraceCheckUtils]: 11: Hoare triple {18700#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 68 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18696#(or (< (mod (+ 66 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:03:14,181 INFO L290 TraceCheckUtils]: 10: Hoare triple {18704#(or (< (mod (+ main_~x~0 70) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18700#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 68 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:03:14,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {18708#(or (< (mod (+ 72 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18704#(or (< (mod (+ main_~x~0 70) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:03:14,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {18712#(or (< (mod (+ main_~x~0 74) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18708#(or (< (mod (+ 72 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:03:14,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {18716#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 76 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18712#(or (< (mod (+ main_~x~0 74) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:03:14,187 INFO L290 TraceCheckUtils]: 6: Hoare triple {18720#(or (< (mod (+ main_~x~0 78) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {18716#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 76 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:03:14,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {18352#true} ~x~0 := 0; {18720#(or (< (mod (+ main_~x~0 78) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:03:14,187 INFO L272 TraceCheckUtils]: 4: Hoare triple {18352#true} call #t~ret4 := main(); {18352#true} is VALID [2022-04-28 03:03:14,187 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18352#true} {18352#true} #34#return; {18352#true} is VALID [2022-04-28 03:03:14,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {18352#true} assume true; {18352#true} is VALID [2022-04-28 03:03:14,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {18352#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {18352#true} is VALID [2022-04-28 03:03:14,188 INFO L272 TraceCheckUtils]: 0: Hoare triple {18352#true} call ULTIMATE.init(); {18352#true} is VALID [2022-04-28 03:03:14,188 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:03:14,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762820313] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:03:14,188 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:03:14,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 45] total 87 [2022-04-28 03:03:14,188 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:03:14,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1043041816] [2022-04-28 03:03:14,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1043041816] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:03:14,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:03:14,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-04-28 03:03:14,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802843819] [2022-04-28 03:03:14,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:03:14,189 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:03:14,189 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:03:14,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 43 states have (on average 1.069767441860465) internal successors, (46), 42 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:03:14,216 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:14,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-28 03:03:14,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:03:14,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-28 03:03:14,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=5591, Unknown=0, NotChecked=0, Total=7482 [2022-04-28 03:03:14,217 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:03:17,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:17,160 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2022-04-28 03:03:17,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-28 03:03:17,160 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:03:17,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:03:17,160 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:03:17,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2022-04-28 03:03:17,161 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:03:17,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2022-04-28 03:03:17,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 57 transitions. [2022-04-28 03:03:17,195 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:03:17,196 INFO L225 Difference]: With dead ends: 57 [2022-04-28 03:03:17,196 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 03:03:17,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=3729, Invalid=12273, Unknown=0, NotChecked=0, Total=16002 [2022-04-28 03:03:17,197 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1572 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 1653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:03:17,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 23 Invalid, 1653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1572 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 03:03:17,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 03:03:17,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-28 03:03:17,243 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:03:17,243 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:03:17,244 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:03:17,244 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:03:17,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:17,244 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-28 03:03:17,244 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-04-28 03:03:17,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:03:17,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:03:17,245 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:03:17,245 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:03:17,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:17,245 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-04-28 03:03:17,245 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-04-28 03:03:17,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:03:17,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:03:17,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:03:17,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:03:17,246 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:03:17,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2022-04-28 03:03:17,246 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2022-04-28 03:03:17,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:03:17,246 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2022-04-28 03:03:17,246 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:03:17,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 52 transitions. [2022-04-28 03:03:17,286 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:17,286 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2022-04-28 03:03:17,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 03:03:17,286 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:03:17,287 INFO L195 NwaCegarLoop]: trace histogram [40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:03:17,296 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:03:17,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Forceful destruction successful, exit code 0 [2022-04-28 03:03:17,690 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:03:17,690 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:03:17,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:03:17,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1557621980, now seen corresponding path program 79 times [2022-04-28 03:03:17,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:03:17,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [233460173] [2022-04-28 03:03:18,043 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:03:18,044 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:03:18,046 INFO L85 PathProgramCache]: Analyzing trace with hash 437800631, now seen corresponding path program 1 times [2022-04-28 03:03:18,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:03:18,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258075446] [2022-04-28 03:03:18,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:18,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:03:18,050 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 2) .v_it_40.0) (* (- 1) main_~x~0_5) (* 4294967296 (div (+ (* 2 .v_it_40.0) main_~x~0_5) 4294967296)) 268435455) 0)) [2022-04-28 03:03:18,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:03:18,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1037646428] [2022-04-28 03:03:18,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:18,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:03:18,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:03:18,054 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:03:18,055 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:03:18,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:03:18,137 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:03:18,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:03:18,149 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:03:18,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1557621980, now seen corresponding path program 80 times [2022-04-28 03:03:18,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:03:18,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610510379] [2022-04-28 03:03:18,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:18,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:03:18,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:19,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:03:19,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:19,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {19189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {19143#true} is VALID [2022-04-28 03:03:19,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {19143#true} assume true; {19143#true} is VALID [2022-04-28 03:03:19,088 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19143#true} {19143#true} #34#return; {19143#true} is VALID [2022-04-28 03:03:19,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {19143#true} call ULTIMATE.init(); {19189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:03:19,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {19189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {19143#true} is VALID [2022-04-28 03:03:19,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {19143#true} assume true; {19143#true} is VALID [2022-04-28 03:03:19,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19143#true} {19143#true} #34#return; {19143#true} is VALID [2022-04-28 03:03:19,089 INFO L272 TraceCheckUtils]: 4: Hoare triple {19143#true} call #t~ret4 := main(); {19143#true} is VALID [2022-04-28 03:03:19,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {19143#true} ~x~0 := 0; {19148#(= main_~x~0 0)} is VALID [2022-04-28 03:03:19,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {19148#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19149#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:03:19,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {19149#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19150#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:03:19,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {19150#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19151#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:03:19,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {19151#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19152#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:03:19,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {19152#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19153#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:03:19,092 INFO L290 TraceCheckUtils]: 11: Hoare triple {19153#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19154#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:03:19,093 INFO L290 TraceCheckUtils]: 12: Hoare triple {19154#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19155#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:03:19,093 INFO L290 TraceCheckUtils]: 13: Hoare triple {19155#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19156#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:03:19,093 INFO L290 TraceCheckUtils]: 14: Hoare triple {19156#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19157#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:03:19,094 INFO L290 TraceCheckUtils]: 15: Hoare triple {19157#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19158#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:03:19,094 INFO L290 TraceCheckUtils]: 16: Hoare triple {19158#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19159#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:03:19,095 INFO L290 TraceCheckUtils]: 17: Hoare triple {19159#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19160#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:03:19,095 INFO L290 TraceCheckUtils]: 18: Hoare triple {19160#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19161#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:03:19,096 INFO L290 TraceCheckUtils]: 19: Hoare triple {19161#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19162#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:03:19,096 INFO L290 TraceCheckUtils]: 20: Hoare triple {19162#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19163#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:03:19,097 INFO L290 TraceCheckUtils]: 21: Hoare triple {19163#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19164#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:03:19,097 INFO L290 TraceCheckUtils]: 22: Hoare triple {19164#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19165#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:03:19,098 INFO L290 TraceCheckUtils]: 23: Hoare triple {19165#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19166#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:03:19,098 INFO L290 TraceCheckUtils]: 24: Hoare triple {19166#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19167#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:03:19,099 INFO L290 TraceCheckUtils]: 25: Hoare triple {19167#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19168#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:03:19,099 INFO L290 TraceCheckUtils]: 26: Hoare triple {19168#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19169#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:03:19,099 INFO L290 TraceCheckUtils]: 27: Hoare triple {19169#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19170#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:03:19,100 INFO L290 TraceCheckUtils]: 28: Hoare triple {19170#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19171#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:03:19,100 INFO L290 TraceCheckUtils]: 29: Hoare triple {19171#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19172#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:03:19,101 INFO L290 TraceCheckUtils]: 30: Hoare triple {19172#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19173#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:03:19,101 INFO L290 TraceCheckUtils]: 31: Hoare triple {19173#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19174#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:03:19,102 INFO L290 TraceCheckUtils]: 32: Hoare triple {19174#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19175#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:03:19,102 INFO L290 TraceCheckUtils]: 33: Hoare triple {19175#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19176#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:03:19,103 INFO L290 TraceCheckUtils]: 34: Hoare triple {19176#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19177#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:03:19,103 INFO L290 TraceCheckUtils]: 35: Hoare triple {19177#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19178#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:03:19,104 INFO L290 TraceCheckUtils]: 36: Hoare triple {19178#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19179#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:03:19,104 INFO L290 TraceCheckUtils]: 37: Hoare triple {19179#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19180#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:03:19,105 INFO L290 TraceCheckUtils]: 38: Hoare triple {19180#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19181#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:03:19,105 INFO L290 TraceCheckUtils]: 39: Hoare triple {19181#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19182#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:03:19,105 INFO L290 TraceCheckUtils]: 40: Hoare triple {19182#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19183#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:03:19,106 INFO L290 TraceCheckUtils]: 41: Hoare triple {19183#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19184#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:03:19,106 INFO L290 TraceCheckUtils]: 42: Hoare triple {19184#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19185#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:03:19,107 INFO L290 TraceCheckUtils]: 43: Hoare triple {19185#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19186#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:03:19,107 INFO L290 TraceCheckUtils]: 44: Hoare triple {19186#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19187#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:03:19,108 INFO L290 TraceCheckUtils]: 45: Hoare triple {19187#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19188#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 80))} is VALID [2022-04-28 03:03:19,108 INFO L290 TraceCheckUtils]: 46: Hoare triple {19188#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 80))} assume !(~x~0 % 4294967296 < 268435455); {19144#false} is VALID [2022-04-28 03:03:19,108 INFO L272 TraceCheckUtils]: 47: Hoare triple {19144#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {19144#false} is VALID [2022-04-28 03:03:19,108 INFO L290 TraceCheckUtils]: 48: Hoare triple {19144#false} ~cond := #in~cond; {19144#false} is VALID [2022-04-28 03:03:19,108 INFO L290 TraceCheckUtils]: 49: Hoare triple {19144#false} assume 0 == ~cond; {19144#false} is VALID [2022-04-28 03:03:19,109 INFO L290 TraceCheckUtils]: 50: Hoare triple {19144#false} assume !false; {19144#false} is VALID [2022-04-28 03:03:19,109 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:03:19,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:03:19,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610510379] [2022-04-28 03:03:19,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610510379] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:03:19,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [128482861] [2022-04-28 03:03:19,109 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:03:19,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:03:19,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:03:19,110 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:03:19,111 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:03:19,152 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:03:19,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:03:19,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 83 conjunts are in the unsatisfiable core [2022-04-28 03:03:19,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:19,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:03:19,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {19143#true} call ULTIMATE.init(); {19143#true} is VALID [2022-04-28 03:03:19,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {19143#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {19143#true} is VALID [2022-04-28 03:03:19,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {19143#true} assume true; {19143#true} is VALID [2022-04-28 03:03:19,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19143#true} {19143#true} #34#return; {19143#true} is VALID [2022-04-28 03:03:19,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {19143#true} call #t~ret4 := main(); {19143#true} is VALID [2022-04-28 03:03:19,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {19143#true} ~x~0 := 0; {19148#(= main_~x~0 0)} is VALID [2022-04-28 03:03:19,708 INFO L290 TraceCheckUtils]: 6: Hoare triple {19148#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19149#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:03:19,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {19149#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19150#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:03:19,709 INFO L290 TraceCheckUtils]: 8: Hoare triple {19150#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19151#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:03:19,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {19151#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19152#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:03:19,709 INFO L290 TraceCheckUtils]: 10: Hoare triple {19152#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19153#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:03:19,710 INFO L290 TraceCheckUtils]: 11: Hoare triple {19153#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19154#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:03:19,710 INFO L290 TraceCheckUtils]: 12: Hoare triple {19154#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19155#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:03:19,711 INFO L290 TraceCheckUtils]: 13: Hoare triple {19155#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19156#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:03:19,711 INFO L290 TraceCheckUtils]: 14: Hoare triple {19156#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19157#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:03:19,712 INFO L290 TraceCheckUtils]: 15: Hoare triple {19157#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19158#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:03:19,712 INFO L290 TraceCheckUtils]: 16: Hoare triple {19158#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19159#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:03:19,713 INFO L290 TraceCheckUtils]: 17: Hoare triple {19159#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19160#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:03:19,713 INFO L290 TraceCheckUtils]: 18: Hoare triple {19160#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19161#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:03:19,714 INFO L290 TraceCheckUtils]: 19: Hoare triple {19161#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19162#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:03:19,714 INFO L290 TraceCheckUtils]: 20: Hoare triple {19162#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19163#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:03:19,715 INFO L290 TraceCheckUtils]: 21: Hoare triple {19163#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19164#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:03:19,715 INFO L290 TraceCheckUtils]: 22: Hoare triple {19164#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19165#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:03:19,716 INFO L290 TraceCheckUtils]: 23: Hoare triple {19165#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19166#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:03:19,716 INFO L290 TraceCheckUtils]: 24: Hoare triple {19166#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19167#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:03:19,716 INFO L290 TraceCheckUtils]: 25: Hoare triple {19167#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19168#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:03:19,717 INFO L290 TraceCheckUtils]: 26: Hoare triple {19168#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19169#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:03:19,717 INFO L290 TraceCheckUtils]: 27: Hoare triple {19169#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19170#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:03:19,718 INFO L290 TraceCheckUtils]: 28: Hoare triple {19170#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19171#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:03:19,718 INFO L290 TraceCheckUtils]: 29: Hoare triple {19171#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19172#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:03:19,719 INFO L290 TraceCheckUtils]: 30: Hoare triple {19172#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19173#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:03:19,719 INFO L290 TraceCheckUtils]: 31: Hoare triple {19173#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19174#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:03:19,720 INFO L290 TraceCheckUtils]: 32: Hoare triple {19174#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19175#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:03:19,720 INFO L290 TraceCheckUtils]: 33: Hoare triple {19175#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19176#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:03:19,721 INFO L290 TraceCheckUtils]: 34: Hoare triple {19176#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19177#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:03:19,721 INFO L290 TraceCheckUtils]: 35: Hoare triple {19177#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19178#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:03:19,722 INFO L290 TraceCheckUtils]: 36: Hoare triple {19178#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19179#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:03:19,722 INFO L290 TraceCheckUtils]: 37: Hoare triple {19179#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19180#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:03:19,722 INFO L290 TraceCheckUtils]: 38: Hoare triple {19180#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19181#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:03:19,723 INFO L290 TraceCheckUtils]: 39: Hoare triple {19181#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19182#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:03:19,723 INFO L290 TraceCheckUtils]: 40: Hoare triple {19182#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19183#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:03:19,724 INFO L290 TraceCheckUtils]: 41: Hoare triple {19183#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19184#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:03:19,724 INFO L290 TraceCheckUtils]: 42: Hoare triple {19184#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19185#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:03:19,725 INFO L290 TraceCheckUtils]: 43: Hoare triple {19185#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19186#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:03:19,725 INFO L290 TraceCheckUtils]: 44: Hoare triple {19186#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19187#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:03:19,726 INFO L290 TraceCheckUtils]: 45: Hoare triple {19187#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19328#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:03:19,726 INFO L290 TraceCheckUtils]: 46: Hoare triple {19328#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !(~x~0 % 4294967296 < 268435455); {19144#false} is VALID [2022-04-28 03:03:19,726 INFO L272 TraceCheckUtils]: 47: Hoare triple {19144#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {19144#false} is VALID [2022-04-28 03:03:19,726 INFO L290 TraceCheckUtils]: 48: Hoare triple {19144#false} ~cond := #in~cond; {19144#false} is VALID [2022-04-28 03:03:19,726 INFO L290 TraceCheckUtils]: 49: Hoare triple {19144#false} assume 0 == ~cond; {19144#false} is VALID [2022-04-28 03:03:19,726 INFO L290 TraceCheckUtils]: 50: Hoare triple {19144#false} assume !false; {19144#false} is VALID [2022-04-28 03:03:19,727 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:03:19,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:03:22,179 INFO L290 TraceCheckUtils]: 50: Hoare triple {19144#false} assume !false; {19144#false} is VALID [2022-04-28 03:03:22,179 INFO L290 TraceCheckUtils]: 49: Hoare triple {19144#false} assume 0 == ~cond; {19144#false} is VALID [2022-04-28 03:03:22,179 INFO L290 TraceCheckUtils]: 48: Hoare triple {19144#false} ~cond := #in~cond; {19144#false} is VALID [2022-04-28 03:03:22,179 INFO L272 TraceCheckUtils]: 47: Hoare triple {19144#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {19144#false} is VALID [2022-04-28 03:03:22,180 INFO L290 TraceCheckUtils]: 46: Hoare triple {19356#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {19144#false} is VALID [2022-04-28 03:03:22,180 INFO L290 TraceCheckUtils]: 45: Hoare triple {19360#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19356#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:03:22,181 INFO L290 TraceCheckUtils]: 44: Hoare triple {19364#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19360#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 03:03:22,181 INFO L290 TraceCheckUtils]: 43: Hoare triple {19368#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19364#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 03:03:22,182 INFO L290 TraceCheckUtils]: 42: Hoare triple {19372#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19368#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 03:03:22,183 INFO L290 TraceCheckUtils]: 41: Hoare triple {19376#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19372#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 03:03:22,183 INFO L290 TraceCheckUtils]: 40: Hoare triple {19380#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19376#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-28 03:03:22,184 INFO L290 TraceCheckUtils]: 39: Hoare triple {19384#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19380#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-28 03:03:22,184 INFO L290 TraceCheckUtils]: 38: Hoare triple {19388#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19384#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-28 03:03:22,185 INFO L290 TraceCheckUtils]: 37: Hoare triple {19392#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19388#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-28 03:03:22,185 INFO L290 TraceCheckUtils]: 36: Hoare triple {19396#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19392#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-28 03:03:22,186 INFO L290 TraceCheckUtils]: 35: Hoare triple {19400#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19396#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-28 03:03:22,187 INFO L290 TraceCheckUtils]: 34: Hoare triple {19404#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19400#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-28 03:03:22,187 INFO L290 TraceCheckUtils]: 33: Hoare triple {19408#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19404#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-28 03:03:22,188 INFO L290 TraceCheckUtils]: 32: Hoare triple {19412#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19408#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-28 03:03:22,188 INFO L290 TraceCheckUtils]: 31: Hoare triple {19416#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19412#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-28 03:03:22,189 INFO L290 TraceCheckUtils]: 30: Hoare triple {19420#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19416#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:03:22,190 INFO L290 TraceCheckUtils]: 29: Hoare triple {19424#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19420#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:03:22,190 INFO L290 TraceCheckUtils]: 28: Hoare triple {19428#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19424#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-28 03:03:22,191 INFO L290 TraceCheckUtils]: 27: Hoare triple {19432#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19428#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-28 03:03:22,191 INFO L290 TraceCheckUtils]: 26: Hoare triple {19436#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19432#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-28 03:03:22,192 INFO L290 TraceCheckUtils]: 25: Hoare triple {19440#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19436#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:03:22,193 INFO L290 TraceCheckUtils]: 24: Hoare triple {19444#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19440#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:03:22,193 INFO L290 TraceCheckUtils]: 23: Hoare triple {19448#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19444#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:03:22,194 INFO L290 TraceCheckUtils]: 22: Hoare triple {19452#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19448#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-28 03:03:22,194 INFO L290 TraceCheckUtils]: 21: Hoare triple {19456#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19452#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-28 03:03:22,195 INFO L290 TraceCheckUtils]: 20: Hoare triple {19460#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19456#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-28 03:03:22,195 INFO L290 TraceCheckUtils]: 19: Hoare triple {19464#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19460#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-28 03:03:22,196 INFO L290 TraceCheckUtils]: 18: Hoare triple {19468#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19464#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-28 03:03:22,197 INFO L290 TraceCheckUtils]: 17: Hoare triple {19472#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19468#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:03:22,197 INFO L290 TraceCheckUtils]: 16: Hoare triple {19476#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19472#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-28 03:03:22,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {19480#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19476#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-28 03:03:22,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {19484#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19480#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-28 03:03:22,199 INFO L290 TraceCheckUtils]: 13: Hoare triple {19488#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19484#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:03:22,199 INFO L290 TraceCheckUtils]: 12: Hoare triple {19492#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19488#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:03:22,200 INFO L290 TraceCheckUtils]: 11: Hoare triple {19496#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19492#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:03:22,201 INFO L290 TraceCheckUtils]: 10: Hoare triple {19500#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19496#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} is VALID [2022-04-28 03:03:22,201 INFO L290 TraceCheckUtils]: 9: Hoare triple {19504#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19500#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:03:22,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {19508#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19504#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} is VALID [2022-04-28 03:03:22,202 INFO L290 TraceCheckUtils]: 7: Hoare triple {19512#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19508#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:03:22,203 INFO L290 TraceCheckUtils]: 6: Hoare triple {19516#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19512#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} is VALID [2022-04-28 03:03:22,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {19143#true} ~x~0 := 0; {19516#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} is VALID [2022-04-28 03:03:22,203 INFO L272 TraceCheckUtils]: 4: Hoare triple {19143#true} call #t~ret4 := main(); {19143#true} is VALID [2022-04-28 03:03:22,203 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19143#true} {19143#true} #34#return; {19143#true} is VALID [2022-04-28 03:03:22,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {19143#true} assume true; {19143#true} is VALID [2022-04-28 03:03:22,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {19143#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {19143#true} is VALID [2022-04-28 03:03:22,204 INFO L272 TraceCheckUtils]: 0: Hoare triple {19143#true} call ULTIMATE.init(); {19143#true} is VALID [2022-04-28 03:03:22,204 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:03:22,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [128482861] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:03:22,204 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:03:22,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43, 43] total 86 [2022-04-28 03:03:22,204 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:03:22,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [233460173] [2022-04-28 03:03:22,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [233460173] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:03:22,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:03:22,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-04-28 03:03:22,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297181253] [2022-04-28 03:03:22,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:03:22,205 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:03:22,205 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:03:22,205 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:03:22,231 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:22,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-28 03:03:22,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:03:22,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-28 03:03:22,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1932, Invalid=5378, Unknown=0, NotChecked=0, Total=7310 [2022-04-28 03:03:22,232 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:03:25,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:25,381 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-28 03:03:25,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-28 03:03:25,382 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:03:25,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:03:25,382 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:03:25,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2022-04-28 03:03:25,383 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:03:25,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2022-04-28 03:03:25,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 58 transitions. [2022-04-28 03:03:25,417 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:03:25,417 INFO L225 Difference]: With dead ends: 58 [2022-04-28 03:03:25,418 INFO L226 Difference]: Without dead ends: 53 [2022-04-28 03:03:25,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 906 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3857, Invalid=12145, Unknown=0, NotChecked=0, Total=16002 [2022-04-28 03:03:25,419 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 1722 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 1805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:03:25,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 93 Invalid, 1805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1722 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 03:03:25,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-28 03:03:25,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-04-28 03:03:25,467 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:03:25,467 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:03:25,467 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:03:25,467 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:03:25,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:25,468 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2022-04-28 03:03:25,468 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-04-28 03:03:25,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:03:25,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:03:25,468 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:03:25,468 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:03:25,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:25,469 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2022-04-28 03:03:25,469 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-04-28 03:03:25,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:03:25,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:03:25,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:03:25,469 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:03:25,469 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:03:25,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2022-04-28 03:03:25,470 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2022-04-28 03:03:25,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:03:25,470 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2022-04-28 03:03:25,470 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:03:25,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 53 transitions. [2022-04-28 03:03:25,520 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:03:25,520 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-04-28 03:03:25,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-28 03:03:25,520 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:03:25,520 INFO L195 NwaCegarLoop]: trace histogram [41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:03:25,535 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:03:25,739 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:03:25,921 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:03:25,921 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:03:25,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:03:25,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1078102390, now seen corresponding path program 81 times [2022-04-28 03:03:25,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:03:25,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1480533437] [2022-04-28 03:03:26,086 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:26,088 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:03:26,090 INFO L85 PathProgramCache]: Analyzing trace with hash 496905975, now seen corresponding path program 1 times [2022-04-28 03:03:26,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:03:26,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678157304] [2022-04-28 03:03:26,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:26,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:03:26,110 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_41.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_41.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:03:26,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:03:26,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [52131776] [2022-04-28 03:03:26,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:26,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:03:26,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:03:26,124 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:03:26,125 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:03:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:03:26,163 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:03:26,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:03:26,174 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:03:26,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1078102390, now seen corresponding path program 82 times [2022-04-28 03:03:26,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:03:26,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006824966] [2022-04-28 03:03:26,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:26,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:03:26,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:27,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:03:27,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:27,113 INFO L290 TraceCheckUtils]: 0: Hoare triple {19994#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {19947#true} is VALID [2022-04-28 03:03:27,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {19947#true} assume true; {19947#true} is VALID [2022-04-28 03:03:27,113 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19947#true} {19947#true} #34#return; {19947#true} is VALID [2022-04-28 03:03:27,113 INFO L272 TraceCheckUtils]: 0: Hoare triple {19947#true} call ULTIMATE.init(); {19994#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:03:27,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {19994#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {19947#true} is VALID [2022-04-28 03:03:27,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {19947#true} assume true; {19947#true} is VALID [2022-04-28 03:03:27,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19947#true} {19947#true} #34#return; {19947#true} is VALID [2022-04-28 03:03:27,114 INFO L272 TraceCheckUtils]: 4: Hoare triple {19947#true} call #t~ret4 := main(); {19947#true} is VALID [2022-04-28 03:03:27,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {19947#true} ~x~0 := 0; {19952#(= main_~x~0 0)} is VALID [2022-04-28 03:03:27,116 INFO L290 TraceCheckUtils]: 6: Hoare triple {19952#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19953#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:03:27,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {19953#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19954#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:03:27,117 INFO L290 TraceCheckUtils]: 8: Hoare triple {19954#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19955#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:03:27,117 INFO L290 TraceCheckUtils]: 9: Hoare triple {19955#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19956#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:03:27,117 INFO L290 TraceCheckUtils]: 10: Hoare triple {19956#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19957#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:03:27,118 INFO L290 TraceCheckUtils]: 11: Hoare triple {19957#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19958#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:03:27,118 INFO L290 TraceCheckUtils]: 12: Hoare triple {19958#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19959#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:03:27,119 INFO L290 TraceCheckUtils]: 13: Hoare triple {19959#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19960#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:03:27,119 INFO L290 TraceCheckUtils]: 14: Hoare triple {19960#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19961#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:03:27,120 INFO L290 TraceCheckUtils]: 15: Hoare triple {19961#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19962#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:03:27,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {19962#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19963#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:03:27,121 INFO L290 TraceCheckUtils]: 17: Hoare triple {19963#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19964#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:03:27,121 INFO L290 TraceCheckUtils]: 18: Hoare triple {19964#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19965#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:03:27,122 INFO L290 TraceCheckUtils]: 19: Hoare triple {19965#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19966#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:03:27,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {19966#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19967#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:03:27,123 INFO L290 TraceCheckUtils]: 21: Hoare triple {19967#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19968#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:03:27,123 INFO L290 TraceCheckUtils]: 22: Hoare triple {19968#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19969#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:03:27,124 INFO L290 TraceCheckUtils]: 23: Hoare triple {19969#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19970#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:03:27,124 INFO L290 TraceCheckUtils]: 24: Hoare triple {19970#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19971#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:03:27,125 INFO L290 TraceCheckUtils]: 25: Hoare triple {19971#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19972#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:03:27,125 INFO L290 TraceCheckUtils]: 26: Hoare triple {19972#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19973#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:03:27,125 INFO L290 TraceCheckUtils]: 27: Hoare triple {19973#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19974#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:03:27,126 INFO L290 TraceCheckUtils]: 28: Hoare triple {19974#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19975#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:03:27,126 INFO L290 TraceCheckUtils]: 29: Hoare triple {19975#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19976#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:03:27,127 INFO L290 TraceCheckUtils]: 30: Hoare triple {19976#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19977#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:03:27,127 INFO L290 TraceCheckUtils]: 31: Hoare triple {19977#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19978#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:03:27,128 INFO L290 TraceCheckUtils]: 32: Hoare triple {19978#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19979#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:03:27,128 INFO L290 TraceCheckUtils]: 33: Hoare triple {19979#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19980#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:03:27,129 INFO L290 TraceCheckUtils]: 34: Hoare triple {19980#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19981#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:03:27,129 INFO L290 TraceCheckUtils]: 35: Hoare triple {19981#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19982#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:03:27,130 INFO L290 TraceCheckUtils]: 36: Hoare triple {19982#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19983#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:03:27,130 INFO L290 TraceCheckUtils]: 37: Hoare triple {19983#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19984#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:03:27,131 INFO L290 TraceCheckUtils]: 38: Hoare triple {19984#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19985#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:03:27,131 INFO L290 TraceCheckUtils]: 39: Hoare triple {19985#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19986#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:03:27,132 INFO L290 TraceCheckUtils]: 40: Hoare triple {19986#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19987#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:03:27,132 INFO L290 TraceCheckUtils]: 41: Hoare triple {19987#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19988#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:03:27,132 INFO L290 TraceCheckUtils]: 42: Hoare triple {19988#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19989#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:03:27,133 INFO L290 TraceCheckUtils]: 43: Hoare triple {19989#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19990#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:03:27,133 INFO L290 TraceCheckUtils]: 44: Hoare triple {19990#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19991#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:03:27,134 INFO L290 TraceCheckUtils]: 45: Hoare triple {19991#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19992#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:03:27,134 INFO L290 TraceCheckUtils]: 46: Hoare triple {19992#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19993#(and (<= main_~x~0 82) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:03:27,135 INFO L290 TraceCheckUtils]: 47: Hoare triple {19993#(and (<= main_~x~0 82) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {19948#false} is VALID [2022-04-28 03:03:27,135 INFO L272 TraceCheckUtils]: 48: Hoare triple {19948#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {19948#false} is VALID [2022-04-28 03:03:27,135 INFO L290 TraceCheckUtils]: 49: Hoare triple {19948#false} ~cond := #in~cond; {19948#false} is VALID [2022-04-28 03:03:27,135 INFO L290 TraceCheckUtils]: 50: Hoare triple {19948#false} assume 0 == ~cond; {19948#false} is VALID [2022-04-28 03:03:27,135 INFO L290 TraceCheckUtils]: 51: Hoare triple {19948#false} assume !false; {19948#false} is VALID [2022-04-28 03:03:27,135 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:03:27,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:03:27,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006824966] [2022-04-28 03:03:27,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006824966] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:03:27,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743593081] [2022-04-28 03:03:27,136 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:03:27,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:03:27,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:03:27,137 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:03:27,138 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:03:27,211 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:03:27,211 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:03:27,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 85 conjunts are in the unsatisfiable core [2022-04-28 03:03:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:27,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:03:27,694 INFO L272 TraceCheckUtils]: 0: Hoare triple {19947#true} call ULTIMATE.init(); {19947#true} is VALID [2022-04-28 03:03:27,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {19947#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {19947#true} is VALID [2022-04-28 03:03:27,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {19947#true} assume true; {19947#true} is VALID [2022-04-28 03:03:27,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19947#true} {19947#true} #34#return; {19947#true} is VALID [2022-04-28 03:03:27,694 INFO L272 TraceCheckUtils]: 4: Hoare triple {19947#true} call #t~ret4 := main(); {19947#true} is VALID [2022-04-28 03:03:27,695 INFO L290 TraceCheckUtils]: 5: Hoare triple {19947#true} ~x~0 := 0; {19952#(= main_~x~0 0)} is VALID [2022-04-28 03:03:27,695 INFO L290 TraceCheckUtils]: 6: Hoare triple {19952#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19953#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:03:27,696 INFO L290 TraceCheckUtils]: 7: Hoare triple {19953#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19954#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:03:27,696 INFO L290 TraceCheckUtils]: 8: Hoare triple {19954#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19955#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:03:27,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {19955#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19956#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:03:27,697 INFO L290 TraceCheckUtils]: 10: Hoare triple {19956#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19957#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:03:27,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {19957#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19958#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:03:27,698 INFO L290 TraceCheckUtils]: 12: Hoare triple {19958#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19959#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:03:27,698 INFO L290 TraceCheckUtils]: 13: Hoare triple {19959#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19960#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:03:27,699 INFO L290 TraceCheckUtils]: 14: Hoare triple {19960#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19961#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:03:27,699 INFO L290 TraceCheckUtils]: 15: Hoare triple {19961#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19962#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:03:27,700 INFO L290 TraceCheckUtils]: 16: Hoare triple {19962#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19963#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:03:27,700 INFO L290 TraceCheckUtils]: 17: Hoare triple {19963#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19964#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:03:27,701 INFO L290 TraceCheckUtils]: 18: Hoare triple {19964#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19965#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:03:27,701 INFO L290 TraceCheckUtils]: 19: Hoare triple {19965#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19966#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:03:27,702 INFO L290 TraceCheckUtils]: 20: Hoare triple {19966#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19967#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:03:27,702 INFO L290 TraceCheckUtils]: 21: Hoare triple {19967#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19968#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:03:27,703 INFO L290 TraceCheckUtils]: 22: Hoare triple {19968#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19969#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:03:27,703 INFO L290 TraceCheckUtils]: 23: Hoare triple {19969#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19970#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:03:27,703 INFO L290 TraceCheckUtils]: 24: Hoare triple {19970#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19971#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:03:27,704 INFO L290 TraceCheckUtils]: 25: Hoare triple {19971#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19972#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:03:27,704 INFO L290 TraceCheckUtils]: 26: Hoare triple {19972#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19973#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:03:27,705 INFO L290 TraceCheckUtils]: 27: Hoare triple {19973#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19974#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:03:27,705 INFO L290 TraceCheckUtils]: 28: Hoare triple {19974#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19975#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:03:27,706 INFO L290 TraceCheckUtils]: 29: Hoare triple {19975#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19976#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:03:27,706 INFO L290 TraceCheckUtils]: 30: Hoare triple {19976#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19977#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:03:27,707 INFO L290 TraceCheckUtils]: 31: Hoare triple {19977#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19978#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:03:27,707 INFO L290 TraceCheckUtils]: 32: Hoare triple {19978#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19979#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:03:27,708 INFO L290 TraceCheckUtils]: 33: Hoare triple {19979#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19980#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:03:27,708 INFO L290 TraceCheckUtils]: 34: Hoare triple {19980#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19981#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:03:27,709 INFO L290 TraceCheckUtils]: 35: Hoare triple {19981#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19982#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:03:27,709 INFO L290 TraceCheckUtils]: 36: Hoare triple {19982#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19983#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:03:27,709 INFO L290 TraceCheckUtils]: 37: Hoare triple {19983#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19984#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:03:27,710 INFO L290 TraceCheckUtils]: 38: Hoare triple {19984#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19985#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:03:27,710 INFO L290 TraceCheckUtils]: 39: Hoare triple {19985#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19986#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:03:27,711 INFO L290 TraceCheckUtils]: 40: Hoare triple {19986#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19987#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:03:27,711 INFO L290 TraceCheckUtils]: 41: Hoare triple {19987#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19988#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:03:27,712 INFO L290 TraceCheckUtils]: 42: Hoare triple {19988#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19989#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:03:27,712 INFO L290 TraceCheckUtils]: 43: Hoare triple {19989#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19990#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:03:27,713 INFO L290 TraceCheckUtils]: 44: Hoare triple {19990#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19991#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:03:27,713 INFO L290 TraceCheckUtils]: 45: Hoare triple {19991#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {19992#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:03:27,714 INFO L290 TraceCheckUtils]: 46: Hoare triple {19992#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20136#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:03:27,714 INFO L290 TraceCheckUtils]: 47: Hoare triple {20136#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !(~x~0 % 4294967296 < 268435455); {19948#false} is VALID [2022-04-28 03:03:27,714 INFO L272 TraceCheckUtils]: 48: Hoare triple {19948#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {19948#false} is VALID [2022-04-28 03:03:27,714 INFO L290 TraceCheckUtils]: 49: Hoare triple {19948#false} ~cond := #in~cond; {19948#false} is VALID [2022-04-28 03:03:27,714 INFO L290 TraceCheckUtils]: 50: Hoare triple {19948#false} assume 0 == ~cond; {19948#false} is VALID [2022-04-28 03:03:27,714 INFO L290 TraceCheckUtils]: 51: Hoare triple {19948#false} assume !false; {19948#false} is VALID [2022-04-28 03:03:27,715 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:03:27,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:03:30,273 INFO L290 TraceCheckUtils]: 51: Hoare triple {19948#false} assume !false; {19948#false} is VALID [2022-04-28 03:03:30,273 INFO L290 TraceCheckUtils]: 50: Hoare triple {19948#false} assume 0 == ~cond; {19948#false} is VALID [2022-04-28 03:03:30,273 INFO L290 TraceCheckUtils]: 49: Hoare triple {19948#false} ~cond := #in~cond; {19948#false} is VALID [2022-04-28 03:03:30,273 INFO L272 TraceCheckUtils]: 48: Hoare triple {19948#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {19948#false} is VALID [2022-04-28 03:03:30,273 INFO L290 TraceCheckUtils]: 47: Hoare triple {20164#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {19948#false} is VALID [2022-04-28 03:03:30,274 INFO L290 TraceCheckUtils]: 46: Hoare triple {20168#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20164#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:03:30,275 INFO L290 TraceCheckUtils]: 45: Hoare triple {20172#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20168#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 03:03:30,285 INFO L290 TraceCheckUtils]: 44: Hoare triple {20176#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20172#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 03:03:30,286 INFO L290 TraceCheckUtils]: 43: Hoare triple {20180#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20176#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 03:03:30,286 INFO L290 TraceCheckUtils]: 42: Hoare triple {20184#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20180#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 03:03:30,287 INFO L290 TraceCheckUtils]: 41: Hoare triple {20188#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20184#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-28 03:03:30,291 INFO L290 TraceCheckUtils]: 40: Hoare triple {20192#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20188#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-28 03:03:30,292 INFO L290 TraceCheckUtils]: 39: Hoare triple {20196#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20192#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-28 03:03:30,293 INFO L290 TraceCheckUtils]: 38: Hoare triple {20200#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20196#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-28 03:03:30,294 INFO L290 TraceCheckUtils]: 37: Hoare triple {20204#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20200#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-28 03:03:30,294 INFO L290 TraceCheckUtils]: 36: Hoare triple {20208#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20204#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-28 03:03:30,295 INFO L290 TraceCheckUtils]: 35: Hoare triple {20212#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20208#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-28 03:03:30,295 INFO L290 TraceCheckUtils]: 34: Hoare triple {20216#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20212#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-28 03:03:30,296 INFO L290 TraceCheckUtils]: 33: Hoare triple {20220#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20216#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-28 03:03:30,297 INFO L290 TraceCheckUtils]: 32: Hoare triple {20224#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20220#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-28 03:03:30,297 INFO L290 TraceCheckUtils]: 31: Hoare triple {20228#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20224#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:03:30,298 INFO L290 TraceCheckUtils]: 30: Hoare triple {20232#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20228#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:03:30,298 INFO L290 TraceCheckUtils]: 29: Hoare triple {20236#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20232#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-28 03:03:30,299 INFO L290 TraceCheckUtils]: 28: Hoare triple {20240#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20236#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-28 03:03:30,299 INFO L290 TraceCheckUtils]: 27: Hoare triple {20244#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20240#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-28 03:03:30,300 INFO L290 TraceCheckUtils]: 26: Hoare triple {20248#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20244#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:03:30,301 INFO L290 TraceCheckUtils]: 25: Hoare triple {20252#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20248#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:03:30,301 INFO L290 TraceCheckUtils]: 24: Hoare triple {20256#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20252#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:03:30,302 INFO L290 TraceCheckUtils]: 23: Hoare triple {20260#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20256#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-28 03:03:30,302 INFO L290 TraceCheckUtils]: 22: Hoare triple {20264#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20260#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-28 03:03:30,303 INFO L290 TraceCheckUtils]: 21: Hoare triple {20268#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20264#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-28 03:03:30,304 INFO L290 TraceCheckUtils]: 20: Hoare triple {20272#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20268#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-28 03:03:30,304 INFO L290 TraceCheckUtils]: 19: Hoare triple {20276#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20272#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-28 03:03:30,305 INFO L290 TraceCheckUtils]: 18: Hoare triple {20280#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20276#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:03:30,305 INFO L290 TraceCheckUtils]: 17: Hoare triple {20284#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20280#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-28 03:03:30,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {20288#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20284#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-28 03:03:30,308 INFO L290 TraceCheckUtils]: 15: Hoare triple {20292#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20288#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-28 03:03:30,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {20296#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20292#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:03:30,309 INFO L290 TraceCheckUtils]: 13: Hoare triple {20300#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20296#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:03:30,310 INFO L290 TraceCheckUtils]: 12: Hoare triple {20304#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20300#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:03:30,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {20308#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20304#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} is VALID [2022-04-28 03:03:30,312 INFO L290 TraceCheckUtils]: 10: Hoare triple {20312#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20308#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:03:30,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {20316#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20312#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} is VALID [2022-04-28 03:03:30,314 INFO L290 TraceCheckUtils]: 8: Hoare triple {20320#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20316#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:03:30,314 INFO L290 TraceCheckUtils]: 7: Hoare triple {20324#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20320#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} is VALID [2022-04-28 03:03:30,315 INFO L290 TraceCheckUtils]: 6: Hoare triple {20328#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20324#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} is VALID [2022-04-28 03:03:30,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {19947#true} ~x~0 := 0; {20328#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} is VALID [2022-04-28 03:03:30,315 INFO L272 TraceCheckUtils]: 4: Hoare triple {19947#true} call #t~ret4 := main(); {19947#true} is VALID [2022-04-28 03:03:30,315 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19947#true} {19947#true} #34#return; {19947#true} is VALID [2022-04-28 03:03:30,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {19947#true} assume true; {19947#true} is VALID [2022-04-28 03:03:30,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {19947#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {19947#true} is VALID [2022-04-28 03:03:30,316 INFO L272 TraceCheckUtils]: 0: Hoare triple {19947#true} call ULTIMATE.init(); {19947#true} is VALID [2022-04-28 03:03:30,316 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:03:30,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743593081] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:03:30,316 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:03:30,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 44, 44] total 88 [2022-04-28 03:03:30,316 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:03:30,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1480533437] [2022-04-28 03:03:30,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1480533437] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:03:30,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:03:30,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-04-28 03:03:30,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995928315] [2022-04-28 03:03:30,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:03:30,317 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:03:30,317 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:03:30,317 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:03:30,344 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:30,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-04-28 03:03:30,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:03:30,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-04-28 03:03:30,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2021, Invalid=5635, Unknown=0, NotChecked=0, Total=7656 [2022-04-28 03:03:30,345 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:03:33,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:33,726 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2022-04-28 03:03:33,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-04-28 03:03:33,726 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:03:33,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:03:33,726 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:03:33,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2022-04-28 03:03:33,727 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:03:33,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2022-04-28 03:03:33,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 59 transitions. [2022-04-28 03:03:33,814 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:03:33,815 INFO L225 Difference]: With dead ends: 59 [2022-04-28 03:03:33,815 INFO L226 Difference]: Without dead ends: 54 [2022-04-28 03:03:33,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 949 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4035, Invalid=12735, Unknown=0, NotChecked=0, Total=16770 [2022-04-28 03:03:33,819 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 1849 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 1934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:03:33,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 138 Invalid, 1934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1849 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-28 03:03:33,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-28 03:03:33,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-28 03:03:33,871 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:03:33,871 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:03:33,871 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:03:33,873 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:03:33,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:33,875 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-28 03:03:33,875 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-04-28 03:03:33,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:03:33,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:03:33,875 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:03:33,875 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:03:33,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:33,876 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2022-04-28 03:03:33,876 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-04-28 03:03:33,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:03:33,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:03:33,877 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:03:33,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:03:33,877 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:03:33,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2022-04-28 03:03:33,878 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2022-04-28 03:03:33,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:03:33,878 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2022-04-28 03:03:33,879 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:03:33,879 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 54 transitions. [2022-04-28 03:03:33,925 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:03:33,926 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2022-04-28 03:03:33,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-28 03:03:33,926 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:03:33,926 INFO L195 NwaCegarLoop]: trace histogram [42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:03:33,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Forceful destruction successful, exit code 0 [2022-04-28 03:03:34,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Forceful destruction successful, exit code 0 [2022-04-28 03:03:34,327 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:03:34,327 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:03:34,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:03:34,328 INFO L85 PathProgramCache]: Analyzing trace with hash -902103012, now seen corresponding path program 83 times [2022-04-28 03:03:34,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:03:34,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2094655390] [2022-04-28 03:03:34,461 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:34,462 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:03:34,464 INFO L85 PathProgramCache]: Analyzing trace with hash 556011319, now seen corresponding path program 1 times [2022-04-28 03:03:34,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:03:34,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179760056] [2022-04-28 03:03:34,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:34,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:03:34,468 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_42.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_42.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:03:34,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:03:34,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1901741485] [2022-04-28 03:03:34,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:34,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:03:34,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:03:34,472 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:03:34,472 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:03:34,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:03:34,516 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:03:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:03:34,524 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:03:34,525 INFO L85 PathProgramCache]: Analyzing trace with hash -902103012, now seen corresponding path program 84 times [2022-04-28 03:03:34,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:03:34,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068304750] [2022-04-28 03:03:34,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:34,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:03:34,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:35,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:03:35,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:35,439 INFO L290 TraceCheckUtils]: 0: Hoare triple {20815#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {20767#true} is VALID [2022-04-28 03:03:35,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {20767#true} assume true; {20767#true} is VALID [2022-04-28 03:03:35,439 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20767#true} {20767#true} #34#return; {20767#true} is VALID [2022-04-28 03:03:35,440 INFO L272 TraceCheckUtils]: 0: Hoare triple {20767#true} call ULTIMATE.init(); {20815#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:03:35,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {20815#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {20767#true} is VALID [2022-04-28 03:03:35,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {20767#true} assume true; {20767#true} is VALID [2022-04-28 03:03:35,440 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20767#true} {20767#true} #34#return; {20767#true} is VALID [2022-04-28 03:03:35,440 INFO L272 TraceCheckUtils]: 4: Hoare triple {20767#true} call #t~ret4 := main(); {20767#true} is VALID [2022-04-28 03:03:35,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {20767#true} ~x~0 := 0; {20772#(= main_~x~0 0)} is VALID [2022-04-28 03:03:35,441 INFO L290 TraceCheckUtils]: 6: Hoare triple {20772#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20773#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:03:35,441 INFO L290 TraceCheckUtils]: 7: Hoare triple {20773#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20774#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:03:35,442 INFO L290 TraceCheckUtils]: 8: Hoare triple {20774#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20775#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:03:35,442 INFO L290 TraceCheckUtils]: 9: Hoare triple {20775#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20776#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:03:35,443 INFO L290 TraceCheckUtils]: 10: Hoare triple {20776#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20777#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:03:35,443 INFO L290 TraceCheckUtils]: 11: Hoare triple {20777#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20778#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:03:35,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {20778#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20779#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:03:35,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {20779#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20780#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:03:35,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {20780#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20781#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:03:35,445 INFO L290 TraceCheckUtils]: 15: Hoare triple {20781#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20782#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:03:35,445 INFO L290 TraceCheckUtils]: 16: Hoare triple {20782#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20783#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:03:35,446 INFO L290 TraceCheckUtils]: 17: Hoare triple {20783#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20784#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:03:35,446 INFO L290 TraceCheckUtils]: 18: Hoare triple {20784#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20785#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:03:35,447 INFO L290 TraceCheckUtils]: 19: Hoare triple {20785#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20786#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:03:35,447 INFO L290 TraceCheckUtils]: 20: Hoare triple {20786#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20787#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:03:35,448 INFO L290 TraceCheckUtils]: 21: Hoare triple {20787#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20788#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:03:35,448 INFO L290 TraceCheckUtils]: 22: Hoare triple {20788#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20789#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:03:35,449 INFO L290 TraceCheckUtils]: 23: Hoare triple {20789#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20790#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:03:35,449 INFO L290 TraceCheckUtils]: 24: Hoare triple {20790#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20791#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:03:35,450 INFO L290 TraceCheckUtils]: 25: Hoare triple {20791#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20792#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:03:35,450 INFO L290 TraceCheckUtils]: 26: Hoare triple {20792#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20793#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:03:35,450 INFO L290 TraceCheckUtils]: 27: Hoare triple {20793#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20794#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:03:35,451 INFO L290 TraceCheckUtils]: 28: Hoare triple {20794#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20795#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:03:35,451 INFO L290 TraceCheckUtils]: 29: Hoare triple {20795#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20796#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:03:35,452 INFO L290 TraceCheckUtils]: 30: Hoare triple {20796#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20797#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:03:35,452 INFO L290 TraceCheckUtils]: 31: Hoare triple {20797#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20798#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:03:35,453 INFO L290 TraceCheckUtils]: 32: Hoare triple {20798#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20799#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:03:35,453 INFO L290 TraceCheckUtils]: 33: Hoare triple {20799#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20800#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:03:35,454 INFO L290 TraceCheckUtils]: 34: Hoare triple {20800#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20801#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:03:35,454 INFO L290 TraceCheckUtils]: 35: Hoare triple {20801#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20802#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:03:35,455 INFO L290 TraceCheckUtils]: 36: Hoare triple {20802#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20803#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:03:35,455 INFO L290 TraceCheckUtils]: 37: Hoare triple {20803#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20804#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:03:35,456 INFO L290 TraceCheckUtils]: 38: Hoare triple {20804#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20805#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:03:35,456 INFO L290 TraceCheckUtils]: 39: Hoare triple {20805#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20806#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:03:35,457 INFO L290 TraceCheckUtils]: 40: Hoare triple {20806#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20807#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:03:35,457 INFO L290 TraceCheckUtils]: 41: Hoare triple {20807#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20808#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:03:35,457 INFO L290 TraceCheckUtils]: 42: Hoare triple {20808#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20809#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:03:35,458 INFO L290 TraceCheckUtils]: 43: Hoare triple {20809#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20810#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:03:35,458 INFO L290 TraceCheckUtils]: 44: Hoare triple {20810#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20811#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:03:35,459 INFO L290 TraceCheckUtils]: 45: Hoare triple {20811#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20812#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:03:35,459 INFO L290 TraceCheckUtils]: 46: Hoare triple {20812#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20813#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:03:35,460 INFO L290 TraceCheckUtils]: 47: Hoare triple {20813#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20814#(and (<= main_~x~0 84) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:03:35,460 INFO L290 TraceCheckUtils]: 48: Hoare triple {20814#(and (<= main_~x~0 84) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {20768#false} is VALID [2022-04-28 03:03:35,460 INFO L272 TraceCheckUtils]: 49: Hoare triple {20768#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {20768#false} is VALID [2022-04-28 03:03:35,460 INFO L290 TraceCheckUtils]: 50: Hoare triple {20768#false} ~cond := #in~cond; {20768#false} is VALID [2022-04-28 03:03:35,460 INFO L290 TraceCheckUtils]: 51: Hoare triple {20768#false} assume 0 == ~cond; {20768#false} is VALID [2022-04-28 03:03:35,461 INFO L290 TraceCheckUtils]: 52: Hoare triple {20768#false} assume !false; {20768#false} is VALID [2022-04-28 03:03:35,461 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:03:35,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:03:35,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068304750] [2022-04-28 03:03:35,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068304750] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:03:35,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268282728] [2022-04-28 03:03:35,461 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:03:35,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:03:35,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:03:35,462 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:03:35,465 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:03:38,422 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2022-04-28 03:03:38,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:03:38,428 WARN L261 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 90 conjunts are in the unsatisfiable core [2022-04-28 03:03:38,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:38,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:03:38,842 INFO L272 TraceCheckUtils]: 0: Hoare triple {20767#true} call ULTIMATE.init(); {20767#true} is VALID [2022-04-28 03:03:38,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {20767#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {20767#true} is VALID [2022-04-28 03:03:38,842 INFO L290 TraceCheckUtils]: 2: Hoare triple {20767#true} assume true; {20767#true} is VALID [2022-04-28 03:03:38,843 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20767#true} {20767#true} #34#return; {20767#true} is VALID [2022-04-28 03:03:38,843 INFO L272 TraceCheckUtils]: 4: Hoare triple {20767#true} call #t~ret4 := main(); {20767#true} is VALID [2022-04-28 03:03:38,843 INFO L290 TraceCheckUtils]: 5: Hoare triple {20767#true} ~x~0 := 0; {20772#(= main_~x~0 0)} is VALID [2022-04-28 03:03:38,843 INFO L290 TraceCheckUtils]: 6: Hoare triple {20772#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20773#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:03:38,844 INFO L290 TraceCheckUtils]: 7: Hoare triple {20773#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20774#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:03:38,844 INFO L290 TraceCheckUtils]: 8: Hoare triple {20774#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20775#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:03:38,845 INFO L290 TraceCheckUtils]: 9: Hoare triple {20775#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20776#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:03:38,845 INFO L290 TraceCheckUtils]: 10: Hoare triple {20776#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20777#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:03:38,846 INFO L290 TraceCheckUtils]: 11: Hoare triple {20777#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20778#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:03:38,846 INFO L290 TraceCheckUtils]: 12: Hoare triple {20778#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20779#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:03:38,847 INFO L290 TraceCheckUtils]: 13: Hoare triple {20779#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20780#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:03:38,847 INFO L290 TraceCheckUtils]: 14: Hoare triple {20780#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20781#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:03:38,848 INFO L290 TraceCheckUtils]: 15: Hoare triple {20781#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20782#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:03:38,848 INFO L290 TraceCheckUtils]: 16: Hoare triple {20782#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20783#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:03:38,849 INFO L290 TraceCheckUtils]: 17: Hoare triple {20783#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20784#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:03:38,849 INFO L290 TraceCheckUtils]: 18: Hoare triple {20784#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20785#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:03:38,850 INFO L290 TraceCheckUtils]: 19: Hoare triple {20785#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20786#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:03:38,850 INFO L290 TraceCheckUtils]: 20: Hoare triple {20786#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20787#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:03:38,850 INFO L290 TraceCheckUtils]: 21: Hoare triple {20787#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20788#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:03:38,851 INFO L290 TraceCheckUtils]: 22: Hoare triple {20788#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20789#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:03:38,851 INFO L290 TraceCheckUtils]: 23: Hoare triple {20789#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20790#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:03:38,852 INFO L290 TraceCheckUtils]: 24: Hoare triple {20790#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20791#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:03:38,852 INFO L290 TraceCheckUtils]: 25: Hoare triple {20791#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20792#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:03:38,853 INFO L290 TraceCheckUtils]: 26: Hoare triple {20792#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20793#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:03:38,853 INFO L290 TraceCheckUtils]: 27: Hoare triple {20793#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20794#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:03:38,854 INFO L290 TraceCheckUtils]: 28: Hoare triple {20794#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20795#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:03:38,854 INFO L290 TraceCheckUtils]: 29: Hoare triple {20795#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20796#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:03:38,855 INFO L290 TraceCheckUtils]: 30: Hoare triple {20796#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20797#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:03:38,855 INFO L290 TraceCheckUtils]: 31: Hoare triple {20797#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20798#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:03:38,856 INFO L290 TraceCheckUtils]: 32: Hoare triple {20798#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20799#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:03:38,856 INFO L290 TraceCheckUtils]: 33: Hoare triple {20799#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20800#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:03:38,857 INFO L290 TraceCheckUtils]: 34: Hoare triple {20800#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20801#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:03:38,857 INFO L290 TraceCheckUtils]: 35: Hoare triple {20801#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20802#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:03:38,858 INFO L290 TraceCheckUtils]: 36: Hoare triple {20802#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20803#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:03:38,858 INFO L290 TraceCheckUtils]: 37: Hoare triple {20803#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20804#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:03:38,859 INFO L290 TraceCheckUtils]: 38: Hoare triple {20804#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20805#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:03:38,859 INFO L290 TraceCheckUtils]: 39: Hoare triple {20805#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20806#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:03:38,860 INFO L290 TraceCheckUtils]: 40: Hoare triple {20806#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20807#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:03:38,860 INFO L290 TraceCheckUtils]: 41: Hoare triple {20807#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20808#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:03:38,861 INFO L290 TraceCheckUtils]: 42: Hoare triple {20808#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20809#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:03:38,861 INFO L290 TraceCheckUtils]: 43: Hoare triple {20809#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20810#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:03:38,861 INFO L290 TraceCheckUtils]: 44: Hoare triple {20810#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20811#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:03:38,862 INFO L290 TraceCheckUtils]: 45: Hoare triple {20811#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20812#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:03:38,862 INFO L290 TraceCheckUtils]: 46: Hoare triple {20812#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20813#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:03:38,863 INFO L290 TraceCheckUtils]: 47: Hoare triple {20813#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20960#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:03:38,863 INFO L290 TraceCheckUtils]: 48: Hoare triple {20960#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !(~x~0 % 4294967296 < 268435455); {20768#false} is VALID [2022-04-28 03:03:38,863 INFO L272 TraceCheckUtils]: 49: Hoare triple {20768#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {20768#false} is VALID [2022-04-28 03:03:38,864 INFO L290 TraceCheckUtils]: 50: Hoare triple {20768#false} ~cond := #in~cond; {20768#false} is VALID [2022-04-28 03:03:38,864 INFO L290 TraceCheckUtils]: 51: Hoare triple {20768#false} assume 0 == ~cond; {20768#false} is VALID [2022-04-28 03:03:38,864 INFO L290 TraceCheckUtils]: 52: Hoare triple {20768#false} assume !false; {20768#false} is VALID [2022-04-28 03:03:38,864 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:03:38,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:03:42,680 INFO L290 TraceCheckUtils]: 52: Hoare triple {20768#false} assume !false; {20768#false} is VALID [2022-04-28 03:03:42,680 INFO L290 TraceCheckUtils]: 51: Hoare triple {20979#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {20768#false} is VALID [2022-04-28 03:03:42,681 INFO L290 TraceCheckUtils]: 50: Hoare triple {20983#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20979#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:03:42,681 INFO L272 TraceCheckUtils]: 49: Hoare triple {20987#(< 0 (mod main_~x~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {20983#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:03:42,682 INFO L290 TraceCheckUtils]: 48: Hoare triple {20991#(or (< 0 (mod main_~x~0 2)) (< (mod main_~x~0 4294967296) 268435455))} assume !(~x~0 % 4294967296 < 268435455); {20987#(< 0 (mod main_~x~0 2))} is VALID [2022-04-28 03:03:42,682 INFO L290 TraceCheckUtils]: 47: Hoare triple {20995#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20991#(or (< 0 (mod main_~x~0 2)) (< (mod main_~x~0 4294967296) 268435455))} is VALID [2022-04-28 03:03:42,683 INFO L290 TraceCheckUtils]: 46: Hoare triple {20999#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20995#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} is VALID [2022-04-28 03:03:42,684 INFO L290 TraceCheckUtils]: 45: Hoare triple {21003#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {20999#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} is VALID [2022-04-28 03:03:42,685 INFO L290 TraceCheckUtils]: 44: Hoare triple {21007#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21003#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} is VALID [2022-04-28 03:03:42,686 INFO L290 TraceCheckUtils]: 43: Hoare triple {21011#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21007#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} is VALID [2022-04-28 03:03:42,687 INFO L290 TraceCheckUtils]: 42: Hoare triple {21015#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21011#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} is VALID [2022-04-28 03:03:42,687 INFO L290 TraceCheckUtils]: 41: Hoare triple {21019#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21015#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} is VALID [2022-04-28 03:03:42,688 INFO L290 TraceCheckUtils]: 40: Hoare triple {21023#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 16) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21019#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 268435455))} is VALID [2022-04-28 03:03:42,689 INFO L290 TraceCheckUtils]: 39: Hoare triple {21027#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21023#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 16) 4294967296) 268435455))} is VALID [2022-04-28 03:03:42,690 INFO L290 TraceCheckUtils]: 38: Hoare triple {21031#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21027#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 268435455))} is VALID [2022-04-28 03:03:42,692 INFO L290 TraceCheckUtils]: 37: Hoare triple {21035#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21031#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} is VALID [2022-04-28 03:03:42,692 INFO L290 TraceCheckUtils]: 36: Hoare triple {21039#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21035#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} is VALID [2022-04-28 03:03:42,701 INFO L290 TraceCheckUtils]: 35: Hoare triple {21043#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21039#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} is VALID [2022-04-28 03:03:42,702 INFO L290 TraceCheckUtils]: 34: Hoare triple {21047#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 28) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21043#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} is VALID [2022-04-28 03:03:42,703 INFO L290 TraceCheckUtils]: 33: Hoare triple {21051#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 30 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21047#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 28) 4294967296) 268435455))} is VALID [2022-04-28 03:03:42,704 INFO L290 TraceCheckUtils]: 32: Hoare triple {21055#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21051#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 30 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:03:42,708 INFO L290 TraceCheckUtils]: 31: Hoare triple {21059#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 34) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21055#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:03:42,709 INFO L290 TraceCheckUtils]: 30: Hoare triple {21063#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21059#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 34) 4294967296) 268435455))} is VALID [2022-04-28 03:03:42,711 INFO L290 TraceCheckUtils]: 29: Hoare triple {21067#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 38) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21063#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} is VALID [2022-04-28 03:03:42,712 INFO L290 TraceCheckUtils]: 28: Hoare triple {21071#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (< 0 (mod main_~x~0 2)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21067#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 38) 4294967296) 268435455))} is VALID [2022-04-28 03:03:42,712 INFO L290 TraceCheckUtils]: 27: Hoare triple {21075#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 42 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21071#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (< 0 (mod main_~x~0 2)))} is VALID [2022-04-28 03:03:42,713 INFO L290 TraceCheckUtils]: 26: Hoare triple {21079#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21075#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 42 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:03:42,714 INFO L290 TraceCheckUtils]: 25: Hoare triple {21083#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21079#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:03:42,715 INFO L290 TraceCheckUtils]: 24: Hoare triple {21087#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21083#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} is VALID [2022-04-28 03:03:42,717 INFO L290 TraceCheckUtils]: 23: Hoare triple {21091#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 50) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21087#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} is VALID [2022-04-28 03:03:42,718 INFO L290 TraceCheckUtils]: 22: Hoare triple {21095#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21091#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 50) 4294967296) 268435455))} is VALID [2022-04-28 03:03:42,721 INFO L290 TraceCheckUtils]: 21: Hoare triple {21099#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21095#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} is VALID [2022-04-28 03:03:42,721 INFO L290 TraceCheckUtils]: 20: Hoare triple {21103#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 56 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21099#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} is VALID [2022-04-28 03:03:42,725 INFO L290 TraceCheckUtils]: 19: Hoare triple {21107#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 58) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21103#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 56 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:03:42,726 INFO L290 TraceCheckUtils]: 18: Hoare triple {21111#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 60) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21107#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 58) 4294967296) 268435455))} is VALID [2022-04-28 03:03:42,726 INFO L290 TraceCheckUtils]: 17: Hoare triple {21115#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 62) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21111#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 60) 4294967296) 268435455))} is VALID [2022-04-28 03:03:42,728 INFO L290 TraceCheckUtils]: 16: Hoare triple {21119#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 64 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21115#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 62) 4294967296) 268435455))} is VALID [2022-04-28 03:03:42,729 INFO L290 TraceCheckUtils]: 15: Hoare triple {21123#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 66 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21119#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 64 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:03:42,730 INFO L290 TraceCheckUtils]: 14: Hoare triple {21127#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 68 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21123#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 66 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:03:42,733 INFO L290 TraceCheckUtils]: 13: Hoare triple {21131#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 70) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21127#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 68 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:03:42,760 INFO L290 TraceCheckUtils]: 12: Hoare triple {21135#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 72 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21131#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 70) 4294967296) 268435455))} is VALID [2022-04-28 03:03:42,761 INFO L290 TraceCheckUtils]: 11: Hoare triple {21139#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 74) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21135#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 72 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:03:42,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {21143#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 76 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21139#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 74) 4294967296) 268435455))} is VALID [2022-04-28 03:03:42,762 INFO L290 TraceCheckUtils]: 9: Hoare triple {21147#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 78) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21143#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 76 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:03:42,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {21151#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 80) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21147#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 78) 4294967296) 268435455))} is VALID [2022-04-28 03:03:42,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {21155#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 82) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21151#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 80) 4294967296) 268435455))} is VALID [2022-04-28 03:03:42,764 INFO L290 TraceCheckUtils]: 6: Hoare triple {21159#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 84 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21155#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 82) 4294967296) 268435455))} is VALID [2022-04-28 03:03:42,764 INFO L290 TraceCheckUtils]: 5: Hoare triple {20767#true} ~x~0 := 0; {21159#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 84 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:03:42,765 INFO L272 TraceCheckUtils]: 4: Hoare triple {20767#true} call #t~ret4 := main(); {20767#true} is VALID [2022-04-28 03:03:42,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20767#true} {20767#true} #34#return; {20767#true} is VALID [2022-04-28 03:03:42,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {20767#true} assume true; {20767#true} is VALID [2022-04-28 03:03:42,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {20767#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {20767#true} is VALID [2022-04-28 03:03:42,765 INFO L272 TraceCheckUtils]: 0: Hoare triple {20767#true} call ULTIMATE.init(); {20767#true} is VALID [2022-04-28 03:03:42,765 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:03:42,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268282728] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:03:42,766 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:03:42,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 45, 48] total 93 [2022-04-28 03:03:42,766 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:03:42,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2094655390] [2022-04-28 03:03:42,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2094655390] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:03:42,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:03:42,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-04-28 03:03:42,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280448297] [2022-04-28 03:03:42,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:03:42,767 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:03:42,767 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:03:42,767 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:03:42,795 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:03:42,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-28 03:03:42,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:03:42,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-28 03:03:42,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2161, Invalid=6395, Unknown=0, NotChecked=0, Total=8556 [2022-04-28 03:03:42,796 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:03:46,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:46,273 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-04-28 03:03:46,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-28 03:03:46,273 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:03:46,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:03:46,274 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:03:46,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2022-04-28 03:03:46,274 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:03:46,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2022-04-28 03:03:46,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 60 transitions. [2022-04-28 03:03:46,323 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:03:46,324 INFO L225 Difference]: With dead ends: 60 [2022-04-28 03:03:46,324 INFO L226 Difference]: Without dead ends: 55 [2022-04-28 03:03:46,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 999 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=4266, Invalid=14094, Unknown=0, NotChecked=0, Total=18360 [2022-04-28 03:03:46,325 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1883 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 1970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:03:46,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 88 Invalid, 1970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1883 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-28 03:03:46,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-28 03:03:46,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-28 03:03:46,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:03:46,383 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:03:46,383 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:03:46,383 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:03:46,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:46,385 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2022-04-28 03:03:46,385 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2022-04-28 03:03:46,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:03:46,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:03:46,385 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:03:46,385 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:03:46,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:46,386 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2022-04-28 03:03:46,386 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2022-04-28 03:03:46,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:03:46,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:03:46,386 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:03:46,386 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:03:46,386 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:03:46,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2022-04-28 03:03:46,387 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2022-04-28 03:03:46,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:03:46,388 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2022-04-28 03:03:46,389 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:03:46,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 55 transitions. [2022-04-28 03:03:46,430 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:03:46,430 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2022-04-28 03:03:46,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-28 03:03:46,430 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:03:46,431 INFO L195 NwaCegarLoop]: trace histogram [43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:03:46,438 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:03:46,636 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:03:46,831 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:03:46,831 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:03:46,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:03:46,832 INFO L85 PathProgramCache]: Analyzing trace with hash 2136038966, now seen corresponding path program 85 times [2022-04-28 03:03:46,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:03:46,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [999381945] [2022-04-28 03:03:47,005 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:47,006 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:03:47,008 INFO L85 PathProgramCache]: Analyzing trace with hash 615116663, now seen corresponding path program 1 times [2022-04-28 03:03:47,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:03:47,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442869717] [2022-04-28 03:03:47,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:47,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:03:47,012 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_43.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_43.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:03:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:03:47,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [949903649] [2022-04-28 03:03:47,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:47,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:03:47,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:03:47,016 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:03:47,017 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:03:47,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:03:47,059 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:03:47,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:03:47,074 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:03:47,074 INFO L85 PathProgramCache]: Analyzing trace with hash 2136038966, now seen corresponding path program 86 times [2022-04-28 03:03:47,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:03:47,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214086683] [2022-04-28 03:03:47,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:47,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:03:47,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:48,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:03:48,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:48,053 INFO L290 TraceCheckUtils]: 0: Hoare triple {21655#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {21606#true} is VALID [2022-04-28 03:03:48,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {21606#true} assume true; {21606#true} is VALID [2022-04-28 03:03:48,053 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21606#true} {21606#true} #34#return; {21606#true} is VALID [2022-04-28 03:03:48,053 INFO L272 TraceCheckUtils]: 0: Hoare triple {21606#true} call ULTIMATE.init(); {21655#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:03:48,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {21655#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {21606#true} is VALID [2022-04-28 03:03:48,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {21606#true} assume true; {21606#true} is VALID [2022-04-28 03:03:48,054 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21606#true} {21606#true} #34#return; {21606#true} is VALID [2022-04-28 03:03:48,054 INFO L272 TraceCheckUtils]: 4: Hoare triple {21606#true} call #t~ret4 := main(); {21606#true} is VALID [2022-04-28 03:03:48,054 INFO L290 TraceCheckUtils]: 5: Hoare triple {21606#true} ~x~0 := 0; {21611#(= main_~x~0 0)} is VALID [2022-04-28 03:03:48,054 INFO L290 TraceCheckUtils]: 6: Hoare triple {21611#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21612#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:03:48,055 INFO L290 TraceCheckUtils]: 7: Hoare triple {21612#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21613#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:03:48,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {21613#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21614#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:03:48,056 INFO L290 TraceCheckUtils]: 9: Hoare triple {21614#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21615#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:03:48,056 INFO L290 TraceCheckUtils]: 10: Hoare triple {21615#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21616#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:03:48,057 INFO L290 TraceCheckUtils]: 11: Hoare triple {21616#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21617#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:03:48,057 INFO L290 TraceCheckUtils]: 12: Hoare triple {21617#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21618#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:03:48,058 INFO L290 TraceCheckUtils]: 13: Hoare triple {21618#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21619#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:03:48,058 INFO L290 TraceCheckUtils]: 14: Hoare triple {21619#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21620#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:03:48,059 INFO L290 TraceCheckUtils]: 15: Hoare triple {21620#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21621#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:03:48,059 INFO L290 TraceCheckUtils]: 16: Hoare triple {21621#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21622#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:03:48,060 INFO L290 TraceCheckUtils]: 17: Hoare triple {21622#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21623#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:03:48,060 INFO L290 TraceCheckUtils]: 18: Hoare triple {21623#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21624#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:03:48,061 INFO L290 TraceCheckUtils]: 19: Hoare triple {21624#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21625#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:03:48,061 INFO L290 TraceCheckUtils]: 20: Hoare triple {21625#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21626#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:03:48,062 INFO L290 TraceCheckUtils]: 21: Hoare triple {21626#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21627#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:03:48,062 INFO L290 TraceCheckUtils]: 22: Hoare triple {21627#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21628#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:03:48,063 INFO L290 TraceCheckUtils]: 23: Hoare triple {21628#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21629#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:03:48,063 INFO L290 TraceCheckUtils]: 24: Hoare triple {21629#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21630#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:03:48,063 INFO L290 TraceCheckUtils]: 25: Hoare triple {21630#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21631#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:03:48,064 INFO L290 TraceCheckUtils]: 26: Hoare triple {21631#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21632#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:03:48,064 INFO L290 TraceCheckUtils]: 27: Hoare triple {21632#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21633#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:03:48,065 INFO L290 TraceCheckUtils]: 28: Hoare triple {21633#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21634#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:03:48,065 INFO L290 TraceCheckUtils]: 29: Hoare triple {21634#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21635#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:03:48,066 INFO L290 TraceCheckUtils]: 30: Hoare triple {21635#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21636#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:03:48,066 INFO L290 TraceCheckUtils]: 31: Hoare triple {21636#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21637#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:03:48,067 INFO L290 TraceCheckUtils]: 32: Hoare triple {21637#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21638#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:03:48,067 INFO L290 TraceCheckUtils]: 33: Hoare triple {21638#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21639#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:03:48,068 INFO L290 TraceCheckUtils]: 34: Hoare triple {21639#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21640#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:03:48,068 INFO L290 TraceCheckUtils]: 35: Hoare triple {21640#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21641#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:03:48,069 INFO L290 TraceCheckUtils]: 36: Hoare triple {21641#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21642#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:03:48,069 INFO L290 TraceCheckUtils]: 37: Hoare triple {21642#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21643#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:03:48,070 INFO L290 TraceCheckUtils]: 38: Hoare triple {21643#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21644#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:03:48,070 INFO L290 TraceCheckUtils]: 39: Hoare triple {21644#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21645#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:03:48,070 INFO L290 TraceCheckUtils]: 40: Hoare triple {21645#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21646#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:03:48,071 INFO L290 TraceCheckUtils]: 41: Hoare triple {21646#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21647#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:03:48,071 INFO L290 TraceCheckUtils]: 42: Hoare triple {21647#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21648#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:03:48,072 INFO L290 TraceCheckUtils]: 43: Hoare triple {21648#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21649#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:03:48,072 INFO L290 TraceCheckUtils]: 44: Hoare triple {21649#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21650#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:03:48,073 INFO L290 TraceCheckUtils]: 45: Hoare triple {21650#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21651#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:03:48,073 INFO L290 TraceCheckUtils]: 46: Hoare triple {21651#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21652#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:03:48,074 INFO L290 TraceCheckUtils]: 47: Hoare triple {21652#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21653#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:03:48,074 INFO L290 TraceCheckUtils]: 48: Hoare triple {21653#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21654#(and (<= main_~x~0 86) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:03:48,075 INFO L290 TraceCheckUtils]: 49: Hoare triple {21654#(and (<= main_~x~0 86) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {21607#false} is VALID [2022-04-28 03:03:48,075 INFO L272 TraceCheckUtils]: 50: Hoare triple {21607#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {21607#false} is VALID [2022-04-28 03:03:48,075 INFO L290 TraceCheckUtils]: 51: Hoare triple {21607#false} ~cond := #in~cond; {21607#false} is VALID [2022-04-28 03:03:48,075 INFO L290 TraceCheckUtils]: 52: Hoare triple {21607#false} assume 0 == ~cond; {21607#false} is VALID [2022-04-28 03:03:48,075 INFO L290 TraceCheckUtils]: 53: Hoare triple {21607#false} assume !false; {21607#false} is VALID [2022-04-28 03:03:48,075 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:03:48,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:03:48,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214086683] [2022-04-28 03:03:48,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214086683] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:03:48,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954309422] [2022-04-28 03:03:48,076 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:03:48,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:03:48,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:03:48,077 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:03:48,077 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:03:48,137 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:03:48,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:03:48,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 89 conjunts are in the unsatisfiable core [2022-04-28 03:03:48,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:48,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:03:48,641 INFO L272 TraceCheckUtils]: 0: Hoare triple {21606#true} call ULTIMATE.init(); {21606#true} is VALID [2022-04-28 03:03:48,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {21606#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {21606#true} is VALID [2022-04-28 03:03:48,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {21606#true} assume true; {21606#true} is VALID [2022-04-28 03:03:48,641 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21606#true} {21606#true} #34#return; {21606#true} is VALID [2022-04-28 03:03:48,641 INFO L272 TraceCheckUtils]: 4: Hoare triple {21606#true} call #t~ret4 := main(); {21606#true} is VALID [2022-04-28 03:03:48,641 INFO L290 TraceCheckUtils]: 5: Hoare triple {21606#true} ~x~0 := 0; {21611#(= main_~x~0 0)} is VALID [2022-04-28 03:03:48,642 INFO L290 TraceCheckUtils]: 6: Hoare triple {21611#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21612#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:03:48,642 INFO L290 TraceCheckUtils]: 7: Hoare triple {21612#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21613#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:03:48,643 INFO L290 TraceCheckUtils]: 8: Hoare triple {21613#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21614#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:03:48,643 INFO L290 TraceCheckUtils]: 9: Hoare triple {21614#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21615#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:03:48,644 INFO L290 TraceCheckUtils]: 10: Hoare triple {21615#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21616#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:03:48,644 INFO L290 TraceCheckUtils]: 11: Hoare triple {21616#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21617#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:03:48,644 INFO L290 TraceCheckUtils]: 12: Hoare triple {21617#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21618#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:03:48,645 INFO L290 TraceCheckUtils]: 13: Hoare triple {21618#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21619#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:03:48,645 INFO L290 TraceCheckUtils]: 14: Hoare triple {21619#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21620#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:03:48,646 INFO L290 TraceCheckUtils]: 15: Hoare triple {21620#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21621#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:03:48,646 INFO L290 TraceCheckUtils]: 16: Hoare triple {21621#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21622#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:03:48,647 INFO L290 TraceCheckUtils]: 17: Hoare triple {21622#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21623#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:03:48,647 INFO L290 TraceCheckUtils]: 18: Hoare triple {21623#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21624#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:03:48,648 INFO L290 TraceCheckUtils]: 19: Hoare triple {21624#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21625#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:03:48,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {21625#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21626#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:03:48,649 INFO L290 TraceCheckUtils]: 21: Hoare triple {21626#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21627#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:03:48,649 INFO L290 TraceCheckUtils]: 22: Hoare triple {21627#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21628#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:03:48,650 INFO L290 TraceCheckUtils]: 23: Hoare triple {21628#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21629#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:03:48,650 INFO L290 TraceCheckUtils]: 24: Hoare triple {21629#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21630#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:03:48,651 INFO L290 TraceCheckUtils]: 25: Hoare triple {21630#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21631#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:03:48,651 INFO L290 TraceCheckUtils]: 26: Hoare triple {21631#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21632#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:03:48,651 INFO L290 TraceCheckUtils]: 27: Hoare triple {21632#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21633#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:03:48,652 INFO L290 TraceCheckUtils]: 28: Hoare triple {21633#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21634#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:03:48,652 INFO L290 TraceCheckUtils]: 29: Hoare triple {21634#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21635#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:03:48,653 INFO L290 TraceCheckUtils]: 30: Hoare triple {21635#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21636#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:03:48,653 INFO L290 TraceCheckUtils]: 31: Hoare triple {21636#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21637#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:03:48,654 INFO L290 TraceCheckUtils]: 32: Hoare triple {21637#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21638#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:03:48,654 INFO L290 TraceCheckUtils]: 33: Hoare triple {21638#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21639#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:03:48,655 INFO L290 TraceCheckUtils]: 34: Hoare triple {21639#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21640#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:03:48,655 INFO L290 TraceCheckUtils]: 35: Hoare triple {21640#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21641#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:03:48,656 INFO L290 TraceCheckUtils]: 36: Hoare triple {21641#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21642#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:03:48,656 INFO L290 TraceCheckUtils]: 37: Hoare triple {21642#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21643#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:03:48,657 INFO L290 TraceCheckUtils]: 38: Hoare triple {21643#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21644#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:03:48,657 INFO L290 TraceCheckUtils]: 39: Hoare triple {21644#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21645#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:03:48,657 INFO L290 TraceCheckUtils]: 40: Hoare triple {21645#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21646#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:03:48,658 INFO L290 TraceCheckUtils]: 41: Hoare triple {21646#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21647#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:03:48,658 INFO L290 TraceCheckUtils]: 42: Hoare triple {21647#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21648#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:03:48,659 INFO L290 TraceCheckUtils]: 43: Hoare triple {21648#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21649#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:03:48,659 INFO L290 TraceCheckUtils]: 44: Hoare triple {21649#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21650#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:03:48,660 INFO L290 TraceCheckUtils]: 45: Hoare triple {21650#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21651#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:03:48,660 INFO L290 TraceCheckUtils]: 46: Hoare triple {21651#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21652#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:03:48,661 INFO L290 TraceCheckUtils]: 47: Hoare triple {21652#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21653#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:03:48,661 INFO L290 TraceCheckUtils]: 48: Hoare triple {21653#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21803#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:03:48,662 INFO L290 TraceCheckUtils]: 49: Hoare triple {21803#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {21607#false} is VALID [2022-04-28 03:03:48,662 INFO L272 TraceCheckUtils]: 50: Hoare triple {21607#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {21607#false} is VALID [2022-04-28 03:03:48,662 INFO L290 TraceCheckUtils]: 51: Hoare triple {21607#false} ~cond := #in~cond; {21607#false} is VALID [2022-04-28 03:03:48,662 INFO L290 TraceCheckUtils]: 52: Hoare triple {21607#false} assume 0 == ~cond; {21607#false} is VALID [2022-04-28 03:03:48,662 INFO L290 TraceCheckUtils]: 53: Hoare triple {21607#false} assume !false; {21607#false} is VALID [2022-04-28 03:03:48,662 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:03:48,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:03:51,462 INFO L290 TraceCheckUtils]: 53: Hoare triple {21607#false} assume !false; {21607#false} is VALID [2022-04-28 03:03:51,462 INFO L290 TraceCheckUtils]: 52: Hoare triple {21607#false} assume 0 == ~cond; {21607#false} is VALID [2022-04-28 03:03:51,463 INFO L290 TraceCheckUtils]: 51: Hoare triple {21607#false} ~cond := #in~cond; {21607#false} is VALID [2022-04-28 03:03:51,463 INFO L272 TraceCheckUtils]: 50: Hoare triple {21607#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {21607#false} is VALID [2022-04-28 03:03:51,463 INFO L290 TraceCheckUtils]: 49: Hoare triple {21831#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {21607#false} is VALID [2022-04-28 03:03:51,464 INFO L290 TraceCheckUtils]: 48: Hoare triple {21835#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21831#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:03:51,464 INFO L290 TraceCheckUtils]: 47: Hoare triple {21839#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21835#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 03:03:51,465 INFO L290 TraceCheckUtils]: 46: Hoare triple {21843#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21839#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 03:03:51,465 INFO L290 TraceCheckUtils]: 45: Hoare triple {21847#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21843#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 03:03:51,466 INFO L290 TraceCheckUtils]: 44: Hoare triple {21851#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21847#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 03:03:51,467 INFO L290 TraceCheckUtils]: 43: Hoare triple {21855#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21851#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-28 03:03:51,467 INFO L290 TraceCheckUtils]: 42: Hoare triple {21859#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21855#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-28 03:03:51,468 INFO L290 TraceCheckUtils]: 41: Hoare triple {21863#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21859#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-28 03:03:51,468 INFO L290 TraceCheckUtils]: 40: Hoare triple {21867#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21863#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-28 03:03:51,469 INFO L290 TraceCheckUtils]: 39: Hoare triple {21871#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21867#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-28 03:03:51,469 INFO L290 TraceCheckUtils]: 38: Hoare triple {21875#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21871#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-28 03:03:51,470 INFO L290 TraceCheckUtils]: 37: Hoare triple {21879#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21875#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-28 03:03:51,471 INFO L290 TraceCheckUtils]: 36: Hoare triple {21883#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21879#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-28 03:03:51,471 INFO L290 TraceCheckUtils]: 35: Hoare triple {21887#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21883#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-28 03:03:51,472 INFO L290 TraceCheckUtils]: 34: Hoare triple {21891#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21887#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-28 03:03:51,472 INFO L290 TraceCheckUtils]: 33: Hoare triple {21895#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21891#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:03:51,473 INFO L290 TraceCheckUtils]: 32: Hoare triple {21899#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21895#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:03:51,474 INFO L290 TraceCheckUtils]: 31: Hoare triple {21903#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21899#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-28 03:03:51,474 INFO L290 TraceCheckUtils]: 30: Hoare triple {21907#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21903#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-28 03:03:51,475 INFO L290 TraceCheckUtils]: 29: Hoare triple {21911#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21907#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-28 03:03:51,475 INFO L290 TraceCheckUtils]: 28: Hoare triple {21915#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21911#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:03:51,476 INFO L290 TraceCheckUtils]: 27: Hoare triple {21919#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21915#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:03:51,477 INFO L290 TraceCheckUtils]: 26: Hoare triple {21923#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21919#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:03:51,477 INFO L290 TraceCheckUtils]: 25: Hoare triple {21927#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21923#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-28 03:03:51,478 INFO L290 TraceCheckUtils]: 24: Hoare triple {21931#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21927#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-28 03:03:51,478 INFO L290 TraceCheckUtils]: 23: Hoare triple {21935#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21931#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-28 03:03:51,479 INFO L290 TraceCheckUtils]: 22: Hoare triple {21939#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21935#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-28 03:03:51,479 INFO L290 TraceCheckUtils]: 21: Hoare triple {21943#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21939#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-28 03:03:51,480 INFO L290 TraceCheckUtils]: 20: Hoare triple {21947#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21943#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:03:51,481 INFO L290 TraceCheckUtils]: 19: Hoare triple {21951#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21947#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-28 03:03:51,481 INFO L290 TraceCheckUtils]: 18: Hoare triple {21955#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21951#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-28 03:03:51,482 INFO L290 TraceCheckUtils]: 17: Hoare triple {21959#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21955#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-28 03:03:51,482 INFO L290 TraceCheckUtils]: 16: Hoare triple {21963#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21959#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:03:51,483 INFO L290 TraceCheckUtils]: 15: Hoare triple {21967#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21963#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:03:51,483 INFO L290 TraceCheckUtils]: 14: Hoare triple {21971#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21967#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:03:51,484 INFO L290 TraceCheckUtils]: 13: Hoare triple {21975#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21971#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} is VALID [2022-04-28 03:03:51,485 INFO L290 TraceCheckUtils]: 12: Hoare triple {21979#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21975#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:03:51,485 INFO L290 TraceCheckUtils]: 11: Hoare triple {21983#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21979#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} is VALID [2022-04-28 03:03:51,486 INFO L290 TraceCheckUtils]: 10: Hoare triple {21987#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21983#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:03:51,486 INFO L290 TraceCheckUtils]: 9: Hoare triple {21991#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21987#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} is VALID [2022-04-28 03:03:51,487 INFO L290 TraceCheckUtils]: 8: Hoare triple {21995#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21991#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} is VALID [2022-04-28 03:03:51,487 INFO L290 TraceCheckUtils]: 7: Hoare triple {21999#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21995#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} is VALID [2022-04-28 03:03:51,488 INFO L290 TraceCheckUtils]: 6: Hoare triple {22003#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {21999#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:03:51,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {21606#true} ~x~0 := 0; {22003#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} is VALID [2022-04-28 03:03:51,488 INFO L272 TraceCheckUtils]: 4: Hoare triple {21606#true} call #t~ret4 := main(); {21606#true} is VALID [2022-04-28 03:03:51,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21606#true} {21606#true} #34#return; {21606#true} is VALID [2022-04-28 03:03:51,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {21606#true} assume true; {21606#true} is VALID [2022-04-28 03:03:51,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {21606#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {21606#true} is VALID [2022-04-28 03:03:51,489 INFO L272 TraceCheckUtils]: 0: Hoare triple {21606#true} call ULTIMATE.init(); {21606#true} is VALID [2022-04-28 03:03:51,489 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:03:51,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954309422] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:03:51,489 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:03:51,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 46] total 92 [2022-04-28 03:03:51,490 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:03:51,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [999381945] [2022-04-28 03:03:51,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [999381945] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:03:51,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:03:51,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-04-28 03:03:51,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057050475] [2022-04-28 03:03:51,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:03:51,490 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:03:51,490 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:03:51,490 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:03:51,517 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:03:51,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-04-28 03:03:51,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:03:51,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-04-28 03:03:51,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2205, Invalid=6167, Unknown=0, NotChecked=0, Total=8372 [2022-04-28 03:03:51,519 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:03:55,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:55,031 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2022-04-28 03:03:55,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-28 03:03:55,032 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:03:55,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:03:55,032 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:03:55,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2022-04-28 03:03:55,033 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:03:55,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2022-04-28 03:03:55,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 61 transitions. [2022-04-28 03:03:55,076 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:03:55,076 INFO L225 Difference]: With dead ends: 61 [2022-04-28 03:03:55,076 INFO L226 Difference]: Without dead ends: 56 [2022-04-28 03:03:55,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1038 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=4403, Invalid=13957, Unknown=0, NotChecked=0, Total=18360 [2022-04-28 03:03:55,078 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1934 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 2023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:03:55,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 53 Invalid, 2023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1934 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-28 03:03:55,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-28 03:03:55,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-28 03:03:55,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:03:55,136 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:03:55,136 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:03:55,136 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:03:55,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:55,137 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-28 03:03:55,137 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-04-28 03:03:55,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:03:55,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:03:55,137 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:03:55,137 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:03:55,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:03:55,138 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2022-04-28 03:03:55,138 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-04-28 03:03:55,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:03:55,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:03:55,138 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:03:55,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:03:55,138 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:03:55,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2022-04-28 03:03:55,139 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2022-04-28 03:03:55,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:03:55,139 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2022-04-28 03:03:55,139 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:03:55,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 56 transitions. [2022-04-28 03:03:55,181 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:03:55,181 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2022-04-28 03:03:55,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-28 03:03:55,182 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:03:55,182 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:03:55,185 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:03:55,402 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:03:55,582 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:03:55,582 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:03:55,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:03:55,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1829159772, now seen corresponding path program 87 times [2022-04-28 03:03:55,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:03:55,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [467282451] [2022-04-28 03:03:57,764 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,766 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:03:57,768 INFO L85 PathProgramCache]: Analyzing trace with hash 674222007, now seen corresponding path program 1 times [2022-04-28 03:03:57,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:03:57,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277386615] [2022-04-28 03:03:57,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:57,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:03:57,772 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 2) .v_it_44.0) (* (- 1) main_~x~0_5) (* 4294967296 (div (+ (* 2 .v_it_44.0) main_~x~0_5) 4294967296)) 268435455) 0)) [2022-04-28 03:03:57,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:03:57,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2146297419] [2022-04-28 03:03:57,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:57,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:03:57,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:03:57,776 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:03:57,777 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:03:57,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:03:57,818 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:03:57,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:03:57,846 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:03:57,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1829159772, now seen corresponding path program 88 times [2022-04-28 03:03:57,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:03:57,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463291078] [2022-04-28 03:03:57,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:03:57,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:03:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:58,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:03:58,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:58,894 INFO L290 TraceCheckUtils]: 0: Hoare triple {22508#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {22458#true} is VALID [2022-04-28 03:03:58,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {22458#true} assume true; {22458#true} is VALID [2022-04-28 03:03:58,894 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22458#true} {22458#true} #34#return; {22458#true} is VALID [2022-04-28 03:03:58,895 INFO L272 TraceCheckUtils]: 0: Hoare triple {22458#true} call ULTIMATE.init(); {22508#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:03:58,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {22508#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {22458#true} is VALID [2022-04-28 03:03:58,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {22458#true} assume true; {22458#true} is VALID [2022-04-28 03:03:58,895 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22458#true} {22458#true} #34#return; {22458#true} is VALID [2022-04-28 03:03:58,895 INFO L272 TraceCheckUtils]: 4: Hoare triple {22458#true} call #t~ret4 := main(); {22458#true} is VALID [2022-04-28 03:03:58,895 INFO L290 TraceCheckUtils]: 5: Hoare triple {22458#true} ~x~0 := 0; {22463#(= main_~x~0 0)} is VALID [2022-04-28 03:03:58,896 INFO L290 TraceCheckUtils]: 6: Hoare triple {22463#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22464#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:03:58,896 INFO L290 TraceCheckUtils]: 7: Hoare triple {22464#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22465#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:03:58,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {22465#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22466#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:03:58,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {22466#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22467#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:03:58,897 INFO L290 TraceCheckUtils]: 10: Hoare triple {22467#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22468#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:03:58,898 INFO L290 TraceCheckUtils]: 11: Hoare triple {22468#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22469#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:03:58,898 INFO L290 TraceCheckUtils]: 12: Hoare triple {22469#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22470#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:03:58,899 INFO L290 TraceCheckUtils]: 13: Hoare triple {22470#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22471#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:03:58,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {22471#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22472#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:03:58,900 INFO L290 TraceCheckUtils]: 15: Hoare triple {22472#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22473#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:03:58,900 INFO L290 TraceCheckUtils]: 16: Hoare triple {22473#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22474#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:03:58,901 INFO L290 TraceCheckUtils]: 17: Hoare triple {22474#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22475#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:03:58,901 INFO L290 TraceCheckUtils]: 18: Hoare triple {22475#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22476#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:03:58,902 INFO L290 TraceCheckUtils]: 19: Hoare triple {22476#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22477#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:03:58,902 INFO L290 TraceCheckUtils]: 20: Hoare triple {22477#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22478#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:03:58,903 INFO L290 TraceCheckUtils]: 21: Hoare triple {22478#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22479#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:03:58,903 INFO L290 TraceCheckUtils]: 22: Hoare triple {22479#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22480#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:03:58,904 INFO L290 TraceCheckUtils]: 23: Hoare triple {22480#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22481#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:03:58,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {22481#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22482#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:03:58,904 INFO L290 TraceCheckUtils]: 25: Hoare triple {22482#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22483#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:03:58,905 INFO L290 TraceCheckUtils]: 26: Hoare triple {22483#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22484#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:03:58,905 INFO L290 TraceCheckUtils]: 27: Hoare triple {22484#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22485#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:03:58,906 INFO L290 TraceCheckUtils]: 28: Hoare triple {22485#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22486#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:03:58,906 INFO L290 TraceCheckUtils]: 29: Hoare triple {22486#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22487#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:03:58,907 INFO L290 TraceCheckUtils]: 30: Hoare triple {22487#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22488#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:03:58,907 INFO L290 TraceCheckUtils]: 31: Hoare triple {22488#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22489#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:03:58,908 INFO L290 TraceCheckUtils]: 32: Hoare triple {22489#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22490#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:03:58,908 INFO L290 TraceCheckUtils]: 33: Hoare triple {22490#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22491#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:03:58,909 INFO L290 TraceCheckUtils]: 34: Hoare triple {22491#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22492#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:03:58,909 INFO L290 TraceCheckUtils]: 35: Hoare triple {22492#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22493#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:03:58,910 INFO L290 TraceCheckUtils]: 36: Hoare triple {22493#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22494#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:03:58,910 INFO L290 TraceCheckUtils]: 37: Hoare triple {22494#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22495#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:03:58,910 INFO L290 TraceCheckUtils]: 38: Hoare triple {22495#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22496#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:03:58,911 INFO L290 TraceCheckUtils]: 39: Hoare triple {22496#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22497#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:03:58,911 INFO L290 TraceCheckUtils]: 40: Hoare triple {22497#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22498#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:03:58,912 INFO L290 TraceCheckUtils]: 41: Hoare triple {22498#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22499#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:03:58,912 INFO L290 TraceCheckUtils]: 42: Hoare triple {22499#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22500#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:03:58,913 INFO L290 TraceCheckUtils]: 43: Hoare triple {22500#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22501#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:03:58,913 INFO L290 TraceCheckUtils]: 44: Hoare triple {22501#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22502#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:03:58,914 INFO L290 TraceCheckUtils]: 45: Hoare triple {22502#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22503#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:03:58,914 INFO L290 TraceCheckUtils]: 46: Hoare triple {22503#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22504#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:03:58,915 INFO L290 TraceCheckUtils]: 47: Hoare triple {22504#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22505#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:03:58,915 INFO L290 TraceCheckUtils]: 48: Hoare triple {22505#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22506#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:03:58,916 INFO L290 TraceCheckUtils]: 49: Hoare triple {22506#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22507#(and (<= main_~x~0 88) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:03:58,916 INFO L290 TraceCheckUtils]: 50: Hoare triple {22507#(and (<= main_~x~0 88) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {22459#false} is VALID [2022-04-28 03:03:58,916 INFO L272 TraceCheckUtils]: 51: Hoare triple {22459#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {22459#false} is VALID [2022-04-28 03:03:58,916 INFO L290 TraceCheckUtils]: 52: Hoare triple {22459#false} ~cond := #in~cond; {22459#false} is VALID [2022-04-28 03:03:58,916 INFO L290 TraceCheckUtils]: 53: Hoare triple {22459#false} assume 0 == ~cond; {22459#false} is VALID [2022-04-28 03:03:58,916 INFO L290 TraceCheckUtils]: 54: Hoare triple {22459#false} assume !false; {22459#false} is VALID [2022-04-28 03:03:58,917 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:03:58,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:03:58,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463291078] [2022-04-28 03:03:58,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463291078] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:03:58,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590714883] [2022-04-28 03:03:58,917 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:03:58,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:03:58,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:03:58,918 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:03:58,919 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:03:59,040 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:03:59,040 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:03:59,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 91 conjunts are in the unsatisfiable core [2022-04-28 03:03:59,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:03:59,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:03:59,544 INFO L272 TraceCheckUtils]: 0: Hoare triple {22458#true} call ULTIMATE.init(); {22458#true} is VALID [2022-04-28 03:03:59,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {22458#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {22458#true} is VALID [2022-04-28 03:03:59,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {22458#true} assume true; {22458#true} is VALID [2022-04-28 03:03:59,544 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22458#true} {22458#true} #34#return; {22458#true} is VALID [2022-04-28 03:03:59,544 INFO L272 TraceCheckUtils]: 4: Hoare triple {22458#true} call #t~ret4 := main(); {22458#true} is VALID [2022-04-28 03:03:59,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {22458#true} ~x~0 := 0; {22463#(= main_~x~0 0)} is VALID [2022-04-28 03:03:59,545 INFO L290 TraceCheckUtils]: 6: Hoare triple {22463#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22464#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:03:59,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {22464#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22465#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:03:59,546 INFO L290 TraceCheckUtils]: 8: Hoare triple {22465#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22466#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:03:59,546 INFO L290 TraceCheckUtils]: 9: Hoare triple {22466#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22467#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:03:59,547 INFO L290 TraceCheckUtils]: 10: Hoare triple {22467#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22468#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:03:59,547 INFO L290 TraceCheckUtils]: 11: Hoare triple {22468#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22469#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:03:59,548 INFO L290 TraceCheckUtils]: 12: Hoare triple {22469#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22470#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:03:59,548 INFO L290 TraceCheckUtils]: 13: Hoare triple {22470#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22471#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:03:59,548 INFO L290 TraceCheckUtils]: 14: Hoare triple {22471#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22472#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:03:59,549 INFO L290 TraceCheckUtils]: 15: Hoare triple {22472#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22473#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:03:59,549 INFO L290 TraceCheckUtils]: 16: Hoare triple {22473#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22474#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:03:59,550 INFO L290 TraceCheckUtils]: 17: Hoare triple {22474#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22475#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:03:59,550 INFO L290 TraceCheckUtils]: 18: Hoare triple {22475#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22476#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:03:59,551 INFO L290 TraceCheckUtils]: 19: Hoare triple {22476#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22477#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:03:59,551 INFO L290 TraceCheckUtils]: 20: Hoare triple {22477#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22478#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:03:59,552 INFO L290 TraceCheckUtils]: 21: Hoare triple {22478#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22479#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:03:59,552 INFO L290 TraceCheckUtils]: 22: Hoare triple {22479#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22480#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:03:59,553 INFO L290 TraceCheckUtils]: 23: Hoare triple {22480#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22481#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:03:59,553 INFO L290 TraceCheckUtils]: 24: Hoare triple {22481#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22482#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:03:59,554 INFO L290 TraceCheckUtils]: 25: Hoare triple {22482#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22483#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:03:59,554 INFO L290 TraceCheckUtils]: 26: Hoare triple {22483#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22484#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:03:59,555 INFO L290 TraceCheckUtils]: 27: Hoare triple {22484#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22485#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:03:59,555 INFO L290 TraceCheckUtils]: 28: Hoare triple {22485#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22486#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:03:59,555 INFO L290 TraceCheckUtils]: 29: Hoare triple {22486#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22487#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:03:59,556 INFO L290 TraceCheckUtils]: 30: Hoare triple {22487#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22488#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:03:59,556 INFO L290 TraceCheckUtils]: 31: Hoare triple {22488#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22489#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:03:59,557 INFO L290 TraceCheckUtils]: 32: Hoare triple {22489#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22490#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:03:59,557 INFO L290 TraceCheckUtils]: 33: Hoare triple {22490#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22491#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:03:59,558 INFO L290 TraceCheckUtils]: 34: Hoare triple {22491#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22492#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:03:59,558 INFO L290 TraceCheckUtils]: 35: Hoare triple {22492#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22493#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:03:59,559 INFO L290 TraceCheckUtils]: 36: Hoare triple {22493#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22494#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:03:59,559 INFO L290 TraceCheckUtils]: 37: Hoare triple {22494#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22495#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:03:59,560 INFO L290 TraceCheckUtils]: 38: Hoare triple {22495#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22496#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:03:59,560 INFO L290 TraceCheckUtils]: 39: Hoare triple {22496#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22497#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:03:59,561 INFO L290 TraceCheckUtils]: 40: Hoare triple {22497#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22498#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:03:59,561 INFO L290 TraceCheckUtils]: 41: Hoare triple {22498#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22499#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:03:59,561 INFO L290 TraceCheckUtils]: 42: Hoare triple {22499#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22500#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:03:59,562 INFO L290 TraceCheckUtils]: 43: Hoare triple {22500#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22501#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:03:59,562 INFO L290 TraceCheckUtils]: 44: Hoare triple {22501#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22502#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:03:59,563 INFO L290 TraceCheckUtils]: 45: Hoare triple {22502#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22503#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:03:59,563 INFO L290 TraceCheckUtils]: 46: Hoare triple {22503#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22504#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:03:59,564 INFO L290 TraceCheckUtils]: 47: Hoare triple {22504#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22505#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:03:59,564 INFO L290 TraceCheckUtils]: 48: Hoare triple {22505#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22506#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:03:59,565 INFO L290 TraceCheckUtils]: 49: Hoare triple {22506#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22659#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:03:59,565 INFO L290 TraceCheckUtils]: 50: Hoare triple {22659#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {22459#false} is VALID [2022-04-28 03:03:59,565 INFO L272 TraceCheckUtils]: 51: Hoare triple {22459#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {22459#false} is VALID [2022-04-28 03:03:59,565 INFO L290 TraceCheckUtils]: 52: Hoare triple {22459#false} ~cond := #in~cond; {22459#false} is VALID [2022-04-28 03:03:59,565 INFO L290 TraceCheckUtils]: 53: Hoare triple {22459#false} assume 0 == ~cond; {22459#false} is VALID [2022-04-28 03:03:59,565 INFO L290 TraceCheckUtils]: 54: Hoare triple {22459#false} assume !false; {22459#false} is VALID [2022-04-28 03:03:59,566 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:03:59,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:04:02,530 INFO L290 TraceCheckUtils]: 54: Hoare triple {22459#false} assume !false; {22459#false} is VALID [2022-04-28 03:04:02,530 INFO L290 TraceCheckUtils]: 53: Hoare triple {22459#false} assume 0 == ~cond; {22459#false} is VALID [2022-04-28 03:04:02,530 INFO L290 TraceCheckUtils]: 52: Hoare triple {22459#false} ~cond := #in~cond; {22459#false} is VALID [2022-04-28 03:04:02,531 INFO L272 TraceCheckUtils]: 51: Hoare triple {22459#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {22459#false} is VALID [2022-04-28 03:04:02,531 INFO L290 TraceCheckUtils]: 50: Hoare triple {22687#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {22459#false} is VALID [2022-04-28 03:04:02,532 INFO L290 TraceCheckUtils]: 49: Hoare triple {22691#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22687#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:04:02,532 INFO L290 TraceCheckUtils]: 48: Hoare triple {22695#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22691#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 03:04:02,533 INFO L290 TraceCheckUtils]: 47: Hoare triple {22699#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22695#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 03:04:02,533 INFO L290 TraceCheckUtils]: 46: Hoare triple {22703#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22699#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 03:04:02,534 INFO L290 TraceCheckUtils]: 45: Hoare triple {22707#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22703#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 03:04:02,534 INFO L290 TraceCheckUtils]: 44: Hoare triple {22711#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22707#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-28 03:04:02,535 INFO L290 TraceCheckUtils]: 43: Hoare triple {22715#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22711#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-28 03:04:02,536 INFO L290 TraceCheckUtils]: 42: Hoare triple {22719#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22715#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-28 03:04:02,537 INFO L290 TraceCheckUtils]: 41: Hoare triple {22723#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22719#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-28 03:04:02,538 INFO L290 TraceCheckUtils]: 40: Hoare triple {22727#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22723#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-28 03:04:02,538 INFO L290 TraceCheckUtils]: 39: Hoare triple {22731#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22727#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-28 03:04:02,539 INFO L290 TraceCheckUtils]: 38: Hoare triple {22735#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22731#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-28 03:04:02,540 INFO L290 TraceCheckUtils]: 37: Hoare triple {22739#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22735#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-28 03:04:02,542 INFO L290 TraceCheckUtils]: 36: Hoare triple {22743#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22739#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-28 03:04:02,542 INFO L290 TraceCheckUtils]: 35: Hoare triple {22747#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22743#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-28 03:04:02,543 INFO L290 TraceCheckUtils]: 34: Hoare triple {22751#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22747#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:04:02,544 INFO L290 TraceCheckUtils]: 33: Hoare triple {22755#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22751#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:04:02,544 INFO L290 TraceCheckUtils]: 32: Hoare triple {22759#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22755#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-28 03:04:02,545 INFO L290 TraceCheckUtils]: 31: Hoare triple {22763#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22759#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-28 03:04:02,545 INFO L290 TraceCheckUtils]: 30: Hoare triple {22767#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22763#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-28 03:04:02,546 INFO L290 TraceCheckUtils]: 29: Hoare triple {22771#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22767#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:04:02,547 INFO L290 TraceCheckUtils]: 28: Hoare triple {22775#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22771#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:04:02,547 INFO L290 TraceCheckUtils]: 27: Hoare triple {22779#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22775#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:04:02,548 INFO L290 TraceCheckUtils]: 26: Hoare triple {22783#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22779#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-28 03:04:02,548 INFO L290 TraceCheckUtils]: 25: Hoare triple {22787#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22783#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-28 03:04:02,549 INFO L290 TraceCheckUtils]: 24: Hoare triple {22791#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22787#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-28 03:04:02,550 INFO L290 TraceCheckUtils]: 23: Hoare triple {22795#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22791#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-28 03:04:02,550 INFO L290 TraceCheckUtils]: 22: Hoare triple {22799#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22795#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-28 03:04:02,551 INFO L290 TraceCheckUtils]: 21: Hoare triple {22803#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22799#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:04:02,551 INFO L290 TraceCheckUtils]: 20: Hoare triple {22807#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22803#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-28 03:04:02,552 INFO L290 TraceCheckUtils]: 19: Hoare triple {22811#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22807#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-28 03:04:02,552 INFO L290 TraceCheckUtils]: 18: Hoare triple {22815#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22811#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-28 03:04:02,553 INFO L290 TraceCheckUtils]: 17: Hoare triple {22819#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22815#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:04:02,554 INFO L290 TraceCheckUtils]: 16: Hoare triple {22823#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22819#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:04:02,554 INFO L290 TraceCheckUtils]: 15: Hoare triple {22827#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22823#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:04:02,555 INFO L290 TraceCheckUtils]: 14: Hoare triple {22831#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22827#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} is VALID [2022-04-28 03:04:02,555 INFO L290 TraceCheckUtils]: 13: Hoare triple {22835#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22831#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:04:02,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {22839#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22835#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} is VALID [2022-04-28 03:04:02,557 INFO L290 TraceCheckUtils]: 11: Hoare triple {22843#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22839#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:04:02,558 INFO L290 TraceCheckUtils]: 10: Hoare triple {22847#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22843#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} is VALID [2022-04-28 03:04:02,558 INFO L290 TraceCheckUtils]: 9: Hoare triple {22851#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22847#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} is VALID [2022-04-28 03:04:02,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {22855#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22851#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} is VALID [2022-04-28 03:04:02,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {22859#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22855#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:04:02,560 INFO L290 TraceCheckUtils]: 6: Hoare triple {22863#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {22859#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} is VALID [2022-04-28 03:04:02,560 INFO L290 TraceCheckUtils]: 5: Hoare triple {22458#true} ~x~0 := 0; {22863#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:04:02,561 INFO L272 TraceCheckUtils]: 4: Hoare triple {22458#true} call #t~ret4 := main(); {22458#true} is VALID [2022-04-28 03:04:02,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22458#true} {22458#true} #34#return; {22458#true} is VALID [2022-04-28 03:04:02,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {22458#true} assume true; {22458#true} is VALID [2022-04-28 03:04:02,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {22458#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {22458#true} is VALID [2022-04-28 03:04:02,561 INFO L272 TraceCheckUtils]: 0: Hoare triple {22458#true} call ULTIMATE.init(); {22458#true} is VALID [2022-04-28 03:04:02,561 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:04:02,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590714883] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:04:02,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:04:02,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 47, 47] total 94 [2022-04-28 03:04:02,562 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:04:02,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [467282451] [2022-04-28 03:04:02,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [467282451] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:04:02,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:04:02,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-04-28 03:04:02,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373830027] [2022-04-28 03:04:02,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:04:02,562 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:04:02,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:04:02,563 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:04:02,590 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:02,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-04-28 03:04:02,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:04:02,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-04-28 03:04:02,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2300, Invalid=6442, Unknown=0, NotChecked=0, Total=8742 [2022-04-28 03:04:02,591 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:04:06,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:04:06,335 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2022-04-28 03:04:06,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-28 03:04:06,335 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:04:06,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:04:06,335 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:04:06,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2022-04-28 03:04:06,337 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:04:06,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2022-04-28 03:04:06,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 62 transitions. [2022-04-28 03:04:06,373 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:04:06,374 INFO L225 Difference]: With dead ends: 62 [2022-04-28 03:04:06,374 INFO L226 Difference]: Without dead ends: 57 [2022-04-28 03:04:06,375 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1084 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=4593, Invalid=14589, Unknown=0, NotChecked=0, Total=19182 [2022-04-28 03:04:06,375 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 2067 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 2158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 2067 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:04:06,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 98 Invalid, 2158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 2067 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-28 03:04:06,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-28 03:04:06,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-28 03:04:06,430 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:04:06,431 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:04:06,431 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:04:06,431 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:04:06,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:04:06,432 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2022-04-28 03:04:06,432 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2022-04-28 03:04:06,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:04:06,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:04:06,432 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:04:06,432 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:04:06,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:04:06,432 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2022-04-28 03:04:06,433 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2022-04-28 03:04:06,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:04:06,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:04:06,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:04:06,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:04:06,433 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:04:06,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2022-04-28 03:04:06,433 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2022-04-28 03:04:06,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:04:06,434 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2022-04-28 03:04:06,434 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:04:06,434 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 57 transitions. [2022-04-28 03:04:06,473 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:06,473 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2022-04-28 03:04:06,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-28 03:04:06,473 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:04:06,474 INFO L195 NwaCegarLoop]: trace histogram [45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:04:06,489 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:04:06,677 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:04:06,874 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:04:06,874 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:04:06,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:04:06,874 INFO L85 PathProgramCache]: Analyzing trace with hash 905839350, now seen corresponding path program 89 times [2022-04-28 03:04:06,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:04:06,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1409691268] [2022-04-28 03:04:07,073 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:07,074 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:04:07,076 INFO L85 PathProgramCache]: Analyzing trace with hash 733327351, now seen corresponding path program 1 times [2022-04-28 03:04:07,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:04:07,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689084594] [2022-04-28 03:04:07,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:04:07,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:04:07,080 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_45.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_45.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:04:07,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:04:07,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1498327771] [2022-04-28 03:04:07,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:04:07,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:04:07,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:04:07,084 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:04:07,091 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:04:07,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:04:07,129 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:04:07,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:04:07,136 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:04:07,137 INFO L85 PathProgramCache]: Analyzing trace with hash 905839350, now seen corresponding path program 90 times [2022-04-28 03:04:07,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:04:07,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281764074] [2022-04-28 03:04:07,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:04:07,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:04:07,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:04:08,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:04:08,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:04:08,206 INFO L290 TraceCheckUtils]: 0: Hoare triple {23377#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {23326#true} is VALID [2022-04-28 03:04:08,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {23326#true} assume true; {23326#true} is VALID [2022-04-28 03:04:08,206 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23326#true} {23326#true} #34#return; {23326#true} is VALID [2022-04-28 03:04:08,207 INFO L272 TraceCheckUtils]: 0: Hoare triple {23326#true} call ULTIMATE.init(); {23377#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:04:08,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {23377#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {23326#true} is VALID [2022-04-28 03:04:08,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {23326#true} assume true; {23326#true} is VALID [2022-04-28 03:04:08,207 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23326#true} {23326#true} #34#return; {23326#true} is VALID [2022-04-28 03:04:08,207 INFO L272 TraceCheckUtils]: 4: Hoare triple {23326#true} call #t~ret4 := main(); {23326#true} is VALID [2022-04-28 03:04:08,207 INFO L290 TraceCheckUtils]: 5: Hoare triple {23326#true} ~x~0 := 0; {23331#(= main_~x~0 0)} is VALID [2022-04-28 03:04:08,208 INFO L290 TraceCheckUtils]: 6: Hoare triple {23331#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23332#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:04:08,208 INFO L290 TraceCheckUtils]: 7: Hoare triple {23332#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23333#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:04:08,209 INFO L290 TraceCheckUtils]: 8: Hoare triple {23333#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23334#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:04:08,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {23334#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23335#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:04:08,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {23335#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23336#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:04:08,210 INFO L290 TraceCheckUtils]: 11: Hoare triple {23336#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23337#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:04:08,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {23337#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23338#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:04:08,211 INFO L290 TraceCheckUtils]: 13: Hoare triple {23338#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23339#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:04:08,211 INFO L290 TraceCheckUtils]: 14: Hoare triple {23339#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23340#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:04:08,212 INFO L290 TraceCheckUtils]: 15: Hoare triple {23340#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23341#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:04:08,212 INFO L290 TraceCheckUtils]: 16: Hoare triple {23341#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23342#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:04:08,217 INFO L290 TraceCheckUtils]: 17: Hoare triple {23342#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23343#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:04:08,218 INFO L290 TraceCheckUtils]: 18: Hoare triple {23343#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23344#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:04:08,218 INFO L290 TraceCheckUtils]: 19: Hoare triple {23344#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23345#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:04:08,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {23345#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23346#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:04:08,219 INFO L290 TraceCheckUtils]: 21: Hoare triple {23346#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23347#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:04:08,220 INFO L290 TraceCheckUtils]: 22: Hoare triple {23347#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23348#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:04:08,220 INFO L290 TraceCheckUtils]: 23: Hoare triple {23348#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23349#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:04:08,221 INFO L290 TraceCheckUtils]: 24: Hoare triple {23349#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23350#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:04:08,221 INFO L290 TraceCheckUtils]: 25: Hoare triple {23350#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23351#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:04:08,222 INFO L290 TraceCheckUtils]: 26: Hoare triple {23351#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23352#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:04:08,222 INFO L290 TraceCheckUtils]: 27: Hoare triple {23352#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23353#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:04:08,223 INFO L290 TraceCheckUtils]: 28: Hoare triple {23353#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23354#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:04:08,223 INFO L290 TraceCheckUtils]: 29: Hoare triple {23354#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23355#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:04:08,224 INFO L290 TraceCheckUtils]: 30: Hoare triple {23355#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23356#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:04:08,224 INFO L290 TraceCheckUtils]: 31: Hoare triple {23356#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23357#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:04:08,225 INFO L290 TraceCheckUtils]: 32: Hoare triple {23357#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23358#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:04:08,225 INFO L290 TraceCheckUtils]: 33: Hoare triple {23358#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23359#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:04:08,225 INFO L290 TraceCheckUtils]: 34: Hoare triple {23359#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23360#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:04:08,226 INFO L290 TraceCheckUtils]: 35: Hoare triple {23360#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23361#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:04:08,226 INFO L290 TraceCheckUtils]: 36: Hoare triple {23361#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23362#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:04:08,227 INFO L290 TraceCheckUtils]: 37: Hoare triple {23362#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23363#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:04:08,227 INFO L290 TraceCheckUtils]: 38: Hoare triple {23363#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23364#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:04:08,228 INFO L290 TraceCheckUtils]: 39: Hoare triple {23364#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23365#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:04:08,228 INFO L290 TraceCheckUtils]: 40: Hoare triple {23365#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23366#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:04:08,229 INFO L290 TraceCheckUtils]: 41: Hoare triple {23366#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23367#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:04:08,229 INFO L290 TraceCheckUtils]: 42: Hoare triple {23367#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23368#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:04:08,230 INFO L290 TraceCheckUtils]: 43: Hoare triple {23368#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23369#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:04:08,230 INFO L290 TraceCheckUtils]: 44: Hoare triple {23369#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23370#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:04:08,231 INFO L290 TraceCheckUtils]: 45: Hoare triple {23370#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23371#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:04:08,231 INFO L290 TraceCheckUtils]: 46: Hoare triple {23371#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23372#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:04:08,231 INFO L290 TraceCheckUtils]: 47: Hoare triple {23372#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23373#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:04:08,232 INFO L290 TraceCheckUtils]: 48: Hoare triple {23373#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23374#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:04:08,232 INFO L290 TraceCheckUtils]: 49: Hoare triple {23374#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23375#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:04:08,233 INFO L290 TraceCheckUtils]: 50: Hoare triple {23375#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23376#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 90))} is VALID [2022-04-28 03:04:08,233 INFO L290 TraceCheckUtils]: 51: Hoare triple {23376#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 90))} assume !(~x~0 % 4294967296 < 268435455); {23327#false} is VALID [2022-04-28 03:04:08,233 INFO L272 TraceCheckUtils]: 52: Hoare triple {23327#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {23327#false} is VALID [2022-04-28 03:04:08,233 INFO L290 TraceCheckUtils]: 53: Hoare triple {23327#false} ~cond := #in~cond; {23327#false} is VALID [2022-04-28 03:04:08,234 INFO L290 TraceCheckUtils]: 54: Hoare triple {23327#false} assume 0 == ~cond; {23327#false} is VALID [2022-04-28 03:04:08,234 INFO L290 TraceCheckUtils]: 55: Hoare triple {23327#false} assume !false; {23327#false} is VALID [2022-04-28 03:04:08,234 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:04:08,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:04:08,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281764074] [2022-04-28 03:04:08,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281764074] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:04:08,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323213983] [2022-04-28 03:04:08,234 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:04:08,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:04:08,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:04:08,235 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:04:08,236 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:04:14,559 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2022-04-28 03:04:14,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:04:14,569 WARN L261 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 94 conjunts are in the unsatisfiable core [2022-04-28 03:04:14,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:04:14,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:04:15,167 INFO L272 TraceCheckUtils]: 0: Hoare triple {23326#true} call ULTIMATE.init(); {23326#true} is VALID [2022-04-28 03:04:15,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {23326#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {23326#true} is VALID [2022-04-28 03:04:15,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {23326#true} assume true; {23326#true} is VALID [2022-04-28 03:04:15,168 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23326#true} {23326#true} #34#return; {23326#true} is VALID [2022-04-28 03:04:15,168 INFO L272 TraceCheckUtils]: 4: Hoare triple {23326#true} call #t~ret4 := main(); {23326#true} is VALID [2022-04-28 03:04:15,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {23326#true} ~x~0 := 0; {23331#(= main_~x~0 0)} is VALID [2022-04-28 03:04:15,169 INFO L290 TraceCheckUtils]: 6: Hoare triple {23331#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23332#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:04:15,169 INFO L290 TraceCheckUtils]: 7: Hoare triple {23332#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23333#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:04:15,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {23333#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23334#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:04:15,170 INFO L290 TraceCheckUtils]: 9: Hoare triple {23334#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23335#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:04:15,170 INFO L290 TraceCheckUtils]: 10: Hoare triple {23335#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23336#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:04:15,171 INFO L290 TraceCheckUtils]: 11: Hoare triple {23336#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23337#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:04:15,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {23337#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23338#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:04:15,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {23338#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23339#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:04:15,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {23339#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23340#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:04:15,173 INFO L290 TraceCheckUtils]: 15: Hoare triple {23340#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23341#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:04:15,173 INFO L290 TraceCheckUtils]: 16: Hoare triple {23341#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23342#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:04:15,174 INFO L290 TraceCheckUtils]: 17: Hoare triple {23342#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23343#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:04:15,174 INFO L290 TraceCheckUtils]: 18: Hoare triple {23343#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23344#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:04:15,175 INFO L290 TraceCheckUtils]: 19: Hoare triple {23344#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23345#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:04:15,175 INFO L290 TraceCheckUtils]: 20: Hoare triple {23345#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23346#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:04:15,176 INFO L290 TraceCheckUtils]: 21: Hoare triple {23346#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23347#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:04:15,176 INFO L290 TraceCheckUtils]: 22: Hoare triple {23347#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23348#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:04:15,176 INFO L290 TraceCheckUtils]: 23: Hoare triple {23348#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23349#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:04:15,177 INFO L290 TraceCheckUtils]: 24: Hoare triple {23349#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23350#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:04:15,177 INFO L290 TraceCheckUtils]: 25: Hoare triple {23350#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23351#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:04:15,178 INFO L290 TraceCheckUtils]: 26: Hoare triple {23351#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23352#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:04:15,178 INFO L290 TraceCheckUtils]: 27: Hoare triple {23352#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23353#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:04:15,179 INFO L290 TraceCheckUtils]: 28: Hoare triple {23353#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23354#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:04:15,179 INFO L290 TraceCheckUtils]: 29: Hoare triple {23354#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23355#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:04:15,180 INFO L290 TraceCheckUtils]: 30: Hoare triple {23355#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23356#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:04:15,180 INFO L290 TraceCheckUtils]: 31: Hoare triple {23356#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23357#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:04:15,181 INFO L290 TraceCheckUtils]: 32: Hoare triple {23357#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23358#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:04:15,181 INFO L290 TraceCheckUtils]: 33: Hoare triple {23358#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23359#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:04:15,181 INFO L290 TraceCheckUtils]: 34: Hoare triple {23359#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23360#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:04:15,182 INFO L290 TraceCheckUtils]: 35: Hoare triple {23360#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23361#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:04:15,182 INFO L290 TraceCheckUtils]: 36: Hoare triple {23361#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23362#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:04:15,183 INFO L290 TraceCheckUtils]: 37: Hoare triple {23362#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23363#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:04:15,183 INFO L290 TraceCheckUtils]: 38: Hoare triple {23363#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23364#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:04:15,184 INFO L290 TraceCheckUtils]: 39: Hoare triple {23364#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23365#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:04:15,184 INFO L290 TraceCheckUtils]: 40: Hoare triple {23365#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23366#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:04:15,185 INFO L290 TraceCheckUtils]: 41: Hoare triple {23366#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23367#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:04:15,185 INFO L290 TraceCheckUtils]: 42: Hoare triple {23367#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23368#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:04:15,186 INFO L290 TraceCheckUtils]: 43: Hoare triple {23368#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23369#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:04:15,186 INFO L290 TraceCheckUtils]: 44: Hoare triple {23369#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23370#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:04:15,187 INFO L290 TraceCheckUtils]: 45: Hoare triple {23370#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23371#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:04:15,187 INFO L290 TraceCheckUtils]: 46: Hoare triple {23371#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23372#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:04:15,188 INFO L290 TraceCheckUtils]: 47: Hoare triple {23372#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23373#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:04:15,188 INFO L290 TraceCheckUtils]: 48: Hoare triple {23373#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23374#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:04:15,188 INFO L290 TraceCheckUtils]: 49: Hoare triple {23374#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23375#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:04:15,189 INFO L290 TraceCheckUtils]: 50: Hoare triple {23375#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23531#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 03:04:15,189 INFO L290 TraceCheckUtils]: 51: Hoare triple {23531#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !(~x~0 % 4294967296 < 268435455); {23327#false} is VALID [2022-04-28 03:04:15,189 INFO L272 TraceCheckUtils]: 52: Hoare triple {23327#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {23327#false} is VALID [2022-04-28 03:04:15,190 INFO L290 TraceCheckUtils]: 53: Hoare triple {23327#false} ~cond := #in~cond; {23327#false} is VALID [2022-04-28 03:04:15,190 INFO L290 TraceCheckUtils]: 54: Hoare triple {23327#false} assume 0 == ~cond; {23327#false} is VALID [2022-04-28 03:04:15,190 INFO L290 TraceCheckUtils]: 55: Hoare triple {23327#false} assume !false; {23327#false} is VALID [2022-04-28 03:04:15,190 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:04:15,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:04:28,634 INFO L290 TraceCheckUtils]: 55: Hoare triple {23327#false} assume !false; {23327#false} is VALID [2022-04-28 03:04:28,634 INFO L290 TraceCheckUtils]: 54: Hoare triple {23327#false} assume 0 == ~cond; {23327#false} is VALID [2022-04-28 03:04:28,634 INFO L290 TraceCheckUtils]: 53: Hoare triple {23327#false} ~cond := #in~cond; {23327#false} is VALID [2022-04-28 03:04:28,634 INFO L272 TraceCheckUtils]: 52: Hoare triple {23327#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {23327#false} is VALID [2022-04-28 03:04:28,635 INFO L290 TraceCheckUtils]: 51: Hoare triple {23559#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {23327#false} is VALID [2022-04-28 03:04:28,635 INFO L290 TraceCheckUtils]: 50: Hoare triple {23563#(or (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23559#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:04:28,636 INFO L290 TraceCheckUtils]: 49: Hoare triple {23567#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23563#(or (not (< (mod main_~x~0 4294967296) 268435455)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} is VALID [2022-04-28 03:04:28,637 INFO L290 TraceCheckUtils]: 48: Hoare triple {23571#(or (< (mod (+ main_~x~0 6) 4294967296) 268435455) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23567#(or (not (< (mod (+ main_~x~0 2) 4294967296) 268435455)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} is VALID [2022-04-28 03:04:28,638 INFO L290 TraceCheckUtils]: 47: Hoare triple {23575#(or (not (< (mod (+ main_~x~0 6) 4294967296) 268435455)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23571#(or (< (mod (+ main_~x~0 6) 4294967296) 268435455) (not (< (mod (+ main_~x~0 4) 4294967296) 268435455)))} is VALID [2022-04-28 03:04:28,638 INFO L290 TraceCheckUtils]: 46: Hoare triple {23579#(or (not (< (mod (+ main_~x~0 8) 4294967296) 268435455)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23575#(or (not (< (mod (+ main_~x~0 6) 4294967296) 268435455)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} is VALID [2022-04-28 03:04:28,639 INFO L290 TraceCheckUtils]: 45: Hoare triple {23583#(or (not (< (mod (+ main_~x~0 10) 4294967296) 268435455)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23579#(or (not (< (mod (+ main_~x~0 8) 4294967296) 268435455)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} is VALID [2022-04-28 03:04:28,640 INFO L290 TraceCheckUtils]: 44: Hoare triple {23587#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (< (mod (+ main_~x~0 12) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23583#(or (not (< (mod (+ main_~x~0 10) 4294967296) 268435455)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} is VALID [2022-04-28 03:04:28,641 INFO L290 TraceCheckUtils]: 43: Hoare triple {23591#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (< (mod (+ main_~x~0 14) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23587#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (< (mod (+ main_~x~0 12) 4294967296) 268435455)))} is VALID [2022-04-28 03:04:28,642 INFO L290 TraceCheckUtils]: 42: Hoare triple {23595#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (< (mod (+ main_~x~0 16) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23591#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (< (mod (+ main_~x~0 14) 4294967296) 268435455)))} is VALID [2022-04-28 03:04:28,642 INFO L290 TraceCheckUtils]: 41: Hoare triple {23599#(or (not (< (mod (+ main_~x~0 18) 4294967296) 268435455)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23595#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (< (mod (+ main_~x~0 16) 4294967296) 268435455)))} is VALID [2022-04-28 03:04:28,643 INFO L290 TraceCheckUtils]: 40: Hoare triple {23603#(or (not (< (mod (+ main_~x~0 20) 4294967296) 268435455)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23599#(or (not (< (mod (+ main_~x~0 18) 4294967296) 268435455)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} is VALID [2022-04-28 03:04:28,644 INFO L290 TraceCheckUtils]: 39: Hoare triple {23607#(or (not (< (mod (+ main_~x~0 22) 4294967296) 268435455)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23603#(or (not (< (mod (+ main_~x~0 20) 4294967296) 268435455)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} is VALID [2022-04-28 03:04:28,645 INFO L290 TraceCheckUtils]: 38: Hoare triple {23611#(or (not (< (mod (+ main_~x~0 24) 4294967296) 268435455)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23607#(or (not (< (mod (+ main_~x~0 22) 4294967296) 268435455)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} is VALID [2022-04-28 03:04:28,645 INFO L290 TraceCheckUtils]: 37: Hoare triple {23615#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (< (mod (+ main_~x~0 26) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23611#(or (not (< (mod (+ main_~x~0 24) 4294967296) 268435455)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} is VALID [2022-04-28 03:04:28,646 INFO L290 TraceCheckUtils]: 36: Hoare triple {23619#(or (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (< (mod (+ main_~x~0 28) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23615#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (< (mod (+ main_~x~0 26) 4294967296) 268435455)))} is VALID [2022-04-28 03:04:28,647 INFO L290 TraceCheckUtils]: 35: Hoare triple {23623#(or (not (< (mod (+ 30 main_~x~0) 4294967296) 268435455)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23619#(or (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (< (mod (+ main_~x~0 28) 4294967296) 268435455)))} is VALID [2022-04-28 03:04:28,648 INFO L290 TraceCheckUtils]: 34: Hoare triple {23627#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (not (< (mod (+ 32 main_~x~0) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23623#(or (not (< (mod (+ 30 main_~x~0) 4294967296) 268435455)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:04:28,648 INFO L290 TraceCheckUtils]: 33: Hoare triple {23631#(or (not (< (mod (+ main_~x~0 34) 4294967296) 268435455)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23627#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (not (< (mod (+ 32 main_~x~0) 4294967296) 268435455)))} is VALID [2022-04-28 03:04:28,649 INFO L290 TraceCheckUtils]: 32: Hoare triple {23635#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (not (< (mod (+ main_~x~0 36) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23631#(or (not (< (mod (+ main_~x~0 34) 4294967296) 268435455)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} is VALID [2022-04-28 03:04:28,650 INFO L290 TraceCheckUtils]: 31: Hoare triple {23639#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (not (< (mod (+ main_~x~0 38) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23635#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (not (< (mod (+ main_~x~0 36) 4294967296) 268435455)))} is VALID [2022-04-28 03:04:28,651 INFO L290 TraceCheckUtils]: 30: Hoare triple {23643#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (not (< (mod (+ 40 main_~x~0) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23639#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (not (< (mod (+ main_~x~0 38) 4294967296) 268435455)))} is VALID [2022-04-28 03:04:28,651 INFO L290 TraceCheckUtils]: 29: Hoare triple {23647#(or (< (mod (+ 44 main_~x~0) 4294967296) 268435455) (not (< (mod (+ 42 main_~x~0) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23643#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (not (< (mod (+ 40 main_~x~0) 4294967296) 268435455)))} is VALID [2022-04-28 03:04:28,652 INFO L290 TraceCheckUtils]: 28: Hoare triple {23651#(or (not (< (mod (+ 44 main_~x~0) 4294967296) 268435455)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23647#(or (< (mod (+ 44 main_~x~0) 4294967296) 268435455) (not (< (mod (+ 42 main_~x~0) 4294967296) 268435455)))} is VALID [2022-04-28 03:04:28,653 INFO L290 TraceCheckUtils]: 27: Hoare triple {23655#(or (not (< (mod (+ main_~x~0 46) 4294967296) 268435455)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23651#(or (not (< (mod (+ 44 main_~x~0) 4294967296) 268435455)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} is VALID [2022-04-28 03:04:28,654 INFO L290 TraceCheckUtils]: 26: Hoare triple {23659#(or (not (< (mod (+ main_~x~0 48) 4294967296) 268435455)) (< (mod (+ main_~x~0 50) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23655#(or (not (< (mod (+ main_~x~0 46) 4294967296) 268435455)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} is VALID [2022-04-28 03:04:28,655 INFO L290 TraceCheckUtils]: 25: Hoare triple {23663#(or (not (< (mod (+ main_~x~0 50) 4294967296) 268435455)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23659#(or (not (< (mod (+ main_~x~0 48) 4294967296) 268435455)) (< (mod (+ main_~x~0 50) 4294967296) 268435455))} is VALID [2022-04-28 03:04:28,655 INFO L290 TraceCheckUtils]: 24: Hoare triple {23667#(or (not (< (mod (+ main_~x~0 52) 4294967296) 268435455)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23663#(or (not (< (mod (+ main_~x~0 50) 4294967296) 268435455)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} is VALID [2022-04-28 03:04:28,656 INFO L290 TraceCheckUtils]: 23: Hoare triple {23671#(or (not (< (mod (+ main_~x~0 54) 4294967296) 268435455)) (< (mod (+ 56 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23667#(or (not (< (mod (+ main_~x~0 52) 4294967296) 268435455)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} is VALID [2022-04-28 03:04:28,657 INFO L290 TraceCheckUtils]: 22: Hoare triple {23675#(or (not (< (mod (+ 56 main_~x~0) 4294967296) 268435455)) (< (mod (+ main_~x~0 58) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23671#(or (not (< (mod (+ main_~x~0 54) 4294967296) 268435455)) (< (mod (+ 56 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:04:28,658 INFO L290 TraceCheckUtils]: 21: Hoare triple {23679#(or (< (mod (+ main_~x~0 60) 4294967296) 268435455) (not (< (mod (+ main_~x~0 58) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23675#(or (not (< (mod (+ 56 main_~x~0) 4294967296) 268435455)) (< (mod (+ main_~x~0 58) 4294967296) 268435455))} is VALID [2022-04-28 03:04:28,658 INFO L290 TraceCheckUtils]: 20: Hoare triple {23683#(or (not (< (mod (+ main_~x~0 60) 4294967296) 268435455)) (< (mod (+ main_~x~0 62) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23679#(or (< (mod (+ main_~x~0 60) 4294967296) 268435455) (not (< (mod (+ main_~x~0 58) 4294967296) 268435455)))} is VALID [2022-04-28 03:04:28,659 INFO L290 TraceCheckUtils]: 19: Hoare triple {23687#(or (< (mod (+ 64 main_~x~0) 4294967296) 268435455) (not (< (mod (+ main_~x~0 62) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23683#(or (not (< (mod (+ main_~x~0 60) 4294967296) 268435455)) (< (mod (+ main_~x~0 62) 4294967296) 268435455))} is VALID [2022-04-28 03:04:28,660 INFO L290 TraceCheckUtils]: 18: Hoare triple {23691#(or (not (< (mod (+ 64 main_~x~0) 4294967296) 268435455)) (< (mod (+ 66 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23687#(or (< (mod (+ 64 main_~x~0) 4294967296) 268435455) (not (< (mod (+ main_~x~0 62) 4294967296) 268435455)))} is VALID [2022-04-28 03:04:28,661 INFO L290 TraceCheckUtils]: 17: Hoare triple {23695#(or (not (< (mod (+ 66 main_~x~0) 4294967296) 268435455)) (< (mod (+ 68 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23691#(or (not (< (mod (+ 64 main_~x~0) 4294967296) 268435455)) (< (mod (+ 66 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:04:28,662 INFO L290 TraceCheckUtils]: 16: Hoare triple {23699#(or (< (mod (+ main_~x~0 70) 4294967296) 268435455) (not (< (mod (+ 68 main_~x~0) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23695#(or (not (< (mod (+ 66 main_~x~0) 4294967296) 268435455)) (< (mod (+ 68 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:04:28,663 INFO L290 TraceCheckUtils]: 15: Hoare triple {23703#(or (not (< (mod (+ main_~x~0 70) 4294967296) 268435455)) (< (mod (+ 72 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23699#(or (< (mod (+ main_~x~0 70) 4294967296) 268435455) (not (< (mod (+ 68 main_~x~0) 4294967296) 268435455)))} is VALID [2022-04-28 03:04:28,663 INFO L290 TraceCheckUtils]: 14: Hoare triple {23707#(or (not (< (mod (+ 72 main_~x~0) 4294967296) 268435455)) (< (mod (+ main_~x~0 74) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23703#(or (not (< (mod (+ main_~x~0 70) 4294967296) 268435455)) (< (mod (+ 72 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:04:28,664 INFO L290 TraceCheckUtils]: 13: Hoare triple {23711#(or (not (< (mod (+ main_~x~0 74) 4294967296) 268435455)) (< (mod (+ 76 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23707#(or (not (< (mod (+ 72 main_~x~0) 4294967296) 268435455)) (< (mod (+ main_~x~0 74) 4294967296) 268435455))} is VALID [2022-04-28 03:04:28,665 INFO L290 TraceCheckUtils]: 12: Hoare triple {23715#(or (< (mod (+ main_~x~0 78) 4294967296) 268435455) (not (< (mod (+ 76 main_~x~0) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23711#(or (not (< (mod (+ main_~x~0 74) 4294967296) 268435455)) (< (mod (+ 76 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:04:28,666 INFO L290 TraceCheckUtils]: 11: Hoare triple {23719#(or (not (< (mod (+ main_~x~0 78) 4294967296) 268435455)) (< (mod (+ main_~x~0 80) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23715#(or (< (mod (+ main_~x~0 78) 4294967296) 268435455) (not (< (mod (+ 76 main_~x~0) 4294967296) 268435455)))} is VALID [2022-04-28 03:04:28,666 INFO L290 TraceCheckUtils]: 10: Hoare triple {23723#(or (< (mod (+ main_~x~0 82) 4294967296) 268435455) (not (< (mod (+ main_~x~0 80) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23719#(or (not (< (mod (+ main_~x~0 78) 4294967296) 268435455)) (< (mod (+ main_~x~0 80) 4294967296) 268435455))} is VALID [2022-04-28 03:04:28,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {23727#(or (< (mod (+ 84 main_~x~0) 4294967296) 268435455) (not (< (mod (+ main_~x~0 82) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23723#(or (< (mod (+ main_~x~0 82) 4294967296) 268435455) (not (< (mod (+ main_~x~0 80) 4294967296) 268435455)))} is VALID [2022-04-28 03:04:28,668 INFO L290 TraceCheckUtils]: 8: Hoare triple {23731#(or (< (mod (+ main_~x~0 86) 4294967296) 268435455) (not (< (mod (+ 84 main_~x~0) 4294967296) 268435455)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23727#(or (< (mod (+ 84 main_~x~0) 4294967296) 268435455) (not (< (mod (+ main_~x~0 82) 4294967296) 268435455)))} is VALID [2022-04-28 03:04:28,669 INFO L290 TraceCheckUtils]: 7: Hoare triple {23735#(or (not (< (mod (+ main_~x~0 86) 4294967296) 268435455)) (< (mod (+ 88 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23731#(or (< (mod (+ main_~x~0 86) 4294967296) 268435455) (not (< (mod (+ 84 main_~x~0) 4294967296) 268435455)))} is VALID [2022-04-28 03:04:28,669 INFO L290 TraceCheckUtils]: 6: Hoare triple {23739#(or (not (< (mod (+ 88 main_~x~0) 4294967296) 268435455)) (< (mod (+ main_~x~0 90) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {23735#(or (not (< (mod (+ main_~x~0 86) 4294967296) 268435455)) (< (mod (+ 88 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:04:28,670 INFO L290 TraceCheckUtils]: 5: Hoare triple {23326#true} ~x~0 := 0; {23739#(or (not (< (mod (+ 88 main_~x~0) 4294967296) 268435455)) (< (mod (+ main_~x~0 90) 4294967296) 268435455))} is VALID [2022-04-28 03:04:28,670 INFO L272 TraceCheckUtils]: 4: Hoare triple {23326#true} call #t~ret4 := main(); {23326#true} is VALID [2022-04-28 03:04:28,670 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23326#true} {23326#true} #34#return; {23326#true} is VALID [2022-04-28 03:04:28,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {23326#true} assume true; {23326#true} is VALID [2022-04-28 03:04:28,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {23326#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {23326#true} is VALID [2022-04-28 03:04:28,670 INFO L272 TraceCheckUtils]: 0: Hoare triple {23326#true} call ULTIMATE.init(); {23326#true} is VALID [2022-04-28 03:04:28,671 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:04:28,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323213983] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:04:28,671 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:04:28,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48, 48] total 96 [2022-04-28 03:04:28,671 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:04:28,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1409691268] [2022-04-28 03:04:28,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1409691268] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:04:28,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:04:28,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2022-04-28 03:04:28,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194430645] [2022-04-28 03:04:28,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:04:28,672 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:04:28,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:04:28,672 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:04:28,708 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:28,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-04-28 03:04:28,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:04:28,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-04-28 03:04:28,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2397, Invalid=6723, Unknown=0, NotChecked=0, Total=9120 [2022-04-28 03:04:28,709 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:04:32,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:04:32,673 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2022-04-28 03:04:32,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-28 03:04:32,673 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:04:32,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:04:32,673 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:04:32,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2022-04-28 03:04:32,674 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:04:32,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2022-04-28 03:04:32,675 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 63 transitions. [2022-04-28 03:04:32,713 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:04:32,714 INFO L225 Difference]: With dead ends: 63 [2022-04-28 03:04:32,714 INFO L226 Difference]: Without dead ends: 58 [2022-04-28 03:04:32,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1131 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=4787, Invalid=15235, Unknown=0, NotChecked=0, Total=20022 [2022-04-28 03:04:32,715 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 2242 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 2335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 2242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:04:32,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 183 Invalid, 2335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 2242 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-28 03:04:32,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-28 03:04:32,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-04-28 03:04:32,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:04:32,779 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:04:32,779 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:04:32,780 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:04:32,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:04:32,780 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-28 03:04:32,780 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-28 03:04:32,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:04:32,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:04:32,780 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:04:32,781 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:04:32,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:04:32,787 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2022-04-28 03:04:32,787 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-28 03:04:32,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:04:32,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:04:32,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:04:32,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:04:32,789 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:04:32,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2022-04-28 03:04:32,790 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2022-04-28 03:04:32,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:04:32,790 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2022-04-28 03:04:32,790 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:04:32,790 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 58 transitions. [2022-04-28 03:04:32,829 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:32,829 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2022-04-28 03:04:32,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-28 03:04:32,830 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:04:32,830 INFO L195 NwaCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:04:32,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Ended with exit code 0 [2022-04-28 03:04:33,035 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:04:33,230 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:04:33,230 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:04:33,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:04:33,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1947289956, now seen corresponding path program 91 times [2022-04-28 03:04:33,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:04:33,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [189633466] [2022-04-28 03:04:33,408 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:33,410 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:04:33,411 INFO L85 PathProgramCache]: Analyzing trace with hash 792432695, now seen corresponding path program 1 times [2022-04-28 03:04:33,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:04:33,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223405704] [2022-04-28 03:04:33,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:04:33,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:04:33,415 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_46.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_46.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:04:33,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:04:33,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2056262944] [2022-04-28 03:04:33,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:04:33,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:04:33,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:04:33,418 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:04:33,423 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:04:33,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:04:33,459 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:04:33,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:04:33,466 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:04:33,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1947289956, now seen corresponding path program 92 times [2022-04-28 03:04:33,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:04:33,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839071477] [2022-04-28 03:04:33,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:04:33,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:04:33,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:04:34,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:04:34,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:04:34,496 INFO L290 TraceCheckUtils]: 0: Hoare triple {24262#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {24210#true} is VALID [2022-04-28 03:04:34,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {24210#true} assume true; {24210#true} is VALID [2022-04-28 03:04:34,496 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24210#true} {24210#true} #34#return; {24210#true} is VALID [2022-04-28 03:04:34,498 INFO L272 TraceCheckUtils]: 0: Hoare triple {24210#true} call ULTIMATE.init(); {24262#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:04:34,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {24262#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {24210#true} is VALID [2022-04-28 03:04:34,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {24210#true} assume true; {24210#true} is VALID [2022-04-28 03:04:34,498 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24210#true} {24210#true} #34#return; {24210#true} is VALID [2022-04-28 03:04:34,498 INFO L272 TraceCheckUtils]: 4: Hoare triple {24210#true} call #t~ret4 := main(); {24210#true} is VALID [2022-04-28 03:04:34,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {24210#true} ~x~0 := 0; {24215#(= main_~x~0 0)} is VALID [2022-04-28 03:04:34,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {24215#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24216#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:04:34,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {24216#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24217#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:04:34,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {24217#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24218#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:04:34,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {24218#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24219#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:04:34,500 INFO L290 TraceCheckUtils]: 10: Hoare triple {24219#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24220#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:04:34,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {24220#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24221#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:04:34,501 INFO L290 TraceCheckUtils]: 12: Hoare triple {24221#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24222#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:04:34,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {24222#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24223#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:04:34,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {24223#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24224#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:04:34,503 INFO L290 TraceCheckUtils]: 15: Hoare triple {24224#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24225#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:04:34,503 INFO L290 TraceCheckUtils]: 16: Hoare triple {24225#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24226#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:04:34,503 INFO L290 TraceCheckUtils]: 17: Hoare triple {24226#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24227#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:04:34,504 INFO L290 TraceCheckUtils]: 18: Hoare triple {24227#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24228#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:04:34,504 INFO L290 TraceCheckUtils]: 19: Hoare triple {24228#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24229#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:04:34,505 INFO L290 TraceCheckUtils]: 20: Hoare triple {24229#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24230#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:04:34,505 INFO L290 TraceCheckUtils]: 21: Hoare triple {24230#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24231#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:04:34,506 INFO L290 TraceCheckUtils]: 22: Hoare triple {24231#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24232#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:04:34,506 INFO L290 TraceCheckUtils]: 23: Hoare triple {24232#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24233#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:04:34,507 INFO L290 TraceCheckUtils]: 24: Hoare triple {24233#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24234#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:04:34,507 INFO L290 TraceCheckUtils]: 25: Hoare triple {24234#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24235#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:04:34,508 INFO L290 TraceCheckUtils]: 26: Hoare triple {24235#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24236#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:04:34,508 INFO L290 TraceCheckUtils]: 27: Hoare triple {24236#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24237#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:04:34,508 INFO L290 TraceCheckUtils]: 28: Hoare triple {24237#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24238#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:04:34,509 INFO L290 TraceCheckUtils]: 29: Hoare triple {24238#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24239#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:04:34,509 INFO L290 TraceCheckUtils]: 30: Hoare triple {24239#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24240#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:04:34,510 INFO L290 TraceCheckUtils]: 31: Hoare triple {24240#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24241#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:04:34,510 INFO L290 TraceCheckUtils]: 32: Hoare triple {24241#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24242#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:04:34,511 INFO L290 TraceCheckUtils]: 33: Hoare triple {24242#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24243#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:04:34,511 INFO L290 TraceCheckUtils]: 34: Hoare triple {24243#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24244#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:04:34,512 INFO L290 TraceCheckUtils]: 35: Hoare triple {24244#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24245#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:04:34,512 INFO L290 TraceCheckUtils]: 36: Hoare triple {24245#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24246#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:04:34,513 INFO L290 TraceCheckUtils]: 37: Hoare triple {24246#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24247#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:04:34,513 INFO L290 TraceCheckUtils]: 38: Hoare triple {24247#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24248#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:04:34,513 INFO L290 TraceCheckUtils]: 39: Hoare triple {24248#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24249#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:04:34,514 INFO L290 TraceCheckUtils]: 40: Hoare triple {24249#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24250#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:04:34,514 INFO L290 TraceCheckUtils]: 41: Hoare triple {24250#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24251#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:04:34,515 INFO L290 TraceCheckUtils]: 42: Hoare triple {24251#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24252#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:04:34,515 INFO L290 TraceCheckUtils]: 43: Hoare triple {24252#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24253#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:04:34,516 INFO L290 TraceCheckUtils]: 44: Hoare triple {24253#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24254#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:04:34,516 INFO L290 TraceCheckUtils]: 45: Hoare triple {24254#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24255#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:04:34,517 INFO L290 TraceCheckUtils]: 46: Hoare triple {24255#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24256#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:04:34,517 INFO L290 TraceCheckUtils]: 47: Hoare triple {24256#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24257#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:04:34,518 INFO L290 TraceCheckUtils]: 48: Hoare triple {24257#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24258#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:04:34,518 INFO L290 TraceCheckUtils]: 49: Hoare triple {24258#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24259#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:04:34,519 INFO L290 TraceCheckUtils]: 50: Hoare triple {24259#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24260#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 03:04:34,519 INFO L290 TraceCheckUtils]: 51: Hoare triple {24260#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24261#(and (<= main_~x~0 92) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:04:34,519 INFO L290 TraceCheckUtils]: 52: Hoare triple {24261#(and (<= main_~x~0 92) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {24211#false} is VALID [2022-04-28 03:04:34,520 INFO L272 TraceCheckUtils]: 53: Hoare triple {24211#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {24211#false} is VALID [2022-04-28 03:04:34,520 INFO L290 TraceCheckUtils]: 54: Hoare triple {24211#false} ~cond := #in~cond; {24211#false} is VALID [2022-04-28 03:04:34,520 INFO L290 TraceCheckUtils]: 55: Hoare triple {24211#false} assume 0 == ~cond; {24211#false} is VALID [2022-04-28 03:04:34,520 INFO L290 TraceCheckUtils]: 56: Hoare triple {24211#false} assume !false; {24211#false} is VALID [2022-04-28 03:04:34,520 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:04:34,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:04:34,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839071477] [2022-04-28 03:04:34,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839071477] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:04:34,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628724256] [2022-04-28 03:04:34,520 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:04:34,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:04:34,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:04:34,521 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:04:34,529 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:04:34,587 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:04:34,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:04:34,589 WARN L261 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 95 conjunts are in the unsatisfiable core [2022-04-28 03:04:34,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:04:34,599 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:04:35,090 INFO L272 TraceCheckUtils]: 0: Hoare triple {24210#true} call ULTIMATE.init(); {24210#true} is VALID [2022-04-28 03:04:35,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {24210#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {24210#true} is VALID [2022-04-28 03:04:35,091 INFO L290 TraceCheckUtils]: 2: Hoare triple {24210#true} assume true; {24210#true} is VALID [2022-04-28 03:04:35,091 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24210#true} {24210#true} #34#return; {24210#true} is VALID [2022-04-28 03:04:35,091 INFO L272 TraceCheckUtils]: 4: Hoare triple {24210#true} call #t~ret4 := main(); {24210#true} is VALID [2022-04-28 03:04:35,091 INFO L290 TraceCheckUtils]: 5: Hoare triple {24210#true} ~x~0 := 0; {24215#(= main_~x~0 0)} is VALID [2022-04-28 03:04:35,091 INFO L290 TraceCheckUtils]: 6: Hoare triple {24215#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24216#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:04:35,092 INFO L290 TraceCheckUtils]: 7: Hoare triple {24216#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24217#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:04:35,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {24217#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24218#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:04:35,093 INFO L290 TraceCheckUtils]: 9: Hoare triple {24218#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24219#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:04:35,093 INFO L290 TraceCheckUtils]: 10: Hoare triple {24219#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24220#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:04:35,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {24220#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24221#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:04:35,094 INFO L290 TraceCheckUtils]: 12: Hoare triple {24221#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24222#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:04:35,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {24222#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24223#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:04:35,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {24223#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24224#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:04:35,095 INFO L290 TraceCheckUtils]: 15: Hoare triple {24224#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24225#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:04:35,096 INFO L290 TraceCheckUtils]: 16: Hoare triple {24225#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24226#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:04:35,096 INFO L290 TraceCheckUtils]: 17: Hoare triple {24226#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24227#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:04:35,097 INFO L290 TraceCheckUtils]: 18: Hoare triple {24227#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24228#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:04:35,097 INFO L290 TraceCheckUtils]: 19: Hoare triple {24228#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24229#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:04:35,098 INFO L290 TraceCheckUtils]: 20: Hoare triple {24229#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24230#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:04:35,098 INFO L290 TraceCheckUtils]: 21: Hoare triple {24230#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24231#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:04:35,099 INFO L290 TraceCheckUtils]: 22: Hoare triple {24231#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24232#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:04:35,099 INFO L290 TraceCheckUtils]: 23: Hoare triple {24232#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24233#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:04:35,100 INFO L290 TraceCheckUtils]: 24: Hoare triple {24233#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24234#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:04:35,100 INFO L290 TraceCheckUtils]: 25: Hoare triple {24234#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24235#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:04:35,101 INFO L290 TraceCheckUtils]: 26: Hoare triple {24235#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24236#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:04:35,101 INFO L290 TraceCheckUtils]: 27: Hoare triple {24236#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24237#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:04:35,101 INFO L290 TraceCheckUtils]: 28: Hoare triple {24237#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24238#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:04:35,102 INFO L290 TraceCheckUtils]: 29: Hoare triple {24238#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24239#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:04:35,102 INFO L290 TraceCheckUtils]: 30: Hoare triple {24239#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24240#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:04:35,103 INFO L290 TraceCheckUtils]: 31: Hoare triple {24240#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24241#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:04:35,103 INFO L290 TraceCheckUtils]: 32: Hoare triple {24241#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24242#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:04:35,104 INFO L290 TraceCheckUtils]: 33: Hoare triple {24242#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24243#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:04:35,104 INFO L290 TraceCheckUtils]: 34: Hoare triple {24243#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24244#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:04:35,105 INFO L290 TraceCheckUtils]: 35: Hoare triple {24244#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24245#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:04:35,105 INFO L290 TraceCheckUtils]: 36: Hoare triple {24245#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24246#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:04:35,106 INFO L290 TraceCheckUtils]: 37: Hoare triple {24246#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24247#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:04:35,106 INFO L290 TraceCheckUtils]: 38: Hoare triple {24247#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24248#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:04:35,107 INFO L290 TraceCheckUtils]: 39: Hoare triple {24248#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24249#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:04:35,107 INFO L290 TraceCheckUtils]: 40: Hoare triple {24249#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24250#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:04:35,107 INFO L290 TraceCheckUtils]: 41: Hoare triple {24250#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24251#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:04:35,108 INFO L290 TraceCheckUtils]: 42: Hoare triple {24251#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24252#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:04:35,108 INFO L290 TraceCheckUtils]: 43: Hoare triple {24252#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24253#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:04:35,109 INFO L290 TraceCheckUtils]: 44: Hoare triple {24253#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24254#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:04:35,109 INFO L290 TraceCheckUtils]: 45: Hoare triple {24254#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24255#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:04:35,110 INFO L290 TraceCheckUtils]: 46: Hoare triple {24255#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24256#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:04:35,110 INFO L290 TraceCheckUtils]: 47: Hoare triple {24256#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24257#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:04:35,111 INFO L290 TraceCheckUtils]: 48: Hoare triple {24257#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24258#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:04:35,111 INFO L290 TraceCheckUtils]: 49: Hoare triple {24258#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24259#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:04:35,112 INFO L290 TraceCheckUtils]: 50: Hoare triple {24259#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24260#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 03:04:35,112 INFO L290 TraceCheckUtils]: 51: Hoare triple {24260#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24419#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 03:04:35,112 INFO L290 TraceCheckUtils]: 52: Hoare triple {24419#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {24211#false} is VALID [2022-04-28 03:04:35,113 INFO L272 TraceCheckUtils]: 53: Hoare triple {24211#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {24211#false} is VALID [2022-04-28 03:04:35,113 INFO L290 TraceCheckUtils]: 54: Hoare triple {24211#false} ~cond := #in~cond; {24211#false} is VALID [2022-04-28 03:04:35,113 INFO L290 TraceCheckUtils]: 55: Hoare triple {24211#false} assume 0 == ~cond; {24211#false} is VALID [2022-04-28 03:04:35,113 INFO L290 TraceCheckUtils]: 56: Hoare triple {24211#false} assume !false; {24211#false} is VALID [2022-04-28 03:04:35,113 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:04:35,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:04:38,241 INFO L290 TraceCheckUtils]: 56: Hoare triple {24211#false} assume !false; {24211#false} is VALID [2022-04-28 03:04:38,242 INFO L290 TraceCheckUtils]: 55: Hoare triple {24211#false} assume 0 == ~cond; {24211#false} is VALID [2022-04-28 03:04:38,242 INFO L290 TraceCheckUtils]: 54: Hoare triple {24211#false} ~cond := #in~cond; {24211#false} is VALID [2022-04-28 03:04:38,242 INFO L272 TraceCheckUtils]: 53: Hoare triple {24211#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {24211#false} is VALID [2022-04-28 03:04:38,242 INFO L290 TraceCheckUtils]: 52: Hoare triple {24447#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {24211#false} is VALID [2022-04-28 03:04:38,243 INFO L290 TraceCheckUtils]: 51: Hoare triple {24451#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24447#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:04:38,243 INFO L290 TraceCheckUtils]: 50: Hoare triple {24455#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24451#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 03:04:38,244 INFO L290 TraceCheckUtils]: 49: Hoare triple {24459#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24455#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 03:04:38,246 INFO L290 TraceCheckUtils]: 48: Hoare triple {24463#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24459#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 03:04:38,247 INFO L290 TraceCheckUtils]: 47: Hoare triple {24467#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24463#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 03:04:38,248 INFO L290 TraceCheckUtils]: 46: Hoare triple {24471#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24467#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-28 03:04:38,248 INFO L290 TraceCheckUtils]: 45: Hoare triple {24475#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24471#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-28 03:04:38,249 INFO L290 TraceCheckUtils]: 44: Hoare triple {24479#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24475#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-28 03:04:38,249 INFO L290 TraceCheckUtils]: 43: Hoare triple {24483#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24479#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-28 03:04:38,250 INFO L290 TraceCheckUtils]: 42: Hoare triple {24487#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24483#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-28 03:04:38,250 INFO L290 TraceCheckUtils]: 41: Hoare triple {24491#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24487#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-28 03:04:38,251 INFO L290 TraceCheckUtils]: 40: Hoare triple {24495#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24491#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-28 03:04:38,252 INFO L290 TraceCheckUtils]: 39: Hoare triple {24499#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24495#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-28 03:04:38,252 INFO L290 TraceCheckUtils]: 38: Hoare triple {24503#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24499#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-28 03:04:38,253 INFO L290 TraceCheckUtils]: 37: Hoare triple {24507#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24503#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-28 03:04:38,253 INFO L290 TraceCheckUtils]: 36: Hoare triple {24511#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24507#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:04:38,254 INFO L290 TraceCheckUtils]: 35: Hoare triple {24515#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24511#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:04:38,255 INFO L290 TraceCheckUtils]: 34: Hoare triple {24519#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24515#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-28 03:04:38,255 INFO L290 TraceCheckUtils]: 33: Hoare triple {24523#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24519#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-28 03:04:38,256 INFO L290 TraceCheckUtils]: 32: Hoare triple {24527#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24523#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-28 03:04:38,256 INFO L290 TraceCheckUtils]: 31: Hoare triple {24531#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24527#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:04:38,257 INFO L290 TraceCheckUtils]: 30: Hoare triple {24535#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24531#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:04:38,257 INFO L290 TraceCheckUtils]: 29: Hoare triple {24539#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24535#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:04:38,258 INFO L290 TraceCheckUtils]: 28: Hoare triple {24543#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24539#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-28 03:04:38,259 INFO L290 TraceCheckUtils]: 27: Hoare triple {24547#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24543#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-28 03:04:38,259 INFO L290 TraceCheckUtils]: 26: Hoare triple {24551#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24547#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-28 03:04:38,260 INFO L290 TraceCheckUtils]: 25: Hoare triple {24555#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24551#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-28 03:04:38,260 INFO L290 TraceCheckUtils]: 24: Hoare triple {24559#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24555#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-28 03:04:38,261 INFO L290 TraceCheckUtils]: 23: Hoare triple {24563#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24559#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:04:38,261 INFO L290 TraceCheckUtils]: 22: Hoare triple {24567#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24563#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-28 03:04:38,262 INFO L290 TraceCheckUtils]: 21: Hoare triple {24571#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24567#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-28 03:04:38,263 INFO L290 TraceCheckUtils]: 20: Hoare triple {24575#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24571#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-28 03:04:38,263 INFO L290 TraceCheckUtils]: 19: Hoare triple {24579#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24575#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:04:38,264 INFO L290 TraceCheckUtils]: 18: Hoare triple {24583#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24579#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:04:38,264 INFO L290 TraceCheckUtils]: 17: Hoare triple {24587#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24583#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:04:38,265 INFO L290 TraceCheckUtils]: 16: Hoare triple {24591#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24587#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} is VALID [2022-04-28 03:04:38,266 INFO L290 TraceCheckUtils]: 15: Hoare triple {24595#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24591#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:04:38,266 INFO L290 TraceCheckUtils]: 14: Hoare triple {24599#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24595#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} is VALID [2022-04-28 03:04:38,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {24603#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24599#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:04:38,267 INFO L290 TraceCheckUtils]: 12: Hoare triple {24607#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24603#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} is VALID [2022-04-28 03:04:38,268 INFO L290 TraceCheckUtils]: 11: Hoare triple {24611#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24607#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} is VALID [2022-04-28 03:04:38,268 INFO L290 TraceCheckUtils]: 10: Hoare triple {24615#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24611#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} is VALID [2022-04-28 03:04:38,269 INFO L290 TraceCheckUtils]: 9: Hoare triple {24619#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24615#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:04:38,269 INFO L290 TraceCheckUtils]: 8: Hoare triple {24623#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24619#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} is VALID [2022-04-28 03:04:38,270 INFO L290 TraceCheckUtils]: 7: Hoare triple {24627#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24623#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:04:38,271 INFO L290 TraceCheckUtils]: 6: Hoare triple {24631#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {24627#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} is VALID [2022-04-28 03:04:38,271 INFO L290 TraceCheckUtils]: 5: Hoare triple {24210#true} ~x~0 := 0; {24631#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:04:38,271 INFO L272 TraceCheckUtils]: 4: Hoare triple {24210#true} call #t~ret4 := main(); {24210#true} is VALID [2022-04-28 03:04:38,271 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24210#true} {24210#true} #34#return; {24210#true} is VALID [2022-04-28 03:04:38,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {24210#true} assume true; {24210#true} is VALID [2022-04-28 03:04:38,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {24210#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {24210#true} is VALID [2022-04-28 03:04:38,271 INFO L272 TraceCheckUtils]: 0: Hoare triple {24210#true} call ULTIMATE.init(); {24210#true} is VALID [2022-04-28 03:04:38,272 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:04:38,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628724256] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:04:38,272 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:04:38,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49, 49] total 98 [2022-04-28 03:04:38,272 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:04:38,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [189633466] [2022-04-28 03:04:38,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [189633466] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:04:38,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:04:38,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2022-04-28 03:04:38,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400005935] [2022-04-28 03:04:38,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:04:38,273 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:04:38,273 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:04:38,273 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:04:38,301 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:38,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-28 03:04:38,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:04:38,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-28 03:04:38,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2496, Invalid=7010, Unknown=0, NotChecked=0, Total=9506 [2022-04-28 03:04:38,302 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:04:42,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:04:42,203 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2022-04-28 03:04:42,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-04-28 03:04:42,204 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:04:42,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:04:42,204 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:04:42,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-04-28 03:04:42,204 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:04:42,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-04-28 03:04:42,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 64 transitions. [2022-04-28 03:04:42,251 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:04:42,251 INFO L225 Difference]: With dead ends: 64 [2022-04-28 03:04:42,251 INFO L226 Difference]: Without dead ends: 59 [2022-04-28 03:04:42,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1179 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=4985, Invalid=15895, Unknown=0, NotChecked=0, Total=20880 [2022-04-28 03:04:42,253 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 2189 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 2284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 2189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:04:42,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 38 Invalid, 2284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 2189 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-28 03:04:42,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-28 03:04:42,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-04-28 03:04:42,308 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:04:42,308 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:04:42,308 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:04:42,308 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:04:42,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:04:42,309 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2022-04-28 03:04:42,309 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2022-04-28 03:04:42,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:04:42,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:04:42,309 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:04:42,309 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:04:42,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:04:42,310 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2022-04-28 03:04:42,310 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2022-04-28 03:04:42,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:04:42,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:04:42,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:04:42,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:04:42,310 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:04:42,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2022-04-28 03:04:42,315 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2022-04-28 03:04:42,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:04:42,315 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2022-04-28 03:04:42,316 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:04:42,316 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 59 transitions. [2022-04-28 03:04:42,358 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:42,358 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2022-04-28 03:04:42,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-28 03:04:42,358 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:04:42,358 INFO L195 NwaCegarLoop]: trace histogram [47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:04:42,364 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:04:42,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Forceful destruction successful, exit code 0 [2022-04-28 03:04:42,761 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:04:42,762 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:04:42,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:04:42,762 INFO L85 PathProgramCache]: Analyzing trace with hash -199985226, now seen corresponding path program 93 times [2022-04-28 03:04:42,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:04:42,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1346750062] [2022-04-28 03:04:42,895 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:04:42,896 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:04:42,898 INFO L85 PathProgramCache]: Analyzing trace with hash 851538039, now seen corresponding path program 1 times [2022-04-28 03:04:42,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:04:42,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469905580] [2022-04-28 03:04:42,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:04:42,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:04:42,902 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 2) .v_it_47.0) (* (- 1) main_~x~0_5) (* 4294967296 (div (+ (* 2 .v_it_47.0) main_~x~0_5) 4294967296)) 268435455) 0)) [2022-04-28 03:04:42,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:04:42,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1808397790] [2022-04-28 03:04:42,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:04:42,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:04:42,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:04:42,905 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:04:42,905 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:04:42,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:04:42,942 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:04:42,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:04:42,948 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:04:42,949 INFO L85 PathProgramCache]: Analyzing trace with hash -199985226, now seen corresponding path program 94 times [2022-04-28 03:04:42,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:04:42,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993221221] [2022-04-28 03:04:42,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:04:42,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:04:42,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:04:44,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:04:44,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:04:44,067 INFO L290 TraceCheckUtils]: 0: Hoare triple {25163#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {25110#true} is VALID [2022-04-28 03:04:44,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {25110#true} assume true; {25110#true} is VALID [2022-04-28 03:04:44,068 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25110#true} {25110#true} #34#return; {25110#true} is VALID [2022-04-28 03:04:44,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {25110#true} call ULTIMATE.init(); {25163#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:04:44,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {25163#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {25110#true} is VALID [2022-04-28 03:04:44,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {25110#true} assume true; {25110#true} is VALID [2022-04-28 03:04:44,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25110#true} {25110#true} #34#return; {25110#true} is VALID [2022-04-28 03:04:44,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {25110#true} call #t~ret4 := main(); {25110#true} is VALID [2022-04-28 03:04:44,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {25110#true} ~x~0 := 0; {25115#(= main_~x~0 0)} is VALID [2022-04-28 03:04:44,069 INFO L290 TraceCheckUtils]: 6: Hoare triple {25115#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25116#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:04:44,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {25116#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25117#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:04:44,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {25117#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25118#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:04:44,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {25118#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25119#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:04:44,071 INFO L290 TraceCheckUtils]: 10: Hoare triple {25119#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25120#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:04:44,071 INFO L290 TraceCheckUtils]: 11: Hoare triple {25120#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25121#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:04:44,072 INFO L290 TraceCheckUtils]: 12: Hoare triple {25121#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25122#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:04:44,072 INFO L290 TraceCheckUtils]: 13: Hoare triple {25122#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25123#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:04:44,073 INFO L290 TraceCheckUtils]: 14: Hoare triple {25123#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25124#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:04:44,073 INFO L290 TraceCheckUtils]: 15: Hoare triple {25124#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25125#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:04:44,073 INFO L290 TraceCheckUtils]: 16: Hoare triple {25125#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25126#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:04:44,074 INFO L290 TraceCheckUtils]: 17: Hoare triple {25126#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25127#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:04:44,074 INFO L290 TraceCheckUtils]: 18: Hoare triple {25127#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25128#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:04:44,075 INFO L290 TraceCheckUtils]: 19: Hoare triple {25128#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25129#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:04:44,075 INFO L290 TraceCheckUtils]: 20: Hoare triple {25129#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25130#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:04:44,076 INFO L290 TraceCheckUtils]: 21: Hoare triple {25130#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25131#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:04:44,076 INFO L290 TraceCheckUtils]: 22: Hoare triple {25131#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25132#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:04:44,077 INFO L290 TraceCheckUtils]: 23: Hoare triple {25132#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25133#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:04:44,077 INFO L290 TraceCheckUtils]: 24: Hoare triple {25133#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25134#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:04:44,078 INFO L290 TraceCheckUtils]: 25: Hoare triple {25134#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25135#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:04:44,078 INFO L290 TraceCheckUtils]: 26: Hoare triple {25135#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25136#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:04:44,079 INFO L290 TraceCheckUtils]: 27: Hoare triple {25136#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25137#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:04:44,079 INFO L290 TraceCheckUtils]: 28: Hoare triple {25137#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25138#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:04:44,080 INFO L290 TraceCheckUtils]: 29: Hoare triple {25138#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25139#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:04:44,080 INFO L290 TraceCheckUtils]: 30: Hoare triple {25139#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25140#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:04:44,080 INFO L290 TraceCheckUtils]: 31: Hoare triple {25140#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25141#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:04:44,081 INFO L290 TraceCheckUtils]: 32: Hoare triple {25141#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25142#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:04:44,081 INFO L290 TraceCheckUtils]: 33: Hoare triple {25142#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25143#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:04:44,082 INFO L290 TraceCheckUtils]: 34: Hoare triple {25143#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25144#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:04:44,082 INFO L290 TraceCheckUtils]: 35: Hoare triple {25144#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25145#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:04:44,083 INFO L290 TraceCheckUtils]: 36: Hoare triple {25145#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25146#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:04:44,083 INFO L290 TraceCheckUtils]: 37: Hoare triple {25146#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25147#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:04:44,084 INFO L290 TraceCheckUtils]: 38: Hoare triple {25147#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25148#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:04:44,084 INFO L290 TraceCheckUtils]: 39: Hoare triple {25148#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25149#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:04:44,084 INFO L290 TraceCheckUtils]: 40: Hoare triple {25149#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25150#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:04:44,085 INFO L290 TraceCheckUtils]: 41: Hoare triple {25150#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25151#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:04:44,085 INFO L290 TraceCheckUtils]: 42: Hoare triple {25151#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25152#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:04:44,086 INFO L290 TraceCheckUtils]: 43: Hoare triple {25152#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25153#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:04:44,086 INFO L290 TraceCheckUtils]: 44: Hoare triple {25153#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25154#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:04:44,087 INFO L290 TraceCheckUtils]: 45: Hoare triple {25154#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25155#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:04:44,087 INFO L290 TraceCheckUtils]: 46: Hoare triple {25155#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25156#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:04:44,088 INFO L290 TraceCheckUtils]: 47: Hoare triple {25156#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25157#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:04:44,088 INFO L290 TraceCheckUtils]: 48: Hoare triple {25157#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25158#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:04:44,089 INFO L290 TraceCheckUtils]: 49: Hoare triple {25158#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25159#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:04:44,089 INFO L290 TraceCheckUtils]: 50: Hoare triple {25159#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25160#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 03:04:44,089 INFO L290 TraceCheckUtils]: 51: Hoare triple {25160#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25161#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 03:04:44,090 INFO L290 TraceCheckUtils]: 52: Hoare triple {25161#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25162#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 94))} is VALID [2022-04-28 03:04:44,090 INFO L290 TraceCheckUtils]: 53: Hoare triple {25162#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 94))} assume !(~x~0 % 4294967296 < 268435455); {25111#false} is VALID [2022-04-28 03:04:44,090 INFO L272 TraceCheckUtils]: 54: Hoare triple {25111#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {25111#false} is VALID [2022-04-28 03:04:44,091 INFO L290 TraceCheckUtils]: 55: Hoare triple {25111#false} ~cond := #in~cond; {25111#false} is VALID [2022-04-28 03:04:44,091 INFO L290 TraceCheckUtils]: 56: Hoare triple {25111#false} assume 0 == ~cond; {25111#false} is VALID [2022-04-28 03:04:44,091 INFO L290 TraceCheckUtils]: 57: Hoare triple {25111#false} assume !false; {25111#false} is VALID [2022-04-28 03:04:44,091 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:04:44,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:04:44,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993221221] [2022-04-28 03:04:44,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993221221] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:04:44,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234453487] [2022-04-28 03:04:44,091 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:04:44,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:04:44,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:04:44,092 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:04:44,093 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:04:44,216 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:04:44,216 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:04:44,217 WARN L261 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 97 conjunts are in the unsatisfiable core [2022-04-28 03:04:44,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:04:44,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:04:44,739 INFO L272 TraceCheckUtils]: 0: Hoare triple {25110#true} call ULTIMATE.init(); {25110#true} is VALID [2022-04-28 03:04:44,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {25110#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {25110#true} is VALID [2022-04-28 03:04:44,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {25110#true} assume true; {25110#true} is VALID [2022-04-28 03:04:44,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25110#true} {25110#true} #34#return; {25110#true} is VALID [2022-04-28 03:04:44,739 INFO L272 TraceCheckUtils]: 4: Hoare triple {25110#true} call #t~ret4 := main(); {25110#true} is VALID [2022-04-28 03:04:44,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {25110#true} ~x~0 := 0; {25115#(= main_~x~0 0)} is VALID [2022-04-28 03:04:44,740 INFO L290 TraceCheckUtils]: 6: Hoare triple {25115#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25116#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:04:44,740 INFO L290 TraceCheckUtils]: 7: Hoare triple {25116#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25117#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:04:44,741 INFO L290 TraceCheckUtils]: 8: Hoare triple {25117#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25118#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:04:44,741 INFO L290 TraceCheckUtils]: 9: Hoare triple {25118#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25119#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:04:44,742 INFO L290 TraceCheckUtils]: 10: Hoare triple {25119#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25120#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:04:44,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {25120#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25121#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:04:44,742 INFO L290 TraceCheckUtils]: 12: Hoare triple {25121#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25122#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:04:44,743 INFO L290 TraceCheckUtils]: 13: Hoare triple {25122#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25123#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:04:44,743 INFO L290 TraceCheckUtils]: 14: Hoare triple {25123#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25124#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:04:44,744 INFO L290 TraceCheckUtils]: 15: Hoare triple {25124#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25125#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:04:44,744 INFO L290 TraceCheckUtils]: 16: Hoare triple {25125#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25126#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:04:44,745 INFO L290 TraceCheckUtils]: 17: Hoare triple {25126#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25127#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:04:44,745 INFO L290 TraceCheckUtils]: 18: Hoare triple {25127#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25128#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:04:44,746 INFO L290 TraceCheckUtils]: 19: Hoare triple {25128#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25129#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:04:44,746 INFO L290 TraceCheckUtils]: 20: Hoare triple {25129#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25130#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:04:44,747 INFO L290 TraceCheckUtils]: 21: Hoare triple {25130#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25131#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:04:44,747 INFO L290 TraceCheckUtils]: 22: Hoare triple {25131#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25132#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:04:44,748 INFO L290 TraceCheckUtils]: 23: Hoare triple {25132#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25133#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:04:44,748 INFO L290 TraceCheckUtils]: 24: Hoare triple {25133#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25134#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:04:44,748 INFO L290 TraceCheckUtils]: 25: Hoare triple {25134#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25135#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:04:44,749 INFO L290 TraceCheckUtils]: 26: Hoare triple {25135#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25136#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:04:44,749 INFO L290 TraceCheckUtils]: 27: Hoare triple {25136#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25137#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:04:44,750 INFO L290 TraceCheckUtils]: 28: Hoare triple {25137#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25138#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:04:44,750 INFO L290 TraceCheckUtils]: 29: Hoare triple {25138#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25139#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:04:44,751 INFO L290 TraceCheckUtils]: 30: Hoare triple {25139#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25140#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:04:44,751 INFO L290 TraceCheckUtils]: 31: Hoare triple {25140#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25141#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:04:44,752 INFO L290 TraceCheckUtils]: 32: Hoare triple {25141#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25142#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:04:44,752 INFO L290 TraceCheckUtils]: 33: Hoare triple {25142#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25143#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:04:44,753 INFO L290 TraceCheckUtils]: 34: Hoare triple {25143#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25144#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:04:44,753 INFO L290 TraceCheckUtils]: 35: Hoare triple {25144#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25145#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:04:44,753 INFO L290 TraceCheckUtils]: 36: Hoare triple {25145#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25146#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:04:44,754 INFO L290 TraceCheckUtils]: 37: Hoare triple {25146#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25147#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:04:44,754 INFO L290 TraceCheckUtils]: 38: Hoare triple {25147#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25148#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:04:44,755 INFO L290 TraceCheckUtils]: 39: Hoare triple {25148#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25149#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:04:44,755 INFO L290 TraceCheckUtils]: 40: Hoare triple {25149#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25150#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:04:44,756 INFO L290 TraceCheckUtils]: 41: Hoare triple {25150#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25151#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:04:44,756 INFO L290 TraceCheckUtils]: 42: Hoare triple {25151#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25152#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:04:44,757 INFO L290 TraceCheckUtils]: 43: Hoare triple {25152#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25153#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:04:44,757 INFO L290 TraceCheckUtils]: 44: Hoare triple {25153#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25154#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:04:44,758 INFO L290 TraceCheckUtils]: 45: Hoare triple {25154#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25155#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:04:44,758 INFO L290 TraceCheckUtils]: 46: Hoare triple {25155#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25156#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:04:44,759 INFO L290 TraceCheckUtils]: 47: Hoare triple {25156#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25157#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:04:44,759 INFO L290 TraceCheckUtils]: 48: Hoare triple {25157#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25158#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:04:44,759 INFO L290 TraceCheckUtils]: 49: Hoare triple {25158#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25159#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:04:44,760 INFO L290 TraceCheckUtils]: 50: Hoare triple {25159#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25160#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 03:04:44,760 INFO L290 TraceCheckUtils]: 51: Hoare triple {25160#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25161#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 03:04:44,761 INFO L290 TraceCheckUtils]: 52: Hoare triple {25161#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25323#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 03:04:44,761 INFO L290 TraceCheckUtils]: 53: Hoare triple {25323#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !(~x~0 % 4294967296 < 268435455); {25111#false} is VALID [2022-04-28 03:04:44,761 INFO L272 TraceCheckUtils]: 54: Hoare triple {25111#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {25111#false} is VALID [2022-04-28 03:04:44,761 INFO L290 TraceCheckUtils]: 55: Hoare triple {25111#false} ~cond := #in~cond; {25111#false} is VALID [2022-04-28 03:04:44,761 INFO L290 TraceCheckUtils]: 56: Hoare triple {25111#false} assume 0 == ~cond; {25111#false} is VALID [2022-04-28 03:04:44,762 INFO L290 TraceCheckUtils]: 57: Hoare triple {25111#false} assume !false; {25111#false} is VALID [2022-04-28 03:04:44,762 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:04:44,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:04:48,074 INFO L290 TraceCheckUtils]: 57: Hoare triple {25111#false} assume !false; {25111#false} is VALID [2022-04-28 03:04:48,074 INFO L290 TraceCheckUtils]: 56: Hoare triple {25111#false} assume 0 == ~cond; {25111#false} is VALID [2022-04-28 03:04:48,074 INFO L290 TraceCheckUtils]: 55: Hoare triple {25111#false} ~cond := #in~cond; {25111#false} is VALID [2022-04-28 03:04:48,075 INFO L272 TraceCheckUtils]: 54: Hoare triple {25111#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {25111#false} is VALID [2022-04-28 03:04:48,075 INFO L290 TraceCheckUtils]: 53: Hoare triple {25351#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {25111#false} is VALID [2022-04-28 03:04:48,076 INFO L290 TraceCheckUtils]: 52: Hoare triple {25355#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25351#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:04:48,076 INFO L290 TraceCheckUtils]: 51: Hoare triple {25359#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25355#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 03:04:48,077 INFO L290 TraceCheckUtils]: 50: Hoare triple {25363#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25359#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 03:04:48,077 INFO L290 TraceCheckUtils]: 49: Hoare triple {25367#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25363#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 03:04:48,078 INFO L290 TraceCheckUtils]: 48: Hoare triple {25371#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25367#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 03:04:48,079 INFO L290 TraceCheckUtils]: 47: Hoare triple {25375#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25371#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-28 03:04:48,079 INFO L290 TraceCheckUtils]: 46: Hoare triple {25379#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25375#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-28 03:04:48,080 INFO L290 TraceCheckUtils]: 45: Hoare triple {25383#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25379#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-28 03:04:48,080 INFO L290 TraceCheckUtils]: 44: Hoare triple {25387#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25383#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-28 03:04:48,081 INFO L290 TraceCheckUtils]: 43: Hoare triple {25391#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25387#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-28 03:04:48,081 INFO L290 TraceCheckUtils]: 42: Hoare triple {25395#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25391#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-28 03:04:48,082 INFO L290 TraceCheckUtils]: 41: Hoare triple {25399#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25395#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-28 03:04:48,083 INFO L290 TraceCheckUtils]: 40: Hoare triple {25403#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25399#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-28 03:04:48,083 INFO L290 TraceCheckUtils]: 39: Hoare triple {25407#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25403#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-28 03:04:48,084 INFO L290 TraceCheckUtils]: 38: Hoare triple {25411#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25407#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-28 03:04:48,084 INFO L290 TraceCheckUtils]: 37: Hoare triple {25415#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25411#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:04:48,085 INFO L290 TraceCheckUtils]: 36: Hoare triple {25419#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25415#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:04:48,085 INFO L290 TraceCheckUtils]: 35: Hoare triple {25423#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25419#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-28 03:04:48,086 INFO L290 TraceCheckUtils]: 34: Hoare triple {25427#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25423#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-28 03:04:48,087 INFO L290 TraceCheckUtils]: 33: Hoare triple {25431#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25427#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-28 03:04:48,087 INFO L290 TraceCheckUtils]: 32: Hoare triple {25435#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25431#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:04:48,088 INFO L290 TraceCheckUtils]: 31: Hoare triple {25439#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25435#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:04:48,088 INFO L290 TraceCheckUtils]: 30: Hoare triple {25443#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25439#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:04:48,089 INFO L290 TraceCheckUtils]: 29: Hoare triple {25447#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25443#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-28 03:04:48,089 INFO L290 TraceCheckUtils]: 28: Hoare triple {25451#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25447#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-28 03:04:48,090 INFO L290 TraceCheckUtils]: 27: Hoare triple {25455#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25451#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-28 03:04:48,091 INFO L290 TraceCheckUtils]: 26: Hoare triple {25459#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25455#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-28 03:04:48,091 INFO L290 TraceCheckUtils]: 25: Hoare triple {25463#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25459#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-28 03:04:48,092 INFO L290 TraceCheckUtils]: 24: Hoare triple {25467#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25463#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:04:48,092 INFO L290 TraceCheckUtils]: 23: Hoare triple {25471#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25467#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-28 03:04:48,093 INFO L290 TraceCheckUtils]: 22: Hoare triple {25475#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25471#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-28 03:04:48,093 INFO L290 TraceCheckUtils]: 21: Hoare triple {25479#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25475#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-28 03:04:48,094 INFO L290 TraceCheckUtils]: 20: Hoare triple {25483#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25479#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:04:48,095 INFO L290 TraceCheckUtils]: 19: Hoare triple {25487#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25483#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:04:48,095 INFO L290 TraceCheckUtils]: 18: Hoare triple {25491#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25487#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:04:48,096 INFO L290 TraceCheckUtils]: 17: Hoare triple {25495#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25491#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} is VALID [2022-04-28 03:04:48,096 INFO L290 TraceCheckUtils]: 16: Hoare triple {25499#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25495#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:04:48,097 INFO L290 TraceCheckUtils]: 15: Hoare triple {25503#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25499#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} is VALID [2022-04-28 03:04:48,097 INFO L290 TraceCheckUtils]: 14: Hoare triple {25507#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25503#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:04:48,098 INFO L290 TraceCheckUtils]: 13: Hoare triple {25511#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25507#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} is VALID [2022-04-28 03:04:48,099 INFO L290 TraceCheckUtils]: 12: Hoare triple {25515#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25511#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} is VALID [2022-04-28 03:04:48,099 INFO L290 TraceCheckUtils]: 11: Hoare triple {25519#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25515#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} is VALID [2022-04-28 03:04:48,100 INFO L290 TraceCheckUtils]: 10: Hoare triple {25523#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25519#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:04:48,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {25527#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25523#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} is VALID [2022-04-28 03:04:48,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {25531#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25527#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:04:48,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {25535#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25531#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} is VALID [2022-04-28 03:04:48,102 INFO L290 TraceCheckUtils]: 6: Hoare triple {25539#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {25535#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:04:48,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {25110#true} ~x~0 := 0; {25539#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:04:48,102 INFO L272 TraceCheckUtils]: 4: Hoare triple {25110#true} call #t~ret4 := main(); {25110#true} is VALID [2022-04-28 03:04:48,102 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25110#true} {25110#true} #34#return; {25110#true} is VALID [2022-04-28 03:04:48,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {25110#true} assume true; {25110#true} is VALID [2022-04-28 03:04:48,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {25110#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {25110#true} is VALID [2022-04-28 03:04:48,103 INFO L272 TraceCheckUtils]: 0: Hoare triple {25110#true} call ULTIMATE.init(); {25110#true} is VALID [2022-04-28 03:04:48,103 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:04:48,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234453487] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:04:48,103 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:04:48,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 50, 50] total 100 [2022-04-28 03:04:48,104 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:04:48,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1346750062] [2022-04-28 03:04:48,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1346750062] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:04:48,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:04:48,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2022-04-28 03:04:48,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846803564] [2022-04-28 03:04:48,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:04:48,104 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:04:48,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:04:48,104 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:04:48,132 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:48,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-04-28 03:04:48,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:04:48,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-04-28 03:04:48,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2597, Invalid=7303, Unknown=0, NotChecked=0, Total=9900 [2022-04-28 03:04:48,134 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:04:52,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:04:52,495 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2022-04-28 03:04:52,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-04-28 03:04:52,495 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:04:52,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:04:52,496 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:04:52,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2022-04-28 03:04:52,496 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:04:52,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2022-04-28 03:04:52,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 65 transitions. [2022-04-28 03:04:52,543 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:04:52,543 INFO L225 Difference]: With dead ends: 65 [2022-04-28 03:04:52,543 INFO L226 Difference]: Without dead ends: 60 [2022-04-28 03:04:52,545 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1228 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=5187, Invalid=16569, Unknown=0, NotChecked=0, Total=21756 [2022-04-28 03:04:52,545 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 2488 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 2585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 2488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:04:52,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 243 Invalid, 2585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 2488 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-28 03:04:52,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-28 03:04:52,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-28 03:04:52,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:04:52,608 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:04:52,608 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:04:52,608 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:04:52,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:04:52,609 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-04-28 03:04:52,609 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2022-04-28 03:04:52,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:04:52,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:04:52,609 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:04:52,610 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:04:52,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:04:52,610 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2022-04-28 03:04:52,610 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2022-04-28 03:04:52,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:04:52,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:04:52,610 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:04:52,610 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:04:52,610 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:04:52,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2022-04-28 03:04:52,611 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2022-04-28 03:04:52,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:04:52,611 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2022-04-28 03:04:52,611 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:04:52,611 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 60 transitions. [2022-04-28 03:04:52,656 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:04:52,656 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2022-04-28 03:04:52,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 03:04:52,656 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:04:52,656 INFO L195 NwaCegarLoop]: trace histogram [48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:04:52,674 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:04:52,862 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:04:53,057 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:04:53,057 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:04:53,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:04:53,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1868113444, now seen corresponding path program 95 times [2022-04-28 03:04:53,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:04:53,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [864359917] [2022-04-28 03:04:53,203 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:53,205 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:04:53,207 INFO L85 PathProgramCache]: Analyzing trace with hash 910643383, now seen corresponding path program 1 times [2022-04-28 03:04:53,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:04:53,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022475573] [2022-04-28 03:04:53,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:04:53,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:04:53,211 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_48.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_48.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:04:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:04:53,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1970100997] [2022-04-28 03:04:53,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:04:53,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:04:53,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:04:53,220 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:04:53,221 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:04:53,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:04:53,262 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:04:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:04:53,268 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:04:53,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1868113444, now seen corresponding path program 96 times [2022-04-28 03:04:53,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:04:53,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867182717] [2022-04-28 03:04:53,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:04:53,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:04:53,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:04:54,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:04:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:04:54,418 INFO L290 TraceCheckUtils]: 0: Hoare triple {26080#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {26026#true} is VALID [2022-04-28 03:04:54,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {26026#true} assume true; {26026#true} is VALID [2022-04-28 03:04:54,418 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26026#true} {26026#true} #34#return; {26026#true} is VALID [2022-04-28 03:04:54,419 INFO L272 TraceCheckUtils]: 0: Hoare triple {26026#true} call ULTIMATE.init(); {26080#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:04:54,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {26080#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {26026#true} is VALID [2022-04-28 03:04:54,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {26026#true} assume true; {26026#true} is VALID [2022-04-28 03:04:54,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26026#true} {26026#true} #34#return; {26026#true} is VALID [2022-04-28 03:04:54,419 INFO L272 TraceCheckUtils]: 4: Hoare triple {26026#true} call #t~ret4 := main(); {26026#true} is VALID [2022-04-28 03:04:54,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {26026#true} ~x~0 := 0; {26031#(= main_~x~0 0)} is VALID [2022-04-28 03:04:54,420 INFO L290 TraceCheckUtils]: 6: Hoare triple {26031#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:04:54,420 INFO L290 TraceCheckUtils]: 7: Hoare triple {26032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26033#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:04:54,421 INFO L290 TraceCheckUtils]: 8: Hoare triple {26033#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26034#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:04:54,421 INFO L290 TraceCheckUtils]: 9: Hoare triple {26034#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26035#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:04:54,422 INFO L290 TraceCheckUtils]: 10: Hoare triple {26035#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26036#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:04:54,422 INFO L290 TraceCheckUtils]: 11: Hoare triple {26036#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26037#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:04:54,423 INFO L290 TraceCheckUtils]: 12: Hoare triple {26037#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26038#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:04:54,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {26038#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26039#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:04:54,423 INFO L290 TraceCheckUtils]: 14: Hoare triple {26039#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26040#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:04:54,424 INFO L290 TraceCheckUtils]: 15: Hoare triple {26040#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26041#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:04:54,424 INFO L290 TraceCheckUtils]: 16: Hoare triple {26041#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26042#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:04:54,425 INFO L290 TraceCheckUtils]: 17: Hoare triple {26042#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26043#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:04:54,425 INFO L290 TraceCheckUtils]: 18: Hoare triple {26043#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26044#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:04:54,426 INFO L290 TraceCheckUtils]: 19: Hoare triple {26044#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26045#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:04:54,426 INFO L290 TraceCheckUtils]: 20: Hoare triple {26045#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26046#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:04:54,427 INFO L290 TraceCheckUtils]: 21: Hoare triple {26046#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26047#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:04:54,427 INFO L290 TraceCheckUtils]: 22: Hoare triple {26047#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26048#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:04:54,428 INFO L290 TraceCheckUtils]: 23: Hoare triple {26048#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26049#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:04:54,428 INFO L290 TraceCheckUtils]: 24: Hoare triple {26049#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26050#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:04:54,429 INFO L290 TraceCheckUtils]: 25: Hoare triple {26050#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26051#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:04:54,429 INFO L290 TraceCheckUtils]: 26: Hoare triple {26051#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26052#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:04:54,429 INFO L290 TraceCheckUtils]: 27: Hoare triple {26052#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26053#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:04:54,430 INFO L290 TraceCheckUtils]: 28: Hoare triple {26053#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26054#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:04:54,430 INFO L290 TraceCheckUtils]: 29: Hoare triple {26054#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26055#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:04:54,431 INFO L290 TraceCheckUtils]: 30: Hoare triple {26055#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26056#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:04:54,431 INFO L290 TraceCheckUtils]: 31: Hoare triple {26056#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26057#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:04:54,432 INFO L290 TraceCheckUtils]: 32: Hoare triple {26057#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26058#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:04:54,432 INFO L290 TraceCheckUtils]: 33: Hoare triple {26058#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26059#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:04:54,433 INFO L290 TraceCheckUtils]: 34: Hoare triple {26059#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26060#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:04:54,433 INFO L290 TraceCheckUtils]: 35: Hoare triple {26060#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26061#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:04:54,434 INFO L290 TraceCheckUtils]: 36: Hoare triple {26061#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26062#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:04:54,434 INFO L290 TraceCheckUtils]: 37: Hoare triple {26062#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26063#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:04:54,434 INFO L290 TraceCheckUtils]: 38: Hoare triple {26063#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26064#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:04:54,435 INFO L290 TraceCheckUtils]: 39: Hoare triple {26064#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26065#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:04:54,435 INFO L290 TraceCheckUtils]: 40: Hoare triple {26065#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26066#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:04:54,436 INFO L290 TraceCheckUtils]: 41: Hoare triple {26066#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26067#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:04:54,436 INFO L290 TraceCheckUtils]: 42: Hoare triple {26067#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26068#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:04:54,437 INFO L290 TraceCheckUtils]: 43: Hoare triple {26068#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26069#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:04:54,437 INFO L290 TraceCheckUtils]: 44: Hoare triple {26069#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26070#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:04:54,438 INFO L290 TraceCheckUtils]: 45: Hoare triple {26070#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26071#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:04:54,438 INFO L290 TraceCheckUtils]: 46: Hoare triple {26071#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26072#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:04:54,439 INFO L290 TraceCheckUtils]: 47: Hoare triple {26072#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26073#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:04:54,439 INFO L290 TraceCheckUtils]: 48: Hoare triple {26073#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26074#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:04:54,439 INFO L290 TraceCheckUtils]: 49: Hoare triple {26074#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26075#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:04:54,440 INFO L290 TraceCheckUtils]: 50: Hoare triple {26075#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26076#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 03:04:54,440 INFO L290 TraceCheckUtils]: 51: Hoare triple {26076#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26077#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 03:04:54,441 INFO L290 TraceCheckUtils]: 52: Hoare triple {26077#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26078#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 03:04:54,441 INFO L290 TraceCheckUtils]: 53: Hoare triple {26078#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26079#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 96))} is VALID [2022-04-28 03:04:54,442 INFO L290 TraceCheckUtils]: 54: Hoare triple {26079#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 96))} assume !(~x~0 % 4294967296 < 268435455); {26027#false} is VALID [2022-04-28 03:04:54,442 INFO L272 TraceCheckUtils]: 55: Hoare triple {26027#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {26027#false} is VALID [2022-04-28 03:04:54,442 INFO L290 TraceCheckUtils]: 56: Hoare triple {26027#false} ~cond := #in~cond; {26027#false} is VALID [2022-04-28 03:04:54,442 INFO L290 TraceCheckUtils]: 57: Hoare triple {26027#false} assume 0 == ~cond; {26027#false} is VALID [2022-04-28 03:04:54,442 INFO L290 TraceCheckUtils]: 58: Hoare triple {26027#false} assume !false; {26027#false} is VALID [2022-04-28 03:04:54,442 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:04:54,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:04:54,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867182717] [2022-04-28 03:04:54,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867182717] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:04:54,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642622719] [2022-04-28 03:04:54,443 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:04:54,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:04:54,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:04:54,444 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:04:54,445 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:04:58,170 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2022-04-28 03:04:58,171 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:04:58,176 WARN L261 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 105 conjunts are in the unsatisfiable core [2022-04-28 03:04:58,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:04:58,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:04:58,615 INFO L272 TraceCheckUtils]: 0: Hoare triple {26026#true} call ULTIMATE.init(); {26026#true} is VALID [2022-04-28 03:04:58,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {26026#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {26026#true} is VALID [2022-04-28 03:04:58,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {26026#true} assume true; {26026#true} is VALID [2022-04-28 03:04:58,615 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26026#true} {26026#true} #34#return; {26026#true} is VALID [2022-04-28 03:04:58,615 INFO L272 TraceCheckUtils]: 4: Hoare triple {26026#true} call #t~ret4 := main(); {26026#true} is VALID [2022-04-28 03:04:58,616 INFO L290 TraceCheckUtils]: 5: Hoare triple {26026#true} ~x~0 := 0; {26031#(= main_~x~0 0)} is VALID [2022-04-28 03:04:58,616 INFO L290 TraceCheckUtils]: 6: Hoare triple {26031#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:04:58,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {26032#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26033#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:04:58,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {26033#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26034#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:04:58,625 INFO L290 TraceCheckUtils]: 9: Hoare triple {26034#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26035#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:04:58,626 INFO L290 TraceCheckUtils]: 10: Hoare triple {26035#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26036#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:04:58,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {26036#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26037#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:04:58,626 INFO L290 TraceCheckUtils]: 12: Hoare triple {26037#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26038#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:04:58,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {26038#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26039#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:04:58,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {26039#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26040#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:04:58,628 INFO L290 TraceCheckUtils]: 15: Hoare triple {26040#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26041#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:04:58,628 INFO L290 TraceCheckUtils]: 16: Hoare triple {26041#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26042#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:04:58,629 INFO L290 TraceCheckUtils]: 17: Hoare triple {26042#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26043#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:04:58,629 INFO L290 TraceCheckUtils]: 18: Hoare triple {26043#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26044#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:04:58,630 INFO L290 TraceCheckUtils]: 19: Hoare triple {26044#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26045#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:04:58,630 INFO L290 TraceCheckUtils]: 20: Hoare triple {26045#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26046#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:04:58,631 INFO L290 TraceCheckUtils]: 21: Hoare triple {26046#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26047#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:04:58,631 INFO L290 TraceCheckUtils]: 22: Hoare triple {26047#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26048#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:04:58,632 INFO L290 TraceCheckUtils]: 23: Hoare triple {26048#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26049#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:04:58,632 INFO L290 TraceCheckUtils]: 24: Hoare triple {26049#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26050#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:04:58,632 INFO L290 TraceCheckUtils]: 25: Hoare triple {26050#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26051#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:04:58,633 INFO L290 TraceCheckUtils]: 26: Hoare triple {26051#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26052#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:04:58,633 INFO L290 TraceCheckUtils]: 27: Hoare triple {26052#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26053#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:04:58,634 INFO L290 TraceCheckUtils]: 28: Hoare triple {26053#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26054#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:04:58,634 INFO L290 TraceCheckUtils]: 29: Hoare triple {26054#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26055#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:04:58,635 INFO L290 TraceCheckUtils]: 30: Hoare triple {26055#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26056#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:04:58,635 INFO L290 TraceCheckUtils]: 31: Hoare triple {26056#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26057#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:04:58,636 INFO L290 TraceCheckUtils]: 32: Hoare triple {26057#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26058#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:04:58,636 INFO L290 TraceCheckUtils]: 33: Hoare triple {26058#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26059#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:04:58,636 INFO L290 TraceCheckUtils]: 34: Hoare triple {26059#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26060#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:04:58,637 INFO L290 TraceCheckUtils]: 35: Hoare triple {26060#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26061#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:04:58,637 INFO L290 TraceCheckUtils]: 36: Hoare triple {26061#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26062#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:04:58,638 INFO L290 TraceCheckUtils]: 37: Hoare triple {26062#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26063#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:04:58,638 INFO L290 TraceCheckUtils]: 38: Hoare triple {26063#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26064#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:04:58,639 INFO L290 TraceCheckUtils]: 39: Hoare triple {26064#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26065#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:04:58,639 INFO L290 TraceCheckUtils]: 40: Hoare triple {26065#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26066#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:04:58,640 INFO L290 TraceCheckUtils]: 41: Hoare triple {26066#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26067#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:04:58,640 INFO L290 TraceCheckUtils]: 42: Hoare triple {26067#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26068#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:04:58,641 INFO L290 TraceCheckUtils]: 43: Hoare triple {26068#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26069#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:04:58,641 INFO L290 TraceCheckUtils]: 44: Hoare triple {26069#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26070#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:04:58,641 INFO L290 TraceCheckUtils]: 45: Hoare triple {26070#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26071#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:04:58,642 INFO L290 TraceCheckUtils]: 46: Hoare triple {26071#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26072#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:04:58,642 INFO L290 TraceCheckUtils]: 47: Hoare triple {26072#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26073#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:04:58,643 INFO L290 TraceCheckUtils]: 48: Hoare triple {26073#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26074#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:04:58,643 INFO L290 TraceCheckUtils]: 49: Hoare triple {26074#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26075#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:04:58,644 INFO L290 TraceCheckUtils]: 50: Hoare triple {26075#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26076#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 03:04:58,644 INFO L290 TraceCheckUtils]: 51: Hoare triple {26076#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26077#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 03:04:58,645 INFO L290 TraceCheckUtils]: 52: Hoare triple {26077#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26078#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 03:04:58,645 INFO L290 TraceCheckUtils]: 53: Hoare triple {26078#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26243#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-28 03:04:58,646 INFO L290 TraceCheckUtils]: 54: Hoare triple {26243#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !(~x~0 % 4294967296 < 268435455); {26027#false} is VALID [2022-04-28 03:04:58,646 INFO L272 TraceCheckUtils]: 55: Hoare triple {26027#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {26027#false} is VALID [2022-04-28 03:04:58,646 INFO L290 TraceCheckUtils]: 56: Hoare triple {26027#false} ~cond := #in~cond; {26027#false} is VALID [2022-04-28 03:04:58,646 INFO L290 TraceCheckUtils]: 57: Hoare triple {26027#false} assume 0 == ~cond; {26027#false} is VALID [2022-04-28 03:04:58,646 INFO L290 TraceCheckUtils]: 58: Hoare triple {26027#false} assume !false; {26027#false} is VALID [2022-04-28 03:04:58,646 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:04:58,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:05:03,367 INFO L290 TraceCheckUtils]: 58: Hoare triple {26027#false} assume !false; {26027#false} is VALID [2022-04-28 03:05:03,367 INFO L290 TraceCheckUtils]: 57: Hoare triple {26262#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {26027#false} is VALID [2022-04-28 03:05:03,368 INFO L290 TraceCheckUtils]: 56: Hoare triple {26266#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {26262#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:05:03,368 INFO L272 TraceCheckUtils]: 55: Hoare triple {26270#(not (= (mod main_~x~0 2) 0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {26266#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:05:03,369 INFO L290 TraceCheckUtils]: 54: Hoare triple {26274#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !(~x~0 % 4294967296 < 268435455); {26270#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 03:05:03,369 INFO L290 TraceCheckUtils]: 53: Hoare triple {26278#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26274#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:05:03,370 INFO L290 TraceCheckUtils]: 52: Hoare triple {26282#(or (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26278#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:05:03,371 INFO L290 TraceCheckUtils]: 51: Hoare triple {26286#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26282#(or (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:05:03,372 INFO L290 TraceCheckUtils]: 50: Hoare triple {26290#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26286#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} is VALID [2022-04-28 03:05:03,386 INFO L290 TraceCheckUtils]: 49: Hoare triple {26294#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26290#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} is VALID [2022-04-28 03:05:03,387 INFO L290 TraceCheckUtils]: 48: Hoare triple {26298#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26294#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} is VALID [2022-04-28 03:05:03,387 INFO L290 TraceCheckUtils]: 47: Hoare triple {26302#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26298#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} is VALID [2022-04-28 03:05:03,388 INFO L290 TraceCheckUtils]: 46: Hoare triple {26306#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26302#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:05:03,389 INFO L290 TraceCheckUtils]: 45: Hoare triple {26310#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26306#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:05:03,390 INFO L290 TraceCheckUtils]: 44: Hoare triple {26314#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26310#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:05:03,390 INFO L290 TraceCheckUtils]: 43: Hoare triple {26318#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26314#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} is VALID [2022-04-28 03:05:03,413 INFO L290 TraceCheckUtils]: 42: Hoare triple {26322#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26318#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} is VALID [2022-04-28 03:05:03,413 INFO L290 TraceCheckUtils]: 41: Hoare triple {26326#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26322#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} is VALID [2022-04-28 03:05:03,414 INFO L290 TraceCheckUtils]: 40: Hoare triple {26330#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26326#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} is VALID [2022-04-28 03:05:03,415 INFO L290 TraceCheckUtils]: 39: Hoare triple {26334#(or (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26330#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:05:03,416 INFO L290 TraceCheckUtils]: 38: Hoare triple {26338#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26334#(or (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:05:03,417 INFO L290 TraceCheckUtils]: 37: Hoare triple {26342#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26338#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:05:03,418 INFO L290 TraceCheckUtils]: 36: Hoare triple {26346#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26342#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:05:03,418 INFO L290 TraceCheckUtils]: 35: Hoare triple {26350#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26346#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} is VALID [2022-04-28 03:05:03,419 INFO L290 TraceCheckUtils]: 34: Hoare triple {26354#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26350#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:05:03,420 INFO L290 TraceCheckUtils]: 33: Hoare triple {26358#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26354#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:05:03,420 INFO L290 TraceCheckUtils]: 32: Hoare triple {26362#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26358#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:05:03,421 INFO L290 TraceCheckUtils]: 31: Hoare triple {26366#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26362#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:05:03,422 INFO L290 TraceCheckUtils]: 30: Hoare triple {26370#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26366#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} is VALID [2022-04-28 03:05:03,422 INFO L290 TraceCheckUtils]: 29: Hoare triple {26374#(or (< (mod (+ main_~x~0 50) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26370#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} is VALID [2022-04-28 03:05:03,423 INFO L290 TraceCheckUtils]: 28: Hoare triple {26378#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26374#(or (< (mod (+ main_~x~0 50) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:05:03,426 INFO L290 TraceCheckUtils]: 27: Hoare triple {26382#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26378#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} is VALID [2022-04-28 03:05:03,427 INFO L290 TraceCheckUtils]: 26: Hoare triple {26386#(or (< (mod (+ 56 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26382#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} is VALID [2022-04-28 03:05:03,427 INFO L290 TraceCheckUtils]: 25: Hoare triple {26390#(or (< (mod (+ main_~x~0 58) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26386#(or (< (mod (+ 56 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:05:03,432 INFO L290 TraceCheckUtils]: 24: Hoare triple {26394#(or (< (mod (+ main_~x~0 60) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26390#(or (< (mod (+ main_~x~0 58) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:05:03,433 INFO L290 TraceCheckUtils]: 23: Hoare triple {26398#(or (< (mod (+ main_~x~0 62) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26394#(or (< (mod (+ main_~x~0 60) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:05:03,435 INFO L290 TraceCheckUtils]: 22: Hoare triple {26402#(or (< (mod (+ 64 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26398#(or (< (mod (+ main_~x~0 62) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:05:03,436 INFO L290 TraceCheckUtils]: 21: Hoare triple {26406#(or (< (mod (+ 66 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26402#(or (< (mod (+ 64 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:05:03,436 INFO L290 TraceCheckUtils]: 20: Hoare triple {26410#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 68 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26406#(or (< (mod (+ 66 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:05:03,437 INFO L290 TraceCheckUtils]: 19: Hoare triple {26414#(or (< (mod (+ main_~x~0 70) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26410#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 68 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:05:03,438 INFO L290 TraceCheckUtils]: 18: Hoare triple {26418#(or (< (mod (+ 72 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26414#(or (< (mod (+ main_~x~0 70) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:05:03,438 INFO L290 TraceCheckUtils]: 17: Hoare triple {26422#(or (< (mod (+ main_~x~0 74) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26418#(or (< (mod (+ 72 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:05:03,439 INFO L290 TraceCheckUtils]: 16: Hoare triple {26426#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 76 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26422#(or (< (mod (+ main_~x~0 74) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:05:03,440 INFO L290 TraceCheckUtils]: 15: Hoare triple {26430#(or (< (mod (+ main_~x~0 78) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26426#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 76 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:05:03,440 INFO L290 TraceCheckUtils]: 14: Hoare triple {26434#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 80) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26430#(or (< (mod (+ main_~x~0 78) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:05:03,441 INFO L290 TraceCheckUtils]: 13: Hoare triple {26438#(or (< (mod (+ main_~x~0 82) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26434#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 80) 4294967296) 268435455))} is VALID [2022-04-28 03:05:03,442 INFO L290 TraceCheckUtils]: 12: Hoare triple {26442#(or (< (mod (+ 84 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26438#(or (< (mod (+ main_~x~0 82) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:05:03,443 INFO L290 TraceCheckUtils]: 11: Hoare triple {26446#(or (< (mod (+ main_~x~0 86) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26442#(or (< (mod (+ 84 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:05:03,443 INFO L290 TraceCheckUtils]: 10: Hoare triple {26450#(or (< (mod (+ 88 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26446#(or (< (mod (+ main_~x~0 86) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:05:03,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {26454#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 90) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26450#(or (< (mod (+ 88 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:05:03,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {26458#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 92 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26454#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 90) 4294967296) 268435455))} is VALID [2022-04-28 03:05:03,445 INFO L290 TraceCheckUtils]: 7: Hoare triple {26462#(or (< (mod (+ 94 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26458#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 92 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:05:03,446 INFO L290 TraceCheckUtils]: 6: Hoare triple {26466#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 96) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26462#(or (< (mod (+ 94 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:05:03,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {26026#true} ~x~0 := 0; {26466#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 96) 4294967296) 268435455))} is VALID [2022-04-28 03:05:03,447 INFO L272 TraceCheckUtils]: 4: Hoare triple {26026#true} call #t~ret4 := main(); {26026#true} is VALID [2022-04-28 03:05:03,447 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26026#true} {26026#true} #34#return; {26026#true} is VALID [2022-04-28 03:05:03,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {26026#true} assume true; {26026#true} is VALID [2022-04-28 03:05:03,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {26026#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {26026#true} is VALID [2022-04-28 03:05:03,447 INFO L272 TraceCheckUtils]: 0: Hoare triple {26026#true} call ULTIMATE.init(); {26026#true} is VALID [2022-04-28 03:05:03,447 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:05:03,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642622719] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:05:03,447 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:05:03,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 51, 54] total 105 [2022-04-28 03:05:03,448 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:05:03,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [864359917] [2022-04-28 03:05:03,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [864359917] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:05:03,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:05:03,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2022-04-28 03:05:03,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812773462] [2022-04-28 03:05:03,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:05:03,448 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:05:03,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:05:03,449 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:05:03,478 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:05:03,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-04-28 03:05:03,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:05:03,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-04-28 03:05:03,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2755, Invalid=8165, Unknown=0, NotChecked=0, Total=10920 [2022-04-28 03:05:03,479 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:05:08,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:08,135 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2022-04-28 03:05:08,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-04-28 03:05:08,135 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:05:08,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:05:08,136 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:05:08,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2022-04-28 03:05:08,139 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:05:08,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2022-04-28 03:05:08,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 66 transitions. [2022-04-28 03:05:08,179 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:05:08,180 INFO L225 Difference]: With dead ends: 66 [2022-04-28 03:05:08,180 INFO L226 Difference]: Without dead ends: 61 [2022-04-28 03:05:08,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1284 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=5448, Invalid=18114, Unknown=0, NotChecked=0, Total=23562 [2022-04-28 03:05:08,181 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 2584 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 2683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 2584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-28 03:05:08,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 243 Invalid, 2683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 2584 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-28 03:05:08,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-28 03:05:08,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-04-28 03:05:08,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:05:08,240 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:05:08,240 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:05:08,241 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:05:08,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:08,241 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2022-04-28 03:05:08,241 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2022-04-28 03:05:08,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:05:08,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:05:08,241 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:05:08,242 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:05:08,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:08,242 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2022-04-28 03:05:08,242 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2022-04-28 03:05:08,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:05:08,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:05:08,242 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:05:08,242 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:05:08,242 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:05:08,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2022-04-28 03:05:08,243 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2022-04-28 03:05:08,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:05:08,243 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2022-04-28 03:05:08,243 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:05:08,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 61 transitions. [2022-04-28 03:05:08,291 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:08,291 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2022-04-28 03:05:08,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-28 03:05:08,291 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:05:08,291 INFO L195 NwaCegarLoop]: trace histogram [49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:05:08,297 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:05:08,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Forceful destruction successful, exit code 0 [2022-04-28 03:05:08,695 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:05:08,695 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:05:08,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:05:08,695 INFO L85 PathProgramCache]: Analyzing trace with hash -2040480650, now seen corresponding path program 97 times [2022-04-28 03:05:08,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:05:08,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1847489479] [2022-04-28 03:05:08,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:05:08,828 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:05:08,830 INFO L85 PathProgramCache]: Analyzing trace with hash 969748727, now seen corresponding path program 1 times [2022-04-28 03:05:08,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:05:08,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426200588] [2022-04-28 03:05:08,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:05:08,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:05:08,834 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_49.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_49.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:05:08,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:05:08,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1614239466] [2022-04-28 03:05:08,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:05:08,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:05:08,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:05:08,837 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:05:08,838 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:05:08,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:05:08,885 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:05:08,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:05:08,893 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:05:08,894 INFO L85 PathProgramCache]: Analyzing trace with hash -2040480650, now seen corresponding path program 98 times [2022-04-28 03:05:08,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:05:08,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989336022] [2022-04-28 03:05:08,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:05:08,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:05:08,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:10,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:05:10,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:10,070 INFO L290 TraceCheckUtils]: 0: Hoare triple {27016#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {26961#true} is VALID [2022-04-28 03:05:10,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {26961#true} assume true; {26961#true} is VALID [2022-04-28 03:05:10,070 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26961#true} {26961#true} #34#return; {26961#true} is VALID [2022-04-28 03:05:10,070 INFO L272 TraceCheckUtils]: 0: Hoare triple {26961#true} call ULTIMATE.init(); {27016#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:05:10,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {27016#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {26961#true} is VALID [2022-04-28 03:05:10,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {26961#true} assume true; {26961#true} is VALID [2022-04-28 03:05:10,071 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26961#true} {26961#true} #34#return; {26961#true} is VALID [2022-04-28 03:05:10,071 INFO L272 TraceCheckUtils]: 4: Hoare triple {26961#true} call #t~ret4 := main(); {26961#true} is VALID [2022-04-28 03:05:10,071 INFO L290 TraceCheckUtils]: 5: Hoare triple {26961#true} ~x~0 := 0; {26966#(= main_~x~0 0)} is VALID [2022-04-28 03:05:10,071 INFO L290 TraceCheckUtils]: 6: Hoare triple {26966#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26967#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:05:10,072 INFO L290 TraceCheckUtils]: 7: Hoare triple {26967#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26968#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:05:10,072 INFO L290 TraceCheckUtils]: 8: Hoare triple {26968#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26969#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:05:10,073 INFO L290 TraceCheckUtils]: 9: Hoare triple {26969#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26970#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:05:10,073 INFO L290 TraceCheckUtils]: 10: Hoare triple {26970#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26971#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:05:10,074 INFO L290 TraceCheckUtils]: 11: Hoare triple {26971#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26972#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:05:10,074 INFO L290 TraceCheckUtils]: 12: Hoare triple {26972#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26973#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:05:10,075 INFO L290 TraceCheckUtils]: 13: Hoare triple {26973#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26974#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:05:10,075 INFO L290 TraceCheckUtils]: 14: Hoare triple {26974#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26975#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:05:10,076 INFO L290 TraceCheckUtils]: 15: Hoare triple {26975#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26976#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:05:10,076 INFO L290 TraceCheckUtils]: 16: Hoare triple {26976#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26977#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:05:10,077 INFO L290 TraceCheckUtils]: 17: Hoare triple {26977#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26978#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:05:10,077 INFO L290 TraceCheckUtils]: 18: Hoare triple {26978#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26979#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:05:10,077 INFO L290 TraceCheckUtils]: 19: Hoare triple {26979#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26980#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:05:10,078 INFO L290 TraceCheckUtils]: 20: Hoare triple {26980#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26981#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:05:10,078 INFO L290 TraceCheckUtils]: 21: Hoare triple {26981#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26982#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:05:10,079 INFO L290 TraceCheckUtils]: 22: Hoare triple {26982#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26983#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:05:10,079 INFO L290 TraceCheckUtils]: 23: Hoare triple {26983#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26984#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:05:10,080 INFO L290 TraceCheckUtils]: 24: Hoare triple {26984#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26985#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:05:10,080 INFO L290 TraceCheckUtils]: 25: Hoare triple {26985#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26986#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:05:10,081 INFO L290 TraceCheckUtils]: 26: Hoare triple {26986#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26987#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:05:10,081 INFO L290 TraceCheckUtils]: 27: Hoare triple {26987#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26988#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:05:10,082 INFO L290 TraceCheckUtils]: 28: Hoare triple {26988#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26989#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:05:10,082 INFO L290 TraceCheckUtils]: 29: Hoare triple {26989#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26990#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:05:10,083 INFO L290 TraceCheckUtils]: 30: Hoare triple {26990#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26991#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:05:10,083 INFO L290 TraceCheckUtils]: 31: Hoare triple {26991#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26992#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:05:10,083 INFO L290 TraceCheckUtils]: 32: Hoare triple {26992#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26993#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:05:10,084 INFO L290 TraceCheckUtils]: 33: Hoare triple {26993#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26994#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:05:10,084 INFO L290 TraceCheckUtils]: 34: Hoare triple {26994#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26995#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:05:10,087 INFO L290 TraceCheckUtils]: 35: Hoare triple {26995#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26996#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:05:10,088 INFO L290 TraceCheckUtils]: 36: Hoare triple {26996#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26997#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:05:10,088 INFO L290 TraceCheckUtils]: 37: Hoare triple {26997#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26998#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:05:10,089 INFO L290 TraceCheckUtils]: 38: Hoare triple {26998#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26999#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:05:10,089 INFO L290 TraceCheckUtils]: 39: Hoare triple {26999#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27000#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:05:10,090 INFO L290 TraceCheckUtils]: 40: Hoare triple {27000#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27001#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:05:10,090 INFO L290 TraceCheckUtils]: 41: Hoare triple {27001#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27002#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:05:10,091 INFO L290 TraceCheckUtils]: 42: Hoare triple {27002#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27003#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:05:10,091 INFO L290 TraceCheckUtils]: 43: Hoare triple {27003#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27004#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:05:10,092 INFO L290 TraceCheckUtils]: 44: Hoare triple {27004#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27005#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:05:10,092 INFO L290 TraceCheckUtils]: 45: Hoare triple {27005#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27006#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:05:10,093 INFO L290 TraceCheckUtils]: 46: Hoare triple {27006#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27007#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:05:10,093 INFO L290 TraceCheckUtils]: 47: Hoare triple {27007#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27008#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:05:10,094 INFO L290 TraceCheckUtils]: 48: Hoare triple {27008#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27009#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:05:10,094 INFO L290 TraceCheckUtils]: 49: Hoare triple {27009#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27010#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:05:10,095 INFO L290 TraceCheckUtils]: 50: Hoare triple {27010#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27011#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 03:05:10,095 INFO L290 TraceCheckUtils]: 51: Hoare triple {27011#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27012#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 03:05:10,096 INFO L290 TraceCheckUtils]: 52: Hoare triple {27012#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27013#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 03:05:10,096 INFO L290 TraceCheckUtils]: 53: Hoare triple {27013#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27014#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-28 03:05:10,097 INFO L290 TraceCheckUtils]: 54: Hoare triple {27014#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27015#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 98))} is VALID [2022-04-28 03:05:10,097 INFO L290 TraceCheckUtils]: 55: Hoare triple {27015#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 98))} assume !(~x~0 % 4294967296 < 268435455); {26962#false} is VALID [2022-04-28 03:05:10,097 INFO L272 TraceCheckUtils]: 56: Hoare triple {26962#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {26962#false} is VALID [2022-04-28 03:05:10,097 INFO L290 TraceCheckUtils]: 57: Hoare triple {26962#false} ~cond := #in~cond; {26962#false} is VALID [2022-04-28 03:05:10,098 INFO L290 TraceCheckUtils]: 58: Hoare triple {26962#false} assume 0 == ~cond; {26962#false} is VALID [2022-04-28 03:05:10,098 INFO L290 TraceCheckUtils]: 59: Hoare triple {26962#false} assume !false; {26962#false} is VALID [2022-04-28 03:05:10,098 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:05:10,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:05:10,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989336022] [2022-04-28 03:05:10,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989336022] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:05:10,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702323161] [2022-04-28 03:05:10,098 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:05:10,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:05:10,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:05:10,099 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:05:10,100 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:05:10,208 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:05:10,208 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:05:10,210 WARN L261 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 101 conjunts are in the unsatisfiable core [2022-04-28 03:05:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:10,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:05:10,772 INFO L272 TraceCheckUtils]: 0: Hoare triple {26961#true} call ULTIMATE.init(); {26961#true} is VALID [2022-04-28 03:05:10,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {26961#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {26961#true} is VALID [2022-04-28 03:05:10,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {26961#true} assume true; {26961#true} is VALID [2022-04-28 03:05:10,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26961#true} {26961#true} #34#return; {26961#true} is VALID [2022-04-28 03:05:10,773 INFO L272 TraceCheckUtils]: 4: Hoare triple {26961#true} call #t~ret4 := main(); {26961#true} is VALID [2022-04-28 03:05:10,773 INFO L290 TraceCheckUtils]: 5: Hoare triple {26961#true} ~x~0 := 0; {26966#(= main_~x~0 0)} is VALID [2022-04-28 03:05:10,773 INFO L290 TraceCheckUtils]: 6: Hoare triple {26966#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26967#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:05:10,774 INFO L290 TraceCheckUtils]: 7: Hoare triple {26967#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26968#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:05:10,774 INFO L290 TraceCheckUtils]: 8: Hoare triple {26968#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26969#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:05:10,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {26969#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26970#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:05:10,775 INFO L290 TraceCheckUtils]: 10: Hoare triple {26970#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26971#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:05:10,776 INFO L290 TraceCheckUtils]: 11: Hoare triple {26971#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26972#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:05:10,776 INFO L290 TraceCheckUtils]: 12: Hoare triple {26972#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26973#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:05:10,776 INFO L290 TraceCheckUtils]: 13: Hoare triple {26973#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26974#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:05:10,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {26974#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26975#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:05:10,777 INFO L290 TraceCheckUtils]: 15: Hoare triple {26975#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26976#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:05:10,778 INFO L290 TraceCheckUtils]: 16: Hoare triple {26976#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26977#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:05:10,778 INFO L290 TraceCheckUtils]: 17: Hoare triple {26977#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26978#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:05:10,779 INFO L290 TraceCheckUtils]: 18: Hoare triple {26978#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26979#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:05:10,779 INFO L290 TraceCheckUtils]: 19: Hoare triple {26979#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26980#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:05:10,780 INFO L290 TraceCheckUtils]: 20: Hoare triple {26980#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26981#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:05:10,780 INFO L290 TraceCheckUtils]: 21: Hoare triple {26981#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26982#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:05:10,781 INFO L290 TraceCheckUtils]: 22: Hoare triple {26982#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26983#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:05:10,781 INFO L290 TraceCheckUtils]: 23: Hoare triple {26983#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26984#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:05:10,782 INFO L290 TraceCheckUtils]: 24: Hoare triple {26984#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26985#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:05:10,782 INFO L290 TraceCheckUtils]: 25: Hoare triple {26985#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26986#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:05:10,783 INFO L290 TraceCheckUtils]: 26: Hoare triple {26986#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26987#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:05:10,783 INFO L290 TraceCheckUtils]: 27: Hoare triple {26987#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26988#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:05:10,783 INFO L290 TraceCheckUtils]: 28: Hoare triple {26988#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26989#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:05:10,784 INFO L290 TraceCheckUtils]: 29: Hoare triple {26989#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26990#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:05:10,784 INFO L290 TraceCheckUtils]: 30: Hoare triple {26990#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26991#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:05:10,785 INFO L290 TraceCheckUtils]: 31: Hoare triple {26991#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26992#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:05:10,785 INFO L290 TraceCheckUtils]: 32: Hoare triple {26992#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26993#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:05:10,786 INFO L290 TraceCheckUtils]: 33: Hoare triple {26993#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26994#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:05:10,786 INFO L290 TraceCheckUtils]: 34: Hoare triple {26994#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26995#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:05:10,787 INFO L290 TraceCheckUtils]: 35: Hoare triple {26995#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26996#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:05:10,792 INFO L290 TraceCheckUtils]: 36: Hoare triple {26996#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26997#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:05:10,793 INFO L290 TraceCheckUtils]: 37: Hoare triple {26997#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26998#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:05:10,793 INFO L290 TraceCheckUtils]: 38: Hoare triple {26998#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {26999#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:05:10,794 INFO L290 TraceCheckUtils]: 39: Hoare triple {26999#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27000#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:05:10,794 INFO L290 TraceCheckUtils]: 40: Hoare triple {27000#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27001#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:05:10,795 INFO L290 TraceCheckUtils]: 41: Hoare triple {27001#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27002#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:05:10,795 INFO L290 TraceCheckUtils]: 42: Hoare triple {27002#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27003#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:05:10,796 INFO L290 TraceCheckUtils]: 43: Hoare triple {27003#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27004#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:05:10,796 INFO L290 TraceCheckUtils]: 44: Hoare triple {27004#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27005#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:05:10,797 INFO L290 TraceCheckUtils]: 45: Hoare triple {27005#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27006#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:05:10,797 INFO L290 TraceCheckUtils]: 46: Hoare triple {27006#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27007#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:05:10,798 INFO L290 TraceCheckUtils]: 47: Hoare triple {27007#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27008#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:05:10,798 INFO L290 TraceCheckUtils]: 48: Hoare triple {27008#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27009#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:05:10,799 INFO L290 TraceCheckUtils]: 49: Hoare triple {27009#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27010#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:05:10,799 INFO L290 TraceCheckUtils]: 50: Hoare triple {27010#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27011#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 03:05:10,800 INFO L290 TraceCheckUtils]: 51: Hoare triple {27011#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27012#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 03:05:10,800 INFO L290 TraceCheckUtils]: 52: Hoare triple {27012#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27013#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 03:05:10,801 INFO L290 TraceCheckUtils]: 53: Hoare triple {27013#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27014#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-28 03:05:10,801 INFO L290 TraceCheckUtils]: 54: Hoare triple {27014#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27182#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-28 03:05:10,802 INFO L290 TraceCheckUtils]: 55: Hoare triple {27182#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !(~x~0 % 4294967296 < 268435455); {26962#false} is VALID [2022-04-28 03:05:10,802 INFO L272 TraceCheckUtils]: 56: Hoare triple {26962#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {26962#false} is VALID [2022-04-28 03:05:10,802 INFO L290 TraceCheckUtils]: 57: Hoare triple {26962#false} ~cond := #in~cond; {26962#false} is VALID [2022-04-28 03:05:10,802 INFO L290 TraceCheckUtils]: 58: Hoare triple {26962#false} assume 0 == ~cond; {26962#false} is VALID [2022-04-28 03:05:10,802 INFO L290 TraceCheckUtils]: 59: Hoare triple {26962#false} assume !false; {26962#false} is VALID [2022-04-28 03:05:10,803 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:05:10,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:05:14,414 INFO L290 TraceCheckUtils]: 59: Hoare triple {26962#false} assume !false; {26962#false} is VALID [2022-04-28 03:05:14,415 INFO L290 TraceCheckUtils]: 58: Hoare triple {26962#false} assume 0 == ~cond; {26962#false} is VALID [2022-04-28 03:05:14,415 INFO L290 TraceCheckUtils]: 57: Hoare triple {26962#false} ~cond := #in~cond; {26962#false} is VALID [2022-04-28 03:05:14,415 INFO L272 TraceCheckUtils]: 56: Hoare triple {26962#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {26962#false} is VALID [2022-04-28 03:05:14,415 INFO L290 TraceCheckUtils]: 55: Hoare triple {27210#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {26962#false} is VALID [2022-04-28 03:05:14,416 INFO L290 TraceCheckUtils]: 54: Hoare triple {27214#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27210#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,416 INFO L290 TraceCheckUtils]: 53: Hoare triple {27218#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27214#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,417 INFO L290 TraceCheckUtils]: 52: Hoare triple {27222#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27218#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,419 INFO L290 TraceCheckUtils]: 51: Hoare triple {27226#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27222#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,420 INFO L290 TraceCheckUtils]: 50: Hoare triple {27230#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27226#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,420 INFO L290 TraceCheckUtils]: 49: Hoare triple {27234#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27230#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,421 INFO L290 TraceCheckUtils]: 48: Hoare triple {27238#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27234#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,421 INFO L290 TraceCheckUtils]: 47: Hoare triple {27242#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27238#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,422 INFO L290 TraceCheckUtils]: 46: Hoare triple {27246#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27242#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,423 INFO L290 TraceCheckUtils]: 45: Hoare triple {27250#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27246#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,423 INFO L290 TraceCheckUtils]: 44: Hoare triple {27254#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27250#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,424 INFO L290 TraceCheckUtils]: 43: Hoare triple {27258#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27254#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,424 INFO L290 TraceCheckUtils]: 42: Hoare triple {27262#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27258#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,425 INFO L290 TraceCheckUtils]: 41: Hoare triple {27266#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27262#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,425 INFO L290 TraceCheckUtils]: 40: Hoare triple {27270#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27266#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,426 INFO L290 TraceCheckUtils]: 39: Hoare triple {27274#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27270#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,427 INFO L290 TraceCheckUtils]: 38: Hoare triple {27278#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27274#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,427 INFO L290 TraceCheckUtils]: 37: Hoare triple {27282#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27278#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,428 INFO L290 TraceCheckUtils]: 36: Hoare triple {27286#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27282#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,432 INFO L290 TraceCheckUtils]: 35: Hoare triple {27290#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27286#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,433 INFO L290 TraceCheckUtils]: 34: Hoare triple {27294#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27290#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,434 INFO L290 TraceCheckUtils]: 33: Hoare triple {27298#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27294#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,434 INFO L290 TraceCheckUtils]: 32: Hoare triple {27302#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27298#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,435 INFO L290 TraceCheckUtils]: 31: Hoare triple {27306#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27302#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,435 INFO L290 TraceCheckUtils]: 30: Hoare triple {27310#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27306#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,436 INFO L290 TraceCheckUtils]: 29: Hoare triple {27314#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27310#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,437 INFO L290 TraceCheckUtils]: 28: Hoare triple {27318#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27314#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,437 INFO L290 TraceCheckUtils]: 27: Hoare triple {27322#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27318#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,438 INFO L290 TraceCheckUtils]: 26: Hoare triple {27326#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27322#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,439 INFO L290 TraceCheckUtils]: 25: Hoare triple {27330#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27326#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,439 INFO L290 TraceCheckUtils]: 24: Hoare triple {27334#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27330#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,440 INFO L290 TraceCheckUtils]: 23: Hoare triple {27338#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27334#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,440 INFO L290 TraceCheckUtils]: 22: Hoare triple {27342#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27338#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,441 INFO L290 TraceCheckUtils]: 21: Hoare triple {27346#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27342#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,442 INFO L290 TraceCheckUtils]: 20: Hoare triple {27350#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27346#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,442 INFO L290 TraceCheckUtils]: 19: Hoare triple {27354#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27350#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,443 INFO L290 TraceCheckUtils]: 18: Hoare triple {27358#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27354#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,443 INFO L290 TraceCheckUtils]: 17: Hoare triple {27362#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27358#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {27366#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27362#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,444 INFO L290 TraceCheckUtils]: 15: Hoare triple {27370#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27366#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {27374#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27370#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,446 INFO L290 TraceCheckUtils]: 13: Hoare triple {27378#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27374#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,446 INFO L290 TraceCheckUtils]: 12: Hoare triple {27382#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27378#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,447 INFO L290 TraceCheckUtils]: 11: Hoare triple {27386#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27382#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,447 INFO L290 TraceCheckUtils]: 10: Hoare triple {27390#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27386#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,448 INFO L290 TraceCheckUtils]: 9: Hoare triple {27394#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27390#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,449 INFO L290 TraceCheckUtils]: 8: Hoare triple {27398#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27394#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,449 INFO L290 TraceCheckUtils]: 7: Hoare triple {27402#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27398#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,450 INFO L290 TraceCheckUtils]: 6: Hoare triple {27406#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27402#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,450 INFO L290 TraceCheckUtils]: 5: Hoare triple {26961#true} ~x~0 := 0; {27406#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:05:14,450 INFO L272 TraceCheckUtils]: 4: Hoare triple {26961#true} call #t~ret4 := main(); {26961#true} is VALID [2022-04-28 03:05:14,450 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26961#true} {26961#true} #34#return; {26961#true} is VALID [2022-04-28 03:05:14,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {26961#true} assume true; {26961#true} is VALID [2022-04-28 03:05:14,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {26961#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {26961#true} is VALID [2022-04-28 03:05:14,450 INFO L272 TraceCheckUtils]: 0: Hoare triple {26961#true} call ULTIMATE.init(); {26961#true} is VALID [2022-04-28 03:05:14,451 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:05:14,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702323161] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:05:14,451 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:05:14,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 52, 52] total 104 [2022-04-28 03:05:14,451 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:05:14,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1847489479] [2022-04-28 03:05:14,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1847489479] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:05:14,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:05:14,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2022-04-28 03:05:14,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587117516] [2022-04-28 03:05:14,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:05:14,452 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:05:14,456 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:05:14,456 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:05:14,486 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:14,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-04-28 03:05:14,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:05:14,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-04-28 03:05:14,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2805, Invalid=7907, Unknown=0, NotChecked=0, Total=10712 [2022-04-28 03:05:14,487 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:05:19,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:19,189 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2022-04-28 03:05:19,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-04-28 03:05:19,189 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:05:19,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:05:19,189 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:05:19,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2022-04-28 03:05:19,190 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:05:19,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2022-04-28 03:05:19,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 67 transitions. [2022-04-28 03:05:19,233 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:05:19,234 INFO L225 Difference]: With dead ends: 67 [2022-04-28 03:05:19,234 INFO L226 Difference]: Without dead ends: 62 [2022-04-28 03:05:19,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1329 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=5603, Invalid=17959, Unknown=0, NotChecked=0, Total=23562 [2022-04-28 03:05:19,235 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 2652 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 2753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 2652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:05:19,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 213 Invalid, 2753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 2652 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-28 03:05:19,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-28 03:05:19,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-04-28 03:05:19,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:05:19,301 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:05:19,301 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:05:19,301 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:05:19,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:19,302 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2022-04-28 03:05:19,302 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2022-04-28 03:05:19,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:05:19,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:05:19,302 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:05:19,302 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:05:19,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:19,303 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2022-04-28 03:05:19,303 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2022-04-28 03:05:19,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:05:19,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:05:19,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:05:19,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:05:19,303 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:05:19,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2022-04-28 03:05:19,304 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2022-04-28 03:05:19,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:05:19,304 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2022-04-28 03:05:19,304 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:05:19,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 62 transitions. [2022-04-28 03:05:19,354 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:19,354 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2022-04-28 03:05:19,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-28 03:05:19,355 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:05:19,355 INFO L195 NwaCegarLoop]: trace histogram [50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:05:19,370 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:05:19,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Forceful destruction successful, exit code 0 [2022-04-28 03:05:19,755 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:05:19,755 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:05:19,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:05:19,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1206070556, now seen corresponding path program 99 times [2022-04-28 03:05:19,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:05:19,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1425743414] [2022-04-28 03:05:19,911 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:19,913 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:05:19,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1028854071, now seen corresponding path program 1 times [2022-04-28 03:05:19,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:05:19,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046985217] [2022-04-28 03:05:19,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:05:19,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:05:19,920 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_50.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_50.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:05:19,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:05:19,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1636786979] [2022-04-28 03:05:19,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:05:19,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:05:19,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:05:19,923 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:05:19,939 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:05:19,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:05:19,970 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:05:19,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:05:19,987 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:05:19,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1206070556, now seen corresponding path program 100 times [2022-04-28 03:05:19,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:05:19,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746681804] [2022-04-28 03:05:19,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:05:19,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:05:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:21,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:05:21,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:21,216 INFO L290 TraceCheckUtils]: 0: Hoare triple {27965#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {27909#true} is VALID [2022-04-28 03:05:21,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {27909#true} assume true; {27909#true} is VALID [2022-04-28 03:05:21,216 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27909#true} {27909#true} #34#return; {27909#true} is VALID [2022-04-28 03:05:21,217 INFO L272 TraceCheckUtils]: 0: Hoare triple {27909#true} call ULTIMATE.init(); {27965#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:05:21,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {27965#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {27909#true} is VALID [2022-04-28 03:05:21,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {27909#true} assume true; {27909#true} is VALID [2022-04-28 03:05:21,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27909#true} {27909#true} #34#return; {27909#true} is VALID [2022-04-28 03:05:21,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {27909#true} call #t~ret4 := main(); {27909#true} is VALID [2022-04-28 03:05:21,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {27909#true} ~x~0 := 0; {27914#(= main_~x~0 0)} is VALID [2022-04-28 03:05:21,218 INFO L290 TraceCheckUtils]: 6: Hoare triple {27914#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27915#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:05:21,218 INFO L290 TraceCheckUtils]: 7: Hoare triple {27915#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27916#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:05:21,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {27916#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27917#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:05:21,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {27917#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27918#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:05:21,220 INFO L290 TraceCheckUtils]: 10: Hoare triple {27918#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27919#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:05:21,220 INFO L290 TraceCheckUtils]: 11: Hoare triple {27919#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27920#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:05:21,220 INFO L290 TraceCheckUtils]: 12: Hoare triple {27920#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27921#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:05:21,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {27921#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27922#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:05:21,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {27922#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27923#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:05:21,222 INFO L290 TraceCheckUtils]: 15: Hoare triple {27923#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27924#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:05:21,222 INFO L290 TraceCheckUtils]: 16: Hoare triple {27924#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27925#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:05:21,223 INFO L290 TraceCheckUtils]: 17: Hoare triple {27925#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27926#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:05:21,223 INFO L290 TraceCheckUtils]: 18: Hoare triple {27926#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27927#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:05:21,224 INFO L290 TraceCheckUtils]: 19: Hoare triple {27927#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27928#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:05:21,224 INFO L290 TraceCheckUtils]: 20: Hoare triple {27928#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27929#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:05:21,225 INFO L290 TraceCheckUtils]: 21: Hoare triple {27929#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27930#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:05:21,225 INFO L290 TraceCheckUtils]: 22: Hoare triple {27930#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27931#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:05:21,225 INFO L290 TraceCheckUtils]: 23: Hoare triple {27931#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27932#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:05:21,226 INFO L290 TraceCheckUtils]: 24: Hoare triple {27932#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27933#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:05:21,226 INFO L290 TraceCheckUtils]: 25: Hoare triple {27933#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27934#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:05:21,227 INFO L290 TraceCheckUtils]: 26: Hoare triple {27934#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27935#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:05:21,227 INFO L290 TraceCheckUtils]: 27: Hoare triple {27935#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27936#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:05:21,228 INFO L290 TraceCheckUtils]: 28: Hoare triple {27936#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27937#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:05:21,230 INFO L290 TraceCheckUtils]: 29: Hoare triple {27937#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27938#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:05:21,237 INFO L290 TraceCheckUtils]: 30: Hoare triple {27938#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27939#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:05:21,238 INFO L290 TraceCheckUtils]: 31: Hoare triple {27939#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27940#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:05:21,238 INFO L290 TraceCheckUtils]: 32: Hoare triple {27940#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27941#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:05:21,239 INFO L290 TraceCheckUtils]: 33: Hoare triple {27941#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27942#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:05:21,239 INFO L290 TraceCheckUtils]: 34: Hoare triple {27942#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27943#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:05:21,240 INFO L290 TraceCheckUtils]: 35: Hoare triple {27943#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27944#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:05:21,240 INFO L290 TraceCheckUtils]: 36: Hoare triple {27944#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27945#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:05:21,241 INFO L290 TraceCheckUtils]: 37: Hoare triple {27945#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27946#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:05:21,241 INFO L290 TraceCheckUtils]: 38: Hoare triple {27946#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27947#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:05:21,242 INFO L290 TraceCheckUtils]: 39: Hoare triple {27947#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27948#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:05:21,242 INFO L290 TraceCheckUtils]: 40: Hoare triple {27948#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27949#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:05:21,243 INFO L290 TraceCheckUtils]: 41: Hoare triple {27949#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27950#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:05:21,243 INFO L290 TraceCheckUtils]: 42: Hoare triple {27950#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27951#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:05:21,244 INFO L290 TraceCheckUtils]: 43: Hoare triple {27951#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27952#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:05:21,244 INFO L290 TraceCheckUtils]: 44: Hoare triple {27952#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27953#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:05:21,245 INFO L290 TraceCheckUtils]: 45: Hoare triple {27953#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27954#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:05:21,245 INFO L290 TraceCheckUtils]: 46: Hoare triple {27954#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27955#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:05:21,246 INFO L290 TraceCheckUtils]: 47: Hoare triple {27955#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27956#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:05:21,246 INFO L290 TraceCheckUtils]: 48: Hoare triple {27956#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27957#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:05:21,247 INFO L290 TraceCheckUtils]: 49: Hoare triple {27957#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27958#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:05:21,247 INFO L290 TraceCheckUtils]: 50: Hoare triple {27958#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27959#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 03:05:21,248 INFO L290 TraceCheckUtils]: 51: Hoare triple {27959#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27960#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 03:05:21,248 INFO L290 TraceCheckUtils]: 52: Hoare triple {27960#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27961#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 03:05:21,265 INFO L290 TraceCheckUtils]: 53: Hoare triple {27961#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27962#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-28 03:05:21,265 INFO L290 TraceCheckUtils]: 54: Hoare triple {27962#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27963#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-28 03:05:21,266 INFO L290 TraceCheckUtils]: 55: Hoare triple {27963#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27964#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 100))} is VALID [2022-04-28 03:05:21,266 INFO L290 TraceCheckUtils]: 56: Hoare triple {27964#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 100))} assume !(~x~0 % 4294967296 < 268435455); {27910#false} is VALID [2022-04-28 03:05:21,266 INFO L272 TraceCheckUtils]: 57: Hoare triple {27910#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {27910#false} is VALID [2022-04-28 03:05:21,266 INFO L290 TraceCheckUtils]: 58: Hoare triple {27910#false} ~cond := #in~cond; {27910#false} is VALID [2022-04-28 03:05:21,266 INFO L290 TraceCheckUtils]: 59: Hoare triple {27910#false} assume 0 == ~cond; {27910#false} is VALID [2022-04-28 03:05:21,266 INFO L290 TraceCheckUtils]: 60: Hoare triple {27910#false} assume !false; {27910#false} is VALID [2022-04-28 03:05:21,267 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:05:21,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:05:21,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746681804] [2022-04-28 03:05:21,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746681804] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:05:21,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803275650] [2022-04-28 03:05:21,267 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:05:21,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:05:21,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:05:21,268 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:05:21,284 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:05:21,413 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:05:21,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:05:21,415 WARN L261 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 103 conjunts are in the unsatisfiable core [2022-04-28 03:05:21,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:21,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:05:21,980 INFO L272 TraceCheckUtils]: 0: Hoare triple {27909#true} call ULTIMATE.init(); {27909#true} is VALID [2022-04-28 03:05:21,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {27909#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {27909#true} is VALID [2022-04-28 03:05:21,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {27909#true} assume true; {27909#true} is VALID [2022-04-28 03:05:21,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27909#true} {27909#true} #34#return; {27909#true} is VALID [2022-04-28 03:05:21,981 INFO L272 TraceCheckUtils]: 4: Hoare triple {27909#true} call #t~ret4 := main(); {27909#true} is VALID [2022-04-28 03:05:21,981 INFO L290 TraceCheckUtils]: 5: Hoare triple {27909#true} ~x~0 := 0; {27914#(= main_~x~0 0)} is VALID [2022-04-28 03:05:21,981 INFO L290 TraceCheckUtils]: 6: Hoare triple {27914#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27915#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:05:21,982 INFO L290 TraceCheckUtils]: 7: Hoare triple {27915#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27916#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:05:21,983 INFO L290 TraceCheckUtils]: 8: Hoare triple {27916#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27917#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:05:21,983 INFO L290 TraceCheckUtils]: 9: Hoare triple {27917#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27918#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:05:21,984 INFO L290 TraceCheckUtils]: 10: Hoare triple {27918#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27919#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:05:21,984 INFO L290 TraceCheckUtils]: 11: Hoare triple {27919#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27920#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:05:21,985 INFO L290 TraceCheckUtils]: 12: Hoare triple {27920#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27921#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:05:21,985 INFO L290 TraceCheckUtils]: 13: Hoare triple {27921#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27922#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:05:21,986 INFO L290 TraceCheckUtils]: 14: Hoare triple {27922#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27923#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:05:21,986 INFO L290 TraceCheckUtils]: 15: Hoare triple {27923#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27924#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:05:21,987 INFO L290 TraceCheckUtils]: 16: Hoare triple {27924#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27925#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:05:21,987 INFO L290 TraceCheckUtils]: 17: Hoare triple {27925#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27926#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:05:21,988 INFO L290 TraceCheckUtils]: 18: Hoare triple {27926#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27927#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:05:21,988 INFO L290 TraceCheckUtils]: 19: Hoare triple {27927#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27928#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:05:21,988 INFO L290 TraceCheckUtils]: 20: Hoare triple {27928#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27929#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:05:21,989 INFO L290 TraceCheckUtils]: 21: Hoare triple {27929#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27930#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:05:21,989 INFO L290 TraceCheckUtils]: 22: Hoare triple {27930#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27931#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:05:21,990 INFO L290 TraceCheckUtils]: 23: Hoare triple {27931#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27932#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:05:21,990 INFO L290 TraceCheckUtils]: 24: Hoare triple {27932#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27933#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:05:21,991 INFO L290 TraceCheckUtils]: 25: Hoare triple {27933#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27934#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:05:21,991 INFO L290 TraceCheckUtils]: 26: Hoare triple {27934#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27935#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:05:21,992 INFO L290 TraceCheckUtils]: 27: Hoare triple {27935#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27936#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:05:21,992 INFO L290 TraceCheckUtils]: 28: Hoare triple {27936#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27937#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:05:21,993 INFO L290 TraceCheckUtils]: 29: Hoare triple {27937#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27938#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:05:21,993 INFO L290 TraceCheckUtils]: 30: Hoare triple {27938#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27939#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:05:21,994 INFO L290 TraceCheckUtils]: 31: Hoare triple {27939#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27940#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:05:21,994 INFO L290 TraceCheckUtils]: 32: Hoare triple {27940#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27941#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:05:21,995 INFO L290 TraceCheckUtils]: 33: Hoare triple {27941#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27942#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:05:21,995 INFO L290 TraceCheckUtils]: 34: Hoare triple {27942#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27943#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:05:21,996 INFO L290 TraceCheckUtils]: 35: Hoare triple {27943#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27944#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:05:21,996 INFO L290 TraceCheckUtils]: 36: Hoare triple {27944#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27945#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:05:21,997 INFO L290 TraceCheckUtils]: 37: Hoare triple {27945#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27946#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:05:21,997 INFO L290 TraceCheckUtils]: 38: Hoare triple {27946#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27947#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:05:21,998 INFO L290 TraceCheckUtils]: 39: Hoare triple {27947#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27948#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:05:21,998 INFO L290 TraceCheckUtils]: 40: Hoare triple {27948#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27949#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:05:21,999 INFO L290 TraceCheckUtils]: 41: Hoare triple {27949#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27950#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:05:21,999 INFO L290 TraceCheckUtils]: 42: Hoare triple {27950#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27951#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:05:22,000 INFO L290 TraceCheckUtils]: 43: Hoare triple {27951#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27952#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:05:22,000 INFO L290 TraceCheckUtils]: 44: Hoare triple {27952#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27953#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:05:22,001 INFO L290 TraceCheckUtils]: 45: Hoare triple {27953#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27954#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:05:22,001 INFO L290 TraceCheckUtils]: 46: Hoare triple {27954#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27955#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:05:22,002 INFO L290 TraceCheckUtils]: 47: Hoare triple {27955#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27956#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:05:22,002 INFO L290 TraceCheckUtils]: 48: Hoare triple {27956#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27957#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:05:22,003 INFO L290 TraceCheckUtils]: 49: Hoare triple {27957#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27958#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:05:22,003 INFO L290 TraceCheckUtils]: 50: Hoare triple {27958#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27959#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 03:05:22,004 INFO L290 TraceCheckUtils]: 51: Hoare triple {27959#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27960#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 03:05:22,004 INFO L290 TraceCheckUtils]: 52: Hoare triple {27960#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27961#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 03:05:22,005 INFO L290 TraceCheckUtils]: 53: Hoare triple {27961#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27962#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-28 03:05:22,005 INFO L290 TraceCheckUtils]: 54: Hoare triple {27962#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {27963#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-28 03:05:22,006 INFO L290 TraceCheckUtils]: 55: Hoare triple {27963#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28134#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-28 03:05:22,006 INFO L290 TraceCheckUtils]: 56: Hoare triple {28134#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !(~x~0 % 4294967296 < 268435455); {27910#false} is VALID [2022-04-28 03:05:22,006 INFO L272 TraceCheckUtils]: 57: Hoare triple {27910#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {27910#false} is VALID [2022-04-28 03:05:22,006 INFO L290 TraceCheckUtils]: 58: Hoare triple {27910#false} ~cond := #in~cond; {27910#false} is VALID [2022-04-28 03:05:22,006 INFO L290 TraceCheckUtils]: 59: Hoare triple {27910#false} assume 0 == ~cond; {27910#false} is VALID [2022-04-28 03:05:22,006 INFO L290 TraceCheckUtils]: 60: Hoare triple {27910#false} assume !false; {27910#false} is VALID [2022-04-28 03:05:22,007 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:05:22,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:05:25,702 INFO L290 TraceCheckUtils]: 60: Hoare triple {27910#false} assume !false; {27910#false} is VALID [2022-04-28 03:05:25,702 INFO L290 TraceCheckUtils]: 59: Hoare triple {27910#false} assume 0 == ~cond; {27910#false} is VALID [2022-04-28 03:05:25,702 INFO L290 TraceCheckUtils]: 58: Hoare triple {27910#false} ~cond := #in~cond; {27910#false} is VALID [2022-04-28 03:05:25,702 INFO L272 TraceCheckUtils]: 57: Hoare triple {27910#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {27910#false} is VALID [2022-04-28 03:05:25,702 INFO L290 TraceCheckUtils]: 56: Hoare triple {28162#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {27910#false} is VALID [2022-04-28 03:05:25,709 INFO L290 TraceCheckUtils]: 55: Hoare triple {28166#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28162#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,710 INFO L290 TraceCheckUtils]: 54: Hoare triple {28170#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28166#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,710 INFO L290 TraceCheckUtils]: 53: Hoare triple {28174#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28170#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,711 INFO L290 TraceCheckUtils]: 52: Hoare triple {28178#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28174#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,711 INFO L290 TraceCheckUtils]: 51: Hoare triple {28182#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28178#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,712 INFO L290 TraceCheckUtils]: 50: Hoare triple {28186#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28182#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,713 INFO L290 TraceCheckUtils]: 49: Hoare triple {28190#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28186#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,713 INFO L290 TraceCheckUtils]: 48: Hoare triple {28194#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28190#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,714 INFO L290 TraceCheckUtils]: 47: Hoare triple {28198#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28194#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,714 INFO L290 TraceCheckUtils]: 46: Hoare triple {28202#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28198#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,715 INFO L290 TraceCheckUtils]: 45: Hoare triple {28206#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28202#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,715 INFO L290 TraceCheckUtils]: 44: Hoare triple {28210#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28206#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,716 INFO L290 TraceCheckUtils]: 43: Hoare triple {28214#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28210#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,723 INFO L290 TraceCheckUtils]: 42: Hoare triple {28218#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28214#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,724 INFO L290 TraceCheckUtils]: 41: Hoare triple {28222#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28218#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,724 INFO L290 TraceCheckUtils]: 40: Hoare triple {28226#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28222#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,725 INFO L290 TraceCheckUtils]: 39: Hoare triple {28230#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28226#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,725 INFO L290 TraceCheckUtils]: 38: Hoare triple {28234#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28230#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,726 INFO L290 TraceCheckUtils]: 37: Hoare triple {28238#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28234#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,726 INFO L290 TraceCheckUtils]: 36: Hoare triple {28242#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28238#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,727 INFO L290 TraceCheckUtils]: 35: Hoare triple {28246#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28242#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,728 INFO L290 TraceCheckUtils]: 34: Hoare triple {28250#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28246#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,728 INFO L290 TraceCheckUtils]: 33: Hoare triple {28254#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28250#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,729 INFO L290 TraceCheckUtils]: 32: Hoare triple {28258#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28254#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,729 INFO L290 TraceCheckUtils]: 31: Hoare triple {28262#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28258#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,730 INFO L290 TraceCheckUtils]: 30: Hoare triple {28266#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28262#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,730 INFO L290 TraceCheckUtils]: 29: Hoare triple {28270#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28266#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,731 INFO L290 TraceCheckUtils]: 28: Hoare triple {28274#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28270#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,731 INFO L290 TraceCheckUtils]: 27: Hoare triple {28278#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28274#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,732 INFO L290 TraceCheckUtils]: 26: Hoare triple {28282#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28278#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,733 INFO L290 TraceCheckUtils]: 25: Hoare triple {28286#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28282#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,733 INFO L290 TraceCheckUtils]: 24: Hoare triple {28290#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28286#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,734 INFO L290 TraceCheckUtils]: 23: Hoare triple {28294#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28290#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,734 INFO L290 TraceCheckUtils]: 22: Hoare triple {28298#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28294#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,735 INFO L290 TraceCheckUtils]: 21: Hoare triple {28302#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28298#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,735 INFO L290 TraceCheckUtils]: 20: Hoare triple {28306#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28302#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,736 INFO L290 TraceCheckUtils]: 19: Hoare triple {28310#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28306#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,737 INFO L290 TraceCheckUtils]: 18: Hoare triple {28314#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28310#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,737 INFO L290 TraceCheckUtils]: 17: Hoare triple {28318#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28314#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,738 INFO L290 TraceCheckUtils]: 16: Hoare triple {28322#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28318#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,738 INFO L290 TraceCheckUtils]: 15: Hoare triple {28326#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28322#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,739 INFO L290 TraceCheckUtils]: 14: Hoare triple {28330#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28326#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,739 INFO L290 TraceCheckUtils]: 13: Hoare triple {28334#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28330#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,740 INFO L290 TraceCheckUtils]: 12: Hoare triple {28338#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28334#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,741 INFO L290 TraceCheckUtils]: 11: Hoare triple {28342#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28338#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,741 INFO L290 TraceCheckUtils]: 10: Hoare triple {28346#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28342#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,742 INFO L290 TraceCheckUtils]: 9: Hoare triple {28350#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28346#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,742 INFO L290 TraceCheckUtils]: 8: Hoare triple {28354#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28350#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {28358#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28354#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,743 INFO L290 TraceCheckUtils]: 6: Hoare triple {28362#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28358#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {27909#true} ~x~0 := 0; {28362#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} is VALID [2022-04-28 03:05:25,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {27909#true} call #t~ret4 := main(); {27909#true} is VALID [2022-04-28 03:05:25,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27909#true} {27909#true} #34#return; {27909#true} is VALID [2022-04-28 03:05:25,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {27909#true} assume true; {27909#true} is VALID [2022-04-28 03:05:25,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {27909#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {27909#true} is VALID [2022-04-28 03:05:25,744 INFO L272 TraceCheckUtils]: 0: Hoare triple {27909#true} call ULTIMATE.init(); {27909#true} is VALID [2022-04-28 03:05:25,745 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:05:25,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803275650] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:05:25,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:05:25,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 53, 53] total 106 [2022-04-28 03:05:25,745 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:05:25,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1425743414] [2022-04-28 03:05:25,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1425743414] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:05:25,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:05:25,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2022-04-28 03:05:25,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723754463] [2022-04-28 03:05:25,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:05:25,746 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:05:25,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:05:25,746 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:05:25,788 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:25,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-04-28 03:05:25,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:05:25,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-04-28 03:05:25,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2912, Invalid=8218, Unknown=0, NotChecked=0, Total=11130 [2022-04-28 03:05:25,790 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:05:30,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:30,573 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2022-04-28 03:05:30,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-04-28 03:05:30,573 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:05:30,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:05:30,574 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:05:30,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2022-04-28 03:05:30,574 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:05:30,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2022-04-28 03:05:30,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 68 transitions. [2022-04-28 03:05:30,614 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:05:30,614 INFO L225 Difference]: With dead ends: 68 [2022-04-28 03:05:30,614 INFO L226 Difference]: Without dead ends: 63 [2022-04-28 03:05:30,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1381 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=5817, Invalid=18675, Unknown=0, NotChecked=0, Total=24492 [2022-04-28 03:05:30,616 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 2722 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 2825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 2722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:05:30,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 183 Invalid, 2825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 2722 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-28 03:05:30,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-28 03:05:30,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-04-28 03:05:30,676 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:05:30,676 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:05:30,677 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:05:30,677 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:05:30,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:30,677 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2022-04-28 03:05:30,677 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2022-04-28 03:05:30,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:05:30,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:05:30,678 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:05:30,678 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:05:30,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:30,678 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2022-04-28 03:05:30,678 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2022-04-28 03:05:30,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:05:30,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:05:30,678 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:05:30,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:05:30,679 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:05:30,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2022-04-28 03:05:30,679 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2022-04-28 03:05:30,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:05:30,679 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2022-04-28 03:05:30,679 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:05:30,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 63 transitions. [2022-04-28 03:05:30,722 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:30,723 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2022-04-28 03:05:30,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-28 03:05:30,723 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:05:30,723 INFO L195 NwaCegarLoop]: trace histogram [51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:05:30,739 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:05:30,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Forceful destruction successful, exit code 0 [2022-04-28 03:05:31,123 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:05:31,124 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:05:31,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:05:31,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1230057162, now seen corresponding path program 101 times [2022-04-28 03:05:31,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:05:31,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2051703909] [2022-04-28 03:05:31,271 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:31,272 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:05:31,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1087959415, now seen corresponding path program 1 times [2022-04-28 03:05:31,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:05:31,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377196933] [2022-04-28 03:05:31,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:05:31,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:05:31,277 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_51.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_51.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:05:31,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:05:31,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1061938304] [2022-04-28 03:05:31,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:05:31,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:05:31,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:05:31,281 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:05:31,282 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:05:31,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:05:31,323 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:05:31,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:05:31,351 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:05:31,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1230057162, now seen corresponding path program 102 times [2022-04-28 03:05:31,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:05:31,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207471917] [2022-04-28 03:05:31,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:05:31,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:05:31,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:32,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:05:32,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:32,611 INFO L290 TraceCheckUtils]: 0: Hoare triple {28930#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {28873#true} is VALID [2022-04-28 03:05:32,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {28873#true} assume true; {28873#true} is VALID [2022-04-28 03:05:32,611 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28873#true} {28873#true} #34#return; {28873#true} is VALID [2022-04-28 03:05:32,611 INFO L272 TraceCheckUtils]: 0: Hoare triple {28873#true} call ULTIMATE.init(); {28930#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:05:32,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {28930#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {28873#true} is VALID [2022-04-28 03:05:32,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {28873#true} assume true; {28873#true} is VALID [2022-04-28 03:05:32,612 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28873#true} {28873#true} #34#return; {28873#true} is VALID [2022-04-28 03:05:32,612 INFO L272 TraceCheckUtils]: 4: Hoare triple {28873#true} call #t~ret4 := main(); {28873#true} is VALID [2022-04-28 03:05:32,612 INFO L290 TraceCheckUtils]: 5: Hoare triple {28873#true} ~x~0 := 0; {28878#(= main_~x~0 0)} is VALID [2022-04-28 03:05:32,612 INFO L290 TraceCheckUtils]: 6: Hoare triple {28878#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28879#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:05:32,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {28879#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28880#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:05:32,613 INFO L290 TraceCheckUtils]: 8: Hoare triple {28880#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28881#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:05:32,614 INFO L290 TraceCheckUtils]: 9: Hoare triple {28881#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28882#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:05:32,614 INFO L290 TraceCheckUtils]: 10: Hoare triple {28882#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28883#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:05:32,615 INFO L290 TraceCheckUtils]: 11: Hoare triple {28883#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28884#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:05:32,615 INFO L290 TraceCheckUtils]: 12: Hoare triple {28884#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28885#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:05:32,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {28885#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28886#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:05:32,616 INFO L290 TraceCheckUtils]: 14: Hoare triple {28886#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28887#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:05:32,617 INFO L290 TraceCheckUtils]: 15: Hoare triple {28887#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28888#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:05:32,617 INFO L290 TraceCheckUtils]: 16: Hoare triple {28888#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28889#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:05:32,617 INFO L290 TraceCheckUtils]: 17: Hoare triple {28889#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28890#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:05:32,618 INFO L290 TraceCheckUtils]: 18: Hoare triple {28890#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28891#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:05:32,618 INFO L290 TraceCheckUtils]: 19: Hoare triple {28891#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28892#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:05:32,619 INFO L290 TraceCheckUtils]: 20: Hoare triple {28892#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28893#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:05:32,619 INFO L290 TraceCheckUtils]: 21: Hoare triple {28893#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28894#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:05:32,620 INFO L290 TraceCheckUtils]: 22: Hoare triple {28894#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28895#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:05:32,620 INFO L290 TraceCheckUtils]: 23: Hoare triple {28895#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28896#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:05:32,621 INFO L290 TraceCheckUtils]: 24: Hoare triple {28896#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28897#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:05:32,621 INFO L290 TraceCheckUtils]: 25: Hoare triple {28897#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28898#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:05:32,622 INFO L290 TraceCheckUtils]: 26: Hoare triple {28898#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28899#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:05:32,622 INFO L290 TraceCheckUtils]: 27: Hoare triple {28899#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28900#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:05:32,623 INFO L290 TraceCheckUtils]: 28: Hoare triple {28900#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28901#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:05:32,623 INFO L290 TraceCheckUtils]: 29: Hoare triple {28901#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28902#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:05:32,624 INFO L290 TraceCheckUtils]: 30: Hoare triple {28902#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28903#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:05:32,624 INFO L290 TraceCheckUtils]: 31: Hoare triple {28903#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28904#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:05:32,624 INFO L290 TraceCheckUtils]: 32: Hoare triple {28904#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28905#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:05:32,625 INFO L290 TraceCheckUtils]: 33: Hoare triple {28905#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28906#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:05:32,625 INFO L290 TraceCheckUtils]: 34: Hoare triple {28906#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28907#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:05:32,626 INFO L290 TraceCheckUtils]: 35: Hoare triple {28907#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28908#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:05:32,626 INFO L290 TraceCheckUtils]: 36: Hoare triple {28908#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28909#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:05:32,627 INFO L290 TraceCheckUtils]: 37: Hoare triple {28909#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28910#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:05:32,627 INFO L290 TraceCheckUtils]: 38: Hoare triple {28910#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28911#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:05:32,628 INFO L290 TraceCheckUtils]: 39: Hoare triple {28911#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28912#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:05:32,628 INFO L290 TraceCheckUtils]: 40: Hoare triple {28912#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28913#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:05:32,629 INFO L290 TraceCheckUtils]: 41: Hoare triple {28913#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28914#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:05:32,629 INFO L290 TraceCheckUtils]: 42: Hoare triple {28914#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28915#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:05:32,629 INFO L290 TraceCheckUtils]: 43: Hoare triple {28915#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28916#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:05:32,630 INFO L290 TraceCheckUtils]: 44: Hoare triple {28916#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28917#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:05:32,630 INFO L290 TraceCheckUtils]: 45: Hoare triple {28917#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28918#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:05:32,631 INFO L290 TraceCheckUtils]: 46: Hoare triple {28918#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28919#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:05:32,631 INFO L290 TraceCheckUtils]: 47: Hoare triple {28919#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28920#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:05:32,632 INFO L290 TraceCheckUtils]: 48: Hoare triple {28920#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28921#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:05:32,632 INFO L290 TraceCheckUtils]: 49: Hoare triple {28921#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28922#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:05:32,633 INFO L290 TraceCheckUtils]: 50: Hoare triple {28922#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28923#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 03:05:32,633 INFO L290 TraceCheckUtils]: 51: Hoare triple {28923#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28924#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 03:05:32,634 INFO L290 TraceCheckUtils]: 52: Hoare triple {28924#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28925#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 03:05:32,634 INFO L290 TraceCheckUtils]: 53: Hoare triple {28925#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28926#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-28 03:05:32,635 INFO L290 TraceCheckUtils]: 54: Hoare triple {28926#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28927#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-28 03:05:32,635 INFO L290 TraceCheckUtils]: 55: Hoare triple {28927#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28928#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-28 03:05:32,636 INFO L290 TraceCheckUtils]: 56: Hoare triple {28928#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28929#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 102))} is VALID [2022-04-28 03:05:32,636 INFO L290 TraceCheckUtils]: 57: Hoare triple {28929#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 102))} assume !(~x~0 % 4294967296 < 268435455); {28874#false} is VALID [2022-04-28 03:05:32,636 INFO L272 TraceCheckUtils]: 58: Hoare triple {28874#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {28874#false} is VALID [2022-04-28 03:05:32,636 INFO L290 TraceCheckUtils]: 59: Hoare triple {28874#false} ~cond := #in~cond; {28874#false} is VALID [2022-04-28 03:05:32,636 INFO L290 TraceCheckUtils]: 60: Hoare triple {28874#false} assume 0 == ~cond; {28874#false} is VALID [2022-04-28 03:05:32,636 INFO L290 TraceCheckUtils]: 61: Hoare triple {28874#false} assume !false; {28874#false} is VALID [2022-04-28 03:05:32,637 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:05:32,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:05:32,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207471917] [2022-04-28 03:05:32,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207471917] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:05:32,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637343207] [2022-04-28 03:05:32,637 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:05:32,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:05:32,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:05:32,638 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:05:32,639 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:05:35,690 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 27 check-sat command(s) [2022-04-28 03:05:35,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:05:35,696 WARN L261 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 108 conjunts are in the unsatisfiable core [2022-04-28 03:05:35,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:35,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:05:36,189 INFO L272 TraceCheckUtils]: 0: Hoare triple {28873#true} call ULTIMATE.init(); {28873#true} is VALID [2022-04-28 03:05:36,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {28873#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {28873#true} is VALID [2022-04-28 03:05:36,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {28873#true} assume true; {28873#true} is VALID [2022-04-28 03:05:36,189 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28873#true} {28873#true} #34#return; {28873#true} is VALID [2022-04-28 03:05:36,189 INFO L272 TraceCheckUtils]: 4: Hoare triple {28873#true} call #t~ret4 := main(); {28873#true} is VALID [2022-04-28 03:05:36,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {28873#true} ~x~0 := 0; {28878#(= main_~x~0 0)} is VALID [2022-04-28 03:05:36,190 INFO L290 TraceCheckUtils]: 6: Hoare triple {28878#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28879#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:05:36,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {28879#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28880#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:05:36,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {28880#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28881#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:05:36,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {28881#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28882#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:05:36,192 INFO L290 TraceCheckUtils]: 10: Hoare triple {28882#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28883#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:05:36,192 INFO L290 TraceCheckUtils]: 11: Hoare triple {28883#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28884#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:05:36,193 INFO L290 TraceCheckUtils]: 12: Hoare triple {28884#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28885#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:05:36,193 INFO L290 TraceCheckUtils]: 13: Hoare triple {28885#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28886#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:05:36,194 INFO L290 TraceCheckUtils]: 14: Hoare triple {28886#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28887#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:05:36,194 INFO L290 TraceCheckUtils]: 15: Hoare triple {28887#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28888#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:05:36,195 INFO L290 TraceCheckUtils]: 16: Hoare triple {28888#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28889#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:05:36,195 INFO L290 TraceCheckUtils]: 17: Hoare triple {28889#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28890#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:05:36,196 INFO L290 TraceCheckUtils]: 18: Hoare triple {28890#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28891#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:05:36,196 INFO L290 TraceCheckUtils]: 19: Hoare triple {28891#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28892#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:05:36,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {28892#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28893#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:05:36,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {28893#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28894#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:05:36,197 INFO L290 TraceCheckUtils]: 22: Hoare triple {28894#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28895#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:05:36,198 INFO L290 TraceCheckUtils]: 23: Hoare triple {28895#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28896#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:05:36,198 INFO L290 TraceCheckUtils]: 24: Hoare triple {28896#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28897#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:05:36,199 INFO L290 TraceCheckUtils]: 25: Hoare triple {28897#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28898#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:05:36,199 INFO L290 TraceCheckUtils]: 26: Hoare triple {28898#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28899#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:05:36,200 INFO L290 TraceCheckUtils]: 27: Hoare triple {28899#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28900#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:05:36,200 INFO L290 TraceCheckUtils]: 28: Hoare triple {28900#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28901#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:05:36,201 INFO L290 TraceCheckUtils]: 29: Hoare triple {28901#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28902#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:05:36,201 INFO L290 TraceCheckUtils]: 30: Hoare triple {28902#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28903#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:05:36,202 INFO L290 TraceCheckUtils]: 31: Hoare triple {28903#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28904#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:05:36,202 INFO L290 TraceCheckUtils]: 32: Hoare triple {28904#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28905#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:05:36,203 INFO L290 TraceCheckUtils]: 33: Hoare triple {28905#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28906#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:05:36,203 INFO L290 TraceCheckUtils]: 34: Hoare triple {28906#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28907#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:05:36,203 INFO L290 TraceCheckUtils]: 35: Hoare triple {28907#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28908#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:05:36,204 INFO L290 TraceCheckUtils]: 36: Hoare triple {28908#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28909#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:05:36,204 INFO L290 TraceCheckUtils]: 37: Hoare triple {28909#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28910#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:05:36,205 INFO L290 TraceCheckUtils]: 38: Hoare triple {28910#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28911#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:05:36,205 INFO L290 TraceCheckUtils]: 39: Hoare triple {28911#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28912#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:05:36,206 INFO L290 TraceCheckUtils]: 40: Hoare triple {28912#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28913#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:05:36,206 INFO L290 TraceCheckUtils]: 41: Hoare triple {28913#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28914#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:05:36,207 INFO L290 TraceCheckUtils]: 42: Hoare triple {28914#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28915#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:05:36,207 INFO L290 TraceCheckUtils]: 43: Hoare triple {28915#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28916#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:05:36,208 INFO L290 TraceCheckUtils]: 44: Hoare triple {28916#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28917#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:05:36,208 INFO L290 TraceCheckUtils]: 45: Hoare triple {28917#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28918#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:05:36,208 INFO L290 TraceCheckUtils]: 46: Hoare triple {28918#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28919#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:05:36,209 INFO L290 TraceCheckUtils]: 47: Hoare triple {28919#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28920#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:05:36,209 INFO L290 TraceCheckUtils]: 48: Hoare triple {28920#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28921#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:05:36,210 INFO L290 TraceCheckUtils]: 49: Hoare triple {28921#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28922#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:05:36,210 INFO L290 TraceCheckUtils]: 50: Hoare triple {28922#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28923#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 03:05:36,211 INFO L290 TraceCheckUtils]: 51: Hoare triple {28923#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28924#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 03:05:36,211 INFO L290 TraceCheckUtils]: 52: Hoare triple {28924#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28925#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 03:05:36,212 INFO L290 TraceCheckUtils]: 53: Hoare triple {28925#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28926#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-28 03:05:36,212 INFO L290 TraceCheckUtils]: 54: Hoare triple {28926#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28927#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-28 03:05:36,213 INFO L290 TraceCheckUtils]: 55: Hoare triple {28927#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {28928#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-28 03:05:36,213 INFO L290 TraceCheckUtils]: 56: Hoare triple {28928#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29102#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-28 03:05:36,214 INFO L290 TraceCheckUtils]: 57: Hoare triple {29102#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {28874#false} is VALID [2022-04-28 03:05:36,214 INFO L272 TraceCheckUtils]: 58: Hoare triple {28874#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {28874#false} is VALID [2022-04-28 03:05:36,214 INFO L290 TraceCheckUtils]: 59: Hoare triple {28874#false} ~cond := #in~cond; {28874#false} is VALID [2022-04-28 03:05:36,214 INFO L290 TraceCheckUtils]: 60: Hoare triple {28874#false} assume 0 == ~cond; {28874#false} is VALID [2022-04-28 03:05:36,214 INFO L290 TraceCheckUtils]: 61: Hoare triple {28874#false} assume !false; {28874#false} is VALID [2022-04-28 03:05:36,214 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:05:36,214 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:05:41,476 INFO L290 TraceCheckUtils]: 61: Hoare triple {28874#false} assume !false; {28874#false} is VALID [2022-04-28 03:05:41,476 INFO L290 TraceCheckUtils]: 60: Hoare triple {29121#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {28874#false} is VALID [2022-04-28 03:05:41,476 INFO L290 TraceCheckUtils]: 59: Hoare triple {29125#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {29121#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:05:41,477 INFO L272 TraceCheckUtils]: 58: Hoare triple {29129#(< 0 (mod main_~x~0 2))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {29125#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:05:41,477 INFO L290 TraceCheckUtils]: 57: Hoare triple {29133#(or (< 0 (mod main_~x~0 2)) (< (mod main_~x~0 4294967296) 268435455))} assume !(~x~0 % 4294967296 < 268435455); {29129#(< 0 (mod main_~x~0 2))} is VALID [2022-04-28 03:05:41,478 INFO L290 TraceCheckUtils]: 56: Hoare triple {29137#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29133#(or (< 0 (mod main_~x~0 2)) (< (mod main_~x~0 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,479 INFO L290 TraceCheckUtils]: 55: Hoare triple {29141#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29137#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,482 INFO L290 TraceCheckUtils]: 54: Hoare triple {29145#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29141#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 4) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,488 INFO L290 TraceCheckUtils]: 53: Hoare triple {29149#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29145#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,490 INFO L290 TraceCheckUtils]: 52: Hoare triple {29153#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29149#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,491 INFO L290 TraceCheckUtils]: 51: Hoare triple {29157#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29153#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,492 INFO L290 TraceCheckUtils]: 50: Hoare triple {29161#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29157#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,492 INFO L290 TraceCheckUtils]: 49: Hoare triple {29165#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 16) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29161#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 14) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,493 INFO L290 TraceCheckUtils]: 48: Hoare triple {29169#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29165#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 16) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,494 INFO L290 TraceCheckUtils]: 47: Hoare triple {29173#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29169#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 18) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,495 INFO L290 TraceCheckUtils]: 46: Hoare triple {29177#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29173#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,496 INFO L290 TraceCheckUtils]: 45: Hoare triple {29181#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29177#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,504 INFO L290 TraceCheckUtils]: 44: Hoare triple {29185#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29181#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,505 INFO L290 TraceCheckUtils]: 43: Hoare triple {29189#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 28) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29185#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,507 INFO L290 TraceCheckUtils]: 42: Hoare triple {29193#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 30 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29189#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 28) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,508 INFO L290 TraceCheckUtils]: 41: Hoare triple {29197#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29193#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 30 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,509 INFO L290 TraceCheckUtils]: 40: Hoare triple {29201#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 34) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29197#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,510 INFO L290 TraceCheckUtils]: 39: Hoare triple {29205#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29201#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 34) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,512 INFO L290 TraceCheckUtils]: 38: Hoare triple {29209#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 38) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29205#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,513 INFO L290 TraceCheckUtils]: 37: Hoare triple {29213#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (< 0 (mod main_~x~0 2)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29209#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 38) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,514 INFO L290 TraceCheckUtils]: 36: Hoare triple {29217#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 42 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29213#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (< 0 (mod main_~x~0 2)))} is VALID [2022-04-28 03:05:41,515 INFO L290 TraceCheckUtils]: 35: Hoare triple {29221#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29217#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 42 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,515 INFO L290 TraceCheckUtils]: 34: Hoare triple {29225#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29221#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,516 INFO L290 TraceCheckUtils]: 33: Hoare triple {29229#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29225#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,517 INFO L290 TraceCheckUtils]: 32: Hoare triple {29233#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 50) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29229#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,518 INFO L290 TraceCheckUtils]: 31: Hoare triple {29237#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29233#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 50) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,520 INFO L290 TraceCheckUtils]: 30: Hoare triple {29241#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29237#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,520 INFO L290 TraceCheckUtils]: 29: Hoare triple {29245#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 56 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29241#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,521 INFO L290 TraceCheckUtils]: 28: Hoare triple {29249#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 58) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29245#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 56 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,522 INFO L290 TraceCheckUtils]: 27: Hoare triple {29253#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 60) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29249#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 58) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,523 INFO L290 TraceCheckUtils]: 26: Hoare triple {29257#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 62) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29253#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 60) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,527 INFO L290 TraceCheckUtils]: 25: Hoare triple {29261#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 64 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29257#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 62) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,528 INFO L290 TraceCheckUtils]: 24: Hoare triple {29265#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 66 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29261#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 64 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,536 INFO L290 TraceCheckUtils]: 23: Hoare triple {29269#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 68 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29265#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 66 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,537 INFO L290 TraceCheckUtils]: 22: Hoare triple {29273#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 70) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29269#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 68 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,538 INFO L290 TraceCheckUtils]: 21: Hoare triple {29277#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 72 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29273#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 70) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,538 INFO L290 TraceCheckUtils]: 20: Hoare triple {29281#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 74) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29277#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 72 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,539 INFO L290 TraceCheckUtils]: 19: Hoare triple {29285#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 76 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29281#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 74) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,540 INFO L290 TraceCheckUtils]: 18: Hoare triple {29289#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 78) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29285#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 76 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,543 INFO L290 TraceCheckUtils]: 17: Hoare triple {29293#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 80) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29289#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 78) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,543 INFO L290 TraceCheckUtils]: 16: Hoare triple {29297#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 82) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29293#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 80) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {29301#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 84 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29297#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 82) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,545 INFO L290 TraceCheckUtils]: 14: Hoare triple {29305#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 86) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29301#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 84 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,549 INFO L290 TraceCheckUtils]: 13: Hoare triple {29309#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 88 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29305#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 86) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,552 INFO L290 TraceCheckUtils]: 12: Hoare triple {29313#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 90) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29309#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 88 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,552 INFO L290 TraceCheckUtils]: 11: Hoare triple {29317#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 92 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29313#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 90) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,559 INFO L290 TraceCheckUtils]: 10: Hoare triple {29321#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 94 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29317#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 92 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {29325#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 96) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29321#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 94 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {29329#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 98 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29325#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 96) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {29333#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 100) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29329#(or (< 0 (mod main_~x~0 2)) (< (mod (+ 98 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,563 INFO L290 TraceCheckUtils]: 6: Hoare triple {29337#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 102) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29333#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 100) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,563 INFO L290 TraceCheckUtils]: 5: Hoare triple {28873#true} ~x~0 := 0; {29337#(or (< 0 (mod main_~x~0 2)) (< (mod (+ main_~x~0 102) 4294967296) 268435455))} is VALID [2022-04-28 03:05:41,563 INFO L272 TraceCheckUtils]: 4: Hoare triple {28873#true} call #t~ret4 := main(); {28873#true} is VALID [2022-04-28 03:05:41,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28873#true} {28873#true} #34#return; {28873#true} is VALID [2022-04-28 03:05:41,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {28873#true} assume true; {28873#true} is VALID [2022-04-28 03:05:41,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {28873#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {28873#true} is VALID [2022-04-28 03:05:41,564 INFO L272 TraceCheckUtils]: 0: Hoare triple {28873#true} call ULTIMATE.init(); {28873#true} is VALID [2022-04-28 03:05:41,564 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:05:41,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637343207] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:05:41,564 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:05:41,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 54, 57] total 111 [2022-04-28 03:05:41,564 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:05:41,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2051703909] [2022-04-28 03:05:41,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2051703909] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:05:41,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:05:41,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2022-04-28 03:05:41,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117108227] [2022-04-28 03:05:41,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:05:41,565 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:05:41,565 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:05:41,565 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:05:41,605 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:41,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-04-28 03:05:41,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:05:41,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-04-28 03:05:41,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3079, Invalid=9131, Unknown=0, NotChecked=0, Total=12210 [2022-04-28 03:05:41,606 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:05:46,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:46,548 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2022-04-28 03:05:46,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-04-28 03:05:46,548 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:05:46,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:05:46,549 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:05:46,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2022-04-28 03:05:46,549 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:05:46,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2022-04-28 03:05:46,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 69 transitions. [2022-04-28 03:05:46,591 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:05:46,591 INFO L225 Difference]: With dead ends: 69 [2022-04-28 03:05:46,592 INFO L226 Difference]: Without dead ends: 64 [2022-04-28 03:05:46,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1440 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=6093, Invalid=20313, Unknown=0, NotChecked=0, Total=26406 [2022-04-28 03:05:46,593 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 2714 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 2819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 2714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:05:46,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 73 Invalid, 2819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 2714 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-28 03:05:46,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-28 03:05:46,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-04-28 03:05:46,677 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:05:46,677 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:05:46,677 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:05:46,677 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:05:46,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:46,678 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2022-04-28 03:05:46,678 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2022-04-28 03:05:46,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:05:46,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:05:46,678 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:05:46,678 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:05:46,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:46,679 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2022-04-28 03:05:46,679 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2022-04-28 03:05:46,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:05:46,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:05:46,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:05:46,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:05:46,679 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:05:46,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2022-04-28 03:05:46,680 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2022-04-28 03:05:46,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:05:46,680 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2022-04-28 03:05:46,680 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:05:46,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 64 transitions. [2022-04-28 03:05:46,728 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:05:46,729 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2022-04-28 03:05:46,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 03:05:46,729 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:05:46,729 INFO L195 NwaCegarLoop]: trace histogram [52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:05:46,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Forceful destruction successful, exit code 0 [2022-04-28 03:05:46,933 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:05:47,129 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:05:47,130 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:05:47,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:05:47,130 INFO L85 PathProgramCache]: Analyzing trace with hash 559394908, now seen corresponding path program 103 times [2022-04-28 03:05:47,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:05:47,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1459152001] [2022-04-28 03:05:47,255 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:47,256 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:05:47,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1147064759, now seen corresponding path program 1 times [2022-04-28 03:05:47,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:05:47,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593149955] [2022-04-28 03:05:47,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:05:47,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:05:47,263 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_52.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_52.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:05:47,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:05:47,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2048479075] [2022-04-28 03:05:47,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:05:47,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:05:47,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:05:47,267 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:05:47,268 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:05:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:05:47,312 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:05:47,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:05:47,320 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:05:47,320 INFO L85 PathProgramCache]: Analyzing trace with hash 559394908, now seen corresponding path program 104 times [2022-04-28 03:05:47,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:05:47,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110146783] [2022-04-28 03:05:47,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:05:47,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:05:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:48,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:05:48,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:48,634 INFO L290 TraceCheckUtils]: 0: Hoare triple {29914#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {29856#true} is VALID [2022-04-28 03:05:48,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {29856#true} assume true; {29856#true} is VALID [2022-04-28 03:05:48,634 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29856#true} {29856#true} #34#return; {29856#true} is VALID [2022-04-28 03:05:48,635 INFO L272 TraceCheckUtils]: 0: Hoare triple {29856#true} call ULTIMATE.init(); {29914#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:05:48,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {29914#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {29856#true} is VALID [2022-04-28 03:05:48,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {29856#true} assume true; {29856#true} is VALID [2022-04-28 03:05:48,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29856#true} {29856#true} #34#return; {29856#true} is VALID [2022-04-28 03:05:48,635 INFO L272 TraceCheckUtils]: 4: Hoare triple {29856#true} call #t~ret4 := main(); {29856#true} is VALID [2022-04-28 03:05:48,635 INFO L290 TraceCheckUtils]: 5: Hoare triple {29856#true} ~x~0 := 0; {29861#(= main_~x~0 0)} is VALID [2022-04-28 03:05:48,635 INFO L290 TraceCheckUtils]: 6: Hoare triple {29861#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29862#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:05:48,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {29862#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29863#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:05:48,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {29863#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29864#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:05:48,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {29864#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29865#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:05:48,637 INFO L290 TraceCheckUtils]: 10: Hoare triple {29865#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29866#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:05:48,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {29866#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29867#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:05:48,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {29867#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29868#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:05:48,639 INFO L290 TraceCheckUtils]: 13: Hoare triple {29868#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29869#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:05:48,639 INFO L290 TraceCheckUtils]: 14: Hoare triple {29869#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29870#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:05:48,640 INFO L290 TraceCheckUtils]: 15: Hoare triple {29870#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29871#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:05:48,640 INFO L290 TraceCheckUtils]: 16: Hoare triple {29871#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29872#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:05:48,641 INFO L290 TraceCheckUtils]: 17: Hoare triple {29872#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29873#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:05:48,641 INFO L290 TraceCheckUtils]: 18: Hoare triple {29873#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29874#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:05:48,642 INFO L290 TraceCheckUtils]: 19: Hoare triple {29874#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29875#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:05:48,642 INFO L290 TraceCheckUtils]: 20: Hoare triple {29875#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29876#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:05:48,642 INFO L290 TraceCheckUtils]: 21: Hoare triple {29876#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29877#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:05:48,643 INFO L290 TraceCheckUtils]: 22: Hoare triple {29877#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29878#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:05:48,643 INFO L290 TraceCheckUtils]: 23: Hoare triple {29878#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29879#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:05:48,644 INFO L290 TraceCheckUtils]: 24: Hoare triple {29879#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29880#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:05:48,644 INFO L290 TraceCheckUtils]: 25: Hoare triple {29880#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29881#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:05:48,645 INFO L290 TraceCheckUtils]: 26: Hoare triple {29881#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29882#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:05:48,645 INFO L290 TraceCheckUtils]: 27: Hoare triple {29882#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29883#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:05:48,646 INFO L290 TraceCheckUtils]: 28: Hoare triple {29883#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29884#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:05:48,646 INFO L290 TraceCheckUtils]: 29: Hoare triple {29884#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29885#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:05:48,647 INFO L290 TraceCheckUtils]: 30: Hoare triple {29885#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29886#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:05:48,647 INFO L290 TraceCheckUtils]: 31: Hoare triple {29886#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29887#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:05:48,647 INFO L290 TraceCheckUtils]: 32: Hoare triple {29887#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29888#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:05:48,648 INFO L290 TraceCheckUtils]: 33: Hoare triple {29888#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29889#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:05:48,648 INFO L290 TraceCheckUtils]: 34: Hoare triple {29889#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29890#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:05:48,649 INFO L290 TraceCheckUtils]: 35: Hoare triple {29890#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29891#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:05:48,649 INFO L290 TraceCheckUtils]: 36: Hoare triple {29891#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29892#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:05:48,650 INFO L290 TraceCheckUtils]: 37: Hoare triple {29892#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29893#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:05:48,650 INFO L290 TraceCheckUtils]: 38: Hoare triple {29893#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29894#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:05:48,651 INFO L290 TraceCheckUtils]: 39: Hoare triple {29894#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29895#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:05:48,651 INFO L290 TraceCheckUtils]: 40: Hoare triple {29895#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29896#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:05:48,652 INFO L290 TraceCheckUtils]: 41: Hoare triple {29896#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29897#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:05:48,652 INFO L290 TraceCheckUtils]: 42: Hoare triple {29897#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29898#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:05:48,653 INFO L290 TraceCheckUtils]: 43: Hoare triple {29898#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29899#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:05:48,653 INFO L290 TraceCheckUtils]: 44: Hoare triple {29899#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29900#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:05:48,654 INFO L290 TraceCheckUtils]: 45: Hoare triple {29900#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29901#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:05:48,654 INFO L290 TraceCheckUtils]: 46: Hoare triple {29901#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29902#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:05:48,654 INFO L290 TraceCheckUtils]: 47: Hoare triple {29902#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29903#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:05:48,655 INFO L290 TraceCheckUtils]: 48: Hoare triple {29903#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29904#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:05:48,655 INFO L290 TraceCheckUtils]: 49: Hoare triple {29904#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29905#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:05:48,656 INFO L290 TraceCheckUtils]: 50: Hoare triple {29905#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29906#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 03:05:48,656 INFO L290 TraceCheckUtils]: 51: Hoare triple {29906#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29907#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 03:05:48,657 INFO L290 TraceCheckUtils]: 52: Hoare triple {29907#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29908#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 03:05:48,657 INFO L290 TraceCheckUtils]: 53: Hoare triple {29908#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29909#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-28 03:05:48,658 INFO L290 TraceCheckUtils]: 54: Hoare triple {29909#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29910#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-28 03:05:48,658 INFO L290 TraceCheckUtils]: 55: Hoare triple {29910#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29911#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-28 03:05:48,659 INFO L290 TraceCheckUtils]: 56: Hoare triple {29911#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29912#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-28 03:05:48,659 INFO L290 TraceCheckUtils]: 57: Hoare triple {29912#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29913#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 104))} is VALID [2022-04-28 03:05:48,660 INFO L290 TraceCheckUtils]: 58: Hoare triple {29913#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 104))} assume !(~x~0 % 4294967296 < 268435455); {29857#false} is VALID [2022-04-28 03:05:48,660 INFO L272 TraceCheckUtils]: 59: Hoare triple {29857#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {29857#false} is VALID [2022-04-28 03:05:48,660 INFO L290 TraceCheckUtils]: 60: Hoare triple {29857#false} ~cond := #in~cond; {29857#false} is VALID [2022-04-28 03:05:48,660 INFO L290 TraceCheckUtils]: 61: Hoare triple {29857#false} assume 0 == ~cond; {29857#false} is VALID [2022-04-28 03:05:48,660 INFO L290 TraceCheckUtils]: 62: Hoare triple {29857#false} assume !false; {29857#false} is VALID [2022-04-28 03:05:48,660 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:05:48,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:05:48,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110146783] [2022-04-28 03:05:48,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110146783] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:05:48,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6592858] [2022-04-28 03:05:48,661 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:05:48,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:05:48,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:05:48,662 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:05:48,662 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:05:48,774 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:05:48,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:05:48,776 WARN L261 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 107 conjunts are in the unsatisfiable core [2022-04-28 03:05:48,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:05:48,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:05:49,343 INFO L272 TraceCheckUtils]: 0: Hoare triple {29856#true} call ULTIMATE.init(); {29856#true} is VALID [2022-04-28 03:05:49,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {29856#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {29856#true} is VALID [2022-04-28 03:05:49,343 INFO L290 TraceCheckUtils]: 2: Hoare triple {29856#true} assume true; {29856#true} is VALID [2022-04-28 03:05:49,344 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29856#true} {29856#true} #34#return; {29856#true} is VALID [2022-04-28 03:05:49,344 INFO L272 TraceCheckUtils]: 4: Hoare triple {29856#true} call #t~ret4 := main(); {29856#true} is VALID [2022-04-28 03:05:49,344 INFO L290 TraceCheckUtils]: 5: Hoare triple {29856#true} ~x~0 := 0; {29861#(= main_~x~0 0)} is VALID [2022-04-28 03:05:49,344 INFO L290 TraceCheckUtils]: 6: Hoare triple {29861#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29862#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:05:49,345 INFO L290 TraceCheckUtils]: 7: Hoare triple {29862#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29863#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:05:49,345 INFO L290 TraceCheckUtils]: 8: Hoare triple {29863#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29864#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:05:49,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {29864#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29865#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:05:49,346 INFO L290 TraceCheckUtils]: 10: Hoare triple {29865#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29866#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:05:49,347 INFO L290 TraceCheckUtils]: 11: Hoare triple {29866#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29867#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:05:49,347 INFO L290 TraceCheckUtils]: 12: Hoare triple {29867#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29868#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:05:49,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {29868#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29869#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:05:49,348 INFO L290 TraceCheckUtils]: 14: Hoare triple {29869#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29870#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:05:49,348 INFO L290 TraceCheckUtils]: 15: Hoare triple {29870#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29871#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:05:49,349 INFO L290 TraceCheckUtils]: 16: Hoare triple {29871#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29872#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:05:49,349 INFO L290 TraceCheckUtils]: 17: Hoare triple {29872#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29873#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:05:49,350 INFO L290 TraceCheckUtils]: 18: Hoare triple {29873#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29874#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:05:49,350 INFO L290 TraceCheckUtils]: 19: Hoare triple {29874#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29875#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:05:49,351 INFO L290 TraceCheckUtils]: 20: Hoare triple {29875#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29876#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:05:49,351 INFO L290 TraceCheckUtils]: 21: Hoare triple {29876#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29877#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:05:49,352 INFO L290 TraceCheckUtils]: 22: Hoare triple {29877#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29878#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:05:49,352 INFO L290 TraceCheckUtils]: 23: Hoare triple {29878#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29879#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:05:49,353 INFO L290 TraceCheckUtils]: 24: Hoare triple {29879#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29880#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:05:49,353 INFO L290 TraceCheckUtils]: 25: Hoare triple {29880#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29881#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:05:49,354 INFO L290 TraceCheckUtils]: 26: Hoare triple {29881#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29882#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:05:49,354 INFO L290 TraceCheckUtils]: 27: Hoare triple {29882#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29883#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:05:49,354 INFO L290 TraceCheckUtils]: 28: Hoare triple {29883#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29884#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:05:49,355 INFO L290 TraceCheckUtils]: 29: Hoare triple {29884#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29885#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:05:49,355 INFO L290 TraceCheckUtils]: 30: Hoare triple {29885#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29886#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:05:49,356 INFO L290 TraceCheckUtils]: 31: Hoare triple {29886#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29887#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:05:49,356 INFO L290 TraceCheckUtils]: 32: Hoare triple {29887#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29888#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:05:49,357 INFO L290 TraceCheckUtils]: 33: Hoare triple {29888#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29889#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:05:49,357 INFO L290 TraceCheckUtils]: 34: Hoare triple {29889#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29890#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:05:49,358 INFO L290 TraceCheckUtils]: 35: Hoare triple {29890#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29891#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:05:49,358 INFO L290 TraceCheckUtils]: 36: Hoare triple {29891#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29892#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:05:49,359 INFO L290 TraceCheckUtils]: 37: Hoare triple {29892#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29893#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:05:49,359 INFO L290 TraceCheckUtils]: 38: Hoare triple {29893#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29894#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:05:49,360 INFO L290 TraceCheckUtils]: 39: Hoare triple {29894#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29895#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:05:49,360 INFO L290 TraceCheckUtils]: 40: Hoare triple {29895#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29896#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:05:49,360 INFO L290 TraceCheckUtils]: 41: Hoare triple {29896#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29897#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:05:49,361 INFO L290 TraceCheckUtils]: 42: Hoare triple {29897#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29898#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:05:49,361 INFO L290 TraceCheckUtils]: 43: Hoare triple {29898#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29899#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:05:49,362 INFO L290 TraceCheckUtils]: 44: Hoare triple {29899#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29900#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:05:49,362 INFO L290 TraceCheckUtils]: 45: Hoare triple {29900#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29901#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:05:49,363 INFO L290 TraceCheckUtils]: 46: Hoare triple {29901#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29902#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:05:49,363 INFO L290 TraceCheckUtils]: 47: Hoare triple {29902#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29903#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:05:49,364 INFO L290 TraceCheckUtils]: 48: Hoare triple {29903#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29904#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:05:49,364 INFO L290 TraceCheckUtils]: 49: Hoare triple {29904#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29905#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:05:49,365 INFO L290 TraceCheckUtils]: 50: Hoare triple {29905#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29906#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 03:05:49,365 INFO L290 TraceCheckUtils]: 51: Hoare triple {29906#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29907#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 03:05:49,365 INFO L290 TraceCheckUtils]: 52: Hoare triple {29907#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29908#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 03:05:49,366 INFO L290 TraceCheckUtils]: 53: Hoare triple {29908#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29909#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-28 03:05:49,366 INFO L290 TraceCheckUtils]: 54: Hoare triple {29909#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29910#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-28 03:05:49,367 INFO L290 TraceCheckUtils]: 55: Hoare triple {29910#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29911#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-28 03:05:49,367 INFO L290 TraceCheckUtils]: 56: Hoare triple {29911#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {29912#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-28 03:05:49,368 INFO L290 TraceCheckUtils]: 57: Hoare triple {29912#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30089#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-28 03:05:49,368 INFO L290 TraceCheckUtils]: 58: Hoare triple {30089#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {29857#false} is VALID [2022-04-28 03:05:49,368 INFO L272 TraceCheckUtils]: 59: Hoare triple {29857#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {29857#false} is VALID [2022-04-28 03:05:49,368 INFO L290 TraceCheckUtils]: 60: Hoare triple {29857#false} ~cond := #in~cond; {29857#false} is VALID [2022-04-28 03:05:49,368 INFO L290 TraceCheckUtils]: 61: Hoare triple {29857#false} assume 0 == ~cond; {29857#false} is VALID [2022-04-28 03:05:49,368 INFO L290 TraceCheckUtils]: 62: Hoare triple {29857#false} assume !false; {29857#false} is VALID [2022-04-28 03:05:49,369 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:05:49,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:05:53,353 INFO L290 TraceCheckUtils]: 62: Hoare triple {29857#false} assume !false; {29857#false} is VALID [2022-04-28 03:05:53,353 INFO L290 TraceCheckUtils]: 61: Hoare triple {29857#false} assume 0 == ~cond; {29857#false} is VALID [2022-04-28 03:05:53,353 INFO L290 TraceCheckUtils]: 60: Hoare triple {29857#false} ~cond := #in~cond; {29857#false} is VALID [2022-04-28 03:05:53,354 INFO L272 TraceCheckUtils]: 59: Hoare triple {29857#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {29857#false} is VALID [2022-04-28 03:05:53,354 INFO L290 TraceCheckUtils]: 58: Hoare triple {30117#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {29857#false} is VALID [2022-04-28 03:05:53,355 INFO L290 TraceCheckUtils]: 57: Hoare triple {30121#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30117#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,355 INFO L290 TraceCheckUtils]: 56: Hoare triple {30125#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30121#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,356 INFO L290 TraceCheckUtils]: 55: Hoare triple {30129#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30125#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,356 INFO L290 TraceCheckUtils]: 54: Hoare triple {30133#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30129#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,357 INFO L290 TraceCheckUtils]: 53: Hoare triple {30137#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30133#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,357 INFO L290 TraceCheckUtils]: 52: Hoare triple {30141#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30137#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,358 INFO L290 TraceCheckUtils]: 51: Hoare triple {30145#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30141#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,359 INFO L290 TraceCheckUtils]: 50: Hoare triple {30149#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30145#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,359 INFO L290 TraceCheckUtils]: 49: Hoare triple {30153#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30149#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,360 INFO L290 TraceCheckUtils]: 48: Hoare triple {30157#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30153#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,360 INFO L290 TraceCheckUtils]: 47: Hoare triple {30161#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30157#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,361 INFO L290 TraceCheckUtils]: 46: Hoare triple {30165#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30161#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,361 INFO L290 TraceCheckUtils]: 45: Hoare triple {30169#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30165#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,362 INFO L290 TraceCheckUtils]: 44: Hoare triple {30173#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30169#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,363 INFO L290 TraceCheckUtils]: 43: Hoare triple {30177#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30173#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,363 INFO L290 TraceCheckUtils]: 42: Hoare triple {30181#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30177#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,364 INFO L290 TraceCheckUtils]: 41: Hoare triple {30185#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30181#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,364 INFO L290 TraceCheckUtils]: 40: Hoare triple {30189#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30185#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,365 INFO L290 TraceCheckUtils]: 39: Hoare triple {30193#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30189#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,365 INFO L290 TraceCheckUtils]: 38: Hoare triple {30197#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30193#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,366 INFO L290 TraceCheckUtils]: 37: Hoare triple {30201#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30197#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,367 INFO L290 TraceCheckUtils]: 36: Hoare triple {30205#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30201#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,367 INFO L290 TraceCheckUtils]: 35: Hoare triple {30209#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30205#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,368 INFO L290 TraceCheckUtils]: 34: Hoare triple {30213#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30209#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,368 INFO L290 TraceCheckUtils]: 33: Hoare triple {30217#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30213#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,369 INFO L290 TraceCheckUtils]: 32: Hoare triple {30221#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30217#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,369 INFO L290 TraceCheckUtils]: 31: Hoare triple {30225#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30221#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,370 INFO L290 TraceCheckUtils]: 30: Hoare triple {30229#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30225#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,371 INFO L290 TraceCheckUtils]: 29: Hoare triple {30233#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30229#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,371 INFO L290 TraceCheckUtils]: 28: Hoare triple {30237#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30233#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,372 INFO L290 TraceCheckUtils]: 27: Hoare triple {30241#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30237#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,372 INFO L290 TraceCheckUtils]: 26: Hoare triple {30245#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30241#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,373 INFO L290 TraceCheckUtils]: 25: Hoare triple {30249#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30245#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,373 INFO L290 TraceCheckUtils]: 24: Hoare triple {30253#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30249#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,374 INFO L290 TraceCheckUtils]: 23: Hoare triple {30257#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30253#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,375 INFO L290 TraceCheckUtils]: 22: Hoare triple {30261#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30257#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,375 INFO L290 TraceCheckUtils]: 21: Hoare triple {30265#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30261#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,376 INFO L290 TraceCheckUtils]: 20: Hoare triple {30269#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30265#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,376 INFO L290 TraceCheckUtils]: 19: Hoare triple {30273#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30269#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,377 INFO L290 TraceCheckUtils]: 18: Hoare triple {30277#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30273#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,377 INFO L290 TraceCheckUtils]: 17: Hoare triple {30281#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30277#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,378 INFO L290 TraceCheckUtils]: 16: Hoare triple {30285#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30281#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,379 INFO L290 TraceCheckUtils]: 15: Hoare triple {30289#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30285#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,379 INFO L290 TraceCheckUtils]: 14: Hoare triple {30293#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30289#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,380 INFO L290 TraceCheckUtils]: 13: Hoare triple {30297#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30293#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,380 INFO L290 TraceCheckUtils]: 12: Hoare triple {30301#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30297#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,381 INFO L290 TraceCheckUtils]: 11: Hoare triple {30305#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30301#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,381 INFO L290 TraceCheckUtils]: 10: Hoare triple {30309#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30305#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {30313#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30309#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {30317#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30313#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {30321#(< (mod (+ main_~x~0 102) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30317#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,384 INFO L290 TraceCheckUtils]: 6: Hoare triple {30325#(< (mod (+ 104 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30321#(< (mod (+ main_~x~0 102) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {29856#true} ~x~0 := 0; {30325#(< (mod (+ 104 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:05:53,384 INFO L272 TraceCheckUtils]: 4: Hoare triple {29856#true} call #t~ret4 := main(); {29856#true} is VALID [2022-04-28 03:05:53,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29856#true} {29856#true} #34#return; {29856#true} is VALID [2022-04-28 03:05:53,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {29856#true} assume true; {29856#true} is VALID [2022-04-28 03:05:53,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {29856#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {29856#true} is VALID [2022-04-28 03:05:53,384 INFO L272 TraceCheckUtils]: 0: Hoare triple {29856#true} call ULTIMATE.init(); {29856#true} is VALID [2022-04-28 03:05:53,385 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:05:53,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6592858] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:05:53,385 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:05:53,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 55, 55] total 110 [2022-04-28 03:05:53,385 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:05:53,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1459152001] [2022-04-28 03:05:53,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1459152001] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:05:53,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:05:53,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2022-04-28 03:05:53,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803629646] [2022-04-28 03:05:53,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:05:53,386 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:05:53,386 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:05:53,386 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:05:53,417 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:53,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-04-28 03:05:53,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:05:53,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-04-28 03:05:53,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3132, Invalid=8858, Unknown=0, NotChecked=0, Total=11990 [2022-04-28 03:05:53,418 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:05:58,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:58,560 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2022-04-28 03:05:58,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-04-28 03:05:58,560 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:05:58,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:05:58,560 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:05:58,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2022-04-28 03:05:58,561 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:05:58,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2022-04-28 03:05:58,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 70 transitions. [2022-04-28 03:05:58,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:05:58,626 INFO L225 Difference]: With dead ends: 70 [2022-04-28 03:05:58,626 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 03:05:58,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1488 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=6257, Invalid=20149, Unknown=0, NotChecked=0, Total=26406 [2022-04-28 03:05:58,628 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 2883 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 2990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 2883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:05:58,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 138 Invalid, 2990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 2883 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-28 03:05:58,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 03:05:58,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-28 03:05:58,689 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:05:58,689 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:05:58,690 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:05:58,690 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:05:58,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:58,690 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2022-04-28 03:05:58,690 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2022-04-28 03:05:58,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:05:58,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:05:58,691 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:05:58,691 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:05:58,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:05:58,691 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2022-04-28 03:05:58,691 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2022-04-28 03:05:58,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:05:58,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:05:58,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:05:58,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:05:58,692 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:05:58,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2022-04-28 03:05:58,692 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2022-04-28 03:05:58,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:05:58,692 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2022-04-28 03:05:58,692 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:05:58,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 65 transitions. [2022-04-28 03:05:58,748 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:05:58,748 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2022-04-28 03:05:58,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-28 03:05:58,748 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:05:58,748 INFO L195 NwaCegarLoop]: trace histogram [53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:05:58,755 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:05:58,967 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:05:59,149 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:05:59,149 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:05:59,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:05:59,149 INFO L85 PathProgramCache]: Analyzing trace with hash 197834230, now seen corresponding path program 105 times [2022-04-28 03:05:59,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:05:59,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [646382906] [2022-04-28 03:06:01,295 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:01,297 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:06:01,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1206170103, now seen corresponding path program 1 times [2022-04-28 03:06:01,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:06:01,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21188101] [2022-04-28 03:06:01,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:06:01,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:06:01,302 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 2) .v_it_53.0) (* (- 1) main_~x~0_5) (* 4294967296 (div (+ (* 2 .v_it_53.0) main_~x~0_5) 4294967296)) 268435455) 0)) [2022-04-28 03:06:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:06:01,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1250563536] [2022-04-28 03:06:01,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:06:01,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:06:01,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:06:01,306 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:06:01,306 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:06:01,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:06:01,351 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:06:01,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:06:01,359 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:06:01,359 INFO L85 PathProgramCache]: Analyzing trace with hash 197834230, now seen corresponding path program 106 times [2022-04-28 03:06:01,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:06:01,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769456801] [2022-04-28 03:06:01,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:06:01,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:06:01,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:06:02,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:06:02,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:06:02,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {30911#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {30852#true} is VALID [2022-04-28 03:06:02,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {30852#true} assume true; {30852#true} is VALID [2022-04-28 03:06:02,720 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30852#true} {30852#true} #34#return; {30852#true} is VALID [2022-04-28 03:06:02,721 INFO L272 TraceCheckUtils]: 0: Hoare triple {30852#true} call ULTIMATE.init(); {30911#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:06:02,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {30911#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {30852#true} is VALID [2022-04-28 03:06:02,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {30852#true} assume true; {30852#true} is VALID [2022-04-28 03:06:02,721 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30852#true} {30852#true} #34#return; {30852#true} is VALID [2022-04-28 03:06:02,721 INFO L272 TraceCheckUtils]: 4: Hoare triple {30852#true} call #t~ret4 := main(); {30852#true} is VALID [2022-04-28 03:06:02,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {30852#true} ~x~0 := 0; {30857#(= main_~x~0 0)} is VALID [2022-04-28 03:06:02,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {30857#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30858#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:06:02,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {30858#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30859#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:06:02,722 INFO L290 TraceCheckUtils]: 8: Hoare triple {30859#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30860#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:06:02,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {30860#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30861#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:06:02,723 INFO L290 TraceCheckUtils]: 10: Hoare triple {30861#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30862#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:06:02,724 INFO L290 TraceCheckUtils]: 11: Hoare triple {30862#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30863#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:06:02,724 INFO L290 TraceCheckUtils]: 12: Hoare triple {30863#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30864#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:06:02,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {30864#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30865#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:06:02,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {30865#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30866#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:06:02,726 INFO L290 TraceCheckUtils]: 15: Hoare triple {30866#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30867#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:06:02,726 INFO L290 TraceCheckUtils]: 16: Hoare triple {30867#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30868#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:06:02,727 INFO L290 TraceCheckUtils]: 17: Hoare triple {30868#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30869#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:06:02,727 INFO L290 TraceCheckUtils]: 18: Hoare triple {30869#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30870#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:06:02,727 INFO L290 TraceCheckUtils]: 19: Hoare triple {30870#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30871#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:06:02,728 INFO L290 TraceCheckUtils]: 20: Hoare triple {30871#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30872#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:06:02,728 INFO L290 TraceCheckUtils]: 21: Hoare triple {30872#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30873#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:06:02,729 INFO L290 TraceCheckUtils]: 22: Hoare triple {30873#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30874#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:06:02,729 INFO L290 TraceCheckUtils]: 23: Hoare triple {30874#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30875#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:06:02,730 INFO L290 TraceCheckUtils]: 24: Hoare triple {30875#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30876#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:06:02,730 INFO L290 TraceCheckUtils]: 25: Hoare triple {30876#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30877#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:06:02,731 INFO L290 TraceCheckUtils]: 26: Hoare triple {30877#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30878#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:06:02,731 INFO L290 TraceCheckUtils]: 27: Hoare triple {30878#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30879#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:06:02,732 INFO L290 TraceCheckUtils]: 28: Hoare triple {30879#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30880#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:06:02,732 INFO L290 TraceCheckUtils]: 29: Hoare triple {30880#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30881#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:06:02,733 INFO L290 TraceCheckUtils]: 30: Hoare triple {30881#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30882#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:06:02,733 INFO L290 TraceCheckUtils]: 31: Hoare triple {30882#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30883#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:06:02,733 INFO L290 TraceCheckUtils]: 32: Hoare triple {30883#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30884#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:06:02,734 INFO L290 TraceCheckUtils]: 33: Hoare triple {30884#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30885#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:06:02,734 INFO L290 TraceCheckUtils]: 34: Hoare triple {30885#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30886#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:06:02,735 INFO L290 TraceCheckUtils]: 35: Hoare triple {30886#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30887#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:06:02,735 INFO L290 TraceCheckUtils]: 36: Hoare triple {30887#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30888#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:06:02,736 INFO L290 TraceCheckUtils]: 37: Hoare triple {30888#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30889#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:06:02,736 INFO L290 TraceCheckUtils]: 38: Hoare triple {30889#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30890#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:06:02,737 INFO L290 TraceCheckUtils]: 39: Hoare triple {30890#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30891#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:06:02,737 INFO L290 TraceCheckUtils]: 40: Hoare triple {30891#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30892#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:06:02,738 INFO L290 TraceCheckUtils]: 41: Hoare triple {30892#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30893#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:06:02,738 INFO L290 TraceCheckUtils]: 42: Hoare triple {30893#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30894#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:06:02,739 INFO L290 TraceCheckUtils]: 43: Hoare triple {30894#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30895#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:06:02,739 INFO L290 TraceCheckUtils]: 44: Hoare triple {30895#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30896#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:06:02,739 INFO L290 TraceCheckUtils]: 45: Hoare triple {30896#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30897#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:06:02,740 INFO L290 TraceCheckUtils]: 46: Hoare triple {30897#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30898#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:06:02,740 INFO L290 TraceCheckUtils]: 47: Hoare triple {30898#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30899#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:06:02,741 INFO L290 TraceCheckUtils]: 48: Hoare triple {30899#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30900#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:06:02,741 INFO L290 TraceCheckUtils]: 49: Hoare triple {30900#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30901#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:06:02,742 INFO L290 TraceCheckUtils]: 50: Hoare triple {30901#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30902#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 03:06:02,742 INFO L290 TraceCheckUtils]: 51: Hoare triple {30902#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30903#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 03:06:02,743 INFO L290 TraceCheckUtils]: 52: Hoare triple {30903#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30904#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 03:06:02,743 INFO L290 TraceCheckUtils]: 53: Hoare triple {30904#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30905#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-28 03:06:02,743 INFO L290 TraceCheckUtils]: 54: Hoare triple {30905#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30906#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-28 03:06:02,744 INFO L290 TraceCheckUtils]: 55: Hoare triple {30906#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30907#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-28 03:06:02,744 INFO L290 TraceCheckUtils]: 56: Hoare triple {30907#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30908#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-28 03:06:02,745 INFO L290 TraceCheckUtils]: 57: Hoare triple {30908#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30909#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-28 03:06:02,745 INFO L290 TraceCheckUtils]: 58: Hoare triple {30909#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30910#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 106))} is VALID [2022-04-28 03:06:02,746 INFO L290 TraceCheckUtils]: 59: Hoare triple {30910#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 106))} assume !(~x~0 % 4294967296 < 268435455); {30853#false} is VALID [2022-04-28 03:06:02,746 INFO L272 TraceCheckUtils]: 60: Hoare triple {30853#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {30853#false} is VALID [2022-04-28 03:06:02,746 INFO L290 TraceCheckUtils]: 61: Hoare triple {30853#false} ~cond := #in~cond; {30853#false} is VALID [2022-04-28 03:06:02,746 INFO L290 TraceCheckUtils]: 62: Hoare triple {30853#false} assume 0 == ~cond; {30853#false} is VALID [2022-04-28 03:06:02,746 INFO L290 TraceCheckUtils]: 63: Hoare triple {30853#false} assume !false; {30853#false} is VALID [2022-04-28 03:06:02,746 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:06:02,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:06:02,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769456801] [2022-04-28 03:06:02,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769456801] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:06:02,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636413648] [2022-04-28 03:06:02,747 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:06:02,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:06:02,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:06:02,748 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:06:02,748 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:06:02,874 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:06:02,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:06:02,876 WARN L261 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 109 conjunts are in the unsatisfiable core [2022-04-28 03:06:02,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:06:02,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:06:03,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {30852#true} call ULTIMATE.init(); {30852#true} is VALID [2022-04-28 03:06:03,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {30852#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {30852#true} is VALID [2022-04-28 03:06:03,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {30852#true} assume true; {30852#true} is VALID [2022-04-28 03:06:03,454 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30852#true} {30852#true} #34#return; {30852#true} is VALID [2022-04-28 03:06:03,454 INFO L272 TraceCheckUtils]: 4: Hoare triple {30852#true} call #t~ret4 := main(); {30852#true} is VALID [2022-04-28 03:06:03,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {30852#true} ~x~0 := 0; {30857#(= main_~x~0 0)} is VALID [2022-04-28 03:06:03,455 INFO L290 TraceCheckUtils]: 6: Hoare triple {30857#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30858#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:06:03,455 INFO L290 TraceCheckUtils]: 7: Hoare triple {30858#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30859#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:06:03,456 INFO L290 TraceCheckUtils]: 8: Hoare triple {30859#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30860#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:06:03,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {30860#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30861#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:06:03,457 INFO L290 TraceCheckUtils]: 10: Hoare triple {30861#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30862#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:06:03,457 INFO L290 TraceCheckUtils]: 11: Hoare triple {30862#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30863#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:06:03,458 INFO L290 TraceCheckUtils]: 12: Hoare triple {30863#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30864#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:06:03,458 INFO L290 TraceCheckUtils]: 13: Hoare triple {30864#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30865#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:06:03,459 INFO L290 TraceCheckUtils]: 14: Hoare triple {30865#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30866#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:06:03,459 INFO L290 TraceCheckUtils]: 15: Hoare triple {30866#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30867#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:06:03,460 INFO L290 TraceCheckUtils]: 16: Hoare triple {30867#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30868#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:06:03,460 INFO L290 TraceCheckUtils]: 17: Hoare triple {30868#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30869#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:06:03,461 INFO L290 TraceCheckUtils]: 18: Hoare triple {30869#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30870#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:06:03,461 INFO L290 TraceCheckUtils]: 19: Hoare triple {30870#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30871#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:06:03,461 INFO L290 TraceCheckUtils]: 20: Hoare triple {30871#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30872#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:06:03,462 INFO L290 TraceCheckUtils]: 21: Hoare triple {30872#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30873#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:06:03,462 INFO L290 TraceCheckUtils]: 22: Hoare triple {30873#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30874#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:06:03,463 INFO L290 TraceCheckUtils]: 23: Hoare triple {30874#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30875#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:06:03,463 INFO L290 TraceCheckUtils]: 24: Hoare triple {30875#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30876#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:06:03,464 INFO L290 TraceCheckUtils]: 25: Hoare triple {30876#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30877#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:06:03,464 INFO L290 TraceCheckUtils]: 26: Hoare triple {30877#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30878#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:06:03,465 INFO L290 TraceCheckUtils]: 27: Hoare triple {30878#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30879#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:06:03,465 INFO L290 TraceCheckUtils]: 28: Hoare triple {30879#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30880#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:06:03,466 INFO L290 TraceCheckUtils]: 29: Hoare triple {30880#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30881#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:06:03,466 INFO L290 TraceCheckUtils]: 30: Hoare triple {30881#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30882#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:06:03,467 INFO L290 TraceCheckUtils]: 31: Hoare triple {30882#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30883#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:06:03,467 INFO L290 TraceCheckUtils]: 32: Hoare triple {30883#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30884#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:06:03,467 INFO L290 TraceCheckUtils]: 33: Hoare triple {30884#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30885#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:06:03,468 INFO L290 TraceCheckUtils]: 34: Hoare triple {30885#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30886#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:06:03,468 INFO L290 TraceCheckUtils]: 35: Hoare triple {30886#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30887#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:06:03,469 INFO L290 TraceCheckUtils]: 36: Hoare triple {30887#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30888#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:06:03,469 INFO L290 TraceCheckUtils]: 37: Hoare triple {30888#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30889#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:06:03,470 INFO L290 TraceCheckUtils]: 38: Hoare triple {30889#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30890#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:06:03,470 INFO L290 TraceCheckUtils]: 39: Hoare triple {30890#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30891#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:06:03,471 INFO L290 TraceCheckUtils]: 40: Hoare triple {30891#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30892#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:06:03,471 INFO L290 TraceCheckUtils]: 41: Hoare triple {30892#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30893#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:06:03,472 INFO L290 TraceCheckUtils]: 42: Hoare triple {30893#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30894#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:06:03,472 INFO L290 TraceCheckUtils]: 43: Hoare triple {30894#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30895#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:06:03,473 INFO L290 TraceCheckUtils]: 44: Hoare triple {30895#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30896#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:06:03,473 INFO L290 TraceCheckUtils]: 45: Hoare triple {30896#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30897#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:06:03,473 INFO L290 TraceCheckUtils]: 46: Hoare triple {30897#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30898#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:06:03,474 INFO L290 TraceCheckUtils]: 47: Hoare triple {30898#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30899#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:06:03,474 INFO L290 TraceCheckUtils]: 48: Hoare triple {30899#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30900#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:06:03,475 INFO L290 TraceCheckUtils]: 49: Hoare triple {30900#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30901#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:06:03,475 INFO L290 TraceCheckUtils]: 50: Hoare triple {30901#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30902#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 03:06:03,476 INFO L290 TraceCheckUtils]: 51: Hoare triple {30902#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30903#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 03:06:03,476 INFO L290 TraceCheckUtils]: 52: Hoare triple {30903#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30904#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 03:06:03,477 INFO L290 TraceCheckUtils]: 53: Hoare triple {30904#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30905#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-28 03:06:03,477 INFO L290 TraceCheckUtils]: 54: Hoare triple {30905#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30906#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-28 03:06:03,478 INFO L290 TraceCheckUtils]: 55: Hoare triple {30906#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30907#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-28 03:06:03,478 INFO L290 TraceCheckUtils]: 56: Hoare triple {30907#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30908#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-28 03:06:03,479 INFO L290 TraceCheckUtils]: 57: Hoare triple {30908#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {30909#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-28 03:06:03,479 INFO L290 TraceCheckUtils]: 58: Hoare triple {30909#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31089#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-28 03:06:03,479 INFO L290 TraceCheckUtils]: 59: Hoare triple {31089#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !(~x~0 % 4294967296 < 268435455); {30853#false} is VALID [2022-04-28 03:06:03,480 INFO L272 TraceCheckUtils]: 60: Hoare triple {30853#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {30853#false} is VALID [2022-04-28 03:06:03,480 INFO L290 TraceCheckUtils]: 61: Hoare triple {30853#false} ~cond := #in~cond; {30853#false} is VALID [2022-04-28 03:06:03,480 INFO L290 TraceCheckUtils]: 62: Hoare triple {30853#false} assume 0 == ~cond; {30853#false} is VALID [2022-04-28 03:06:03,480 INFO L290 TraceCheckUtils]: 63: Hoare triple {30853#false} assume !false; {30853#false} is VALID [2022-04-28 03:06:03,480 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:06:03,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:06:07,618 INFO L290 TraceCheckUtils]: 63: Hoare triple {30853#false} assume !false; {30853#false} is VALID [2022-04-28 03:06:07,618 INFO L290 TraceCheckUtils]: 62: Hoare triple {30853#false} assume 0 == ~cond; {30853#false} is VALID [2022-04-28 03:06:07,618 INFO L290 TraceCheckUtils]: 61: Hoare triple {30853#false} ~cond := #in~cond; {30853#false} is VALID [2022-04-28 03:06:07,618 INFO L272 TraceCheckUtils]: 60: Hoare triple {30853#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {30853#false} is VALID [2022-04-28 03:06:07,619 INFO L290 TraceCheckUtils]: 59: Hoare triple {31117#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {30853#false} is VALID [2022-04-28 03:06:07,620 INFO L290 TraceCheckUtils]: 58: Hoare triple {31121#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31117#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,620 INFO L290 TraceCheckUtils]: 57: Hoare triple {31125#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31121#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,621 INFO L290 TraceCheckUtils]: 56: Hoare triple {31129#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31125#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,621 INFO L290 TraceCheckUtils]: 55: Hoare triple {31133#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31129#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,622 INFO L290 TraceCheckUtils]: 54: Hoare triple {31137#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31133#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,622 INFO L290 TraceCheckUtils]: 53: Hoare triple {31141#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31137#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,623 INFO L290 TraceCheckUtils]: 52: Hoare triple {31145#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31141#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,624 INFO L290 TraceCheckUtils]: 51: Hoare triple {31149#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31145#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,624 INFO L290 TraceCheckUtils]: 50: Hoare triple {31153#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31149#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,625 INFO L290 TraceCheckUtils]: 49: Hoare triple {31157#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31153#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,625 INFO L290 TraceCheckUtils]: 48: Hoare triple {31161#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31157#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,626 INFO L290 TraceCheckUtils]: 47: Hoare triple {31165#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31161#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,626 INFO L290 TraceCheckUtils]: 46: Hoare triple {31169#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31165#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,639 INFO L290 TraceCheckUtils]: 45: Hoare triple {31173#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31169#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,640 INFO L290 TraceCheckUtils]: 44: Hoare triple {31177#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31173#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,640 INFO L290 TraceCheckUtils]: 43: Hoare triple {31181#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31177#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,641 INFO L290 TraceCheckUtils]: 42: Hoare triple {31185#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31181#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,641 INFO L290 TraceCheckUtils]: 41: Hoare triple {31189#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31185#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,642 INFO L290 TraceCheckUtils]: 40: Hoare triple {31193#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31189#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,643 INFO L290 TraceCheckUtils]: 39: Hoare triple {31197#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31193#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,643 INFO L290 TraceCheckUtils]: 38: Hoare triple {31201#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31197#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,644 INFO L290 TraceCheckUtils]: 37: Hoare triple {31205#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31201#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,644 INFO L290 TraceCheckUtils]: 36: Hoare triple {31209#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31205#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,645 INFO L290 TraceCheckUtils]: 35: Hoare triple {31213#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31209#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,646 INFO L290 TraceCheckUtils]: 34: Hoare triple {31217#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31213#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,646 INFO L290 TraceCheckUtils]: 33: Hoare triple {31221#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31217#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,647 INFO L290 TraceCheckUtils]: 32: Hoare triple {31225#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31221#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,647 INFO L290 TraceCheckUtils]: 31: Hoare triple {31229#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31225#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,648 INFO L290 TraceCheckUtils]: 30: Hoare triple {31233#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31229#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,648 INFO L290 TraceCheckUtils]: 29: Hoare triple {31237#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31233#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,649 INFO L290 TraceCheckUtils]: 28: Hoare triple {31241#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31237#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,654 INFO L290 TraceCheckUtils]: 27: Hoare triple {31245#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31241#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,655 INFO L290 TraceCheckUtils]: 26: Hoare triple {31249#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31245#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,655 INFO L290 TraceCheckUtils]: 25: Hoare triple {31253#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31249#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,656 INFO L290 TraceCheckUtils]: 24: Hoare triple {31257#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31253#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,657 INFO L290 TraceCheckUtils]: 23: Hoare triple {31261#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31257#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,657 INFO L290 TraceCheckUtils]: 22: Hoare triple {31265#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31261#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,658 INFO L290 TraceCheckUtils]: 21: Hoare triple {31269#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31265#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,658 INFO L290 TraceCheckUtils]: 20: Hoare triple {31273#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31269#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,659 INFO L290 TraceCheckUtils]: 19: Hoare triple {31277#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31273#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,659 INFO L290 TraceCheckUtils]: 18: Hoare triple {31281#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31277#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,660 INFO L290 TraceCheckUtils]: 17: Hoare triple {31285#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31281#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,661 INFO L290 TraceCheckUtils]: 16: Hoare triple {31289#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31285#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,661 INFO L290 TraceCheckUtils]: 15: Hoare triple {31293#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31289#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {31297#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31293#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {31301#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31297#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,663 INFO L290 TraceCheckUtils]: 12: Hoare triple {31305#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31301#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,663 INFO L290 TraceCheckUtils]: 11: Hoare triple {31309#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31305#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,664 INFO L290 TraceCheckUtils]: 10: Hoare triple {31313#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31309#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,665 INFO L290 TraceCheckUtils]: 9: Hoare triple {31317#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31313#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,665 INFO L290 TraceCheckUtils]: 8: Hoare triple {31321#(< (mod (+ main_~x~0 102) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31317#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,666 INFO L290 TraceCheckUtils]: 7: Hoare triple {31325#(< (mod (+ 104 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31321#(< (mod (+ main_~x~0 102) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,666 INFO L290 TraceCheckUtils]: 6: Hoare triple {31329#(< (mod (+ 106 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31325#(< (mod (+ 104 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {30852#true} ~x~0 := 0; {31329#(< (mod (+ 106 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:07,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {30852#true} call #t~ret4 := main(); {30852#true} is VALID [2022-04-28 03:06:07,667 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30852#true} {30852#true} #34#return; {30852#true} is VALID [2022-04-28 03:06:07,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {30852#true} assume true; {30852#true} is VALID [2022-04-28 03:06:07,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {30852#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {30852#true} is VALID [2022-04-28 03:06:07,667 INFO L272 TraceCheckUtils]: 0: Hoare triple {30852#true} call ULTIMATE.init(); {30852#true} is VALID [2022-04-28 03:06:07,667 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:06:07,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636413648] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:06:07,668 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:06:07,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 56, 56] total 112 [2022-04-28 03:06:07,668 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:06:07,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [646382906] [2022-04-28 03:06:07,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [646382906] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:06:07,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:06:07,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [57] imperfect sequences [] total 57 [2022-04-28 03:06:07,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056105849] [2022-04-28 03:06:07,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:06:07,668 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:06:07,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:06:07,669 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:06:07,700 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:07,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-04-28 03:06:07,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:06:07,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-04-28 03:06:07,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3245, Invalid=9187, Unknown=0, NotChecked=0, Total=12432 [2022-04-28 03:06:07,701 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:06:12,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:06:12,952 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2022-04-28 03:06:12,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-04-28 03:06:12,952 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:06:12,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:06:12,953 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:06:12,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 71 transitions. [2022-04-28 03:06:12,953 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:06:12,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 71 transitions. [2022-04-28 03:06:12,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 71 transitions. [2022-04-28 03:06:12,997 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:06:12,998 INFO L225 Difference]: With dead ends: 71 [2022-04-28 03:06:12,998 INFO L226 Difference]: Without dead ends: 66 [2022-04-28 03:06:12,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1543 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=6483, Invalid=20907, Unknown=0, NotChecked=0, Total=27390 [2022-04-28 03:06:13,000 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 2949 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 3058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 2949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:06:13,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 98 Invalid, 3058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 2949 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-28 03:06:13,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-28 03:06:13,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-04-28 03:06:13,072 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:06:13,072 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:06:13,072 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:06:13,072 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:06:13,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:06:13,073 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2022-04-28 03:06:13,073 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2022-04-28 03:06:13,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:06:13,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:06:13,073 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:06:13,073 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:06:13,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:06:13,074 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2022-04-28 03:06:13,074 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2022-04-28 03:06:13,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:06:13,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:06:13,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:06:13,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:06:13,074 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:06:13,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2022-04-28 03:06:13,075 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2022-04-28 03:06:13,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:06:13,075 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2022-04-28 03:06:13,075 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:06:13,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 66 transitions. [2022-04-28 03:06:13,122 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:13,122 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2022-04-28 03:06:13,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-28 03:06:13,122 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:06:13,122 INFO L195 NwaCegarLoop]: trace histogram [54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:06:13,126 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:06:13,338 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:06:13,523 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:06:13,523 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:06:13,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:06:13,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1874355100, now seen corresponding path program 107 times [2022-04-28 03:06:13,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:06:13,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [597856063] [2022-04-28 03:06:14,729 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:14,730 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:06:14,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1265275447, now seen corresponding path program 1 times [2022-04-28 03:06:14,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:06:14,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551314844] [2022-04-28 03:06:14,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:06:14,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:06:14,741 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_54.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_54.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:06:14,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:06:14,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [571852344] [2022-04-28 03:06:14,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:06:14,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:06:14,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:06:14,745 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:06:14,746 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:06:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:06:14,789 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:06:14,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:06:14,799 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:06:14,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1874355100, now seen corresponding path program 108 times [2022-04-28 03:06:14,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:06:14,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763476996] [2022-04-28 03:06:14,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:06:14,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:06:14,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:06:16,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:06:16,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:06:16,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {31924#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {31864#true} is VALID [2022-04-28 03:06:16,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {31864#true} assume true; {31864#true} is VALID [2022-04-28 03:06:16,182 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31864#true} {31864#true} #34#return; {31864#true} is VALID [2022-04-28 03:06:16,183 INFO L272 TraceCheckUtils]: 0: Hoare triple {31864#true} call ULTIMATE.init(); {31924#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:06:16,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {31924#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {31864#true} is VALID [2022-04-28 03:06:16,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {31864#true} assume true; {31864#true} is VALID [2022-04-28 03:06:16,183 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31864#true} {31864#true} #34#return; {31864#true} is VALID [2022-04-28 03:06:16,183 INFO L272 TraceCheckUtils]: 4: Hoare triple {31864#true} call #t~ret4 := main(); {31864#true} is VALID [2022-04-28 03:06:16,183 INFO L290 TraceCheckUtils]: 5: Hoare triple {31864#true} ~x~0 := 0; {31869#(= main_~x~0 0)} is VALID [2022-04-28 03:06:16,184 INFO L290 TraceCheckUtils]: 6: Hoare triple {31869#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31870#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:06:16,184 INFO L290 TraceCheckUtils]: 7: Hoare triple {31870#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31871#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:06:16,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {31871#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31872#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:06:16,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {31872#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31873#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:06:16,186 INFO L290 TraceCheckUtils]: 10: Hoare triple {31873#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31874#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:06:16,186 INFO L290 TraceCheckUtils]: 11: Hoare triple {31874#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31875#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:06:16,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {31875#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31876#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:06:16,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {31876#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31877#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:06:16,188 INFO L290 TraceCheckUtils]: 14: Hoare triple {31877#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31878#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:06:16,188 INFO L290 TraceCheckUtils]: 15: Hoare triple {31878#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31879#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:06:16,188 INFO L290 TraceCheckUtils]: 16: Hoare triple {31879#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31880#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:06:16,189 INFO L290 TraceCheckUtils]: 17: Hoare triple {31880#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31881#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:06:16,189 INFO L290 TraceCheckUtils]: 18: Hoare triple {31881#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31882#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:06:16,190 INFO L290 TraceCheckUtils]: 19: Hoare triple {31882#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31883#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:06:16,190 INFO L290 TraceCheckUtils]: 20: Hoare triple {31883#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31884#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:06:16,191 INFO L290 TraceCheckUtils]: 21: Hoare triple {31884#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31885#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:06:16,191 INFO L290 TraceCheckUtils]: 22: Hoare triple {31885#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31886#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:06:16,192 INFO L290 TraceCheckUtils]: 23: Hoare triple {31886#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31887#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:06:16,192 INFO L290 TraceCheckUtils]: 24: Hoare triple {31887#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31888#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:06:16,193 INFO L290 TraceCheckUtils]: 25: Hoare triple {31888#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31889#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:06:16,193 INFO L290 TraceCheckUtils]: 26: Hoare triple {31889#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31890#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:06:16,194 INFO L290 TraceCheckUtils]: 27: Hoare triple {31890#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31891#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:06:16,194 INFO L290 TraceCheckUtils]: 28: Hoare triple {31891#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31892#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:06:16,194 INFO L290 TraceCheckUtils]: 29: Hoare triple {31892#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31893#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:06:16,195 INFO L290 TraceCheckUtils]: 30: Hoare triple {31893#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31894#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:06:16,195 INFO L290 TraceCheckUtils]: 31: Hoare triple {31894#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31895#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:06:16,196 INFO L290 TraceCheckUtils]: 32: Hoare triple {31895#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31896#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:06:16,196 INFO L290 TraceCheckUtils]: 33: Hoare triple {31896#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31897#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:06:16,197 INFO L290 TraceCheckUtils]: 34: Hoare triple {31897#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31898#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:06:16,197 INFO L290 TraceCheckUtils]: 35: Hoare triple {31898#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31899#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:06:16,198 INFO L290 TraceCheckUtils]: 36: Hoare triple {31899#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31900#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:06:16,198 INFO L290 TraceCheckUtils]: 37: Hoare triple {31900#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31901#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:06:16,199 INFO L290 TraceCheckUtils]: 38: Hoare triple {31901#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31902#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:06:16,199 INFO L290 TraceCheckUtils]: 39: Hoare triple {31902#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31903#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:06:16,200 INFO L290 TraceCheckUtils]: 40: Hoare triple {31903#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31904#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:06:16,200 INFO L290 TraceCheckUtils]: 41: Hoare triple {31904#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31905#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:06:16,200 INFO L290 TraceCheckUtils]: 42: Hoare triple {31905#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31906#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:06:16,201 INFO L290 TraceCheckUtils]: 43: Hoare triple {31906#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31907#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:06:16,201 INFO L290 TraceCheckUtils]: 44: Hoare triple {31907#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31908#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:06:16,202 INFO L290 TraceCheckUtils]: 45: Hoare triple {31908#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31909#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:06:16,202 INFO L290 TraceCheckUtils]: 46: Hoare triple {31909#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31910#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:06:16,203 INFO L290 TraceCheckUtils]: 47: Hoare triple {31910#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31911#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:06:16,203 INFO L290 TraceCheckUtils]: 48: Hoare triple {31911#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31912#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:06:16,204 INFO L290 TraceCheckUtils]: 49: Hoare triple {31912#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31913#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:06:16,204 INFO L290 TraceCheckUtils]: 50: Hoare triple {31913#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31914#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 03:06:16,205 INFO L290 TraceCheckUtils]: 51: Hoare triple {31914#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31915#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 03:06:16,205 INFO L290 TraceCheckUtils]: 52: Hoare triple {31915#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31916#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 03:06:16,205 INFO L290 TraceCheckUtils]: 53: Hoare triple {31916#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31917#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-28 03:06:16,206 INFO L290 TraceCheckUtils]: 54: Hoare triple {31917#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31918#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-28 03:06:16,206 INFO L290 TraceCheckUtils]: 55: Hoare triple {31918#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31919#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-28 03:06:16,207 INFO L290 TraceCheckUtils]: 56: Hoare triple {31919#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31920#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-28 03:06:16,207 INFO L290 TraceCheckUtils]: 57: Hoare triple {31920#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31921#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-28 03:06:16,208 INFO L290 TraceCheckUtils]: 58: Hoare triple {31921#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31922#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-28 03:06:16,208 INFO L290 TraceCheckUtils]: 59: Hoare triple {31922#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31923#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 108))} is VALID [2022-04-28 03:06:16,209 INFO L290 TraceCheckUtils]: 60: Hoare triple {31923#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 108))} assume !(~x~0 % 4294967296 < 268435455); {31865#false} is VALID [2022-04-28 03:06:16,209 INFO L272 TraceCheckUtils]: 61: Hoare triple {31865#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {31865#false} is VALID [2022-04-28 03:06:16,209 INFO L290 TraceCheckUtils]: 62: Hoare triple {31865#false} ~cond := #in~cond; {31865#false} is VALID [2022-04-28 03:06:16,209 INFO L290 TraceCheckUtils]: 63: Hoare triple {31865#false} assume 0 == ~cond; {31865#false} is VALID [2022-04-28 03:06:16,209 INFO L290 TraceCheckUtils]: 64: Hoare triple {31865#false} assume !false; {31865#false} is VALID [2022-04-28 03:06:16,209 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:06:16,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:06:16,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763476996] [2022-04-28 03:06:16,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763476996] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:06:16,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67387606] [2022-04-28 03:06:16,210 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:06:16,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:06:16,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:06:16,211 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:06:16,220 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:06:21,830 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2022-04-28 03:06:21,830 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:06:21,837 WARN L261 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 117 conjunts are in the unsatisfiable core [2022-04-28 03:06:21,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:06:21,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:06:22,360 INFO L272 TraceCheckUtils]: 0: Hoare triple {31864#true} call ULTIMATE.init(); {31864#true} is VALID [2022-04-28 03:06:22,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {31864#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {31864#true} is VALID [2022-04-28 03:06:22,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {31864#true} assume true; {31864#true} is VALID [2022-04-28 03:06:22,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31864#true} {31864#true} #34#return; {31864#true} is VALID [2022-04-28 03:06:22,361 INFO L272 TraceCheckUtils]: 4: Hoare triple {31864#true} call #t~ret4 := main(); {31864#true} is VALID [2022-04-28 03:06:22,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {31864#true} ~x~0 := 0; {31869#(= main_~x~0 0)} is VALID [2022-04-28 03:06:22,361 INFO L290 TraceCheckUtils]: 6: Hoare triple {31869#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31870#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:06:22,362 INFO L290 TraceCheckUtils]: 7: Hoare triple {31870#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31871#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:06:22,362 INFO L290 TraceCheckUtils]: 8: Hoare triple {31871#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31872#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:06:22,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {31872#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31873#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:06:22,363 INFO L290 TraceCheckUtils]: 10: Hoare triple {31873#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31874#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:06:22,364 INFO L290 TraceCheckUtils]: 11: Hoare triple {31874#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31875#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:06:22,364 INFO L290 TraceCheckUtils]: 12: Hoare triple {31875#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31876#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:06:22,365 INFO L290 TraceCheckUtils]: 13: Hoare triple {31876#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31877#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:06:22,365 INFO L290 TraceCheckUtils]: 14: Hoare triple {31877#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31878#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:06:22,365 INFO L290 TraceCheckUtils]: 15: Hoare triple {31878#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31879#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:06:22,366 INFO L290 TraceCheckUtils]: 16: Hoare triple {31879#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31880#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:06:22,366 INFO L290 TraceCheckUtils]: 17: Hoare triple {31880#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31881#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:06:22,367 INFO L290 TraceCheckUtils]: 18: Hoare triple {31881#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31882#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:06:22,367 INFO L290 TraceCheckUtils]: 19: Hoare triple {31882#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31883#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:06:22,368 INFO L290 TraceCheckUtils]: 20: Hoare triple {31883#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31884#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:06:22,368 INFO L290 TraceCheckUtils]: 21: Hoare triple {31884#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31885#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:06:22,369 INFO L290 TraceCheckUtils]: 22: Hoare triple {31885#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31886#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:06:22,369 INFO L290 TraceCheckUtils]: 23: Hoare triple {31886#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31887#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:06:22,370 INFO L290 TraceCheckUtils]: 24: Hoare triple {31887#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31888#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:06:22,370 INFO L290 TraceCheckUtils]: 25: Hoare triple {31888#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31889#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:06:22,370 INFO L290 TraceCheckUtils]: 26: Hoare triple {31889#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31890#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:06:22,371 INFO L290 TraceCheckUtils]: 27: Hoare triple {31890#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31891#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:06:22,371 INFO L290 TraceCheckUtils]: 28: Hoare triple {31891#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31892#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:06:22,372 INFO L290 TraceCheckUtils]: 29: Hoare triple {31892#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31893#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:06:22,372 INFO L290 TraceCheckUtils]: 30: Hoare triple {31893#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31894#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:06:22,373 INFO L290 TraceCheckUtils]: 31: Hoare triple {31894#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31895#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:06:22,373 INFO L290 TraceCheckUtils]: 32: Hoare triple {31895#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31896#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:06:22,374 INFO L290 TraceCheckUtils]: 33: Hoare triple {31896#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31897#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:06:22,374 INFO L290 TraceCheckUtils]: 34: Hoare triple {31897#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31898#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:06:22,375 INFO L290 TraceCheckUtils]: 35: Hoare triple {31898#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31899#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:06:22,375 INFO L290 TraceCheckUtils]: 36: Hoare triple {31899#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31900#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:06:22,376 INFO L290 TraceCheckUtils]: 37: Hoare triple {31900#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31901#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:06:22,376 INFO L290 TraceCheckUtils]: 38: Hoare triple {31901#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31902#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:06:22,376 INFO L290 TraceCheckUtils]: 39: Hoare triple {31902#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31903#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:06:22,377 INFO L290 TraceCheckUtils]: 40: Hoare triple {31903#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31904#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:06:22,377 INFO L290 TraceCheckUtils]: 41: Hoare triple {31904#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31905#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:06:22,378 INFO L290 TraceCheckUtils]: 42: Hoare triple {31905#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31906#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:06:22,378 INFO L290 TraceCheckUtils]: 43: Hoare triple {31906#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31907#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:06:22,379 INFO L290 TraceCheckUtils]: 44: Hoare triple {31907#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31908#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:06:22,379 INFO L290 TraceCheckUtils]: 45: Hoare triple {31908#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31909#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:06:22,380 INFO L290 TraceCheckUtils]: 46: Hoare triple {31909#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31910#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:06:22,380 INFO L290 TraceCheckUtils]: 47: Hoare triple {31910#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31911#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:06:22,381 INFO L290 TraceCheckUtils]: 48: Hoare triple {31911#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31912#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:06:22,381 INFO L290 TraceCheckUtils]: 49: Hoare triple {31912#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31913#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:06:22,381 INFO L290 TraceCheckUtils]: 50: Hoare triple {31913#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31914#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 03:06:22,382 INFO L290 TraceCheckUtils]: 51: Hoare triple {31914#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31915#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 03:06:22,382 INFO L290 TraceCheckUtils]: 52: Hoare triple {31915#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31916#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 03:06:22,383 INFO L290 TraceCheckUtils]: 53: Hoare triple {31916#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31917#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-28 03:06:22,383 INFO L290 TraceCheckUtils]: 54: Hoare triple {31917#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31918#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-28 03:06:22,384 INFO L290 TraceCheckUtils]: 55: Hoare triple {31918#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31919#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-28 03:06:22,384 INFO L290 TraceCheckUtils]: 56: Hoare triple {31919#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31920#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-28 03:06:22,385 INFO L290 TraceCheckUtils]: 57: Hoare triple {31920#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31921#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-28 03:06:22,385 INFO L290 TraceCheckUtils]: 58: Hoare triple {31921#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {31922#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-28 03:06:22,386 INFO L290 TraceCheckUtils]: 59: Hoare triple {31922#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32105#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-28 03:06:22,386 INFO L290 TraceCheckUtils]: 60: Hoare triple {32105#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !(~x~0 % 4294967296 < 268435455); {31865#false} is VALID [2022-04-28 03:06:22,386 INFO L272 TraceCheckUtils]: 61: Hoare triple {31865#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {31865#false} is VALID [2022-04-28 03:06:22,386 INFO L290 TraceCheckUtils]: 62: Hoare triple {31865#false} ~cond := #in~cond; {31865#false} is VALID [2022-04-28 03:06:22,386 INFO L290 TraceCheckUtils]: 63: Hoare triple {31865#false} assume 0 == ~cond; {31865#false} is VALID [2022-04-28 03:06:22,386 INFO L290 TraceCheckUtils]: 64: Hoare triple {31865#false} assume !false; {31865#false} is VALID [2022-04-28 03:06:22,387 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:06:22,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:06:28,186 INFO L290 TraceCheckUtils]: 64: Hoare triple {31865#false} assume !false; {31865#false} is VALID [2022-04-28 03:06:28,186 INFO L290 TraceCheckUtils]: 63: Hoare triple {32124#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {31865#false} is VALID [2022-04-28 03:06:28,187 INFO L290 TraceCheckUtils]: 62: Hoare triple {32128#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {32124#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:06:28,187 INFO L272 TraceCheckUtils]: 61: Hoare triple {32132#(not (= (mod main_~x~0 2) 0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {32128#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:06:28,188 INFO L290 TraceCheckUtils]: 60: Hoare triple {32136#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !(~x~0 % 4294967296 < 268435455); {32132#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 03:06:28,188 INFO L290 TraceCheckUtils]: 59: Hoare triple {32140#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32136#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:06:28,189 INFO L290 TraceCheckUtils]: 58: Hoare triple {32144#(or (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32140#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:06:28,190 INFO L290 TraceCheckUtils]: 57: Hoare triple {32148#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32144#(or (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:06:28,191 INFO L290 TraceCheckUtils]: 56: Hoare triple {32152#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32148#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} is VALID [2022-04-28 03:06:28,192 INFO L290 TraceCheckUtils]: 55: Hoare triple {32156#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32152#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} is VALID [2022-04-28 03:06:28,192 INFO L290 TraceCheckUtils]: 54: Hoare triple {32160#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32156#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} is VALID [2022-04-28 03:06:28,193 INFO L290 TraceCheckUtils]: 53: Hoare triple {32164#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32160#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} is VALID [2022-04-28 03:06:28,194 INFO L290 TraceCheckUtils]: 52: Hoare triple {32168#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32164#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:06:28,195 INFO L290 TraceCheckUtils]: 51: Hoare triple {32172#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32168#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:06:28,196 INFO L290 TraceCheckUtils]: 50: Hoare triple {32176#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32172#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:06:28,197 INFO L290 TraceCheckUtils]: 49: Hoare triple {32180#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32176#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} is VALID [2022-04-28 03:06:28,201 INFO L290 TraceCheckUtils]: 48: Hoare triple {32184#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32180#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} is VALID [2022-04-28 03:06:28,202 INFO L290 TraceCheckUtils]: 47: Hoare triple {32188#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32184#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} is VALID [2022-04-28 03:06:28,205 INFO L290 TraceCheckUtils]: 46: Hoare triple {32192#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32188#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} is VALID [2022-04-28 03:06:28,206 INFO L290 TraceCheckUtils]: 45: Hoare triple {32196#(or (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32192#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:06:28,207 INFO L290 TraceCheckUtils]: 44: Hoare triple {32200#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32196#(or (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:06:28,208 INFO L290 TraceCheckUtils]: 43: Hoare triple {32204#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32200#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:06:28,209 INFO L290 TraceCheckUtils]: 42: Hoare triple {32208#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32204#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:06:28,209 INFO L290 TraceCheckUtils]: 41: Hoare triple {32212#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32208#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} is VALID [2022-04-28 03:06:28,210 INFO L290 TraceCheckUtils]: 40: Hoare triple {32216#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32212#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:06:28,211 INFO L290 TraceCheckUtils]: 39: Hoare triple {32220#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32216#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:06:28,212 INFO L290 TraceCheckUtils]: 38: Hoare triple {32224#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32220#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:06:28,212 INFO L290 TraceCheckUtils]: 37: Hoare triple {32228#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32224#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:06:28,213 INFO L290 TraceCheckUtils]: 36: Hoare triple {32232#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32228#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} is VALID [2022-04-28 03:06:28,214 INFO L290 TraceCheckUtils]: 35: Hoare triple {32236#(or (< (mod (+ main_~x~0 50) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32232#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} is VALID [2022-04-28 03:06:28,217 INFO L290 TraceCheckUtils]: 34: Hoare triple {32240#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32236#(or (< (mod (+ main_~x~0 50) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:06:28,218 INFO L290 TraceCheckUtils]: 33: Hoare triple {32244#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32240#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} is VALID [2022-04-28 03:06:28,222 INFO L290 TraceCheckUtils]: 32: Hoare triple {32248#(or (< (mod (+ 56 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32244#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} is VALID [2022-04-28 03:06:28,223 INFO L290 TraceCheckUtils]: 31: Hoare triple {32252#(or (< (mod (+ main_~x~0 58) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32248#(or (< (mod (+ 56 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:06:28,223 INFO L290 TraceCheckUtils]: 30: Hoare triple {32256#(or (< (mod (+ main_~x~0 60) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32252#(or (< (mod (+ main_~x~0 58) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:06:28,224 INFO L290 TraceCheckUtils]: 29: Hoare triple {32260#(or (< (mod (+ main_~x~0 62) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32256#(or (< (mod (+ main_~x~0 60) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:06:28,230 INFO L290 TraceCheckUtils]: 28: Hoare triple {32264#(or (< (mod (+ 64 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32260#(or (< (mod (+ main_~x~0 62) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:06:28,231 INFO L290 TraceCheckUtils]: 27: Hoare triple {32268#(or (< (mod (+ 66 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32264#(or (< (mod (+ 64 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:06:28,231 INFO L290 TraceCheckUtils]: 26: Hoare triple {32272#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 68 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32268#(or (< (mod (+ 66 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:06:28,232 INFO L290 TraceCheckUtils]: 25: Hoare triple {32276#(or (< (mod (+ main_~x~0 70) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32272#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 68 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:06:28,233 INFO L290 TraceCheckUtils]: 24: Hoare triple {32280#(or (< (mod (+ 72 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32276#(or (< (mod (+ main_~x~0 70) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:06:28,234 INFO L290 TraceCheckUtils]: 23: Hoare triple {32284#(or (< (mod (+ main_~x~0 74) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32280#(or (< (mod (+ 72 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:06:28,238 INFO L290 TraceCheckUtils]: 22: Hoare triple {32288#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 76 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32284#(or (< (mod (+ main_~x~0 74) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:06:28,239 INFO L290 TraceCheckUtils]: 21: Hoare triple {32292#(or (< (mod (+ main_~x~0 78) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32288#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 76 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:06:28,240 INFO L290 TraceCheckUtils]: 20: Hoare triple {32296#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 80) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32292#(or (< (mod (+ main_~x~0 78) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:06:28,241 INFO L290 TraceCheckUtils]: 19: Hoare triple {32300#(or (< (mod (+ main_~x~0 82) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32296#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 80) 4294967296) 268435455))} is VALID [2022-04-28 03:06:28,242 INFO L290 TraceCheckUtils]: 18: Hoare triple {32304#(or (< (mod (+ 84 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32300#(or (< (mod (+ main_~x~0 82) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:06:28,242 INFO L290 TraceCheckUtils]: 17: Hoare triple {32308#(or (< (mod (+ main_~x~0 86) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32304#(or (< (mod (+ 84 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:06:28,243 INFO L290 TraceCheckUtils]: 16: Hoare triple {32312#(or (< (mod (+ 88 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32308#(or (< (mod (+ main_~x~0 86) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:06:28,244 INFO L290 TraceCheckUtils]: 15: Hoare triple {32316#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 90) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32312#(or (< (mod (+ 88 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:06:28,244 INFO L290 TraceCheckUtils]: 14: Hoare triple {32320#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 92 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32316#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 90) 4294967296) 268435455))} is VALID [2022-04-28 03:06:28,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {32324#(or (< (mod (+ 94 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32320#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 92 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:06:28,246 INFO L290 TraceCheckUtils]: 12: Hoare triple {32328#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 96) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32324#(or (< (mod (+ 94 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:06:28,247 INFO L290 TraceCheckUtils]: 11: Hoare triple {32332#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 98 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32328#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 96) 4294967296) 268435455))} is VALID [2022-04-28 03:06:28,249 INFO L290 TraceCheckUtils]: 10: Hoare triple {32336#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 100) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32332#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 98 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:06:28,250 INFO L290 TraceCheckUtils]: 9: Hoare triple {32340#(or (< (mod (+ main_~x~0 102) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32336#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 100) 4294967296) 268435455))} is VALID [2022-04-28 03:06:28,251 INFO L290 TraceCheckUtils]: 8: Hoare triple {32344#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 104 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32340#(or (< (mod (+ main_~x~0 102) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:06:28,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {32348#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 106 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32344#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 104 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:06:28,253 INFO L290 TraceCheckUtils]: 6: Hoare triple {32352#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 108 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32348#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 106 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:06:28,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {31864#true} ~x~0 := 0; {32352#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 108 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:06:28,253 INFO L272 TraceCheckUtils]: 4: Hoare triple {31864#true} call #t~ret4 := main(); {31864#true} is VALID [2022-04-28 03:06:28,253 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31864#true} {31864#true} #34#return; {31864#true} is VALID [2022-04-28 03:06:28,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {31864#true} assume true; {31864#true} is VALID [2022-04-28 03:06:28,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {31864#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {31864#true} is VALID [2022-04-28 03:06:28,253 INFO L272 TraceCheckUtils]: 0: Hoare triple {31864#true} call ULTIMATE.init(); {31864#true} is VALID [2022-04-28 03:06:28,254 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:06:28,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67387606] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:06:28,254 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:06:28,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 57, 60] total 117 [2022-04-28 03:06:28,254 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:06:28,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [597856063] [2022-04-28 03:06:28,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [597856063] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:06:28,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:06:28,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [58] imperfect sequences [] total 58 [2022-04-28 03:06:28,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577589729] [2022-04-28 03:06:28,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:06:28,255 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:06:28,255 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:06:28,255 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:06:28,306 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:28,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-04-28 03:06:28,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:06:28,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-04-28 03:06:28,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3421, Invalid=10151, Unknown=0, NotChecked=0, Total=13572 [2022-04-28 03:06:28,308 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:06:33,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:06:33,971 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2022-04-28 03:06:33,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-04-28 03:06:33,971 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:06:33,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:06:33,971 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:06:33,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2022-04-28 03:06:33,972 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:06:33,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2022-04-28 03:06:33,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 72 transitions. [2022-04-28 03:06:34,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:06:34,056 INFO L225 Difference]: With dead ends: 72 [2022-04-28 03:06:34,056 INFO L226 Difference]: Without dead ends: 67 [2022-04-28 03:06:34,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1605 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=6774, Invalid=22638, Unknown=0, NotChecked=0, Total=29412 [2022-04-28 03:06:34,058 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 3197 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 3308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 3197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:06:34,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 238 Invalid, 3308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 3197 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 03:06:34,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-28 03:06:34,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-28 03:06:34,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:06:34,129 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:06:34,130 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:06:34,130 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:06:34,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:06:34,130 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2022-04-28 03:06:34,130 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2022-04-28 03:06:34,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:06:34,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:06:34,131 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:06:34,131 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:06:34,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:06:34,131 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2022-04-28 03:06:34,131 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2022-04-28 03:06:34,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:06:34,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:06:34,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:06:34,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:06:34,132 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:06:34,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2022-04-28 03:06:34,132 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2022-04-28 03:06:34,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:06:34,132 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2022-04-28 03:06:34,132 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:06:34,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 67 transitions. [2022-04-28 03:06:34,187 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:34,187 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2022-04-28 03:06:34,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 03:06:34,187 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:06:34,187 INFO L195 NwaCegarLoop]: trace histogram [55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:06:34,191 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:06:34,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Forceful destruction successful, exit code 0 [2022-04-28 03:06:34,588 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:06:34,588 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:06:34,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:06:34,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1988072778, now seen corresponding path program 109 times [2022-04-28 03:06:34,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:06:34,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [587466575] [2022-04-28 03:06:34,717 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:34,718 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:06:34,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1324380791, now seen corresponding path program 1 times [2022-04-28 03:06:34,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:06:34,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529428231] [2022-04-28 03:06:34,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:06:34,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:06:34,724 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 2) .v_it_55.0) (* (- 1) main_~x~0_5) (* 4294967296 (div (+ (* 2 .v_it_55.0) main_~x~0_5) 4294967296)) 268435455) 0)) [2022-04-28 03:06:34,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:06:34,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1389584681] [2022-04-28 03:06:34,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:06:34,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:06:34,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:06:34,727 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:06:34,728 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:06:34,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:06:34,771 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:06:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:06:34,787 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:06:34,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1988072778, now seen corresponding path program 110 times [2022-04-28 03:06:34,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:06:34,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421048331] [2022-04-28 03:06:34,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:06:34,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:06:34,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:06:36,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:06:36,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:06:36,208 INFO L290 TraceCheckUtils]: 0: Hoare triple {32956#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {32895#true} is VALID [2022-04-28 03:06:36,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {32895#true} assume true; {32895#true} is VALID [2022-04-28 03:06:36,208 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32895#true} {32895#true} #34#return; {32895#true} is VALID [2022-04-28 03:06:36,208 INFO L272 TraceCheckUtils]: 0: Hoare triple {32895#true} call ULTIMATE.init(); {32956#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:06:36,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {32956#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {32895#true} is VALID [2022-04-28 03:06:36,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {32895#true} assume true; {32895#true} is VALID [2022-04-28 03:06:36,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32895#true} {32895#true} #34#return; {32895#true} is VALID [2022-04-28 03:06:36,209 INFO L272 TraceCheckUtils]: 4: Hoare triple {32895#true} call #t~ret4 := main(); {32895#true} is VALID [2022-04-28 03:06:36,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {32895#true} ~x~0 := 0; {32900#(= main_~x~0 0)} is VALID [2022-04-28 03:06:36,209 INFO L290 TraceCheckUtils]: 6: Hoare triple {32900#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32901#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:06:36,210 INFO L290 TraceCheckUtils]: 7: Hoare triple {32901#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32902#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:06:36,210 INFO L290 TraceCheckUtils]: 8: Hoare triple {32902#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32903#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:06:36,211 INFO L290 TraceCheckUtils]: 9: Hoare triple {32903#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32904#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:06:36,211 INFO L290 TraceCheckUtils]: 10: Hoare triple {32904#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32905#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:06:36,212 INFO L290 TraceCheckUtils]: 11: Hoare triple {32905#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32906#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:06:36,212 INFO L290 TraceCheckUtils]: 12: Hoare triple {32906#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32907#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:06:36,213 INFO L290 TraceCheckUtils]: 13: Hoare triple {32907#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32908#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:06:36,213 INFO L290 TraceCheckUtils]: 14: Hoare triple {32908#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32909#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:06:36,214 INFO L290 TraceCheckUtils]: 15: Hoare triple {32909#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32910#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:06:36,214 INFO L290 TraceCheckUtils]: 16: Hoare triple {32910#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32911#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:06:36,214 INFO L290 TraceCheckUtils]: 17: Hoare triple {32911#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32912#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:06:36,215 INFO L290 TraceCheckUtils]: 18: Hoare triple {32912#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32913#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:06:36,215 INFO L290 TraceCheckUtils]: 19: Hoare triple {32913#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32914#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:06:36,216 INFO L290 TraceCheckUtils]: 20: Hoare triple {32914#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32915#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:06:36,216 INFO L290 TraceCheckUtils]: 21: Hoare triple {32915#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32916#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:06:36,217 INFO L290 TraceCheckUtils]: 22: Hoare triple {32916#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32917#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:06:36,217 INFO L290 TraceCheckUtils]: 23: Hoare triple {32917#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32918#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:06:36,218 INFO L290 TraceCheckUtils]: 24: Hoare triple {32918#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32919#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:06:36,218 INFO L290 TraceCheckUtils]: 25: Hoare triple {32919#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32920#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:06:36,219 INFO L290 TraceCheckUtils]: 26: Hoare triple {32920#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32921#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:06:36,219 INFO L290 TraceCheckUtils]: 27: Hoare triple {32921#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32922#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:06:36,219 INFO L290 TraceCheckUtils]: 28: Hoare triple {32922#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32923#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:06:36,220 INFO L290 TraceCheckUtils]: 29: Hoare triple {32923#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32924#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:06:36,220 INFO L290 TraceCheckUtils]: 30: Hoare triple {32924#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32925#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:06:36,221 INFO L290 TraceCheckUtils]: 31: Hoare triple {32925#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32926#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:06:36,221 INFO L290 TraceCheckUtils]: 32: Hoare triple {32926#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32927#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:06:36,222 INFO L290 TraceCheckUtils]: 33: Hoare triple {32927#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32928#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:06:36,222 INFO L290 TraceCheckUtils]: 34: Hoare triple {32928#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32929#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:06:36,223 INFO L290 TraceCheckUtils]: 35: Hoare triple {32929#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32930#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:06:36,223 INFO L290 TraceCheckUtils]: 36: Hoare triple {32930#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32931#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:06:36,224 INFO L290 TraceCheckUtils]: 37: Hoare triple {32931#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32932#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:06:36,224 INFO L290 TraceCheckUtils]: 38: Hoare triple {32932#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32933#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:06:36,225 INFO L290 TraceCheckUtils]: 39: Hoare triple {32933#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32934#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:06:36,225 INFO L290 TraceCheckUtils]: 40: Hoare triple {32934#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32935#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:06:36,225 INFO L290 TraceCheckUtils]: 41: Hoare triple {32935#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32936#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:06:36,226 INFO L290 TraceCheckUtils]: 42: Hoare triple {32936#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32937#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:06:36,226 INFO L290 TraceCheckUtils]: 43: Hoare triple {32937#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32938#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:06:36,227 INFO L290 TraceCheckUtils]: 44: Hoare triple {32938#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32939#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:06:36,227 INFO L290 TraceCheckUtils]: 45: Hoare triple {32939#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32940#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:06:36,228 INFO L290 TraceCheckUtils]: 46: Hoare triple {32940#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32941#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:06:36,228 INFO L290 TraceCheckUtils]: 47: Hoare triple {32941#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32942#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:06:36,229 INFO L290 TraceCheckUtils]: 48: Hoare triple {32942#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32943#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:06:36,229 INFO L290 TraceCheckUtils]: 49: Hoare triple {32943#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32944#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:06:36,230 INFO L290 TraceCheckUtils]: 50: Hoare triple {32944#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32945#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 03:06:36,230 INFO L290 TraceCheckUtils]: 51: Hoare triple {32945#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32946#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 03:06:36,230 INFO L290 TraceCheckUtils]: 52: Hoare triple {32946#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32947#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 03:06:36,231 INFO L290 TraceCheckUtils]: 53: Hoare triple {32947#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32948#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-28 03:06:36,231 INFO L290 TraceCheckUtils]: 54: Hoare triple {32948#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32949#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-28 03:06:36,232 INFO L290 TraceCheckUtils]: 55: Hoare triple {32949#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32950#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-28 03:06:36,232 INFO L290 TraceCheckUtils]: 56: Hoare triple {32950#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32951#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-28 03:06:36,233 INFO L290 TraceCheckUtils]: 57: Hoare triple {32951#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32952#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-28 03:06:36,233 INFO L290 TraceCheckUtils]: 58: Hoare triple {32952#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32953#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-28 03:06:36,234 INFO L290 TraceCheckUtils]: 59: Hoare triple {32953#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32954#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-28 03:06:36,234 INFO L290 TraceCheckUtils]: 60: Hoare triple {32954#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32955#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 110))} is VALID [2022-04-28 03:06:36,235 INFO L290 TraceCheckUtils]: 61: Hoare triple {32955#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 110))} assume !(~x~0 % 4294967296 < 268435455); {32896#false} is VALID [2022-04-28 03:06:36,235 INFO L272 TraceCheckUtils]: 62: Hoare triple {32896#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {32896#false} is VALID [2022-04-28 03:06:36,235 INFO L290 TraceCheckUtils]: 63: Hoare triple {32896#false} ~cond := #in~cond; {32896#false} is VALID [2022-04-28 03:06:36,235 INFO L290 TraceCheckUtils]: 64: Hoare triple {32896#false} assume 0 == ~cond; {32896#false} is VALID [2022-04-28 03:06:36,235 INFO L290 TraceCheckUtils]: 65: Hoare triple {32896#false} assume !false; {32896#false} is VALID [2022-04-28 03:06:36,235 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:06:36,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:06:36,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421048331] [2022-04-28 03:06:36,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421048331] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:06:36,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236188839] [2022-04-28 03:06:36,236 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:06:36,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:06:36,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:06:36,237 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:06:36,237 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:06:36,302 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:06:36,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:06:36,304 WARN L261 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 113 conjunts are in the unsatisfiable core [2022-04-28 03:06:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:06:36,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:06:36,907 INFO L272 TraceCheckUtils]: 0: Hoare triple {32895#true} call ULTIMATE.init(); {32895#true} is VALID [2022-04-28 03:06:36,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {32895#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {32895#true} is VALID [2022-04-28 03:06:36,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {32895#true} assume true; {32895#true} is VALID [2022-04-28 03:06:36,907 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32895#true} {32895#true} #34#return; {32895#true} is VALID [2022-04-28 03:06:36,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {32895#true} call #t~ret4 := main(); {32895#true} is VALID [2022-04-28 03:06:36,908 INFO L290 TraceCheckUtils]: 5: Hoare triple {32895#true} ~x~0 := 0; {32900#(= main_~x~0 0)} is VALID [2022-04-28 03:06:36,908 INFO L290 TraceCheckUtils]: 6: Hoare triple {32900#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32901#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:06:36,909 INFO L290 TraceCheckUtils]: 7: Hoare triple {32901#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32902#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:06:36,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {32902#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32903#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:06:36,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {32903#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32904#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:06:36,910 INFO L290 TraceCheckUtils]: 10: Hoare triple {32904#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32905#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:06:36,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {32905#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32906#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:06:36,911 INFO L290 TraceCheckUtils]: 12: Hoare triple {32906#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32907#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:06:36,912 INFO L290 TraceCheckUtils]: 13: Hoare triple {32907#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32908#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:06:36,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {32908#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32909#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:06:36,913 INFO L290 TraceCheckUtils]: 15: Hoare triple {32909#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32910#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:06:36,914 INFO L290 TraceCheckUtils]: 16: Hoare triple {32910#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32911#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:06:36,914 INFO L290 TraceCheckUtils]: 17: Hoare triple {32911#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32912#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:06:36,915 INFO L290 TraceCheckUtils]: 18: Hoare triple {32912#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32913#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:06:36,915 INFO L290 TraceCheckUtils]: 19: Hoare triple {32913#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32914#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:06:36,916 INFO L290 TraceCheckUtils]: 20: Hoare triple {32914#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32915#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:06:36,916 INFO L290 TraceCheckUtils]: 21: Hoare triple {32915#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32916#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:06:36,917 INFO L290 TraceCheckUtils]: 22: Hoare triple {32916#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32917#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:06:36,917 INFO L290 TraceCheckUtils]: 23: Hoare triple {32917#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32918#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:06:36,917 INFO L290 TraceCheckUtils]: 24: Hoare triple {32918#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32919#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:06:36,918 INFO L290 TraceCheckUtils]: 25: Hoare triple {32919#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32920#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:06:36,918 INFO L290 TraceCheckUtils]: 26: Hoare triple {32920#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32921#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:06:36,919 INFO L290 TraceCheckUtils]: 27: Hoare triple {32921#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32922#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:06:36,933 INFO L290 TraceCheckUtils]: 28: Hoare triple {32922#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32923#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:06:36,934 INFO L290 TraceCheckUtils]: 29: Hoare triple {32923#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32924#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:06:36,934 INFO L290 TraceCheckUtils]: 30: Hoare triple {32924#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32925#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:06:36,935 INFO L290 TraceCheckUtils]: 31: Hoare triple {32925#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32926#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:06:36,935 INFO L290 TraceCheckUtils]: 32: Hoare triple {32926#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32927#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:06:36,936 INFO L290 TraceCheckUtils]: 33: Hoare triple {32927#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32928#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:06:36,936 INFO L290 TraceCheckUtils]: 34: Hoare triple {32928#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32929#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:06:36,937 INFO L290 TraceCheckUtils]: 35: Hoare triple {32929#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32930#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:06:36,937 INFO L290 TraceCheckUtils]: 36: Hoare triple {32930#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32931#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:06:36,938 INFO L290 TraceCheckUtils]: 37: Hoare triple {32931#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32932#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:06:36,938 INFO L290 TraceCheckUtils]: 38: Hoare triple {32932#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32933#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:06:36,939 INFO L290 TraceCheckUtils]: 39: Hoare triple {32933#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32934#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:06:36,939 INFO L290 TraceCheckUtils]: 40: Hoare triple {32934#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32935#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:06:36,940 INFO L290 TraceCheckUtils]: 41: Hoare triple {32935#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32936#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:06:36,940 INFO L290 TraceCheckUtils]: 42: Hoare triple {32936#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32937#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:06:36,941 INFO L290 TraceCheckUtils]: 43: Hoare triple {32937#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32938#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:06:36,941 INFO L290 TraceCheckUtils]: 44: Hoare triple {32938#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32939#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:06:36,942 INFO L290 TraceCheckUtils]: 45: Hoare triple {32939#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32940#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:06:36,942 INFO L290 TraceCheckUtils]: 46: Hoare triple {32940#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32941#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:06:36,943 INFO L290 TraceCheckUtils]: 47: Hoare triple {32941#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32942#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:06:36,943 INFO L290 TraceCheckUtils]: 48: Hoare triple {32942#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32943#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:06:36,944 INFO L290 TraceCheckUtils]: 49: Hoare triple {32943#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32944#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:06:36,944 INFO L290 TraceCheckUtils]: 50: Hoare triple {32944#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32945#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 03:06:36,945 INFO L290 TraceCheckUtils]: 51: Hoare triple {32945#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32946#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 03:06:36,945 INFO L290 TraceCheckUtils]: 52: Hoare triple {32946#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32947#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 03:06:36,946 INFO L290 TraceCheckUtils]: 53: Hoare triple {32947#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32948#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-28 03:06:36,946 INFO L290 TraceCheckUtils]: 54: Hoare triple {32948#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32949#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-28 03:06:36,946 INFO L290 TraceCheckUtils]: 55: Hoare triple {32949#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32950#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-28 03:06:36,947 INFO L290 TraceCheckUtils]: 56: Hoare triple {32950#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32951#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-28 03:06:36,947 INFO L290 TraceCheckUtils]: 57: Hoare triple {32951#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32952#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-28 03:06:36,948 INFO L290 TraceCheckUtils]: 58: Hoare triple {32952#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32953#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-28 03:06:36,948 INFO L290 TraceCheckUtils]: 59: Hoare triple {32953#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {32954#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-28 03:06:36,949 INFO L290 TraceCheckUtils]: 60: Hoare triple {32954#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33140#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-28 03:06:36,949 INFO L290 TraceCheckUtils]: 61: Hoare triple {33140#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !(~x~0 % 4294967296 < 268435455); {32896#false} is VALID [2022-04-28 03:06:36,949 INFO L272 TraceCheckUtils]: 62: Hoare triple {32896#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {32896#false} is VALID [2022-04-28 03:06:36,950 INFO L290 TraceCheckUtils]: 63: Hoare triple {32896#false} ~cond := #in~cond; {32896#false} is VALID [2022-04-28 03:06:36,950 INFO L290 TraceCheckUtils]: 64: Hoare triple {32896#false} assume 0 == ~cond; {32896#false} is VALID [2022-04-28 03:06:36,950 INFO L290 TraceCheckUtils]: 65: Hoare triple {32896#false} assume !false; {32896#false} is VALID [2022-04-28 03:06:36,950 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:06:36,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:06:41,347 INFO L290 TraceCheckUtils]: 65: Hoare triple {32896#false} assume !false; {32896#false} is VALID [2022-04-28 03:06:41,348 INFO L290 TraceCheckUtils]: 64: Hoare triple {32896#false} assume 0 == ~cond; {32896#false} is VALID [2022-04-28 03:06:41,348 INFO L290 TraceCheckUtils]: 63: Hoare triple {32896#false} ~cond := #in~cond; {32896#false} is VALID [2022-04-28 03:06:41,348 INFO L272 TraceCheckUtils]: 62: Hoare triple {32896#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {32896#false} is VALID [2022-04-28 03:06:41,348 INFO L290 TraceCheckUtils]: 61: Hoare triple {33168#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {32896#false} is VALID [2022-04-28 03:06:41,349 INFO L290 TraceCheckUtils]: 60: Hoare triple {33172#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33168#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,349 INFO L290 TraceCheckUtils]: 59: Hoare triple {33176#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33172#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,350 INFO L290 TraceCheckUtils]: 58: Hoare triple {33180#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33176#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,351 INFO L290 TraceCheckUtils]: 57: Hoare triple {33184#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33180#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,351 INFO L290 TraceCheckUtils]: 56: Hoare triple {33188#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33184#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,352 INFO L290 TraceCheckUtils]: 55: Hoare triple {33192#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33188#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,352 INFO L290 TraceCheckUtils]: 54: Hoare triple {33196#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33192#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,353 INFO L290 TraceCheckUtils]: 53: Hoare triple {33200#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33196#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,401 INFO L290 TraceCheckUtils]: 52: Hoare triple {33204#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33200#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,402 INFO L290 TraceCheckUtils]: 51: Hoare triple {33208#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33204#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,403 INFO L290 TraceCheckUtils]: 50: Hoare triple {33212#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33208#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,403 INFO L290 TraceCheckUtils]: 49: Hoare triple {33216#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33212#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,404 INFO L290 TraceCheckUtils]: 48: Hoare triple {33220#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33216#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,408 INFO L290 TraceCheckUtils]: 47: Hoare triple {33224#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33220#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,408 INFO L290 TraceCheckUtils]: 46: Hoare triple {33228#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33224#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,409 INFO L290 TraceCheckUtils]: 45: Hoare triple {33232#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33228#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,410 INFO L290 TraceCheckUtils]: 44: Hoare triple {33236#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33232#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,410 INFO L290 TraceCheckUtils]: 43: Hoare triple {33240#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33236#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,411 INFO L290 TraceCheckUtils]: 42: Hoare triple {33244#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33240#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,416 INFO L290 TraceCheckUtils]: 41: Hoare triple {33248#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33244#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,416 INFO L290 TraceCheckUtils]: 40: Hoare triple {33252#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33248#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,417 INFO L290 TraceCheckUtils]: 39: Hoare triple {33256#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33252#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,417 INFO L290 TraceCheckUtils]: 38: Hoare triple {33260#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33256#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,418 INFO L290 TraceCheckUtils]: 37: Hoare triple {33264#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33260#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,418 INFO L290 TraceCheckUtils]: 36: Hoare triple {33268#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33264#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,419 INFO L290 TraceCheckUtils]: 35: Hoare triple {33272#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33268#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,420 INFO L290 TraceCheckUtils]: 34: Hoare triple {33276#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33272#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,420 INFO L290 TraceCheckUtils]: 33: Hoare triple {33280#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33276#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,421 INFO L290 TraceCheckUtils]: 32: Hoare triple {33284#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33280#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,421 INFO L290 TraceCheckUtils]: 31: Hoare triple {33288#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33284#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,422 INFO L290 TraceCheckUtils]: 30: Hoare triple {33292#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33288#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,422 INFO L290 TraceCheckUtils]: 29: Hoare triple {33296#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33292#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,423 INFO L290 TraceCheckUtils]: 28: Hoare triple {33300#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33296#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,424 INFO L290 TraceCheckUtils]: 27: Hoare triple {33304#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33300#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,424 INFO L290 TraceCheckUtils]: 26: Hoare triple {33308#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33304#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,425 INFO L290 TraceCheckUtils]: 25: Hoare triple {33312#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33308#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,425 INFO L290 TraceCheckUtils]: 24: Hoare triple {33316#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33312#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,426 INFO L290 TraceCheckUtils]: 23: Hoare triple {33320#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33316#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,426 INFO L290 TraceCheckUtils]: 22: Hoare triple {33324#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33320#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,427 INFO L290 TraceCheckUtils]: 21: Hoare triple {33328#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33324#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,428 INFO L290 TraceCheckUtils]: 20: Hoare triple {33332#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33328#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,428 INFO L290 TraceCheckUtils]: 19: Hoare triple {33336#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33332#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,429 INFO L290 TraceCheckUtils]: 18: Hoare triple {33340#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33336#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,429 INFO L290 TraceCheckUtils]: 17: Hoare triple {33344#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33340#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,430 INFO L290 TraceCheckUtils]: 16: Hoare triple {33348#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33344#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,430 INFO L290 TraceCheckUtils]: 15: Hoare triple {33352#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33348#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,431 INFO L290 TraceCheckUtils]: 14: Hoare triple {33356#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33352#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {33360#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33356#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,432 INFO L290 TraceCheckUtils]: 12: Hoare triple {33364#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33360#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,433 INFO L290 TraceCheckUtils]: 11: Hoare triple {33368#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33364#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,433 INFO L290 TraceCheckUtils]: 10: Hoare triple {33372#(< (mod (+ main_~x~0 102) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33368#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {33376#(< (mod (+ 104 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33372#(< (mod (+ main_~x~0 102) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {33380#(< (mod (+ 106 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33376#(< (mod (+ 104 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,436 INFO L290 TraceCheckUtils]: 7: Hoare triple {33384#(< (mod (+ 108 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33380#(< (mod (+ 106 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,436 INFO L290 TraceCheckUtils]: 6: Hoare triple {33388#(< (mod (+ 110 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33384#(< (mod (+ 108 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,436 INFO L290 TraceCheckUtils]: 5: Hoare triple {32895#true} ~x~0 := 0; {33388#(< (mod (+ 110 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:41,437 INFO L272 TraceCheckUtils]: 4: Hoare triple {32895#true} call #t~ret4 := main(); {32895#true} is VALID [2022-04-28 03:06:41,437 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32895#true} {32895#true} #34#return; {32895#true} is VALID [2022-04-28 03:06:41,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {32895#true} assume true; {32895#true} is VALID [2022-04-28 03:06:41,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {32895#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {32895#true} is VALID [2022-04-28 03:06:41,437 INFO L272 TraceCheckUtils]: 0: Hoare triple {32895#true} call ULTIMATE.init(); {32895#true} is VALID [2022-04-28 03:06:41,437 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:06:41,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236188839] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:06:41,437 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:06:41,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 58, 58] total 116 [2022-04-28 03:06:41,438 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:06:41,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [587466575] [2022-04-28 03:06:41,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [587466575] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:06:41,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:06:41,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2022-04-28 03:06:41,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814985777] [2022-04-28 03:06:41,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:06:41,438 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:06:41,438 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:06:41,438 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:06:41,471 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:41,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-04-28 03:06:41,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:06:41,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-04-28 03:06:41,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3477, Invalid=9863, Unknown=0, NotChecked=0, Total=13340 [2022-04-28 03:06:41,472 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:06:47,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:06:47,260 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2022-04-28 03:06:47,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-04-28 03:06:47,261 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:06:47,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:06:47,261 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:06:47,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2022-04-28 03:06:47,262 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:06:47,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 73 transitions. [2022-04-28 03:06:47,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 73 transitions. [2022-04-28 03:06:47,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:06:47,304 INFO L225 Difference]: With dead ends: 73 [2022-04-28 03:06:47,304 INFO L226 Difference]: Without dead ends: 68 [2022-04-28 03:06:47,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1656 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=6947, Invalid=22465, Unknown=0, NotChecked=0, Total=29412 [2022-04-28 03:06:47,306 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 3322 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 3435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 3322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:06:47,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 253 Invalid, 3435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 3322 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 03:06:47,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-28 03:06:47,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-04-28 03:06:47,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:06:47,372 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:06:47,372 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:06:47,373 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:06:47,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:06:47,373 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2022-04-28 03:06:47,373 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2022-04-28 03:06:47,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:06:47,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:06:47,374 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:06:47,374 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:06:47,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:06:47,374 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2022-04-28 03:06:47,374 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2022-04-28 03:06:47,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:06:47,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:06:47,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:06:47,375 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:06:47,375 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:06:47,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2022-04-28 03:06:47,375 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2022-04-28 03:06:47,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:06:47,375 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2022-04-28 03:06:47,375 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:06:47,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 68 transitions. [2022-04-28 03:06:47,450 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:47,450 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2022-04-28 03:06:47,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-28 03:06:47,450 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:06:47,450 INFO L195 NwaCegarLoop]: trace histogram [56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:06:47,454 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:06:47,670 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:06:47,854 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:06:47,854 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:06:47,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:06:47,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1464252708, now seen corresponding path program 111 times [2022-04-28 03:06:47,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:06:47,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [367102034] [2022-04-28 03:06:48,004 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:48,006 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:06:48,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1383486135, now seen corresponding path program 1 times [2022-04-28 03:06:48,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:06:48,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648495606] [2022-04-28 03:06:48,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:06:48,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:06:48,011 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_56.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_56.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:06:48,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:06:48,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2017653371] [2022-04-28 03:06:48,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:06:48,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:06:48,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:06:48,015 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:06:48,016 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:06:48,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:06:48,061 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:06:48,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:06:48,070 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:06:48,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1464252708, now seen corresponding path program 112 times [2022-04-28 03:06:48,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:06:48,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550861579] [2022-04-28 03:06:48,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:06:48,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:06:48,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:06:49,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:06:49,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:06:49,539 INFO L290 TraceCheckUtils]: 0: Hoare triple {34001#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {33939#true} is VALID [2022-04-28 03:06:49,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {33939#true} assume true; {33939#true} is VALID [2022-04-28 03:06:49,539 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33939#true} {33939#true} #34#return; {33939#true} is VALID [2022-04-28 03:06:49,540 INFO L272 TraceCheckUtils]: 0: Hoare triple {33939#true} call ULTIMATE.init(); {34001#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:06:49,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {34001#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {33939#true} is VALID [2022-04-28 03:06:49,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {33939#true} assume true; {33939#true} is VALID [2022-04-28 03:06:49,540 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33939#true} {33939#true} #34#return; {33939#true} is VALID [2022-04-28 03:06:49,540 INFO L272 TraceCheckUtils]: 4: Hoare triple {33939#true} call #t~ret4 := main(); {33939#true} is VALID [2022-04-28 03:06:49,540 INFO L290 TraceCheckUtils]: 5: Hoare triple {33939#true} ~x~0 := 0; {33944#(= main_~x~0 0)} is VALID [2022-04-28 03:06:49,540 INFO L290 TraceCheckUtils]: 6: Hoare triple {33944#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33945#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:06:49,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {33945#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33946#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:06:49,541 INFO L290 TraceCheckUtils]: 8: Hoare triple {33946#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33947#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:06:49,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {33947#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33948#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:06:49,542 INFO L290 TraceCheckUtils]: 10: Hoare triple {33948#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33949#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:06:49,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {33949#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33950#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:06:49,543 INFO L290 TraceCheckUtils]: 12: Hoare triple {33950#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33951#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:06:49,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {33951#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33952#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:06:49,544 INFO L290 TraceCheckUtils]: 14: Hoare triple {33952#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33953#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:06:49,545 INFO L290 TraceCheckUtils]: 15: Hoare triple {33953#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33954#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:06:49,545 INFO L290 TraceCheckUtils]: 16: Hoare triple {33954#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33955#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:06:49,546 INFO L290 TraceCheckUtils]: 17: Hoare triple {33955#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33956#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:06:49,546 INFO L290 TraceCheckUtils]: 18: Hoare triple {33956#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33957#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:06:49,546 INFO L290 TraceCheckUtils]: 19: Hoare triple {33957#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33958#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:06:49,547 INFO L290 TraceCheckUtils]: 20: Hoare triple {33958#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33959#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:06:49,547 INFO L290 TraceCheckUtils]: 21: Hoare triple {33959#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33960#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:06:49,548 INFO L290 TraceCheckUtils]: 22: Hoare triple {33960#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33961#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:06:49,548 INFO L290 TraceCheckUtils]: 23: Hoare triple {33961#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33962#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:06:49,549 INFO L290 TraceCheckUtils]: 24: Hoare triple {33962#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33963#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:06:49,549 INFO L290 TraceCheckUtils]: 25: Hoare triple {33963#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33964#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:06:49,550 INFO L290 TraceCheckUtils]: 26: Hoare triple {33964#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33965#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:06:49,550 INFO L290 TraceCheckUtils]: 27: Hoare triple {33965#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33966#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:06:49,551 INFO L290 TraceCheckUtils]: 28: Hoare triple {33966#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33967#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:06:49,551 INFO L290 TraceCheckUtils]: 29: Hoare triple {33967#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33968#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:06:49,552 INFO L290 TraceCheckUtils]: 30: Hoare triple {33968#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33969#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:06:49,552 INFO L290 TraceCheckUtils]: 31: Hoare triple {33969#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33970#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:06:49,552 INFO L290 TraceCheckUtils]: 32: Hoare triple {33970#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33971#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:06:49,553 INFO L290 TraceCheckUtils]: 33: Hoare triple {33971#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33972#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:06:49,553 INFO L290 TraceCheckUtils]: 34: Hoare triple {33972#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33973#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:06:49,554 INFO L290 TraceCheckUtils]: 35: Hoare triple {33973#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33974#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:06:49,554 INFO L290 TraceCheckUtils]: 36: Hoare triple {33974#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33975#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:06:49,555 INFO L290 TraceCheckUtils]: 37: Hoare triple {33975#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33976#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:06:49,555 INFO L290 TraceCheckUtils]: 38: Hoare triple {33976#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33977#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:06:49,556 INFO L290 TraceCheckUtils]: 39: Hoare triple {33977#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33978#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:06:49,556 INFO L290 TraceCheckUtils]: 40: Hoare triple {33978#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33979#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:06:49,557 INFO L290 TraceCheckUtils]: 41: Hoare triple {33979#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33980#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:06:49,557 INFO L290 TraceCheckUtils]: 42: Hoare triple {33980#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33981#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:06:49,557 INFO L290 TraceCheckUtils]: 43: Hoare triple {33981#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33982#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:06:49,558 INFO L290 TraceCheckUtils]: 44: Hoare triple {33982#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33983#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:06:49,558 INFO L290 TraceCheckUtils]: 45: Hoare triple {33983#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33984#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:06:49,559 INFO L290 TraceCheckUtils]: 46: Hoare triple {33984#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33985#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:06:49,559 INFO L290 TraceCheckUtils]: 47: Hoare triple {33985#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33986#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:06:49,560 INFO L290 TraceCheckUtils]: 48: Hoare triple {33986#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33987#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:06:49,560 INFO L290 TraceCheckUtils]: 49: Hoare triple {33987#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33988#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:06:49,561 INFO L290 TraceCheckUtils]: 50: Hoare triple {33988#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33989#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 03:06:49,561 INFO L290 TraceCheckUtils]: 51: Hoare triple {33989#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33990#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 03:06:49,562 INFO L290 TraceCheckUtils]: 52: Hoare triple {33990#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33991#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 03:06:49,562 INFO L290 TraceCheckUtils]: 53: Hoare triple {33991#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33992#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-28 03:06:49,562 INFO L290 TraceCheckUtils]: 54: Hoare triple {33992#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33993#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-28 03:06:49,563 INFO L290 TraceCheckUtils]: 55: Hoare triple {33993#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33994#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-28 03:06:49,563 INFO L290 TraceCheckUtils]: 56: Hoare triple {33994#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33995#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-28 03:06:49,564 INFO L290 TraceCheckUtils]: 57: Hoare triple {33995#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33996#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-28 03:06:49,564 INFO L290 TraceCheckUtils]: 58: Hoare triple {33996#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33997#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-28 03:06:49,565 INFO L290 TraceCheckUtils]: 59: Hoare triple {33997#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33998#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-28 03:06:49,565 INFO L290 TraceCheckUtils]: 60: Hoare triple {33998#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33999#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-28 03:06:49,566 INFO L290 TraceCheckUtils]: 61: Hoare triple {33999#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34000#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 112))} is VALID [2022-04-28 03:06:49,566 INFO L290 TraceCheckUtils]: 62: Hoare triple {34000#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 112))} assume !(~x~0 % 4294967296 < 268435455); {33940#false} is VALID [2022-04-28 03:06:49,566 INFO L272 TraceCheckUtils]: 63: Hoare triple {33940#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {33940#false} is VALID [2022-04-28 03:06:49,566 INFO L290 TraceCheckUtils]: 64: Hoare triple {33940#false} ~cond := #in~cond; {33940#false} is VALID [2022-04-28 03:06:49,566 INFO L290 TraceCheckUtils]: 65: Hoare triple {33940#false} assume 0 == ~cond; {33940#false} is VALID [2022-04-28 03:06:49,566 INFO L290 TraceCheckUtils]: 66: Hoare triple {33940#false} assume !false; {33940#false} is VALID [2022-04-28 03:06:49,567 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:06:49,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:06:49,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550861579] [2022-04-28 03:06:49,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550861579] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:06:49,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481152027] [2022-04-28 03:06:49,567 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:06:49,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:06:49,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:06:49,568 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:06:49,569 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:06:49,687 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:06:49,688 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:06:49,689 WARN L261 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 115 conjunts are in the unsatisfiable core [2022-04-28 03:06:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:06:49,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:06:50,308 INFO L272 TraceCheckUtils]: 0: Hoare triple {33939#true} call ULTIMATE.init(); {33939#true} is VALID [2022-04-28 03:06:50,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {33939#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {33939#true} is VALID [2022-04-28 03:06:50,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {33939#true} assume true; {33939#true} is VALID [2022-04-28 03:06:50,308 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33939#true} {33939#true} #34#return; {33939#true} is VALID [2022-04-28 03:06:50,308 INFO L272 TraceCheckUtils]: 4: Hoare triple {33939#true} call #t~ret4 := main(); {33939#true} is VALID [2022-04-28 03:06:50,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {33939#true} ~x~0 := 0; {33944#(= main_~x~0 0)} is VALID [2022-04-28 03:06:50,309 INFO L290 TraceCheckUtils]: 6: Hoare triple {33944#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33945#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:06:50,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {33945#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33946#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:06:50,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {33946#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33947#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:06:50,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {33947#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33948#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:06:50,310 INFO L290 TraceCheckUtils]: 10: Hoare triple {33948#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33949#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:06:50,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {33949#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33950#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:06:50,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {33950#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33951#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:06:50,312 INFO L290 TraceCheckUtils]: 13: Hoare triple {33951#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33952#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:06:50,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {33952#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33953#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:06:50,313 INFO L290 TraceCheckUtils]: 15: Hoare triple {33953#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33954#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:06:50,313 INFO L290 TraceCheckUtils]: 16: Hoare triple {33954#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33955#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:06:50,314 INFO L290 TraceCheckUtils]: 17: Hoare triple {33955#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33956#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:06:50,314 INFO L290 TraceCheckUtils]: 18: Hoare triple {33956#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33957#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:06:50,315 INFO L290 TraceCheckUtils]: 19: Hoare triple {33957#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33958#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:06:50,315 INFO L290 TraceCheckUtils]: 20: Hoare triple {33958#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33959#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:06:50,316 INFO L290 TraceCheckUtils]: 21: Hoare triple {33959#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33960#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:06:50,316 INFO L290 TraceCheckUtils]: 22: Hoare triple {33960#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33961#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:06:50,316 INFO L290 TraceCheckUtils]: 23: Hoare triple {33961#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33962#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:06:50,317 INFO L290 TraceCheckUtils]: 24: Hoare triple {33962#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33963#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:06:50,317 INFO L290 TraceCheckUtils]: 25: Hoare triple {33963#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33964#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:06:50,318 INFO L290 TraceCheckUtils]: 26: Hoare triple {33964#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33965#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:06:50,318 INFO L290 TraceCheckUtils]: 27: Hoare triple {33965#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33966#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:06:50,319 INFO L290 TraceCheckUtils]: 28: Hoare triple {33966#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33967#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:06:50,319 INFO L290 TraceCheckUtils]: 29: Hoare triple {33967#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33968#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:06:50,320 INFO L290 TraceCheckUtils]: 30: Hoare triple {33968#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33969#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:06:50,320 INFO L290 TraceCheckUtils]: 31: Hoare triple {33969#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33970#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:06:50,321 INFO L290 TraceCheckUtils]: 32: Hoare triple {33970#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33971#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:06:50,321 INFO L290 TraceCheckUtils]: 33: Hoare triple {33971#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33972#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:06:50,322 INFO L290 TraceCheckUtils]: 34: Hoare triple {33972#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33973#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:06:50,322 INFO L290 TraceCheckUtils]: 35: Hoare triple {33973#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33974#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:06:50,322 INFO L290 TraceCheckUtils]: 36: Hoare triple {33974#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33975#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:06:50,323 INFO L290 TraceCheckUtils]: 37: Hoare triple {33975#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33976#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:06:50,323 INFO L290 TraceCheckUtils]: 38: Hoare triple {33976#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33977#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:06:50,324 INFO L290 TraceCheckUtils]: 39: Hoare triple {33977#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33978#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:06:50,324 INFO L290 TraceCheckUtils]: 40: Hoare triple {33978#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33979#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:06:50,325 INFO L290 TraceCheckUtils]: 41: Hoare triple {33979#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33980#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:06:50,325 INFO L290 TraceCheckUtils]: 42: Hoare triple {33980#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33981#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:06:50,326 INFO L290 TraceCheckUtils]: 43: Hoare triple {33981#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33982#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:06:50,326 INFO L290 TraceCheckUtils]: 44: Hoare triple {33982#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33983#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:06:50,327 INFO L290 TraceCheckUtils]: 45: Hoare triple {33983#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33984#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:06:50,327 INFO L290 TraceCheckUtils]: 46: Hoare triple {33984#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33985#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:06:50,328 INFO L290 TraceCheckUtils]: 47: Hoare triple {33985#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33986#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:06:50,328 INFO L290 TraceCheckUtils]: 48: Hoare triple {33986#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33987#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:06:50,328 INFO L290 TraceCheckUtils]: 49: Hoare triple {33987#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33988#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:06:50,329 INFO L290 TraceCheckUtils]: 50: Hoare triple {33988#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33989#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 03:06:50,329 INFO L290 TraceCheckUtils]: 51: Hoare triple {33989#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33990#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 03:06:50,330 INFO L290 TraceCheckUtils]: 52: Hoare triple {33990#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33991#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 03:06:50,330 INFO L290 TraceCheckUtils]: 53: Hoare triple {33991#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33992#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-28 03:06:50,331 INFO L290 TraceCheckUtils]: 54: Hoare triple {33992#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33993#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-28 03:06:50,331 INFO L290 TraceCheckUtils]: 55: Hoare triple {33993#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33994#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-28 03:06:50,332 INFO L290 TraceCheckUtils]: 56: Hoare triple {33994#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33995#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-28 03:06:50,332 INFO L290 TraceCheckUtils]: 57: Hoare triple {33995#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33996#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-28 03:06:50,333 INFO L290 TraceCheckUtils]: 58: Hoare triple {33996#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33997#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-28 03:06:50,333 INFO L290 TraceCheckUtils]: 59: Hoare triple {33997#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33998#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-28 03:06:50,334 INFO L290 TraceCheckUtils]: 60: Hoare triple {33998#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {33999#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-28 03:06:50,334 INFO L290 TraceCheckUtils]: 61: Hoare triple {33999#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34188#(and (<= main_~x~0 112) (<= 112 main_~x~0))} is VALID [2022-04-28 03:06:50,334 INFO L290 TraceCheckUtils]: 62: Hoare triple {34188#(and (<= main_~x~0 112) (<= 112 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {33940#false} is VALID [2022-04-28 03:06:50,335 INFO L272 TraceCheckUtils]: 63: Hoare triple {33940#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {33940#false} is VALID [2022-04-28 03:06:50,335 INFO L290 TraceCheckUtils]: 64: Hoare triple {33940#false} ~cond := #in~cond; {33940#false} is VALID [2022-04-28 03:06:50,335 INFO L290 TraceCheckUtils]: 65: Hoare triple {33940#false} assume 0 == ~cond; {33940#false} is VALID [2022-04-28 03:06:50,335 INFO L290 TraceCheckUtils]: 66: Hoare triple {33940#false} assume !false; {33940#false} is VALID [2022-04-28 03:06:50,335 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:06:50,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:06:54,948 INFO L290 TraceCheckUtils]: 66: Hoare triple {33940#false} assume !false; {33940#false} is VALID [2022-04-28 03:06:54,948 INFO L290 TraceCheckUtils]: 65: Hoare triple {33940#false} assume 0 == ~cond; {33940#false} is VALID [2022-04-28 03:06:54,949 INFO L290 TraceCheckUtils]: 64: Hoare triple {33940#false} ~cond := #in~cond; {33940#false} is VALID [2022-04-28 03:06:54,949 INFO L272 TraceCheckUtils]: 63: Hoare triple {33940#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {33940#false} is VALID [2022-04-28 03:06:54,949 INFO L290 TraceCheckUtils]: 62: Hoare triple {34216#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {33940#false} is VALID [2022-04-28 03:06:54,950 INFO L290 TraceCheckUtils]: 61: Hoare triple {34220#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34216#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,950 INFO L290 TraceCheckUtils]: 60: Hoare triple {34224#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34220#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,951 INFO L290 TraceCheckUtils]: 59: Hoare triple {34228#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34224#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,951 INFO L290 TraceCheckUtils]: 58: Hoare triple {34232#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34228#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,952 INFO L290 TraceCheckUtils]: 57: Hoare triple {34236#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34232#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,952 INFO L290 TraceCheckUtils]: 56: Hoare triple {34240#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34236#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,953 INFO L290 TraceCheckUtils]: 55: Hoare triple {34244#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34240#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,954 INFO L290 TraceCheckUtils]: 54: Hoare triple {34248#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34244#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,954 INFO L290 TraceCheckUtils]: 53: Hoare triple {34252#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34248#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,955 INFO L290 TraceCheckUtils]: 52: Hoare triple {34256#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34252#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,955 INFO L290 TraceCheckUtils]: 51: Hoare triple {34260#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34256#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,956 INFO L290 TraceCheckUtils]: 50: Hoare triple {34264#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34260#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,957 INFO L290 TraceCheckUtils]: 49: Hoare triple {34268#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34264#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,957 INFO L290 TraceCheckUtils]: 48: Hoare triple {34272#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34268#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,958 INFO L290 TraceCheckUtils]: 47: Hoare triple {34276#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34272#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,958 INFO L290 TraceCheckUtils]: 46: Hoare triple {34280#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34276#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,959 INFO L290 TraceCheckUtils]: 45: Hoare triple {34284#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34280#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,959 INFO L290 TraceCheckUtils]: 44: Hoare triple {34288#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34284#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,960 INFO L290 TraceCheckUtils]: 43: Hoare triple {34292#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34288#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,961 INFO L290 TraceCheckUtils]: 42: Hoare triple {34296#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34292#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,961 INFO L290 TraceCheckUtils]: 41: Hoare triple {34300#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34296#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,962 INFO L290 TraceCheckUtils]: 40: Hoare triple {34304#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34300#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,962 INFO L290 TraceCheckUtils]: 39: Hoare triple {34308#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34304#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,963 INFO L290 TraceCheckUtils]: 38: Hoare triple {34312#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34308#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,963 INFO L290 TraceCheckUtils]: 37: Hoare triple {34316#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34312#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,964 INFO L290 TraceCheckUtils]: 36: Hoare triple {34320#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34316#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,965 INFO L290 TraceCheckUtils]: 35: Hoare triple {34324#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34320#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,965 INFO L290 TraceCheckUtils]: 34: Hoare triple {34328#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34324#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,966 INFO L290 TraceCheckUtils]: 33: Hoare triple {34332#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34328#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,966 INFO L290 TraceCheckUtils]: 32: Hoare triple {34336#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34332#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,967 INFO L290 TraceCheckUtils]: 31: Hoare triple {34340#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34336#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,968 INFO L290 TraceCheckUtils]: 30: Hoare triple {34344#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34340#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,969 INFO L290 TraceCheckUtils]: 29: Hoare triple {34348#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34344#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,969 INFO L290 TraceCheckUtils]: 28: Hoare triple {34352#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34348#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,970 INFO L290 TraceCheckUtils]: 27: Hoare triple {34356#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34352#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,970 INFO L290 TraceCheckUtils]: 26: Hoare triple {34360#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34356#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,971 INFO L290 TraceCheckUtils]: 25: Hoare triple {34364#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34360#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,971 INFO L290 TraceCheckUtils]: 24: Hoare triple {34368#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34364#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,972 INFO L290 TraceCheckUtils]: 23: Hoare triple {34372#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34368#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,973 INFO L290 TraceCheckUtils]: 22: Hoare triple {34376#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34372#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,973 INFO L290 TraceCheckUtils]: 21: Hoare triple {34380#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34376#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,974 INFO L290 TraceCheckUtils]: 20: Hoare triple {34384#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34380#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,974 INFO L290 TraceCheckUtils]: 19: Hoare triple {34388#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34384#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,975 INFO L290 TraceCheckUtils]: 18: Hoare triple {34392#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34388#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,975 INFO L290 TraceCheckUtils]: 17: Hoare triple {34396#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34392#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,976 INFO L290 TraceCheckUtils]: 16: Hoare triple {34400#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34396#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,977 INFO L290 TraceCheckUtils]: 15: Hoare triple {34404#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34400#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,977 INFO L290 TraceCheckUtils]: 14: Hoare triple {34408#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34404#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,978 INFO L290 TraceCheckUtils]: 13: Hoare triple {34412#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34408#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,978 INFO L290 TraceCheckUtils]: 12: Hoare triple {34416#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34412#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,979 INFO L290 TraceCheckUtils]: 11: Hoare triple {34420#(< (mod (+ main_~x~0 102) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34416#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,980 INFO L290 TraceCheckUtils]: 10: Hoare triple {34424#(< (mod (+ 104 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34420#(< (mod (+ main_~x~0 102) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,980 INFO L290 TraceCheckUtils]: 9: Hoare triple {34428#(< (mod (+ 106 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34424#(< (mod (+ 104 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {34432#(< (mod (+ 108 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34428#(< (mod (+ 106 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,981 INFO L290 TraceCheckUtils]: 7: Hoare triple {34436#(< (mod (+ 110 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34432#(< (mod (+ 108 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,982 INFO L290 TraceCheckUtils]: 6: Hoare triple {34440#(< (mod (+ 112 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {34436#(< (mod (+ 110 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {33939#true} ~x~0 := 0; {34440#(< (mod (+ 112 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:06:54,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {33939#true} call #t~ret4 := main(); {33939#true} is VALID [2022-04-28 03:06:54,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33939#true} {33939#true} #34#return; {33939#true} is VALID [2022-04-28 03:06:54,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {33939#true} assume true; {33939#true} is VALID [2022-04-28 03:06:54,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {33939#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {33939#true} is VALID [2022-04-28 03:06:54,983 INFO L272 TraceCheckUtils]: 0: Hoare triple {33939#true} call ULTIMATE.init(); {33939#true} is VALID [2022-04-28 03:06:54,983 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:06:54,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481152027] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:06:54,983 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:06:54,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 59, 59] total 118 [2022-04-28 03:06:54,984 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:06:54,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [367102034] [2022-04-28 03:06:54,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [367102034] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:06:54,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:06:54,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2022-04-28 03:06:54,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120186099] [2022-04-28 03:06:54,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:06:54,984 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:06:54,984 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:06:54,984 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:06:55,018 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:55,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-04-28 03:06:55,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:06:55,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-04-28 03:06:55,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3596, Invalid=10210, Unknown=0, NotChecked=0, Total=13806 [2022-04-28 03:06:55,020 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:07:00,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:00,760 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2022-04-28 03:07:00,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-04-28 03:07:00,760 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:07:00,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:07:00,760 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:07:00,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2022-04-28 03:07:00,761 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:07:00,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2022-04-28 03:07:00,762 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 74 transitions. [2022-04-28 03:07:00,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:07:00,806 INFO L225 Difference]: With dead ends: 74 [2022-04-28 03:07:00,806 INFO L226 Difference]: Without dead ends: 69 [2022-04-28 03:07:00,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1714 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=7185, Invalid=23265, Unknown=0, NotChecked=0, Total=30450 [2022-04-28 03:07:00,807 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 3234 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 3349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 3234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:07:00,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 53 Invalid, 3349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 3234 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 03:07:00,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-28 03:07:00,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-04-28 03:07:00,875 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:07:00,875 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:07:00,875 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:07:00,875 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:07:00,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:00,876 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2022-04-28 03:07:00,876 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2022-04-28 03:07:00,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:07:00,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:07:00,876 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:07:00,876 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:07:00,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:00,877 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2022-04-28 03:07:00,877 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2022-04-28 03:07:00,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:07:00,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:07:00,877 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:07:00,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:07:00,877 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:07:00,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2022-04-28 03:07:00,878 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2022-04-28 03:07:00,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:07:00,878 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2022-04-28 03:07:00,878 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:07:00,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 69 transitions. [2022-04-28 03:07:00,926 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:00,926 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2022-04-28 03:07:00,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-28 03:07:00,926 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:07:00,926 INFO L195 NwaCegarLoop]: trace histogram [57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:07:00,943 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:07:01,130 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:07:01,327 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:07:01,327 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:07:01,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:07:01,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1889267574, now seen corresponding path program 113 times [2022-04-28 03:07:01,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:07:01,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1719145253] [2022-04-28 03:07:01,532 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:01,533 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:07:01,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1442591479, now seen corresponding path program 1 times [2022-04-28 03:07:01,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:07:01,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557257833] [2022-04-28 03:07:01,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:07:01,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:07:01,539 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_57.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_57.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:07:01,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:07:01,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1752315752] [2022-04-28 03:07:01,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:07:01,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:07:01,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:07:01,543 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:07:01,543 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:07:01,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:07:01,583 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:07:01,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:07:01,594 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:07:01,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1889267574, now seen corresponding path program 114 times [2022-04-28 03:07:01,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:07:01,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520984715] [2022-04-28 03:07:01,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:07:01,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:07:01,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:03,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:07:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:03,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {35062#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {34999#true} is VALID [2022-04-28 03:07:03,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {34999#true} assume true; {34999#true} is VALID [2022-04-28 03:07:03,146 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34999#true} {34999#true} #34#return; {34999#true} is VALID [2022-04-28 03:07:03,146 INFO L272 TraceCheckUtils]: 0: Hoare triple {34999#true} call ULTIMATE.init(); {35062#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:07:03,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {35062#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {34999#true} is VALID [2022-04-28 03:07:03,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {34999#true} assume true; {34999#true} is VALID [2022-04-28 03:07:03,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34999#true} {34999#true} #34#return; {34999#true} is VALID [2022-04-28 03:07:03,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {34999#true} call #t~ret4 := main(); {34999#true} is VALID [2022-04-28 03:07:03,147 INFO L290 TraceCheckUtils]: 5: Hoare triple {34999#true} ~x~0 := 0; {35004#(= main_~x~0 0)} is VALID [2022-04-28 03:07:03,147 INFO L290 TraceCheckUtils]: 6: Hoare triple {35004#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35005#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:07:03,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {35005#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35006#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:07:03,148 INFO L290 TraceCheckUtils]: 8: Hoare triple {35006#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35007#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:07:03,148 INFO L290 TraceCheckUtils]: 9: Hoare triple {35007#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35008#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:07:03,149 INFO L290 TraceCheckUtils]: 10: Hoare triple {35008#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35009#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:07:03,149 INFO L290 TraceCheckUtils]: 11: Hoare triple {35009#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35010#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:07:03,150 INFO L290 TraceCheckUtils]: 12: Hoare triple {35010#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35011#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:07:03,150 INFO L290 TraceCheckUtils]: 13: Hoare triple {35011#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35012#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:07:03,151 INFO L290 TraceCheckUtils]: 14: Hoare triple {35012#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35013#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:07:03,151 INFO L290 TraceCheckUtils]: 15: Hoare triple {35013#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35014#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:07:03,152 INFO L290 TraceCheckUtils]: 16: Hoare triple {35014#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35015#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:07:03,152 INFO L290 TraceCheckUtils]: 17: Hoare triple {35015#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35016#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:07:03,153 INFO L290 TraceCheckUtils]: 18: Hoare triple {35016#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35017#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:07:03,153 INFO L290 TraceCheckUtils]: 19: Hoare triple {35017#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35018#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:07:03,154 INFO L290 TraceCheckUtils]: 20: Hoare triple {35018#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35019#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:07:03,154 INFO L290 TraceCheckUtils]: 21: Hoare triple {35019#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35020#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:07:03,154 INFO L290 TraceCheckUtils]: 22: Hoare triple {35020#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35021#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:07:03,155 INFO L290 TraceCheckUtils]: 23: Hoare triple {35021#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35022#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:07:03,155 INFO L290 TraceCheckUtils]: 24: Hoare triple {35022#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35023#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:07:03,156 INFO L290 TraceCheckUtils]: 25: Hoare triple {35023#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35024#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:07:03,156 INFO L290 TraceCheckUtils]: 26: Hoare triple {35024#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35025#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:07:03,157 INFO L290 TraceCheckUtils]: 27: Hoare triple {35025#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35026#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:07:03,157 INFO L290 TraceCheckUtils]: 28: Hoare triple {35026#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35027#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:07:03,158 INFO L290 TraceCheckUtils]: 29: Hoare triple {35027#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35028#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:07:03,158 INFO L290 TraceCheckUtils]: 30: Hoare triple {35028#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35029#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:07:03,159 INFO L290 TraceCheckUtils]: 31: Hoare triple {35029#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35030#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:07:03,159 INFO L290 TraceCheckUtils]: 32: Hoare triple {35030#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35031#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:07:03,160 INFO L290 TraceCheckUtils]: 33: Hoare triple {35031#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35032#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:07:03,160 INFO L290 TraceCheckUtils]: 34: Hoare triple {35032#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35033#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:07:03,160 INFO L290 TraceCheckUtils]: 35: Hoare triple {35033#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35034#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:07:03,161 INFO L290 TraceCheckUtils]: 36: Hoare triple {35034#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35035#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:07:03,161 INFO L290 TraceCheckUtils]: 37: Hoare triple {35035#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35036#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:07:03,162 INFO L290 TraceCheckUtils]: 38: Hoare triple {35036#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35037#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:07:03,162 INFO L290 TraceCheckUtils]: 39: Hoare triple {35037#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35038#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:07:03,163 INFO L290 TraceCheckUtils]: 40: Hoare triple {35038#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35039#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:07:03,163 INFO L290 TraceCheckUtils]: 41: Hoare triple {35039#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35040#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:07:03,164 INFO L290 TraceCheckUtils]: 42: Hoare triple {35040#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35041#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:07:03,164 INFO L290 TraceCheckUtils]: 43: Hoare triple {35041#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35042#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:07:03,165 INFO L290 TraceCheckUtils]: 44: Hoare triple {35042#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35043#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:07:03,165 INFO L290 TraceCheckUtils]: 45: Hoare triple {35043#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35044#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:07:03,166 INFO L290 TraceCheckUtils]: 46: Hoare triple {35044#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35045#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:07:03,166 INFO L290 TraceCheckUtils]: 47: Hoare triple {35045#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35046#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:07:03,167 INFO L290 TraceCheckUtils]: 48: Hoare triple {35046#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35047#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:07:03,167 INFO L290 TraceCheckUtils]: 49: Hoare triple {35047#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35048#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:07:03,167 INFO L290 TraceCheckUtils]: 50: Hoare triple {35048#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35049#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 03:07:03,168 INFO L290 TraceCheckUtils]: 51: Hoare triple {35049#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35050#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 03:07:03,168 INFO L290 TraceCheckUtils]: 52: Hoare triple {35050#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35051#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 03:07:03,169 INFO L290 TraceCheckUtils]: 53: Hoare triple {35051#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35052#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-28 03:07:03,169 INFO L290 TraceCheckUtils]: 54: Hoare triple {35052#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35053#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-28 03:07:03,170 INFO L290 TraceCheckUtils]: 55: Hoare triple {35053#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35054#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-28 03:07:03,170 INFO L290 TraceCheckUtils]: 56: Hoare triple {35054#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35055#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-28 03:07:03,171 INFO L290 TraceCheckUtils]: 57: Hoare triple {35055#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35056#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-28 03:07:03,171 INFO L290 TraceCheckUtils]: 58: Hoare triple {35056#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35057#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-28 03:07:03,172 INFO L290 TraceCheckUtils]: 59: Hoare triple {35057#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35058#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-28 03:07:03,172 INFO L290 TraceCheckUtils]: 60: Hoare triple {35058#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35059#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-28 03:07:03,173 INFO L290 TraceCheckUtils]: 61: Hoare triple {35059#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35060#(and (<= main_~x~0 112) (<= 112 main_~x~0))} is VALID [2022-04-28 03:07:03,173 INFO L290 TraceCheckUtils]: 62: Hoare triple {35060#(and (<= main_~x~0 112) (<= 112 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35061#(and (<= main_~x~0 114) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:07:03,173 INFO L290 TraceCheckUtils]: 63: Hoare triple {35061#(and (<= main_~x~0 114) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {35000#false} is VALID [2022-04-28 03:07:03,174 INFO L272 TraceCheckUtils]: 64: Hoare triple {35000#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {35000#false} is VALID [2022-04-28 03:07:03,174 INFO L290 TraceCheckUtils]: 65: Hoare triple {35000#false} ~cond := #in~cond; {35000#false} is VALID [2022-04-28 03:07:03,174 INFO L290 TraceCheckUtils]: 66: Hoare triple {35000#false} assume 0 == ~cond; {35000#false} is VALID [2022-04-28 03:07:03,174 INFO L290 TraceCheckUtils]: 67: Hoare triple {35000#false} assume !false; {35000#false} is VALID [2022-04-28 03:07:03,174 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:07:03,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:07:03,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520984715] [2022-04-28 03:07:03,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520984715] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:07:03,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457462816] [2022-04-28 03:07:03,175 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:07:03,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:07:03,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:07:03,175 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:07:03,176 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:07:08,689 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 30 check-sat command(s) [2022-04-28 03:07:08,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:07:08,698 WARN L261 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 117 conjunts are in the unsatisfiable core [2022-04-28 03:07:08,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:08,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:07:09,304 INFO L272 TraceCheckUtils]: 0: Hoare triple {34999#true} call ULTIMATE.init(); {34999#true} is VALID [2022-04-28 03:07:09,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {34999#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {34999#true} is VALID [2022-04-28 03:07:09,305 INFO L290 TraceCheckUtils]: 2: Hoare triple {34999#true} assume true; {34999#true} is VALID [2022-04-28 03:07:09,305 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34999#true} {34999#true} #34#return; {34999#true} is VALID [2022-04-28 03:07:09,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {34999#true} call #t~ret4 := main(); {34999#true} is VALID [2022-04-28 03:07:09,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {34999#true} ~x~0 := 0; {35004#(= main_~x~0 0)} is VALID [2022-04-28 03:07:09,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {35004#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35005#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:07:09,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {35005#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35006#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:07:09,306 INFO L290 TraceCheckUtils]: 8: Hoare triple {35006#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35007#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:07:09,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {35007#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35008#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:07:09,307 INFO L290 TraceCheckUtils]: 10: Hoare triple {35008#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35009#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:07:09,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {35009#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35010#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:07:09,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {35010#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35011#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:07:09,309 INFO L290 TraceCheckUtils]: 13: Hoare triple {35011#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35012#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:07:09,309 INFO L290 TraceCheckUtils]: 14: Hoare triple {35012#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35013#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:07:09,310 INFO L290 TraceCheckUtils]: 15: Hoare triple {35013#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35014#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:07:09,310 INFO L290 TraceCheckUtils]: 16: Hoare triple {35014#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35015#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:07:09,311 INFO L290 TraceCheckUtils]: 17: Hoare triple {35015#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35016#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:07:09,311 INFO L290 TraceCheckUtils]: 18: Hoare triple {35016#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35017#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:07:09,311 INFO L290 TraceCheckUtils]: 19: Hoare triple {35017#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35018#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:07:09,312 INFO L290 TraceCheckUtils]: 20: Hoare triple {35018#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35019#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:07:09,312 INFO L290 TraceCheckUtils]: 21: Hoare triple {35019#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35020#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:07:09,313 INFO L290 TraceCheckUtils]: 22: Hoare triple {35020#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35021#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:07:09,313 INFO L290 TraceCheckUtils]: 23: Hoare triple {35021#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35022#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:07:09,314 INFO L290 TraceCheckUtils]: 24: Hoare triple {35022#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35023#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:07:09,314 INFO L290 TraceCheckUtils]: 25: Hoare triple {35023#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35024#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:07:09,315 INFO L290 TraceCheckUtils]: 26: Hoare triple {35024#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35025#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:07:09,315 INFO L290 TraceCheckUtils]: 27: Hoare triple {35025#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35026#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:07:09,316 INFO L290 TraceCheckUtils]: 28: Hoare triple {35026#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35027#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:07:09,316 INFO L290 TraceCheckUtils]: 29: Hoare triple {35027#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35028#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:07:09,317 INFO L290 TraceCheckUtils]: 30: Hoare triple {35028#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35029#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:07:09,317 INFO L290 TraceCheckUtils]: 31: Hoare triple {35029#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35030#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:07:09,317 INFO L290 TraceCheckUtils]: 32: Hoare triple {35030#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35031#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:07:09,318 INFO L290 TraceCheckUtils]: 33: Hoare triple {35031#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35032#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:07:09,318 INFO L290 TraceCheckUtils]: 34: Hoare triple {35032#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35033#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:07:09,319 INFO L290 TraceCheckUtils]: 35: Hoare triple {35033#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35034#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:07:09,319 INFO L290 TraceCheckUtils]: 36: Hoare triple {35034#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35035#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:07:09,320 INFO L290 TraceCheckUtils]: 37: Hoare triple {35035#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35036#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:07:09,320 INFO L290 TraceCheckUtils]: 38: Hoare triple {35036#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35037#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:07:09,321 INFO L290 TraceCheckUtils]: 39: Hoare triple {35037#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35038#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:07:09,321 INFO L290 TraceCheckUtils]: 40: Hoare triple {35038#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35039#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:07:09,322 INFO L290 TraceCheckUtils]: 41: Hoare triple {35039#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35040#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:07:09,322 INFO L290 TraceCheckUtils]: 42: Hoare triple {35040#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35041#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:07:09,323 INFO L290 TraceCheckUtils]: 43: Hoare triple {35041#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35042#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:07:09,323 INFO L290 TraceCheckUtils]: 44: Hoare triple {35042#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35043#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:07:09,324 INFO L290 TraceCheckUtils]: 45: Hoare triple {35043#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35044#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:07:09,324 INFO L290 TraceCheckUtils]: 46: Hoare triple {35044#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35045#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:07:09,325 INFO L290 TraceCheckUtils]: 47: Hoare triple {35045#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35046#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:07:09,325 INFO L290 TraceCheckUtils]: 48: Hoare triple {35046#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35047#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:07:09,325 INFO L290 TraceCheckUtils]: 49: Hoare triple {35047#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35048#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:07:09,326 INFO L290 TraceCheckUtils]: 50: Hoare triple {35048#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35049#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 03:07:09,326 INFO L290 TraceCheckUtils]: 51: Hoare triple {35049#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35050#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 03:07:09,327 INFO L290 TraceCheckUtils]: 52: Hoare triple {35050#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35051#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 03:07:09,327 INFO L290 TraceCheckUtils]: 53: Hoare triple {35051#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35052#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-28 03:07:09,328 INFO L290 TraceCheckUtils]: 54: Hoare triple {35052#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35053#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-28 03:07:09,328 INFO L290 TraceCheckUtils]: 55: Hoare triple {35053#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35054#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-28 03:07:09,329 INFO L290 TraceCheckUtils]: 56: Hoare triple {35054#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35055#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-28 03:07:09,329 INFO L290 TraceCheckUtils]: 57: Hoare triple {35055#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35056#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-28 03:07:09,330 INFO L290 TraceCheckUtils]: 58: Hoare triple {35056#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35057#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-28 03:07:09,330 INFO L290 TraceCheckUtils]: 59: Hoare triple {35057#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35058#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-28 03:07:09,331 INFO L290 TraceCheckUtils]: 60: Hoare triple {35058#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35059#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-28 03:07:09,331 INFO L290 TraceCheckUtils]: 61: Hoare triple {35059#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35060#(and (<= main_~x~0 112) (<= 112 main_~x~0))} is VALID [2022-04-28 03:07:09,332 INFO L290 TraceCheckUtils]: 62: Hoare triple {35060#(and (<= main_~x~0 112) (<= 112 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35252#(and (<= main_~x~0 114) (<= 114 main_~x~0))} is VALID [2022-04-28 03:07:09,332 INFO L290 TraceCheckUtils]: 63: Hoare triple {35252#(and (<= main_~x~0 114) (<= 114 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {35000#false} is VALID [2022-04-28 03:07:09,332 INFO L272 TraceCheckUtils]: 64: Hoare triple {35000#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {35000#false} is VALID [2022-04-28 03:07:09,332 INFO L290 TraceCheckUtils]: 65: Hoare triple {35000#false} ~cond := #in~cond; {35000#false} is VALID [2022-04-28 03:07:09,332 INFO L290 TraceCheckUtils]: 66: Hoare triple {35000#false} assume 0 == ~cond; {35000#false} is VALID [2022-04-28 03:07:09,332 INFO L290 TraceCheckUtils]: 67: Hoare triple {35000#false} assume !false; {35000#false} is VALID [2022-04-28 03:07:09,333 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:07:09,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:07:14,084 INFO L290 TraceCheckUtils]: 67: Hoare triple {35000#false} assume !false; {35000#false} is VALID [2022-04-28 03:07:14,084 INFO L290 TraceCheckUtils]: 66: Hoare triple {35000#false} assume 0 == ~cond; {35000#false} is VALID [2022-04-28 03:07:14,085 INFO L290 TraceCheckUtils]: 65: Hoare triple {35000#false} ~cond := #in~cond; {35000#false} is VALID [2022-04-28 03:07:14,085 INFO L272 TraceCheckUtils]: 64: Hoare triple {35000#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {35000#false} is VALID [2022-04-28 03:07:14,085 INFO L290 TraceCheckUtils]: 63: Hoare triple {35280#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {35000#false} is VALID [2022-04-28 03:07:14,086 INFO L290 TraceCheckUtils]: 62: Hoare triple {35284#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35280#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,086 INFO L290 TraceCheckUtils]: 61: Hoare triple {35288#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35284#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,087 INFO L290 TraceCheckUtils]: 60: Hoare triple {35292#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35288#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,090 INFO L290 TraceCheckUtils]: 59: Hoare triple {35296#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35292#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,091 INFO L290 TraceCheckUtils]: 58: Hoare triple {35300#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35296#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,091 INFO L290 TraceCheckUtils]: 57: Hoare triple {35304#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35300#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,092 INFO L290 TraceCheckUtils]: 56: Hoare triple {35308#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35304#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,092 INFO L290 TraceCheckUtils]: 55: Hoare triple {35312#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35308#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,093 INFO L290 TraceCheckUtils]: 54: Hoare triple {35316#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35312#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,094 INFO L290 TraceCheckUtils]: 53: Hoare triple {35320#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35316#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,094 INFO L290 TraceCheckUtils]: 52: Hoare triple {35324#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35320#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,095 INFO L290 TraceCheckUtils]: 51: Hoare triple {35328#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35324#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,095 INFO L290 TraceCheckUtils]: 50: Hoare triple {35332#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35328#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,096 INFO L290 TraceCheckUtils]: 49: Hoare triple {35336#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35332#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,097 INFO L290 TraceCheckUtils]: 48: Hoare triple {35340#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35336#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,097 INFO L290 TraceCheckUtils]: 47: Hoare triple {35344#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35340#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,098 INFO L290 TraceCheckUtils]: 46: Hoare triple {35348#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35344#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,098 INFO L290 TraceCheckUtils]: 45: Hoare triple {35352#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35348#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,099 INFO L290 TraceCheckUtils]: 44: Hoare triple {35356#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35352#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,099 INFO L290 TraceCheckUtils]: 43: Hoare triple {35360#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35356#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,100 INFO L290 TraceCheckUtils]: 42: Hoare triple {35364#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35360#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,101 INFO L290 TraceCheckUtils]: 41: Hoare triple {35368#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35364#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,101 INFO L290 TraceCheckUtils]: 40: Hoare triple {35372#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35368#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,102 INFO L290 TraceCheckUtils]: 39: Hoare triple {35376#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35372#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,102 INFO L290 TraceCheckUtils]: 38: Hoare triple {35380#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35376#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,103 INFO L290 TraceCheckUtils]: 37: Hoare triple {35384#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35380#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,103 INFO L290 TraceCheckUtils]: 36: Hoare triple {35388#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35384#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,104 INFO L290 TraceCheckUtils]: 35: Hoare triple {35392#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35388#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,105 INFO L290 TraceCheckUtils]: 34: Hoare triple {35396#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35392#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,105 INFO L290 TraceCheckUtils]: 33: Hoare triple {35400#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35396#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,106 INFO L290 TraceCheckUtils]: 32: Hoare triple {35404#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35400#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,106 INFO L290 TraceCheckUtils]: 31: Hoare triple {35408#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35404#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,107 INFO L290 TraceCheckUtils]: 30: Hoare triple {35412#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35408#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,108 INFO L290 TraceCheckUtils]: 29: Hoare triple {35416#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35412#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,108 INFO L290 TraceCheckUtils]: 28: Hoare triple {35420#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35416#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,109 INFO L290 TraceCheckUtils]: 27: Hoare triple {35424#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35420#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,109 INFO L290 TraceCheckUtils]: 26: Hoare triple {35428#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35424#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,110 INFO L290 TraceCheckUtils]: 25: Hoare triple {35432#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35428#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,110 INFO L290 TraceCheckUtils]: 24: Hoare triple {35436#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35432#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,111 INFO L290 TraceCheckUtils]: 23: Hoare triple {35440#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35436#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,112 INFO L290 TraceCheckUtils]: 22: Hoare triple {35444#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35440#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,112 INFO L290 TraceCheckUtils]: 21: Hoare triple {35448#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35444#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,113 INFO L290 TraceCheckUtils]: 20: Hoare triple {35452#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35448#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,113 INFO L290 TraceCheckUtils]: 19: Hoare triple {35456#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35452#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,114 INFO L290 TraceCheckUtils]: 18: Hoare triple {35460#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35456#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,114 INFO L290 TraceCheckUtils]: 17: Hoare triple {35464#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35460#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,115 INFO L290 TraceCheckUtils]: 16: Hoare triple {35468#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35464#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,116 INFO L290 TraceCheckUtils]: 15: Hoare triple {35472#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35468#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,116 INFO L290 TraceCheckUtils]: 14: Hoare triple {35476#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35472#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,117 INFO L290 TraceCheckUtils]: 13: Hoare triple {35480#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35476#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,117 INFO L290 TraceCheckUtils]: 12: Hoare triple {35484#(< (mod (+ main_~x~0 102) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35480#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,118 INFO L290 TraceCheckUtils]: 11: Hoare triple {35488#(< (mod (+ 104 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35484#(< (mod (+ main_~x~0 102) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,118 INFO L290 TraceCheckUtils]: 10: Hoare triple {35492#(< (mod (+ 106 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35488#(< (mod (+ 104 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {35496#(< (mod (+ 108 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35492#(< (mod (+ 106 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,120 INFO L290 TraceCheckUtils]: 8: Hoare triple {35500#(< (mod (+ 110 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35496#(< (mod (+ 108 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,120 INFO L290 TraceCheckUtils]: 7: Hoare triple {35504#(< (mod (+ 112 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35500#(< (mod (+ 110 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,121 INFO L290 TraceCheckUtils]: 6: Hoare triple {35508#(< (mod (+ main_~x~0 114) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {35504#(< (mod (+ 112 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,121 INFO L290 TraceCheckUtils]: 5: Hoare triple {34999#true} ~x~0 := 0; {35508#(< (mod (+ main_~x~0 114) 4294967296) 268435455)} is VALID [2022-04-28 03:07:14,121 INFO L272 TraceCheckUtils]: 4: Hoare triple {34999#true} call #t~ret4 := main(); {34999#true} is VALID [2022-04-28 03:07:14,121 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34999#true} {34999#true} #34#return; {34999#true} is VALID [2022-04-28 03:07:14,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {34999#true} assume true; {34999#true} is VALID [2022-04-28 03:07:14,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {34999#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {34999#true} is VALID [2022-04-28 03:07:14,121 INFO L272 TraceCheckUtils]: 0: Hoare triple {34999#true} call ULTIMATE.init(); {34999#true} is VALID [2022-04-28 03:07:14,122 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:07:14,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457462816] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:07:14,122 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:07:14,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 60, 60] total 120 [2022-04-28 03:07:14,122 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:07:14,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1719145253] [2022-04-28 03:07:14,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1719145253] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:07:14,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:07:14,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2022-04-28 03:07:14,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967669637] [2022-04-28 03:07:14,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:07:14,123 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:07:14,123 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:07:14,123 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:07:14,169 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:07:14,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-04-28 03:07:14,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:07:14,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-04-28 03:07:14,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3717, Invalid=10563, Unknown=0, NotChecked=0, Total=14280 [2022-04-28 03:07:14,171 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:07:20,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:20,409 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2022-04-28 03:07:20,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-04-28 03:07:20,409 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:07:20,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:07:20,410 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:07:20,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2022-04-28 03:07:20,410 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:07:20,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2022-04-28 03:07:20,411 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 75 transitions. [2022-04-28 03:07:20,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:07:20,473 INFO L225 Difference]: With dead ends: 75 [2022-04-28 03:07:20,473 INFO L226 Difference]: Without dead ends: 70 [2022-04-28 03:07:20,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1773 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=7427, Invalid=24079, Unknown=0, NotChecked=0, Total=31506 [2022-04-28 03:07:20,474 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 3528 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 3645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 3528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:07:20,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 233 Invalid, 3645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 3528 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 03:07:20,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-28 03:07:20,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-28 03:07:20,565 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:07:20,565 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:07:20,565 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:07:20,565 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:07:20,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:20,566 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2022-04-28 03:07:20,566 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2022-04-28 03:07:20,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:07:20,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:07:20,566 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:07:20,566 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:07:20,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:20,567 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2022-04-28 03:07:20,567 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2022-04-28 03:07:20,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:07:20,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:07:20,567 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:07:20,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:07:20,567 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:07:20,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2022-04-28 03:07:20,567 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2022-04-28 03:07:20,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:07:20,568 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2022-04-28 03:07:20,568 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:07:20,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 70 transitions. [2022-04-28 03:07:20,616 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:20,616 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2022-04-28 03:07:20,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-28 03:07:20,616 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:07:20,616 INFO L195 NwaCegarLoop]: trace histogram [58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:07:20,621 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:07:20,820 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:07:21,016 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:07:21,017 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:07:21,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:07:21,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1525786084, now seen corresponding path program 115 times [2022-04-28 03:07:21,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:07:21,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [15629327] [2022-04-28 03:07:21,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:07:21,274 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:07:21,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1501696823, now seen corresponding path program 1 times [2022-04-28 03:07:21,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:07:21,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132744740] [2022-04-28 03:07:21,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:07:21,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:07:21,280 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_58.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_58.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:07:21,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:07:21,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [110695227] [2022-04-28 03:07:21,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:07:21,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:07:21,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:07:21,283 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:07:21,284 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:07:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:07:21,325 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:07:21,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:07:21,331 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:07:21,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1525786084, now seen corresponding path program 116 times [2022-04-28 03:07:21,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:07:21,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864385138] [2022-04-28 03:07:21,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:07:21,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:07:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:22,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:07:22,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:22,871 INFO L290 TraceCheckUtils]: 0: Hoare triple {36139#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {36075#true} is VALID [2022-04-28 03:07:22,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {36075#true} assume true; {36075#true} is VALID [2022-04-28 03:07:22,871 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36075#true} {36075#true} #34#return; {36075#true} is VALID [2022-04-28 03:07:22,871 INFO L272 TraceCheckUtils]: 0: Hoare triple {36075#true} call ULTIMATE.init(); {36139#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:07:22,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {36139#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {36075#true} is VALID [2022-04-28 03:07:22,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {36075#true} assume true; {36075#true} is VALID [2022-04-28 03:07:22,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36075#true} {36075#true} #34#return; {36075#true} is VALID [2022-04-28 03:07:22,872 INFO L272 TraceCheckUtils]: 4: Hoare triple {36075#true} call #t~ret4 := main(); {36075#true} is VALID [2022-04-28 03:07:22,872 INFO L290 TraceCheckUtils]: 5: Hoare triple {36075#true} ~x~0 := 0; {36080#(= main_~x~0 0)} is VALID [2022-04-28 03:07:22,872 INFO L290 TraceCheckUtils]: 6: Hoare triple {36080#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36081#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:07:22,873 INFO L290 TraceCheckUtils]: 7: Hoare triple {36081#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36082#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:07:22,873 INFO L290 TraceCheckUtils]: 8: Hoare triple {36082#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36083#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:07:22,874 INFO L290 TraceCheckUtils]: 9: Hoare triple {36083#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36084#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:07:22,874 INFO L290 TraceCheckUtils]: 10: Hoare triple {36084#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36085#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:07:22,875 INFO L290 TraceCheckUtils]: 11: Hoare triple {36085#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36086#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:07:22,875 INFO L290 TraceCheckUtils]: 12: Hoare triple {36086#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36087#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:07:22,875 INFO L290 TraceCheckUtils]: 13: Hoare triple {36087#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36088#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:07:22,876 INFO L290 TraceCheckUtils]: 14: Hoare triple {36088#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36089#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:07:22,876 INFO L290 TraceCheckUtils]: 15: Hoare triple {36089#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36090#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:07:22,877 INFO L290 TraceCheckUtils]: 16: Hoare triple {36090#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36091#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:07:22,877 INFO L290 TraceCheckUtils]: 17: Hoare triple {36091#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36092#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:07:22,878 INFO L290 TraceCheckUtils]: 18: Hoare triple {36092#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36093#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:07:22,878 INFO L290 TraceCheckUtils]: 19: Hoare triple {36093#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36094#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:07:22,879 INFO L290 TraceCheckUtils]: 20: Hoare triple {36094#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36095#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:07:22,879 INFO L290 TraceCheckUtils]: 21: Hoare triple {36095#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36096#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:07:22,880 INFO L290 TraceCheckUtils]: 22: Hoare triple {36096#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36097#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:07:22,880 INFO L290 TraceCheckUtils]: 23: Hoare triple {36097#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36098#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:07:22,881 INFO L290 TraceCheckUtils]: 24: Hoare triple {36098#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36099#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:07:22,881 INFO L290 TraceCheckUtils]: 25: Hoare triple {36099#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36100#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:07:22,882 INFO L290 TraceCheckUtils]: 26: Hoare triple {36100#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36101#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:07:22,882 INFO L290 TraceCheckUtils]: 27: Hoare triple {36101#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36102#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:07:22,883 INFO L290 TraceCheckUtils]: 28: Hoare triple {36102#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36103#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:07:22,883 INFO L290 TraceCheckUtils]: 29: Hoare triple {36103#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36104#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:07:22,883 INFO L290 TraceCheckUtils]: 30: Hoare triple {36104#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36105#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:07:22,884 INFO L290 TraceCheckUtils]: 31: Hoare triple {36105#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36106#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:07:22,884 INFO L290 TraceCheckUtils]: 32: Hoare triple {36106#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36107#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:07:22,885 INFO L290 TraceCheckUtils]: 33: Hoare triple {36107#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36108#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:07:22,885 INFO L290 TraceCheckUtils]: 34: Hoare triple {36108#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36109#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:07:22,886 INFO L290 TraceCheckUtils]: 35: Hoare triple {36109#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36110#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:07:22,886 INFO L290 TraceCheckUtils]: 36: Hoare triple {36110#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36111#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:07:22,887 INFO L290 TraceCheckUtils]: 37: Hoare triple {36111#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36112#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:07:22,887 INFO L290 TraceCheckUtils]: 38: Hoare triple {36112#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36113#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:07:22,888 INFO L290 TraceCheckUtils]: 39: Hoare triple {36113#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36114#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:07:22,888 INFO L290 TraceCheckUtils]: 40: Hoare triple {36114#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36115#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:07:22,888 INFO L290 TraceCheckUtils]: 41: Hoare triple {36115#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36116#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:07:22,889 INFO L290 TraceCheckUtils]: 42: Hoare triple {36116#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36117#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:07:22,889 INFO L290 TraceCheckUtils]: 43: Hoare triple {36117#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36118#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:07:22,890 INFO L290 TraceCheckUtils]: 44: Hoare triple {36118#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36119#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:07:22,890 INFO L290 TraceCheckUtils]: 45: Hoare triple {36119#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36120#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:07:22,891 INFO L290 TraceCheckUtils]: 46: Hoare triple {36120#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36121#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:07:22,891 INFO L290 TraceCheckUtils]: 47: Hoare triple {36121#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36122#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:07:22,892 INFO L290 TraceCheckUtils]: 48: Hoare triple {36122#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36123#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:07:22,892 INFO L290 TraceCheckUtils]: 49: Hoare triple {36123#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36124#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:07:22,893 INFO L290 TraceCheckUtils]: 50: Hoare triple {36124#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36125#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 03:07:22,893 INFO L290 TraceCheckUtils]: 51: Hoare triple {36125#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36126#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 03:07:22,894 INFO L290 TraceCheckUtils]: 52: Hoare triple {36126#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36127#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 03:07:22,894 INFO L290 TraceCheckUtils]: 53: Hoare triple {36127#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36128#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-28 03:07:22,894 INFO L290 TraceCheckUtils]: 54: Hoare triple {36128#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36129#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-28 03:07:22,895 INFO L290 TraceCheckUtils]: 55: Hoare triple {36129#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36130#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-28 03:07:22,895 INFO L290 TraceCheckUtils]: 56: Hoare triple {36130#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36131#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-28 03:07:22,896 INFO L290 TraceCheckUtils]: 57: Hoare triple {36131#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36132#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-28 03:07:22,896 INFO L290 TraceCheckUtils]: 58: Hoare triple {36132#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36133#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-28 03:07:22,897 INFO L290 TraceCheckUtils]: 59: Hoare triple {36133#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36134#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-28 03:07:22,897 INFO L290 TraceCheckUtils]: 60: Hoare triple {36134#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36135#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-28 03:07:22,898 INFO L290 TraceCheckUtils]: 61: Hoare triple {36135#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36136#(and (<= main_~x~0 112) (<= 112 main_~x~0))} is VALID [2022-04-28 03:07:22,898 INFO L290 TraceCheckUtils]: 62: Hoare triple {36136#(and (<= main_~x~0 112) (<= 112 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36137#(and (<= main_~x~0 114) (<= 114 main_~x~0))} is VALID [2022-04-28 03:07:22,899 INFO L290 TraceCheckUtils]: 63: Hoare triple {36137#(and (<= main_~x~0 114) (<= 114 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36138#(and (<= main_~x~0 116) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:07:22,899 INFO L290 TraceCheckUtils]: 64: Hoare triple {36138#(and (<= main_~x~0 116) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {36076#false} is VALID [2022-04-28 03:07:22,899 INFO L272 TraceCheckUtils]: 65: Hoare triple {36076#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {36076#false} is VALID [2022-04-28 03:07:22,899 INFO L290 TraceCheckUtils]: 66: Hoare triple {36076#false} ~cond := #in~cond; {36076#false} is VALID [2022-04-28 03:07:22,899 INFO L290 TraceCheckUtils]: 67: Hoare triple {36076#false} assume 0 == ~cond; {36076#false} is VALID [2022-04-28 03:07:22,899 INFO L290 TraceCheckUtils]: 68: Hoare triple {36076#false} assume !false; {36076#false} is VALID [2022-04-28 03:07:22,900 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:07:22,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:07:22,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864385138] [2022-04-28 03:07:22,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864385138] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:07:22,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121309022] [2022-04-28 03:07:22,900 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:07:22,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:07:22,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:07:22,901 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:07:22,902 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:07:22,971 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:07:22,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:07:22,973 WARN L261 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 119 conjunts are in the unsatisfiable core [2022-04-28 03:07:22,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:22,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:07:23,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {36075#true} call ULTIMATE.init(); {36075#true} is VALID [2022-04-28 03:07:23,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {36075#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {36075#true} is VALID [2022-04-28 03:07:23,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {36075#true} assume true; {36075#true} is VALID [2022-04-28 03:07:23,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36075#true} {36075#true} #34#return; {36075#true} is VALID [2022-04-28 03:07:23,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {36075#true} call #t~ret4 := main(); {36075#true} is VALID [2022-04-28 03:07:23,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {36075#true} ~x~0 := 0; {36080#(= main_~x~0 0)} is VALID [2022-04-28 03:07:23,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {36080#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36081#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:07:23,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {36081#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36082#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:07:23,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {36082#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36083#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:07:23,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {36083#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36084#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:07:23,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {36084#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36085#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:07:23,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {36085#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36086#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:07:23,590 INFO L290 TraceCheckUtils]: 12: Hoare triple {36086#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36087#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:07:23,590 INFO L290 TraceCheckUtils]: 13: Hoare triple {36087#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36088#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:07:23,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {36088#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36089#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:07:23,591 INFO L290 TraceCheckUtils]: 15: Hoare triple {36089#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36090#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:07:23,592 INFO L290 TraceCheckUtils]: 16: Hoare triple {36090#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36091#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:07:23,592 INFO L290 TraceCheckUtils]: 17: Hoare triple {36091#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36092#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:07:23,593 INFO L290 TraceCheckUtils]: 18: Hoare triple {36092#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36093#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:07:23,593 INFO L290 TraceCheckUtils]: 19: Hoare triple {36093#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36094#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:07:23,593 INFO L290 TraceCheckUtils]: 20: Hoare triple {36094#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36095#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:07:23,594 INFO L290 TraceCheckUtils]: 21: Hoare triple {36095#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36096#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:07:23,594 INFO L290 TraceCheckUtils]: 22: Hoare triple {36096#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36097#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:07:23,595 INFO L290 TraceCheckUtils]: 23: Hoare triple {36097#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36098#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:07:23,595 INFO L290 TraceCheckUtils]: 24: Hoare triple {36098#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36099#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:07:23,596 INFO L290 TraceCheckUtils]: 25: Hoare triple {36099#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36100#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:07:23,596 INFO L290 TraceCheckUtils]: 26: Hoare triple {36100#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36101#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:07:23,597 INFO L290 TraceCheckUtils]: 27: Hoare triple {36101#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36102#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:07:23,597 INFO L290 TraceCheckUtils]: 28: Hoare triple {36102#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36103#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:07:23,597 INFO L290 TraceCheckUtils]: 29: Hoare triple {36103#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36104#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:07:23,598 INFO L290 TraceCheckUtils]: 30: Hoare triple {36104#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36105#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:07:23,598 INFO L290 TraceCheckUtils]: 31: Hoare triple {36105#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36106#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:07:23,599 INFO L290 TraceCheckUtils]: 32: Hoare triple {36106#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36107#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:07:23,599 INFO L290 TraceCheckUtils]: 33: Hoare triple {36107#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36108#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:07:23,600 INFO L290 TraceCheckUtils]: 34: Hoare triple {36108#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36109#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:07:23,600 INFO L290 TraceCheckUtils]: 35: Hoare triple {36109#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36110#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:07:23,601 INFO L290 TraceCheckUtils]: 36: Hoare triple {36110#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36111#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:07:23,601 INFO L290 TraceCheckUtils]: 37: Hoare triple {36111#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36112#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:07:23,602 INFO L290 TraceCheckUtils]: 38: Hoare triple {36112#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36113#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:07:23,602 INFO L290 TraceCheckUtils]: 39: Hoare triple {36113#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36114#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:07:23,602 INFO L290 TraceCheckUtils]: 40: Hoare triple {36114#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36115#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:07:23,603 INFO L290 TraceCheckUtils]: 41: Hoare triple {36115#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36116#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:07:23,603 INFO L290 TraceCheckUtils]: 42: Hoare triple {36116#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36117#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:07:23,604 INFO L290 TraceCheckUtils]: 43: Hoare triple {36117#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36118#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:07:23,604 INFO L290 TraceCheckUtils]: 44: Hoare triple {36118#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36119#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:07:23,605 INFO L290 TraceCheckUtils]: 45: Hoare triple {36119#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36120#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:07:23,605 INFO L290 TraceCheckUtils]: 46: Hoare triple {36120#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36121#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:07:23,606 INFO L290 TraceCheckUtils]: 47: Hoare triple {36121#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36122#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:07:23,606 INFO L290 TraceCheckUtils]: 48: Hoare triple {36122#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36123#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:07:23,607 INFO L290 TraceCheckUtils]: 49: Hoare triple {36123#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36124#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:07:23,607 INFO L290 TraceCheckUtils]: 50: Hoare triple {36124#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36125#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 03:07:23,608 INFO L290 TraceCheckUtils]: 51: Hoare triple {36125#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36126#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 03:07:23,608 INFO L290 TraceCheckUtils]: 52: Hoare triple {36126#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36127#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 03:07:23,608 INFO L290 TraceCheckUtils]: 53: Hoare triple {36127#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36128#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-28 03:07:23,609 INFO L290 TraceCheckUtils]: 54: Hoare triple {36128#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36129#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-28 03:07:23,609 INFO L290 TraceCheckUtils]: 55: Hoare triple {36129#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36130#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-28 03:07:23,610 INFO L290 TraceCheckUtils]: 56: Hoare triple {36130#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36131#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-28 03:07:23,610 INFO L290 TraceCheckUtils]: 57: Hoare triple {36131#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36132#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-28 03:07:23,611 INFO L290 TraceCheckUtils]: 58: Hoare triple {36132#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36133#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-28 03:07:23,611 INFO L290 TraceCheckUtils]: 59: Hoare triple {36133#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36134#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-28 03:07:23,612 INFO L290 TraceCheckUtils]: 60: Hoare triple {36134#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36135#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-28 03:07:23,612 INFO L290 TraceCheckUtils]: 61: Hoare triple {36135#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36136#(and (<= main_~x~0 112) (<= 112 main_~x~0))} is VALID [2022-04-28 03:07:23,613 INFO L290 TraceCheckUtils]: 62: Hoare triple {36136#(and (<= main_~x~0 112) (<= 112 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36137#(and (<= main_~x~0 114) (<= 114 main_~x~0))} is VALID [2022-04-28 03:07:23,613 INFO L290 TraceCheckUtils]: 63: Hoare triple {36137#(and (<= main_~x~0 114) (<= 114 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36332#(and (<= main_~x~0 116) (<= 116 main_~x~0))} is VALID [2022-04-28 03:07:23,613 INFO L290 TraceCheckUtils]: 64: Hoare triple {36332#(and (<= main_~x~0 116) (<= 116 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {36076#false} is VALID [2022-04-28 03:07:23,614 INFO L272 TraceCheckUtils]: 65: Hoare triple {36076#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {36076#false} is VALID [2022-04-28 03:07:23,614 INFO L290 TraceCheckUtils]: 66: Hoare triple {36076#false} ~cond := #in~cond; {36076#false} is VALID [2022-04-28 03:07:23,614 INFO L290 TraceCheckUtils]: 67: Hoare triple {36076#false} assume 0 == ~cond; {36076#false} is VALID [2022-04-28 03:07:23,614 INFO L290 TraceCheckUtils]: 68: Hoare triple {36076#false} assume !false; {36076#false} is VALID [2022-04-28 03:07:23,614 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:07:23,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:07:28,473 INFO L290 TraceCheckUtils]: 68: Hoare triple {36076#false} assume !false; {36076#false} is VALID [2022-04-28 03:07:28,473 INFO L290 TraceCheckUtils]: 67: Hoare triple {36076#false} assume 0 == ~cond; {36076#false} is VALID [2022-04-28 03:07:28,473 INFO L290 TraceCheckUtils]: 66: Hoare triple {36076#false} ~cond := #in~cond; {36076#false} is VALID [2022-04-28 03:07:28,473 INFO L272 TraceCheckUtils]: 65: Hoare triple {36076#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {36076#false} is VALID [2022-04-28 03:07:28,473 INFO L290 TraceCheckUtils]: 64: Hoare triple {36360#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {36076#false} is VALID [2022-04-28 03:07:28,474 INFO L290 TraceCheckUtils]: 63: Hoare triple {36364#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36360#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,475 INFO L290 TraceCheckUtils]: 62: Hoare triple {36368#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36364#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,475 INFO L290 TraceCheckUtils]: 61: Hoare triple {36372#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36368#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,476 INFO L290 TraceCheckUtils]: 60: Hoare triple {36376#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36372#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,476 INFO L290 TraceCheckUtils]: 59: Hoare triple {36380#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36376#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,477 INFO L290 TraceCheckUtils]: 58: Hoare triple {36384#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36380#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,478 INFO L290 TraceCheckUtils]: 57: Hoare triple {36388#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36384#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,478 INFO L290 TraceCheckUtils]: 56: Hoare triple {36392#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36388#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,479 INFO L290 TraceCheckUtils]: 55: Hoare triple {36396#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36392#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,479 INFO L290 TraceCheckUtils]: 54: Hoare triple {36400#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36396#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,480 INFO L290 TraceCheckUtils]: 53: Hoare triple {36404#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36400#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,480 INFO L290 TraceCheckUtils]: 52: Hoare triple {36408#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36404#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,481 INFO L290 TraceCheckUtils]: 51: Hoare triple {36412#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36408#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,482 INFO L290 TraceCheckUtils]: 50: Hoare triple {36416#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36412#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,482 INFO L290 TraceCheckUtils]: 49: Hoare triple {36420#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36416#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,483 INFO L290 TraceCheckUtils]: 48: Hoare triple {36424#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36420#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,483 INFO L290 TraceCheckUtils]: 47: Hoare triple {36428#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36424#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,484 INFO L290 TraceCheckUtils]: 46: Hoare triple {36432#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36428#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,484 INFO L290 TraceCheckUtils]: 45: Hoare triple {36436#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36432#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,485 INFO L290 TraceCheckUtils]: 44: Hoare triple {36440#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36436#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,485 INFO L290 TraceCheckUtils]: 43: Hoare triple {36444#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36440#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,486 INFO L290 TraceCheckUtils]: 42: Hoare triple {36448#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36444#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,487 INFO L290 TraceCheckUtils]: 41: Hoare triple {36452#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36448#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,487 INFO L290 TraceCheckUtils]: 40: Hoare triple {36456#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36452#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,488 INFO L290 TraceCheckUtils]: 39: Hoare triple {36460#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36456#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,488 INFO L290 TraceCheckUtils]: 38: Hoare triple {36464#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36460#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,489 INFO L290 TraceCheckUtils]: 37: Hoare triple {36468#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36464#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,489 INFO L290 TraceCheckUtils]: 36: Hoare triple {36472#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36468#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,490 INFO L290 TraceCheckUtils]: 35: Hoare triple {36476#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36472#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,491 INFO L290 TraceCheckUtils]: 34: Hoare triple {36480#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36476#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,491 INFO L290 TraceCheckUtils]: 33: Hoare triple {36484#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36480#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,492 INFO L290 TraceCheckUtils]: 32: Hoare triple {36488#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36484#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,492 INFO L290 TraceCheckUtils]: 31: Hoare triple {36492#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36488#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,493 INFO L290 TraceCheckUtils]: 30: Hoare triple {36496#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36492#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,493 INFO L290 TraceCheckUtils]: 29: Hoare triple {36500#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36496#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,494 INFO L290 TraceCheckUtils]: 28: Hoare triple {36504#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36500#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,495 INFO L290 TraceCheckUtils]: 27: Hoare triple {36508#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36504#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,495 INFO L290 TraceCheckUtils]: 26: Hoare triple {36512#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36508#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,496 INFO L290 TraceCheckUtils]: 25: Hoare triple {36516#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36512#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,496 INFO L290 TraceCheckUtils]: 24: Hoare triple {36520#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36516#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,497 INFO L290 TraceCheckUtils]: 23: Hoare triple {36524#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36520#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,497 INFO L290 TraceCheckUtils]: 22: Hoare triple {36528#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36524#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,498 INFO L290 TraceCheckUtils]: 21: Hoare triple {36532#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36528#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,499 INFO L290 TraceCheckUtils]: 20: Hoare triple {36536#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36532#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,499 INFO L290 TraceCheckUtils]: 19: Hoare triple {36540#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36536#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,500 INFO L290 TraceCheckUtils]: 18: Hoare triple {36544#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36540#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,500 INFO L290 TraceCheckUtils]: 17: Hoare triple {36548#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36544#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,501 INFO L290 TraceCheckUtils]: 16: Hoare triple {36552#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36548#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,501 INFO L290 TraceCheckUtils]: 15: Hoare triple {36556#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36552#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {36560#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36556#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,503 INFO L290 TraceCheckUtils]: 13: Hoare triple {36564#(< (mod (+ main_~x~0 102) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36560#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {36568#(< (mod (+ 104 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36564#(< (mod (+ main_~x~0 102) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,504 INFO L290 TraceCheckUtils]: 11: Hoare triple {36572#(< (mod (+ 106 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36568#(< (mod (+ 104 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,504 INFO L290 TraceCheckUtils]: 10: Hoare triple {36576#(< (mod (+ 108 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36572#(< (mod (+ 106 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {36580#(< (mod (+ 110 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36576#(< (mod (+ 108 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,505 INFO L290 TraceCheckUtils]: 8: Hoare triple {36584#(< (mod (+ 112 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36580#(< (mod (+ 110 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,506 INFO L290 TraceCheckUtils]: 7: Hoare triple {36588#(< (mod (+ main_~x~0 114) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36584#(< (mod (+ 112 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,507 INFO L290 TraceCheckUtils]: 6: Hoare triple {36592#(< (mod (+ 116 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {36588#(< (mod (+ main_~x~0 114) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,507 INFO L290 TraceCheckUtils]: 5: Hoare triple {36075#true} ~x~0 := 0; {36592#(< (mod (+ 116 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:28,507 INFO L272 TraceCheckUtils]: 4: Hoare triple {36075#true} call #t~ret4 := main(); {36075#true} is VALID [2022-04-28 03:07:28,507 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36075#true} {36075#true} #34#return; {36075#true} is VALID [2022-04-28 03:07:28,507 INFO L290 TraceCheckUtils]: 2: Hoare triple {36075#true} assume true; {36075#true} is VALID [2022-04-28 03:07:28,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {36075#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {36075#true} is VALID [2022-04-28 03:07:28,507 INFO L272 TraceCheckUtils]: 0: Hoare triple {36075#true} call ULTIMATE.init(); {36075#true} is VALID [2022-04-28 03:07:28,508 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:07:28,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121309022] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:07:28,508 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:07:28,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 61, 61] total 122 [2022-04-28 03:07:28,508 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:07:28,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [15629327] [2022-04-28 03:07:28,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [15629327] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:07:28,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:07:28,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2022-04-28 03:07:28,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178150404] [2022-04-28 03:07:28,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:07:28,509 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:07:28,509 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:07:28,509 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:07:28,542 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:28,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-04-28 03:07:28,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:07:28,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-04-28 03:07:28,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3840, Invalid=10922, Unknown=0, NotChecked=0, Total=14762 [2022-04-28 03:07:28,544 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:07:34,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:34,803 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2022-04-28 03:07:34,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-04-28 03:07:34,803 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:07:34,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:07:34,803 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:07:34,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2022-04-28 03:07:34,804 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:07:34,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2022-04-28 03:07:34,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 76 transitions. [2022-04-28 03:07:34,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:07:34,849 INFO L225 Difference]: With dead ends: 76 [2022-04-28 03:07:34,849 INFO L226 Difference]: Without dead ends: 71 [2022-04-28 03:07:34,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1833 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=7673, Invalid=24907, Unknown=0, NotChecked=0, Total=32580 [2022-04-28 03:07:34,851 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 3509 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 3628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 3509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:07:34,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 98 Invalid, 3628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 3509 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 03:07:34,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-28 03:07:34,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-04-28 03:07:34,921 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:07:34,921 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:07:34,921 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:07:34,922 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:07:34,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:34,922 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2022-04-28 03:07:34,922 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2022-04-28 03:07:34,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:07:34,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:07:34,922 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:07:34,923 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:07:34,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:34,923 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2022-04-28 03:07:34,923 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2022-04-28 03:07:34,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:07:34,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:07:34,923 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:07:34,923 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:07:34,924 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:07:34,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2022-04-28 03:07:34,924 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2022-04-28 03:07:34,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:07:34,924 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2022-04-28 03:07:34,924 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:07:34,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 71 transitions. [2022-04-28 03:07:34,975 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:34,976 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2022-04-28 03:07:34,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-28 03:07:34,976 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:07:34,976 INFO L195 NwaCegarLoop]: trace histogram [59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:07:34,980 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:07:35,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Forceful destruction successful, exit code 0 [2022-04-28 03:07:35,376 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:07:35,377 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:07:35,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:07:35,377 INFO L85 PathProgramCache]: Analyzing trace with hash -18267082, now seen corresponding path program 117 times [2022-04-28 03:07:35,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:07:35,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1122839913] [2022-04-28 03:07:35,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:07:35,575 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:07:35,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1560802167, now seen corresponding path program 1 times [2022-04-28 03:07:35,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:07:35,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16371931] [2022-04-28 03:07:35,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:07:35,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:07:35,581 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_59.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_59.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:07:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:07:35,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1668037399] [2022-04-28 03:07:35,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:07:35,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:07:35,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:07:35,584 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:07:35,585 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:07:35,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:07:35,630 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:07:35,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:07:35,638 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:07:35,638 INFO L85 PathProgramCache]: Analyzing trace with hash -18267082, now seen corresponding path program 118 times [2022-04-28 03:07:35,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:07:35,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807707304] [2022-04-28 03:07:35,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:07:35,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:07:35,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:37,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:07:37,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:37,227 INFO L290 TraceCheckUtils]: 0: Hoare triple {37232#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {37167#true} is VALID [2022-04-28 03:07:37,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {37167#true} assume true; {37167#true} is VALID [2022-04-28 03:07:37,227 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37167#true} {37167#true} #34#return; {37167#true} is VALID [2022-04-28 03:07:37,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {37167#true} call ULTIMATE.init(); {37232#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:07:37,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {37232#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {37167#true} is VALID [2022-04-28 03:07:37,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {37167#true} assume true; {37167#true} is VALID [2022-04-28 03:07:37,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37167#true} {37167#true} #34#return; {37167#true} is VALID [2022-04-28 03:07:37,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {37167#true} call #t~ret4 := main(); {37167#true} is VALID [2022-04-28 03:07:37,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {37167#true} ~x~0 := 0; {37172#(= main_~x~0 0)} is VALID [2022-04-28 03:07:37,228 INFO L290 TraceCheckUtils]: 6: Hoare triple {37172#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37173#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:07:37,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {37173#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37174#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:07:37,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {37174#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37175#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:07:37,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {37175#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37176#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:07:37,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {37176#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37177#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:07:37,231 INFO L290 TraceCheckUtils]: 11: Hoare triple {37177#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37178#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:07:37,231 INFO L290 TraceCheckUtils]: 12: Hoare triple {37178#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37179#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:07:37,232 INFO L290 TraceCheckUtils]: 13: Hoare triple {37179#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37180#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:07:37,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {37180#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37181#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:07:37,233 INFO L290 TraceCheckUtils]: 15: Hoare triple {37181#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37182#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:07:37,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {37182#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37183#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:07:37,234 INFO L290 TraceCheckUtils]: 17: Hoare triple {37183#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37184#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:07:37,234 INFO L290 TraceCheckUtils]: 18: Hoare triple {37184#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37185#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:07:37,234 INFO L290 TraceCheckUtils]: 19: Hoare triple {37185#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37186#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:07:37,235 INFO L290 TraceCheckUtils]: 20: Hoare triple {37186#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37187#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:07:37,235 INFO L290 TraceCheckUtils]: 21: Hoare triple {37187#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37188#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:07:37,236 INFO L290 TraceCheckUtils]: 22: Hoare triple {37188#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37189#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:07:37,236 INFO L290 TraceCheckUtils]: 23: Hoare triple {37189#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37190#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:07:37,237 INFO L290 TraceCheckUtils]: 24: Hoare triple {37190#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37191#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:07:37,237 INFO L290 TraceCheckUtils]: 25: Hoare triple {37191#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37192#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:07:37,238 INFO L290 TraceCheckUtils]: 26: Hoare triple {37192#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37193#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:07:37,238 INFO L290 TraceCheckUtils]: 27: Hoare triple {37193#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37194#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:07:37,239 INFO L290 TraceCheckUtils]: 28: Hoare triple {37194#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37195#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:07:37,239 INFO L290 TraceCheckUtils]: 29: Hoare triple {37195#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37196#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:07:37,240 INFO L290 TraceCheckUtils]: 30: Hoare triple {37196#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37197#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:07:37,240 INFO L290 TraceCheckUtils]: 31: Hoare triple {37197#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37198#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:07:37,240 INFO L290 TraceCheckUtils]: 32: Hoare triple {37198#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37199#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:07:37,241 INFO L290 TraceCheckUtils]: 33: Hoare triple {37199#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37200#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:07:37,241 INFO L290 TraceCheckUtils]: 34: Hoare triple {37200#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37201#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:07:37,242 INFO L290 TraceCheckUtils]: 35: Hoare triple {37201#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37202#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:07:37,242 INFO L290 TraceCheckUtils]: 36: Hoare triple {37202#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37203#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:07:37,243 INFO L290 TraceCheckUtils]: 37: Hoare triple {37203#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37204#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:07:37,243 INFO L290 TraceCheckUtils]: 38: Hoare triple {37204#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37205#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:07:37,244 INFO L290 TraceCheckUtils]: 39: Hoare triple {37205#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37206#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:07:37,244 INFO L290 TraceCheckUtils]: 40: Hoare triple {37206#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37207#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:07:37,244 INFO L290 TraceCheckUtils]: 41: Hoare triple {37207#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37208#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:07:37,245 INFO L290 TraceCheckUtils]: 42: Hoare triple {37208#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37209#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:07:37,245 INFO L290 TraceCheckUtils]: 43: Hoare triple {37209#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37210#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:07:37,246 INFO L290 TraceCheckUtils]: 44: Hoare triple {37210#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37211#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:07:37,246 INFO L290 TraceCheckUtils]: 45: Hoare triple {37211#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37212#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:07:37,247 INFO L290 TraceCheckUtils]: 46: Hoare triple {37212#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37213#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:07:37,247 INFO L290 TraceCheckUtils]: 47: Hoare triple {37213#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37214#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:07:37,248 INFO L290 TraceCheckUtils]: 48: Hoare triple {37214#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37215#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:07:37,248 INFO L290 TraceCheckUtils]: 49: Hoare triple {37215#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37216#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:07:37,249 INFO L290 TraceCheckUtils]: 50: Hoare triple {37216#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37217#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 03:07:37,249 INFO L290 TraceCheckUtils]: 51: Hoare triple {37217#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37218#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 03:07:37,250 INFO L290 TraceCheckUtils]: 52: Hoare triple {37218#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37219#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 03:07:37,250 INFO L290 TraceCheckUtils]: 53: Hoare triple {37219#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37220#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-28 03:07:37,250 INFO L290 TraceCheckUtils]: 54: Hoare triple {37220#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37221#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-28 03:07:37,251 INFO L290 TraceCheckUtils]: 55: Hoare triple {37221#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37222#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-28 03:07:37,251 INFO L290 TraceCheckUtils]: 56: Hoare triple {37222#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37223#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-28 03:07:37,252 INFO L290 TraceCheckUtils]: 57: Hoare triple {37223#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37224#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-28 03:07:37,252 INFO L290 TraceCheckUtils]: 58: Hoare triple {37224#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37225#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-28 03:07:37,253 INFO L290 TraceCheckUtils]: 59: Hoare triple {37225#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37226#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-28 03:07:37,253 INFO L290 TraceCheckUtils]: 60: Hoare triple {37226#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37227#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-28 03:07:37,254 INFO L290 TraceCheckUtils]: 61: Hoare triple {37227#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37228#(and (<= main_~x~0 112) (<= 112 main_~x~0))} is VALID [2022-04-28 03:07:37,254 INFO L290 TraceCheckUtils]: 62: Hoare triple {37228#(and (<= main_~x~0 112) (<= 112 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37229#(and (<= main_~x~0 114) (<= 114 main_~x~0))} is VALID [2022-04-28 03:07:37,254 INFO L290 TraceCheckUtils]: 63: Hoare triple {37229#(and (<= main_~x~0 114) (<= 114 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37230#(and (<= main_~x~0 116) (<= 116 main_~x~0))} is VALID [2022-04-28 03:07:37,255 INFO L290 TraceCheckUtils]: 64: Hoare triple {37230#(and (<= main_~x~0 116) (<= 116 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37231#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 118))} is VALID [2022-04-28 03:07:37,255 INFO L290 TraceCheckUtils]: 65: Hoare triple {37231#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 118))} assume !(~x~0 % 4294967296 < 268435455); {37168#false} is VALID [2022-04-28 03:07:37,255 INFO L272 TraceCheckUtils]: 66: Hoare triple {37168#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {37168#false} is VALID [2022-04-28 03:07:37,256 INFO L290 TraceCheckUtils]: 67: Hoare triple {37168#false} ~cond := #in~cond; {37168#false} is VALID [2022-04-28 03:07:37,256 INFO L290 TraceCheckUtils]: 68: Hoare triple {37168#false} assume 0 == ~cond; {37168#false} is VALID [2022-04-28 03:07:37,256 INFO L290 TraceCheckUtils]: 69: Hoare triple {37168#false} assume !false; {37168#false} is VALID [2022-04-28 03:07:37,256 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:07:37,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:07:37,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807707304] [2022-04-28 03:07:37,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807707304] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:07:37,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595933418] [2022-04-28 03:07:37,256 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:07:37,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:07:37,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:07:37,257 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:07:37,258 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:07:37,363 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:07:37,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:07:37,366 WARN L261 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 121 conjunts are in the unsatisfiable core [2022-04-28 03:07:37,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:37,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:07:38,016 INFO L272 TraceCheckUtils]: 0: Hoare triple {37167#true} call ULTIMATE.init(); {37167#true} is VALID [2022-04-28 03:07:38,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {37167#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {37167#true} is VALID [2022-04-28 03:07:38,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {37167#true} assume true; {37167#true} is VALID [2022-04-28 03:07:38,016 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37167#true} {37167#true} #34#return; {37167#true} is VALID [2022-04-28 03:07:38,016 INFO L272 TraceCheckUtils]: 4: Hoare triple {37167#true} call #t~ret4 := main(); {37167#true} is VALID [2022-04-28 03:07:38,016 INFO L290 TraceCheckUtils]: 5: Hoare triple {37167#true} ~x~0 := 0; {37172#(= main_~x~0 0)} is VALID [2022-04-28 03:07:38,017 INFO L290 TraceCheckUtils]: 6: Hoare triple {37172#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37173#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:07:38,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {37173#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37174#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:07:38,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {37174#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37175#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:07:38,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {37175#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37176#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:07:38,019 INFO L290 TraceCheckUtils]: 10: Hoare triple {37176#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37177#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:07:38,019 INFO L290 TraceCheckUtils]: 11: Hoare triple {37177#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37178#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:07:38,020 INFO L290 TraceCheckUtils]: 12: Hoare triple {37178#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37179#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:07:38,020 INFO L290 TraceCheckUtils]: 13: Hoare triple {37179#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37180#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:07:38,021 INFO L290 TraceCheckUtils]: 14: Hoare triple {37180#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37181#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:07:38,021 INFO L290 TraceCheckUtils]: 15: Hoare triple {37181#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37182#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:07:38,022 INFO L290 TraceCheckUtils]: 16: Hoare triple {37182#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37183#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:07:38,022 INFO L290 TraceCheckUtils]: 17: Hoare triple {37183#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37184#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:07:38,023 INFO L290 TraceCheckUtils]: 18: Hoare triple {37184#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37185#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:07:38,023 INFO L290 TraceCheckUtils]: 19: Hoare triple {37185#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37186#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:07:38,024 INFO L290 TraceCheckUtils]: 20: Hoare triple {37186#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37187#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:07:38,024 INFO L290 TraceCheckUtils]: 21: Hoare triple {37187#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37188#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:07:38,024 INFO L290 TraceCheckUtils]: 22: Hoare triple {37188#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37189#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:07:38,025 INFO L290 TraceCheckUtils]: 23: Hoare triple {37189#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37190#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:07:38,025 INFO L290 TraceCheckUtils]: 24: Hoare triple {37190#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37191#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:07:38,026 INFO L290 TraceCheckUtils]: 25: Hoare triple {37191#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37192#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:07:38,026 INFO L290 TraceCheckUtils]: 26: Hoare triple {37192#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37193#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:07:38,027 INFO L290 TraceCheckUtils]: 27: Hoare triple {37193#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37194#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:07:38,027 INFO L290 TraceCheckUtils]: 28: Hoare triple {37194#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37195#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:07:38,028 INFO L290 TraceCheckUtils]: 29: Hoare triple {37195#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37196#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:07:38,028 INFO L290 TraceCheckUtils]: 30: Hoare triple {37196#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37197#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:07:38,029 INFO L290 TraceCheckUtils]: 31: Hoare triple {37197#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37198#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:07:38,029 INFO L290 TraceCheckUtils]: 32: Hoare triple {37198#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37199#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:07:38,030 INFO L290 TraceCheckUtils]: 33: Hoare triple {37199#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37200#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:07:38,030 INFO L290 TraceCheckUtils]: 34: Hoare triple {37200#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37201#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:07:38,031 INFO L290 TraceCheckUtils]: 35: Hoare triple {37201#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37202#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:07:38,031 INFO L290 TraceCheckUtils]: 36: Hoare triple {37202#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37203#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:07:38,032 INFO L290 TraceCheckUtils]: 37: Hoare triple {37203#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37204#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:07:38,032 INFO L290 TraceCheckUtils]: 38: Hoare triple {37204#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37205#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:07:38,033 INFO L290 TraceCheckUtils]: 39: Hoare triple {37205#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37206#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:07:38,033 INFO L290 TraceCheckUtils]: 40: Hoare triple {37206#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37207#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:07:38,034 INFO L290 TraceCheckUtils]: 41: Hoare triple {37207#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37208#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:07:38,034 INFO L290 TraceCheckUtils]: 42: Hoare triple {37208#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37209#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:07:38,035 INFO L290 TraceCheckUtils]: 43: Hoare triple {37209#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37210#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:07:38,035 INFO L290 TraceCheckUtils]: 44: Hoare triple {37210#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37211#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:07:38,036 INFO L290 TraceCheckUtils]: 45: Hoare triple {37211#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37212#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:07:38,036 INFO L290 TraceCheckUtils]: 46: Hoare triple {37212#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37213#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:07:38,037 INFO L290 TraceCheckUtils]: 47: Hoare triple {37213#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37214#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:07:38,037 INFO L290 TraceCheckUtils]: 48: Hoare triple {37214#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37215#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:07:38,038 INFO L290 TraceCheckUtils]: 49: Hoare triple {37215#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37216#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:07:38,038 INFO L290 TraceCheckUtils]: 50: Hoare triple {37216#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37217#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 03:07:38,039 INFO L290 TraceCheckUtils]: 51: Hoare triple {37217#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37218#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 03:07:38,039 INFO L290 TraceCheckUtils]: 52: Hoare triple {37218#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37219#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 03:07:38,040 INFO L290 TraceCheckUtils]: 53: Hoare triple {37219#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37220#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-28 03:07:38,040 INFO L290 TraceCheckUtils]: 54: Hoare triple {37220#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37221#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-28 03:07:38,041 INFO L290 TraceCheckUtils]: 55: Hoare triple {37221#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37222#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-28 03:07:38,041 INFO L290 TraceCheckUtils]: 56: Hoare triple {37222#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37223#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-28 03:07:38,042 INFO L290 TraceCheckUtils]: 57: Hoare triple {37223#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37224#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-28 03:07:38,042 INFO L290 TraceCheckUtils]: 58: Hoare triple {37224#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37225#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-28 03:07:38,043 INFO L290 TraceCheckUtils]: 59: Hoare triple {37225#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37226#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-28 03:07:38,043 INFO L290 TraceCheckUtils]: 60: Hoare triple {37226#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37227#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-28 03:07:38,044 INFO L290 TraceCheckUtils]: 61: Hoare triple {37227#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37228#(and (<= main_~x~0 112) (<= 112 main_~x~0))} is VALID [2022-04-28 03:07:38,044 INFO L290 TraceCheckUtils]: 62: Hoare triple {37228#(and (<= main_~x~0 112) (<= 112 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37229#(and (<= main_~x~0 114) (<= 114 main_~x~0))} is VALID [2022-04-28 03:07:38,044 INFO L290 TraceCheckUtils]: 63: Hoare triple {37229#(and (<= main_~x~0 114) (<= 114 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37230#(and (<= main_~x~0 116) (<= 116 main_~x~0))} is VALID [2022-04-28 03:07:38,045 INFO L290 TraceCheckUtils]: 64: Hoare triple {37230#(and (<= main_~x~0 116) (<= 116 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37428#(and (<= 118 main_~x~0) (<= main_~x~0 118))} is VALID [2022-04-28 03:07:38,045 INFO L290 TraceCheckUtils]: 65: Hoare triple {37428#(and (<= 118 main_~x~0) (<= main_~x~0 118))} assume !(~x~0 % 4294967296 < 268435455); {37168#false} is VALID [2022-04-28 03:07:38,046 INFO L272 TraceCheckUtils]: 66: Hoare triple {37168#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {37168#false} is VALID [2022-04-28 03:07:38,046 INFO L290 TraceCheckUtils]: 67: Hoare triple {37168#false} ~cond := #in~cond; {37168#false} is VALID [2022-04-28 03:07:38,046 INFO L290 TraceCheckUtils]: 68: Hoare triple {37168#false} assume 0 == ~cond; {37168#false} is VALID [2022-04-28 03:07:38,046 INFO L290 TraceCheckUtils]: 69: Hoare triple {37168#false} assume !false; {37168#false} is VALID [2022-04-28 03:07:38,046 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:07:38,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:07:43,176 INFO L290 TraceCheckUtils]: 69: Hoare triple {37168#false} assume !false; {37168#false} is VALID [2022-04-28 03:07:43,177 INFO L290 TraceCheckUtils]: 68: Hoare triple {37168#false} assume 0 == ~cond; {37168#false} is VALID [2022-04-28 03:07:43,177 INFO L290 TraceCheckUtils]: 67: Hoare triple {37168#false} ~cond := #in~cond; {37168#false} is VALID [2022-04-28 03:07:43,177 INFO L272 TraceCheckUtils]: 66: Hoare triple {37168#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {37168#false} is VALID [2022-04-28 03:07:43,177 INFO L290 TraceCheckUtils]: 65: Hoare triple {37456#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {37168#false} is VALID [2022-04-28 03:07:43,179 INFO L290 TraceCheckUtils]: 64: Hoare triple {37460#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37456#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,179 INFO L290 TraceCheckUtils]: 63: Hoare triple {37464#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37460#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,180 INFO L290 TraceCheckUtils]: 62: Hoare triple {37468#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37464#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,181 INFO L290 TraceCheckUtils]: 61: Hoare triple {37472#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37468#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,181 INFO L290 TraceCheckUtils]: 60: Hoare triple {37476#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37472#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,182 INFO L290 TraceCheckUtils]: 59: Hoare triple {37480#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37476#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,183 INFO L290 TraceCheckUtils]: 58: Hoare triple {37484#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37480#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,183 INFO L290 TraceCheckUtils]: 57: Hoare triple {37488#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37484#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,184 INFO L290 TraceCheckUtils]: 56: Hoare triple {37492#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37488#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,184 INFO L290 TraceCheckUtils]: 55: Hoare triple {37496#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37492#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,185 INFO L290 TraceCheckUtils]: 54: Hoare triple {37500#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37496#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,186 INFO L290 TraceCheckUtils]: 53: Hoare triple {37504#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37500#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,186 INFO L290 TraceCheckUtils]: 52: Hoare triple {37508#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37504#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,187 INFO L290 TraceCheckUtils]: 51: Hoare triple {37512#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37508#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,189 INFO L290 TraceCheckUtils]: 50: Hoare triple {37516#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37512#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,190 INFO L290 TraceCheckUtils]: 49: Hoare triple {37520#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37516#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,191 INFO L290 TraceCheckUtils]: 48: Hoare triple {37524#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37520#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,191 INFO L290 TraceCheckUtils]: 47: Hoare triple {37528#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37524#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,192 INFO L290 TraceCheckUtils]: 46: Hoare triple {37532#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37528#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,194 INFO L290 TraceCheckUtils]: 45: Hoare triple {37536#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37532#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,194 INFO L290 TraceCheckUtils]: 44: Hoare triple {37540#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37536#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,195 INFO L290 TraceCheckUtils]: 43: Hoare triple {37544#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37540#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,196 INFO L290 TraceCheckUtils]: 42: Hoare triple {37548#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37544#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,196 INFO L290 TraceCheckUtils]: 41: Hoare triple {37552#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37548#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,197 INFO L290 TraceCheckUtils]: 40: Hoare triple {37556#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37552#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,197 INFO L290 TraceCheckUtils]: 39: Hoare triple {37560#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37556#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,198 INFO L290 TraceCheckUtils]: 38: Hoare triple {37564#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37560#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,199 INFO L290 TraceCheckUtils]: 37: Hoare triple {37568#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37564#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,199 INFO L290 TraceCheckUtils]: 36: Hoare triple {37572#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37568#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,200 INFO L290 TraceCheckUtils]: 35: Hoare triple {37576#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37572#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,200 INFO L290 TraceCheckUtils]: 34: Hoare triple {37580#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37576#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,201 INFO L290 TraceCheckUtils]: 33: Hoare triple {37584#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37580#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,202 INFO L290 TraceCheckUtils]: 32: Hoare triple {37588#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37584#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,202 INFO L290 TraceCheckUtils]: 31: Hoare triple {37592#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37588#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,203 INFO L290 TraceCheckUtils]: 30: Hoare triple {37596#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37592#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,203 INFO L290 TraceCheckUtils]: 29: Hoare triple {37600#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37596#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,204 INFO L290 TraceCheckUtils]: 28: Hoare triple {37604#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37600#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,204 INFO L290 TraceCheckUtils]: 27: Hoare triple {37608#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37604#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,205 INFO L290 TraceCheckUtils]: 26: Hoare triple {37612#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37608#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,206 INFO L290 TraceCheckUtils]: 25: Hoare triple {37616#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37612#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,206 INFO L290 TraceCheckUtils]: 24: Hoare triple {37620#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37616#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,207 INFO L290 TraceCheckUtils]: 23: Hoare triple {37624#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37620#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,208 INFO L290 TraceCheckUtils]: 22: Hoare triple {37628#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37624#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,208 INFO L290 TraceCheckUtils]: 21: Hoare triple {37632#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37628#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,209 INFO L290 TraceCheckUtils]: 20: Hoare triple {37636#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37632#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,209 INFO L290 TraceCheckUtils]: 19: Hoare triple {37640#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37636#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,210 INFO L290 TraceCheckUtils]: 18: Hoare triple {37644#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37640#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,210 INFO L290 TraceCheckUtils]: 17: Hoare triple {37648#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37644#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,211 INFO L290 TraceCheckUtils]: 16: Hoare triple {37652#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37648#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,212 INFO L290 TraceCheckUtils]: 15: Hoare triple {37656#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37652#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,212 INFO L290 TraceCheckUtils]: 14: Hoare triple {37660#(< (mod (+ main_~x~0 102) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37656#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,213 INFO L290 TraceCheckUtils]: 13: Hoare triple {37664#(< (mod (+ 104 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37660#(< (mod (+ main_~x~0 102) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,213 INFO L290 TraceCheckUtils]: 12: Hoare triple {37668#(< (mod (+ 106 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37664#(< (mod (+ 104 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,214 INFO L290 TraceCheckUtils]: 11: Hoare triple {37672#(< (mod (+ 108 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37668#(< (mod (+ 106 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,215 INFO L290 TraceCheckUtils]: 10: Hoare triple {37676#(< (mod (+ 110 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37672#(< (mod (+ 108 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,215 INFO L290 TraceCheckUtils]: 9: Hoare triple {37680#(< (mod (+ 112 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37676#(< (mod (+ 110 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,216 INFO L290 TraceCheckUtils]: 8: Hoare triple {37684#(< (mod (+ main_~x~0 114) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37680#(< (mod (+ 112 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {37688#(< (mod (+ 116 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37684#(< (mod (+ main_~x~0 114) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,217 INFO L290 TraceCheckUtils]: 6: Hoare triple {37692#(< (mod (+ main_~x~0 118) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {37688#(< (mod (+ 116 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {37167#true} ~x~0 := 0; {37692#(< (mod (+ main_~x~0 118) 4294967296) 268435455)} is VALID [2022-04-28 03:07:43,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {37167#true} call #t~ret4 := main(); {37167#true} is VALID [2022-04-28 03:07:43,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37167#true} {37167#true} #34#return; {37167#true} is VALID [2022-04-28 03:07:43,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {37167#true} assume true; {37167#true} is VALID [2022-04-28 03:07:43,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {37167#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {37167#true} is VALID [2022-04-28 03:07:43,218 INFO L272 TraceCheckUtils]: 0: Hoare triple {37167#true} call ULTIMATE.init(); {37167#true} is VALID [2022-04-28 03:07:43,218 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:07:43,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595933418] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:07:43,218 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:07:43,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 62, 62] total 124 [2022-04-28 03:07:43,219 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:07:43,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1122839913] [2022-04-28 03:07:43,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1122839913] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:07:43,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:07:43,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2022-04-28 03:07:43,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794174413] [2022-04-28 03:07:43,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:07:43,219 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:07:43,219 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:07:43,219 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:07:43,254 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:43,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-04-28 03:07:43,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:07:43,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-04-28 03:07:43,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3965, Invalid=11287, Unknown=0, NotChecked=0, Total=15252 [2022-04-28 03:07:43,255 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:07:49,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:49,977 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2022-04-28 03:07:49,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-04-28 03:07:49,977 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:07:49,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:07:49,977 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:07:49,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2022-04-28 03:07:49,978 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:07:49,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2022-04-28 03:07:49,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 77 transitions. [2022-04-28 03:07:50,027 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:07:50,028 INFO L225 Difference]: With dead ends: 77 [2022-04-28 03:07:50,028 INFO L226 Difference]: Without dead ends: 72 [2022-04-28 03:07:50,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1894 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=7923, Invalid=25749, Unknown=0, NotChecked=0, Total=33672 [2022-04-28 03:07:50,030 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 3747 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 3868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 3747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:07:50,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 218 Invalid, 3868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 3747 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-28 03:07:50,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-28 03:07:50,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-04-28 03:07:50,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:07:50,100 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:07:50,100 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:07:50,100 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:07:50,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:50,101 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2022-04-28 03:07:50,101 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2022-04-28 03:07:50,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:07:50,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:07:50,101 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:07:50,101 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:07:50,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:07:50,102 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2022-04-28 03:07:50,102 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2022-04-28 03:07:50,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:07:50,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:07:50,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:07:50,102 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:07:50,102 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:07:50,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2022-04-28 03:07:50,103 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2022-04-28 03:07:50,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:07:50,103 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2022-04-28 03:07:50,103 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:07:50,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 72 states and 72 transitions. [2022-04-28 03:07:50,162 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:07:50,163 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2022-04-28 03:07:50,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-28 03:07:50,163 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:07:50,163 INFO L195 NwaCegarLoop]: trace histogram [60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:07:50,179 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:07:50,366 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:07:50,563 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:07:50,564 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:07:50,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:07:50,564 INFO L85 PathProgramCache]: Analyzing trace with hash -529818276, now seen corresponding path program 119 times [2022-04-28 03:07:50,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:07:50,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [200941045] [2022-04-28 03:07:52,632 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:07:52,687 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 03:07:52,696 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:07:52,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1619907511, now seen corresponding path program 1 times [2022-04-28 03:07:52,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:07:52,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469714631] [2022-04-28 03:07:52,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:07:52,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:07:52,701 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_60.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_60.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:07:52,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:07:52,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [501824671] [2022-04-28 03:07:52,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:07:52,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:07:52,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:07:52,705 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:07:52,706 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:07:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:07:52,754 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:07:52,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:07:52,764 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:07:52,764 INFO L85 PathProgramCache]: Analyzing trace with hash -529818276, now seen corresponding path program 120 times [2022-04-28 03:07:52,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:07:52,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215354742] [2022-04-28 03:07:52,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:07:52,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:07:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:54,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:07:54,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:07:54,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {38341#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {38275#true} is VALID [2022-04-28 03:07:54,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {38275#true} assume true; {38275#true} is VALID [2022-04-28 03:07:54,411 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38275#true} {38275#true} #34#return; {38275#true} is VALID [2022-04-28 03:07:54,411 INFO L272 TraceCheckUtils]: 0: Hoare triple {38275#true} call ULTIMATE.init(); {38341#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:07:54,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {38341#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {38275#true} is VALID [2022-04-28 03:07:54,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {38275#true} assume true; {38275#true} is VALID [2022-04-28 03:07:54,412 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38275#true} {38275#true} #34#return; {38275#true} is VALID [2022-04-28 03:07:54,412 INFO L272 TraceCheckUtils]: 4: Hoare triple {38275#true} call #t~ret4 := main(); {38275#true} is VALID [2022-04-28 03:07:54,412 INFO L290 TraceCheckUtils]: 5: Hoare triple {38275#true} ~x~0 := 0; {38280#(= main_~x~0 0)} is VALID [2022-04-28 03:07:54,412 INFO L290 TraceCheckUtils]: 6: Hoare triple {38280#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38281#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:07:54,413 INFO L290 TraceCheckUtils]: 7: Hoare triple {38281#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38282#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:07:54,413 INFO L290 TraceCheckUtils]: 8: Hoare triple {38282#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38283#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:07:54,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {38283#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38284#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:07:54,414 INFO L290 TraceCheckUtils]: 10: Hoare triple {38284#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38285#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:07:54,415 INFO L290 TraceCheckUtils]: 11: Hoare triple {38285#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38286#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:07:54,415 INFO L290 TraceCheckUtils]: 12: Hoare triple {38286#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38287#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:07:54,416 INFO L290 TraceCheckUtils]: 13: Hoare triple {38287#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38288#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:07:54,416 INFO L290 TraceCheckUtils]: 14: Hoare triple {38288#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38289#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:07:54,417 INFO L290 TraceCheckUtils]: 15: Hoare triple {38289#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38290#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:07:54,417 INFO L290 TraceCheckUtils]: 16: Hoare triple {38290#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38291#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:07:54,417 INFO L290 TraceCheckUtils]: 17: Hoare triple {38291#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38292#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:07:54,418 INFO L290 TraceCheckUtils]: 18: Hoare triple {38292#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38293#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:07:54,418 INFO L290 TraceCheckUtils]: 19: Hoare triple {38293#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38294#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:07:54,419 INFO L290 TraceCheckUtils]: 20: Hoare triple {38294#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38295#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:07:54,419 INFO L290 TraceCheckUtils]: 21: Hoare triple {38295#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38296#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:07:54,420 INFO L290 TraceCheckUtils]: 22: Hoare triple {38296#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38297#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:07:54,420 INFO L290 TraceCheckUtils]: 23: Hoare triple {38297#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38298#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:07:54,421 INFO L290 TraceCheckUtils]: 24: Hoare triple {38298#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38299#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:07:54,421 INFO L290 TraceCheckUtils]: 25: Hoare triple {38299#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38300#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:07:54,422 INFO L290 TraceCheckUtils]: 26: Hoare triple {38300#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38301#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:07:54,422 INFO L290 TraceCheckUtils]: 27: Hoare triple {38301#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38302#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:07:54,423 INFO L290 TraceCheckUtils]: 28: Hoare triple {38302#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38303#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:07:54,423 INFO L290 TraceCheckUtils]: 29: Hoare triple {38303#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38304#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:07:54,423 INFO L290 TraceCheckUtils]: 30: Hoare triple {38304#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38305#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:07:54,424 INFO L290 TraceCheckUtils]: 31: Hoare triple {38305#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38306#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:07:54,424 INFO L290 TraceCheckUtils]: 32: Hoare triple {38306#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38307#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:07:54,425 INFO L290 TraceCheckUtils]: 33: Hoare triple {38307#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38308#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:07:54,425 INFO L290 TraceCheckUtils]: 34: Hoare triple {38308#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38309#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:07:54,426 INFO L290 TraceCheckUtils]: 35: Hoare triple {38309#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38310#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:07:54,426 INFO L290 TraceCheckUtils]: 36: Hoare triple {38310#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38311#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:07:54,427 INFO L290 TraceCheckUtils]: 37: Hoare triple {38311#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38312#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:07:54,427 INFO L290 TraceCheckUtils]: 38: Hoare triple {38312#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38313#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:07:54,428 INFO L290 TraceCheckUtils]: 39: Hoare triple {38313#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38314#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:07:54,428 INFO L290 TraceCheckUtils]: 40: Hoare triple {38314#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38315#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:07:54,428 INFO L290 TraceCheckUtils]: 41: Hoare triple {38315#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38316#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:07:54,429 INFO L290 TraceCheckUtils]: 42: Hoare triple {38316#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38317#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:07:54,429 INFO L290 TraceCheckUtils]: 43: Hoare triple {38317#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38318#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:07:54,430 INFO L290 TraceCheckUtils]: 44: Hoare triple {38318#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38319#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:07:54,430 INFO L290 TraceCheckUtils]: 45: Hoare triple {38319#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38320#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:07:54,431 INFO L290 TraceCheckUtils]: 46: Hoare triple {38320#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38321#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:07:54,431 INFO L290 TraceCheckUtils]: 47: Hoare triple {38321#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38322#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:07:54,432 INFO L290 TraceCheckUtils]: 48: Hoare triple {38322#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38323#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:07:54,432 INFO L290 TraceCheckUtils]: 49: Hoare triple {38323#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38324#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:07:54,433 INFO L290 TraceCheckUtils]: 50: Hoare triple {38324#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38325#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 03:07:54,433 INFO L290 TraceCheckUtils]: 51: Hoare triple {38325#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38326#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 03:07:54,434 INFO L290 TraceCheckUtils]: 52: Hoare triple {38326#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38327#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 03:07:54,434 INFO L290 TraceCheckUtils]: 53: Hoare triple {38327#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38328#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-28 03:07:54,434 INFO L290 TraceCheckUtils]: 54: Hoare triple {38328#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38329#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-28 03:07:54,435 INFO L290 TraceCheckUtils]: 55: Hoare triple {38329#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38330#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-28 03:07:54,435 INFO L290 TraceCheckUtils]: 56: Hoare triple {38330#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38331#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-28 03:07:54,436 INFO L290 TraceCheckUtils]: 57: Hoare triple {38331#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38332#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-28 03:07:54,436 INFO L290 TraceCheckUtils]: 58: Hoare triple {38332#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38333#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-28 03:07:54,437 INFO L290 TraceCheckUtils]: 59: Hoare triple {38333#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38334#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-28 03:07:54,437 INFO L290 TraceCheckUtils]: 60: Hoare triple {38334#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38335#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-28 03:07:54,438 INFO L290 TraceCheckUtils]: 61: Hoare triple {38335#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38336#(and (<= main_~x~0 112) (<= 112 main_~x~0))} is VALID [2022-04-28 03:07:54,438 INFO L290 TraceCheckUtils]: 62: Hoare triple {38336#(and (<= main_~x~0 112) (<= 112 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38337#(and (<= main_~x~0 114) (<= 114 main_~x~0))} is VALID [2022-04-28 03:07:54,439 INFO L290 TraceCheckUtils]: 63: Hoare triple {38337#(and (<= main_~x~0 114) (<= 114 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38338#(and (<= main_~x~0 116) (<= 116 main_~x~0))} is VALID [2022-04-28 03:07:54,439 INFO L290 TraceCheckUtils]: 64: Hoare triple {38338#(and (<= main_~x~0 116) (<= 116 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38339#(and (<= 118 main_~x~0) (<= main_~x~0 118))} is VALID [2022-04-28 03:07:54,440 INFO L290 TraceCheckUtils]: 65: Hoare triple {38339#(and (<= 118 main_~x~0) (<= main_~x~0 118))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38340#(and (<= main_~x~0 120) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:07:54,440 INFO L290 TraceCheckUtils]: 66: Hoare triple {38340#(and (<= main_~x~0 120) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {38276#false} is VALID [2022-04-28 03:07:54,440 INFO L272 TraceCheckUtils]: 67: Hoare triple {38276#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {38276#false} is VALID [2022-04-28 03:07:54,440 INFO L290 TraceCheckUtils]: 68: Hoare triple {38276#false} ~cond := #in~cond; {38276#false} is VALID [2022-04-28 03:07:54,440 INFO L290 TraceCheckUtils]: 69: Hoare triple {38276#false} assume 0 == ~cond; {38276#false} is VALID [2022-04-28 03:07:54,440 INFO L290 TraceCheckUtils]: 70: Hoare triple {38276#false} assume !false; {38276#false} is VALID [2022-04-28 03:07:54,441 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:07:54,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:07:54,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215354742] [2022-04-28 03:07:54,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215354742] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:07:54,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519058134] [2022-04-28 03:07:54,441 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:07:54,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:07:54,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:07:54,442 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:07:54,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Waiting until timeout for monitored process [2022-04-28 03:08:24,356 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2022-04-28 03:08:24,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:08:24,389 WARN L261 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 129 conjunts are in the unsatisfiable core [2022-04-28 03:08:24,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:24,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:08:24,953 INFO L272 TraceCheckUtils]: 0: Hoare triple {38275#true} call ULTIMATE.init(); {38275#true} is VALID [2022-04-28 03:08:24,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {38275#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {38275#true} is VALID [2022-04-28 03:08:24,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {38275#true} assume true; {38275#true} is VALID [2022-04-28 03:08:24,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38275#true} {38275#true} #34#return; {38275#true} is VALID [2022-04-28 03:08:24,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {38275#true} call #t~ret4 := main(); {38275#true} is VALID [2022-04-28 03:08:24,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {38275#true} ~x~0 := 0; {38280#(= main_~x~0 0)} is VALID [2022-04-28 03:08:24,954 INFO L290 TraceCheckUtils]: 6: Hoare triple {38280#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38281#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:08:24,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {38281#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38282#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:08:24,955 INFO L290 TraceCheckUtils]: 8: Hoare triple {38282#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38283#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:08:24,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {38283#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38284#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:08:24,956 INFO L290 TraceCheckUtils]: 10: Hoare triple {38284#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38285#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:08:24,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {38285#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38286#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:08:24,957 INFO L290 TraceCheckUtils]: 12: Hoare triple {38286#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38287#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:08:24,957 INFO L290 TraceCheckUtils]: 13: Hoare triple {38287#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38288#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:08:24,958 INFO L290 TraceCheckUtils]: 14: Hoare triple {38288#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38289#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:08:24,958 INFO L290 TraceCheckUtils]: 15: Hoare triple {38289#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38290#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:08:24,959 INFO L290 TraceCheckUtils]: 16: Hoare triple {38290#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38291#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:08:24,959 INFO L290 TraceCheckUtils]: 17: Hoare triple {38291#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38292#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:08:24,959 INFO L290 TraceCheckUtils]: 18: Hoare triple {38292#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38293#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:08:24,960 INFO L290 TraceCheckUtils]: 19: Hoare triple {38293#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38294#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:08:24,960 INFO L290 TraceCheckUtils]: 20: Hoare triple {38294#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38295#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:08:24,961 INFO L290 TraceCheckUtils]: 21: Hoare triple {38295#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38296#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:08:24,961 INFO L290 TraceCheckUtils]: 22: Hoare triple {38296#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38297#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:08:24,962 INFO L290 TraceCheckUtils]: 23: Hoare triple {38297#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38298#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:08:24,962 INFO L290 TraceCheckUtils]: 24: Hoare triple {38298#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38299#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:08:24,963 INFO L290 TraceCheckUtils]: 25: Hoare triple {38299#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38300#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:08:24,963 INFO L290 TraceCheckUtils]: 26: Hoare triple {38300#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38301#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:08:24,963 INFO L290 TraceCheckUtils]: 27: Hoare triple {38301#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38302#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:08:24,964 INFO L290 TraceCheckUtils]: 28: Hoare triple {38302#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38303#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:08:24,964 INFO L290 TraceCheckUtils]: 29: Hoare triple {38303#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38304#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:08:24,965 INFO L290 TraceCheckUtils]: 30: Hoare triple {38304#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38305#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:08:24,965 INFO L290 TraceCheckUtils]: 31: Hoare triple {38305#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38306#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:08:24,966 INFO L290 TraceCheckUtils]: 32: Hoare triple {38306#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38307#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:08:24,966 INFO L290 TraceCheckUtils]: 33: Hoare triple {38307#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38308#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:08:24,967 INFO L290 TraceCheckUtils]: 34: Hoare triple {38308#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38309#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:08:24,967 INFO L290 TraceCheckUtils]: 35: Hoare triple {38309#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38310#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:08:24,968 INFO L290 TraceCheckUtils]: 36: Hoare triple {38310#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38311#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:08:24,968 INFO L290 TraceCheckUtils]: 37: Hoare triple {38311#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38312#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:08:24,969 INFO L290 TraceCheckUtils]: 38: Hoare triple {38312#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38313#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:08:24,969 INFO L290 TraceCheckUtils]: 39: Hoare triple {38313#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38314#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:08:24,969 INFO L290 TraceCheckUtils]: 40: Hoare triple {38314#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38315#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:08:24,970 INFO L290 TraceCheckUtils]: 41: Hoare triple {38315#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38316#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:08:24,970 INFO L290 TraceCheckUtils]: 42: Hoare triple {38316#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38317#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:08:24,971 INFO L290 TraceCheckUtils]: 43: Hoare triple {38317#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38318#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:08:24,971 INFO L290 TraceCheckUtils]: 44: Hoare triple {38318#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38319#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:08:24,972 INFO L290 TraceCheckUtils]: 45: Hoare triple {38319#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38320#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:08:24,972 INFO L290 TraceCheckUtils]: 46: Hoare triple {38320#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38321#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:08:24,973 INFO L290 TraceCheckUtils]: 47: Hoare triple {38321#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38322#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:08:24,973 INFO L290 TraceCheckUtils]: 48: Hoare triple {38322#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38323#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:08:24,974 INFO L290 TraceCheckUtils]: 49: Hoare triple {38323#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38324#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:08:24,974 INFO L290 TraceCheckUtils]: 50: Hoare triple {38324#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38325#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 03:08:24,974 INFO L290 TraceCheckUtils]: 51: Hoare triple {38325#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38326#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 03:08:24,975 INFO L290 TraceCheckUtils]: 52: Hoare triple {38326#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38327#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 03:08:24,975 INFO L290 TraceCheckUtils]: 53: Hoare triple {38327#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38328#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-28 03:08:24,976 INFO L290 TraceCheckUtils]: 54: Hoare triple {38328#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38329#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-28 03:08:24,976 INFO L290 TraceCheckUtils]: 55: Hoare triple {38329#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38330#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-28 03:08:24,977 INFO L290 TraceCheckUtils]: 56: Hoare triple {38330#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38331#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-28 03:08:24,977 INFO L290 TraceCheckUtils]: 57: Hoare triple {38331#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38332#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-28 03:08:24,978 INFO L290 TraceCheckUtils]: 58: Hoare triple {38332#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38333#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-28 03:08:24,978 INFO L290 TraceCheckUtils]: 59: Hoare triple {38333#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38334#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-28 03:08:24,979 INFO L290 TraceCheckUtils]: 60: Hoare triple {38334#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38335#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-28 03:08:24,979 INFO L290 TraceCheckUtils]: 61: Hoare triple {38335#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38336#(and (<= main_~x~0 112) (<= 112 main_~x~0))} is VALID [2022-04-28 03:08:24,980 INFO L290 TraceCheckUtils]: 62: Hoare triple {38336#(and (<= main_~x~0 112) (<= 112 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38337#(and (<= main_~x~0 114) (<= 114 main_~x~0))} is VALID [2022-04-28 03:08:24,980 INFO L290 TraceCheckUtils]: 63: Hoare triple {38337#(and (<= main_~x~0 114) (<= 114 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38338#(and (<= main_~x~0 116) (<= 116 main_~x~0))} is VALID [2022-04-28 03:08:24,980 INFO L290 TraceCheckUtils]: 64: Hoare triple {38338#(and (<= main_~x~0 116) (<= 116 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38339#(and (<= 118 main_~x~0) (<= main_~x~0 118))} is VALID [2022-04-28 03:08:24,981 INFO L290 TraceCheckUtils]: 65: Hoare triple {38339#(and (<= 118 main_~x~0) (<= main_~x~0 118))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38540#(and (<= main_~x~0 120) (<= 120 main_~x~0))} is VALID [2022-04-28 03:08:24,981 INFO L290 TraceCheckUtils]: 66: Hoare triple {38540#(and (<= main_~x~0 120) (<= 120 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {38276#false} is VALID [2022-04-28 03:08:24,981 INFO L272 TraceCheckUtils]: 67: Hoare triple {38276#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {38276#false} is VALID [2022-04-28 03:08:24,982 INFO L290 TraceCheckUtils]: 68: Hoare triple {38276#false} ~cond := #in~cond; {38276#false} is VALID [2022-04-28 03:08:24,982 INFO L290 TraceCheckUtils]: 69: Hoare triple {38276#false} assume 0 == ~cond; {38276#false} is VALID [2022-04-28 03:08:24,982 INFO L290 TraceCheckUtils]: 70: Hoare triple {38276#false} assume !false; {38276#false} is VALID [2022-04-28 03:08:24,982 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:08:24,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:08:32,060 INFO L290 TraceCheckUtils]: 70: Hoare triple {38276#false} assume !false; {38276#false} is VALID [2022-04-28 03:08:32,060 INFO L290 TraceCheckUtils]: 69: Hoare triple {38559#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {38276#false} is VALID [2022-04-28 03:08:32,060 INFO L290 TraceCheckUtils]: 68: Hoare triple {38563#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {38559#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:08:32,061 INFO L272 TraceCheckUtils]: 67: Hoare triple {38567#(not (= (mod main_~x~0 2) 0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {38563#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:08:32,061 INFO L290 TraceCheckUtils]: 66: Hoare triple {38571#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !(~x~0 % 4294967296 < 268435455); {38567#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 03:08:32,062 INFO L290 TraceCheckUtils]: 65: Hoare triple {38575#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38571#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:08:32,065 INFO L290 TraceCheckUtils]: 64: Hoare triple {38579#(or (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38575#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:08:32,065 INFO L290 TraceCheckUtils]: 63: Hoare triple {38583#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38579#(or (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:08:32,066 INFO L290 TraceCheckUtils]: 62: Hoare triple {38587#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38583#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} is VALID [2022-04-28 03:08:32,069 INFO L290 TraceCheckUtils]: 61: Hoare triple {38591#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38587#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} is VALID [2022-04-28 03:08:32,070 INFO L290 TraceCheckUtils]: 60: Hoare triple {38595#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38591#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} is VALID [2022-04-28 03:08:32,071 INFO L290 TraceCheckUtils]: 59: Hoare triple {38599#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38595#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} is VALID [2022-04-28 03:08:32,072 INFO L290 TraceCheckUtils]: 58: Hoare triple {38603#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38599#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:08:32,074 INFO L290 TraceCheckUtils]: 57: Hoare triple {38607#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38603#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:08:32,074 INFO L290 TraceCheckUtils]: 56: Hoare triple {38611#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38607#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:08:32,075 INFO L290 TraceCheckUtils]: 55: Hoare triple {38615#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38611#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} is VALID [2022-04-28 03:08:32,078 INFO L290 TraceCheckUtils]: 54: Hoare triple {38619#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38615#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} is VALID [2022-04-28 03:08:32,079 INFO L290 TraceCheckUtils]: 53: Hoare triple {38623#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38619#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} is VALID [2022-04-28 03:08:32,089 INFO L290 TraceCheckUtils]: 52: Hoare triple {38627#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38623#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} is VALID [2022-04-28 03:08:32,090 INFO L290 TraceCheckUtils]: 51: Hoare triple {38631#(or (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38627#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:08:32,091 INFO L290 TraceCheckUtils]: 50: Hoare triple {38635#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38631#(or (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:08:32,091 INFO L290 TraceCheckUtils]: 49: Hoare triple {38639#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38635#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:08:32,092 INFO L290 TraceCheckUtils]: 48: Hoare triple {38643#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38639#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:08:32,093 INFO L290 TraceCheckUtils]: 47: Hoare triple {38647#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38643#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} is VALID [2022-04-28 03:08:32,096 INFO L290 TraceCheckUtils]: 46: Hoare triple {38651#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38647#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:08:32,096 INFO L290 TraceCheckUtils]: 45: Hoare triple {38655#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38651#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:08:32,097 INFO L290 TraceCheckUtils]: 44: Hoare triple {38659#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38655#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:08:32,124 INFO L290 TraceCheckUtils]: 43: Hoare triple {38663#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38659#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:08:32,125 INFO L290 TraceCheckUtils]: 42: Hoare triple {38667#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38663#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} is VALID [2022-04-28 03:08:32,126 INFO L290 TraceCheckUtils]: 41: Hoare triple {38671#(or (< (mod (+ main_~x~0 50) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38667#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} is VALID [2022-04-28 03:08:32,127 INFO L290 TraceCheckUtils]: 40: Hoare triple {38675#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38671#(or (< (mod (+ main_~x~0 50) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:08:32,129 INFO L290 TraceCheckUtils]: 39: Hoare triple {38679#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38675#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} is VALID [2022-04-28 03:08:32,130 INFO L290 TraceCheckUtils]: 38: Hoare triple {38683#(or (< (mod (+ 56 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38679#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} is VALID [2022-04-28 03:08:32,131 INFO L290 TraceCheckUtils]: 37: Hoare triple {38687#(or (< (mod (+ main_~x~0 58) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38683#(or (< (mod (+ 56 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:08:32,131 INFO L290 TraceCheckUtils]: 36: Hoare triple {38691#(or (< (mod (+ main_~x~0 60) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38687#(or (< (mod (+ main_~x~0 58) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:08:32,132 INFO L290 TraceCheckUtils]: 35: Hoare triple {38695#(or (< (mod (+ main_~x~0 62) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38691#(or (< (mod (+ main_~x~0 60) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:08:32,133 INFO L290 TraceCheckUtils]: 34: Hoare triple {38699#(or (< (mod (+ 64 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38695#(or (< (mod (+ main_~x~0 62) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:08:32,138 INFO L290 TraceCheckUtils]: 33: Hoare triple {38703#(or (< (mod (+ 66 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38699#(or (< (mod (+ 64 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:08:32,142 INFO L290 TraceCheckUtils]: 32: Hoare triple {38707#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 68 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38703#(or (< (mod (+ 66 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:08:32,143 INFO L290 TraceCheckUtils]: 31: Hoare triple {38711#(or (< (mod (+ main_~x~0 70) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38707#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 68 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:08:32,143 INFO L290 TraceCheckUtils]: 30: Hoare triple {38715#(or (< (mod (+ 72 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38711#(or (< (mod (+ main_~x~0 70) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:08:32,144 INFO L290 TraceCheckUtils]: 29: Hoare triple {38719#(or (< (mod (+ main_~x~0 74) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38715#(or (< (mod (+ 72 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:08:32,145 INFO L290 TraceCheckUtils]: 28: Hoare triple {38723#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 76 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38719#(or (< (mod (+ main_~x~0 74) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:08:32,145 INFO L290 TraceCheckUtils]: 27: Hoare triple {38727#(or (< (mod (+ main_~x~0 78) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38723#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 76 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:08:32,157 INFO L290 TraceCheckUtils]: 26: Hoare triple {38731#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 80) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38727#(or (< (mod (+ main_~x~0 78) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:08:32,158 INFO L290 TraceCheckUtils]: 25: Hoare triple {38735#(or (< (mod (+ main_~x~0 82) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38731#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 80) 4294967296) 268435455))} is VALID [2022-04-28 03:08:32,199 INFO L290 TraceCheckUtils]: 24: Hoare triple {38739#(or (< (mod (+ 84 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38735#(or (< (mod (+ main_~x~0 82) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:08:32,200 INFO L290 TraceCheckUtils]: 23: Hoare triple {38743#(or (< (mod (+ main_~x~0 86) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38739#(or (< (mod (+ 84 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:08:32,201 INFO L290 TraceCheckUtils]: 22: Hoare triple {38747#(or (< (mod (+ 88 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38743#(or (< (mod (+ main_~x~0 86) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:08:32,202 INFO L290 TraceCheckUtils]: 21: Hoare triple {38751#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 90) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38747#(or (< (mod (+ 88 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:08:32,203 INFO L290 TraceCheckUtils]: 20: Hoare triple {38755#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 92 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38751#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 90) 4294967296) 268435455))} is VALID [2022-04-28 03:08:32,230 INFO L290 TraceCheckUtils]: 19: Hoare triple {38759#(or (< (mod (+ 94 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38755#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 92 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:08:32,231 INFO L290 TraceCheckUtils]: 18: Hoare triple {38763#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 96) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38759#(or (< (mod (+ 94 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:08:32,231 INFO L290 TraceCheckUtils]: 17: Hoare triple {38767#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 98 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38763#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 96) 4294967296) 268435455))} is VALID [2022-04-28 03:08:32,237 INFO L290 TraceCheckUtils]: 16: Hoare triple {38771#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 100) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38767#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 98 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:08:32,255 INFO L290 TraceCheckUtils]: 15: Hoare triple {38775#(or (< (mod (+ main_~x~0 102) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38771#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 100) 4294967296) 268435455))} is VALID [2022-04-28 03:08:32,256 INFO L290 TraceCheckUtils]: 14: Hoare triple {38779#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 104 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38775#(or (< (mod (+ main_~x~0 102) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:08:32,260 INFO L290 TraceCheckUtils]: 13: Hoare triple {38783#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 106 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38779#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 104 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:08:32,263 INFO L290 TraceCheckUtils]: 12: Hoare triple {38787#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 108 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38783#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 106 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:08:32,264 INFO L290 TraceCheckUtils]: 11: Hoare triple {38791#(or (< (mod (+ 110 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38787#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 108 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:08:32,265 INFO L290 TraceCheckUtils]: 10: Hoare triple {38795#(or (< (mod (+ 112 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38791#(or (< (mod (+ 110 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:08:32,265 INFO L290 TraceCheckUtils]: 9: Hoare triple {38799#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 114) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38795#(or (< (mod (+ 112 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:08:32,269 INFO L290 TraceCheckUtils]: 8: Hoare triple {38803#(or (< (mod (+ 116 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38799#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 114) 4294967296) 268435455))} is VALID [2022-04-28 03:08:32,270 INFO L290 TraceCheckUtils]: 7: Hoare triple {38807#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 118) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38803#(or (< (mod (+ 116 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:08:32,272 INFO L290 TraceCheckUtils]: 6: Hoare triple {38811#(or (< (mod (+ main_~x~0 120) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {38807#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 118) 4294967296) 268435455))} is VALID [2022-04-28 03:08:32,272 INFO L290 TraceCheckUtils]: 5: Hoare triple {38275#true} ~x~0 := 0; {38811#(or (< (mod (+ main_~x~0 120) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:08:32,272 INFO L272 TraceCheckUtils]: 4: Hoare triple {38275#true} call #t~ret4 := main(); {38275#true} is VALID [2022-04-28 03:08:32,272 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38275#true} {38275#true} #34#return; {38275#true} is VALID [2022-04-28 03:08:32,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {38275#true} assume true; {38275#true} is VALID [2022-04-28 03:08:32,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {38275#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {38275#true} is VALID [2022-04-28 03:08:32,272 INFO L272 TraceCheckUtils]: 0: Hoare triple {38275#true} call ULTIMATE.init(); {38275#true} is VALID [2022-04-28 03:08:32,273 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:08:32,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519058134] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:08:32,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:08:32,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 63, 66] total 129 [2022-04-28 03:08:32,273 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:08:32,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [200941045] [2022-04-28 03:08:32,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [200941045] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:08:32,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:08:32,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2022-04-28 03:08:32,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782416470] [2022-04-28 03:08:32,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:08:32,274 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.046875) internal successors, (67), 63 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2022-04-28 03:08:32,274 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:08:32,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 64 states, 64 states have (on average 1.046875) internal successors, (67), 63 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:32,309 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:08:32,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-04-28 03:08:32,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:08:32,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-04-28 03:08:32,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4159, Invalid=12353, Unknown=0, NotChecked=0, Total=16512 [2022-04-28 03:08:32,311 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand has 64 states, 64 states have (on average 1.046875) internal successors, (67), 63 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:39,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:39,457 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2022-04-28 03:08:39,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-04-28 03:08:39,458 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.046875) internal successors, (67), 63 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 71 [2022-04-28 03:08:39,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:08:39,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.046875) internal successors, (67), 63 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:39,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 78 transitions. [2022-04-28 03:08:39,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 1.046875) internal successors, (67), 63 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:39,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 78 transitions. [2022-04-28 03:08:39,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 78 transitions. [2022-04-28 03:08:39,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:08:39,505 INFO L225 Difference]: With dead ends: 78 [2022-04-28 03:08:39,505 INFO L226 Difference]: Without dead ends: 73 [2022-04-28 03:08:39,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1962 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=8244, Invalid=27666, Unknown=0, NotChecked=0, Total=35910 [2022-04-28 03:08:39,507 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 3962 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 4085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 3962 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:08:39,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 313 Invalid, 4085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 3962 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-04-28 03:08:39,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-28 03:08:39,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-04-28 03:08:39,596 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:08:39,596 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 73 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:39,596 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 73 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:39,596 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 73 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:39,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:39,597 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2022-04-28 03:08:39,597 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2022-04-28 03:08:39,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:08:39,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:08:39,597 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 73 states. [2022-04-28 03:08:39,597 INFO L87 Difference]: Start difference. First operand has 73 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 73 states. [2022-04-28 03:08:39,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:39,598 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2022-04-28 03:08:39,598 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2022-04-28 03:08:39,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:08:39,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:08:39,598 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:08:39,598 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:08:39,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.0147058823529411) internal successors, (69), 68 states have internal predecessors, (69), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:39,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2022-04-28 03:08:39,599 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2022-04-28 03:08:39,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:08:39,599 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2022-04-28 03:08:39,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 1.046875) internal successors, (67), 63 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:39,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 73 transitions. [2022-04-28 03:08:39,649 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:39,650 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2022-04-28 03:08:39,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-28 03:08:39,650 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:08:39,650 INFO L195 NwaCegarLoop]: trace histogram [61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:08:39,655 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Forceful destruction successful, exit code 0 [2022-04-28 03:08:39,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Ended with exit code 0 [2022-04-28 03:08:40,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120,120 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable121,121 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:08:40,051 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:08:40,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:08:40,051 INFO L85 PathProgramCache]: Analyzing trace with hash 791963894, now seen corresponding path program 121 times [2022-04-28 03:08:40,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:08:40,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [242246203] [2022-04-28 03:08:40,238 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:40,239 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:08:40,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1679012855, now seen corresponding path program 1 times [2022-04-28 03:08:40,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:08:40,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033381699] [2022-04-28 03:08:40,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:08:40,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:08:40,245 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_61.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_61.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:08:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:08:40,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [477221679] [2022-04-28 03:08:40,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:08:40,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:08:40,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:08:40,248 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:08:40,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Waiting until timeout for monitored process [2022-04-28 03:08:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:08:40,299 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:08:40,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:08:40,308 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:08:40,308 INFO L85 PathProgramCache]: Analyzing trace with hash 791963894, now seen corresponding path program 122 times [2022-04-28 03:08:40,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:08:40,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678343679] [2022-04-28 03:08:40,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:08:40,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:08:40,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:42,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:08:42,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:42,035 INFO L290 TraceCheckUtils]: 0: Hoare triple {39469#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {39402#true} is VALID [2022-04-28 03:08:42,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {39402#true} assume true; {39402#true} is VALID [2022-04-28 03:08:42,035 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39402#true} {39402#true} #34#return; {39402#true} is VALID [2022-04-28 03:08:42,036 INFO L272 TraceCheckUtils]: 0: Hoare triple {39402#true} call ULTIMATE.init(); {39469#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:08:42,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {39469#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {39402#true} is VALID [2022-04-28 03:08:42,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {39402#true} assume true; {39402#true} is VALID [2022-04-28 03:08:42,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39402#true} {39402#true} #34#return; {39402#true} is VALID [2022-04-28 03:08:42,036 INFO L272 TraceCheckUtils]: 4: Hoare triple {39402#true} call #t~ret4 := main(); {39402#true} is VALID [2022-04-28 03:08:42,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {39402#true} ~x~0 := 0; {39407#(= main_~x~0 0)} is VALID [2022-04-28 03:08:42,036 INFO L290 TraceCheckUtils]: 6: Hoare triple {39407#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39408#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:08:42,037 INFO L290 TraceCheckUtils]: 7: Hoare triple {39408#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39409#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:08:42,037 INFO L290 TraceCheckUtils]: 8: Hoare triple {39409#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39410#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:08:42,038 INFO L290 TraceCheckUtils]: 9: Hoare triple {39410#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39411#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:08:42,038 INFO L290 TraceCheckUtils]: 10: Hoare triple {39411#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39412#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:08:42,039 INFO L290 TraceCheckUtils]: 11: Hoare triple {39412#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39413#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:08:42,039 INFO L290 TraceCheckUtils]: 12: Hoare triple {39413#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39414#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:08:42,040 INFO L290 TraceCheckUtils]: 13: Hoare triple {39414#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39415#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:08:42,040 INFO L290 TraceCheckUtils]: 14: Hoare triple {39415#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39416#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:08:42,041 INFO L290 TraceCheckUtils]: 15: Hoare triple {39416#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39417#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:08:42,041 INFO L290 TraceCheckUtils]: 16: Hoare triple {39417#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39418#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:08:42,042 INFO L290 TraceCheckUtils]: 17: Hoare triple {39418#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39419#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:08:42,042 INFO L290 TraceCheckUtils]: 18: Hoare triple {39419#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39420#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:08:42,043 INFO L290 TraceCheckUtils]: 19: Hoare triple {39420#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39421#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:08:42,043 INFO L290 TraceCheckUtils]: 20: Hoare triple {39421#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39422#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:08:42,044 INFO L290 TraceCheckUtils]: 21: Hoare triple {39422#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39423#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:08:42,044 INFO L290 TraceCheckUtils]: 22: Hoare triple {39423#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39424#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:08:42,044 INFO L290 TraceCheckUtils]: 23: Hoare triple {39424#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39425#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:08:42,045 INFO L290 TraceCheckUtils]: 24: Hoare triple {39425#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39426#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:08:42,045 INFO L290 TraceCheckUtils]: 25: Hoare triple {39426#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39427#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:08:42,046 INFO L290 TraceCheckUtils]: 26: Hoare triple {39427#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39428#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:08:42,046 INFO L290 TraceCheckUtils]: 27: Hoare triple {39428#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39429#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:08:42,047 INFO L290 TraceCheckUtils]: 28: Hoare triple {39429#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39430#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:08:42,047 INFO L290 TraceCheckUtils]: 29: Hoare triple {39430#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39431#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:08:42,048 INFO L290 TraceCheckUtils]: 30: Hoare triple {39431#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39432#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:08:42,048 INFO L290 TraceCheckUtils]: 31: Hoare triple {39432#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39433#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:08:42,049 INFO L290 TraceCheckUtils]: 32: Hoare triple {39433#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39434#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:08:42,049 INFO L290 TraceCheckUtils]: 33: Hoare triple {39434#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39435#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:08:42,050 INFO L290 TraceCheckUtils]: 34: Hoare triple {39435#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39436#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:08:42,050 INFO L290 TraceCheckUtils]: 35: Hoare triple {39436#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39437#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:08:42,051 INFO L290 TraceCheckUtils]: 36: Hoare triple {39437#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39438#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:08:42,051 INFO L290 TraceCheckUtils]: 37: Hoare triple {39438#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39439#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:08:42,051 INFO L290 TraceCheckUtils]: 38: Hoare triple {39439#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39440#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:08:42,052 INFO L290 TraceCheckUtils]: 39: Hoare triple {39440#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39441#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:08:42,052 INFO L290 TraceCheckUtils]: 40: Hoare triple {39441#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39442#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:08:42,053 INFO L290 TraceCheckUtils]: 41: Hoare triple {39442#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39443#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:08:42,053 INFO L290 TraceCheckUtils]: 42: Hoare triple {39443#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39444#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:08:42,054 INFO L290 TraceCheckUtils]: 43: Hoare triple {39444#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39445#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:08:42,054 INFO L290 TraceCheckUtils]: 44: Hoare triple {39445#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39446#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:08:42,055 INFO L290 TraceCheckUtils]: 45: Hoare triple {39446#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39447#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:08:42,055 INFO L290 TraceCheckUtils]: 46: Hoare triple {39447#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39448#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:08:42,056 INFO L290 TraceCheckUtils]: 47: Hoare triple {39448#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39449#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:08:42,056 INFO L290 TraceCheckUtils]: 48: Hoare triple {39449#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39450#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:08:42,057 INFO L290 TraceCheckUtils]: 49: Hoare triple {39450#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39451#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:08:42,057 INFO L290 TraceCheckUtils]: 50: Hoare triple {39451#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39452#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 03:08:42,058 INFO L290 TraceCheckUtils]: 51: Hoare triple {39452#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39453#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 03:08:42,058 INFO L290 TraceCheckUtils]: 52: Hoare triple {39453#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39454#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 03:08:42,058 INFO L290 TraceCheckUtils]: 53: Hoare triple {39454#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39455#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-28 03:08:42,059 INFO L290 TraceCheckUtils]: 54: Hoare triple {39455#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39456#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-28 03:08:42,059 INFO L290 TraceCheckUtils]: 55: Hoare triple {39456#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39457#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-28 03:08:42,060 INFO L290 TraceCheckUtils]: 56: Hoare triple {39457#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39458#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-28 03:08:42,060 INFO L290 TraceCheckUtils]: 57: Hoare triple {39458#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39459#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-28 03:08:42,061 INFO L290 TraceCheckUtils]: 58: Hoare triple {39459#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39460#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-28 03:08:42,061 INFO L290 TraceCheckUtils]: 59: Hoare triple {39460#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39461#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-28 03:08:42,062 INFO L290 TraceCheckUtils]: 60: Hoare triple {39461#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39462#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-28 03:08:42,062 INFO L290 TraceCheckUtils]: 61: Hoare triple {39462#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39463#(and (<= main_~x~0 112) (<= 112 main_~x~0))} is VALID [2022-04-28 03:08:42,063 INFO L290 TraceCheckUtils]: 62: Hoare triple {39463#(and (<= main_~x~0 112) (<= 112 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39464#(and (<= main_~x~0 114) (<= 114 main_~x~0))} is VALID [2022-04-28 03:08:42,063 INFO L290 TraceCheckUtils]: 63: Hoare triple {39464#(and (<= main_~x~0 114) (<= 114 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39465#(and (<= main_~x~0 116) (<= 116 main_~x~0))} is VALID [2022-04-28 03:08:42,064 INFO L290 TraceCheckUtils]: 64: Hoare triple {39465#(and (<= main_~x~0 116) (<= 116 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39466#(and (<= 118 main_~x~0) (<= main_~x~0 118))} is VALID [2022-04-28 03:08:42,064 INFO L290 TraceCheckUtils]: 65: Hoare triple {39466#(and (<= 118 main_~x~0) (<= main_~x~0 118))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39467#(and (<= main_~x~0 120) (<= 120 main_~x~0))} is VALID [2022-04-28 03:08:42,065 INFO L290 TraceCheckUtils]: 66: Hoare triple {39467#(and (<= main_~x~0 120) (<= 120 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39468#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 122))} is VALID [2022-04-28 03:08:42,065 INFO L290 TraceCheckUtils]: 67: Hoare triple {39468#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 122))} assume !(~x~0 % 4294967296 < 268435455); {39403#false} is VALID [2022-04-28 03:08:42,065 INFO L272 TraceCheckUtils]: 68: Hoare triple {39403#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {39403#false} is VALID [2022-04-28 03:08:42,065 INFO L290 TraceCheckUtils]: 69: Hoare triple {39403#false} ~cond := #in~cond; {39403#false} is VALID [2022-04-28 03:08:42,065 INFO L290 TraceCheckUtils]: 70: Hoare triple {39403#false} assume 0 == ~cond; {39403#false} is VALID [2022-04-28 03:08:42,065 INFO L290 TraceCheckUtils]: 71: Hoare triple {39403#false} assume !false; {39403#false} is VALID [2022-04-28 03:08:42,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:08:42,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:08:42,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678343679] [2022-04-28 03:08:42,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678343679] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:08:42,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835222409] [2022-04-28 03:08:42,066 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:08:42,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:08:42,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:08:42,067 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:08:42,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Waiting until timeout for monitored process [2022-04-28 03:08:42,138 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:08:42,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:08:42,140 WARN L261 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 125 conjunts are in the unsatisfiable core [2022-04-28 03:08:42,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:42,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:08:42,831 INFO L272 TraceCheckUtils]: 0: Hoare triple {39402#true} call ULTIMATE.init(); {39402#true} is VALID [2022-04-28 03:08:42,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {39402#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {39402#true} is VALID [2022-04-28 03:08:42,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {39402#true} assume true; {39402#true} is VALID [2022-04-28 03:08:42,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39402#true} {39402#true} #34#return; {39402#true} is VALID [2022-04-28 03:08:42,832 INFO L272 TraceCheckUtils]: 4: Hoare triple {39402#true} call #t~ret4 := main(); {39402#true} is VALID [2022-04-28 03:08:42,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {39402#true} ~x~0 := 0; {39407#(= main_~x~0 0)} is VALID [2022-04-28 03:08:42,833 INFO L290 TraceCheckUtils]: 6: Hoare triple {39407#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39408#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:08:42,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {39408#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39409#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:08:42,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {39409#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39410#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:08:42,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {39410#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39411#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:08:42,835 INFO L290 TraceCheckUtils]: 10: Hoare triple {39411#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39412#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:08:42,835 INFO L290 TraceCheckUtils]: 11: Hoare triple {39412#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39413#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:08:42,836 INFO L290 TraceCheckUtils]: 12: Hoare triple {39413#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39414#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:08:42,836 INFO L290 TraceCheckUtils]: 13: Hoare triple {39414#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39415#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:08:42,836 INFO L290 TraceCheckUtils]: 14: Hoare triple {39415#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39416#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:08:42,837 INFO L290 TraceCheckUtils]: 15: Hoare triple {39416#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39417#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:08:42,837 INFO L290 TraceCheckUtils]: 16: Hoare triple {39417#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39418#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:08:42,838 INFO L290 TraceCheckUtils]: 17: Hoare triple {39418#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39419#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:08:42,838 INFO L290 TraceCheckUtils]: 18: Hoare triple {39419#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39420#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:08:42,839 INFO L290 TraceCheckUtils]: 19: Hoare triple {39420#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39421#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:08:42,839 INFO L290 TraceCheckUtils]: 20: Hoare triple {39421#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39422#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:08:42,840 INFO L290 TraceCheckUtils]: 21: Hoare triple {39422#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39423#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:08:42,840 INFO L290 TraceCheckUtils]: 22: Hoare triple {39423#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39424#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:08:42,841 INFO L290 TraceCheckUtils]: 23: Hoare triple {39424#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39425#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:08:42,841 INFO L290 TraceCheckUtils]: 24: Hoare triple {39425#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39426#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:08:42,842 INFO L290 TraceCheckUtils]: 25: Hoare triple {39426#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39427#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:08:42,842 INFO L290 TraceCheckUtils]: 26: Hoare triple {39427#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39428#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:08:42,843 INFO L290 TraceCheckUtils]: 27: Hoare triple {39428#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39429#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:08:42,843 INFO L290 TraceCheckUtils]: 28: Hoare triple {39429#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39430#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:08:42,843 INFO L290 TraceCheckUtils]: 29: Hoare triple {39430#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39431#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:08:42,844 INFO L290 TraceCheckUtils]: 30: Hoare triple {39431#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39432#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:08:42,844 INFO L290 TraceCheckUtils]: 31: Hoare triple {39432#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39433#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:08:42,845 INFO L290 TraceCheckUtils]: 32: Hoare triple {39433#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39434#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:08:42,845 INFO L290 TraceCheckUtils]: 33: Hoare triple {39434#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39435#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:08:42,846 INFO L290 TraceCheckUtils]: 34: Hoare triple {39435#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39436#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:08:42,846 INFO L290 TraceCheckUtils]: 35: Hoare triple {39436#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39437#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:08:42,847 INFO L290 TraceCheckUtils]: 36: Hoare triple {39437#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39438#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:08:42,847 INFO L290 TraceCheckUtils]: 37: Hoare triple {39438#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39439#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:08:42,848 INFO L290 TraceCheckUtils]: 38: Hoare triple {39439#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39440#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:08:42,848 INFO L290 TraceCheckUtils]: 39: Hoare triple {39440#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39441#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:08:42,849 INFO L290 TraceCheckUtils]: 40: Hoare triple {39441#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39442#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:08:42,849 INFO L290 TraceCheckUtils]: 41: Hoare triple {39442#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39443#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:08:42,849 INFO L290 TraceCheckUtils]: 42: Hoare triple {39443#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39444#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:08:42,850 INFO L290 TraceCheckUtils]: 43: Hoare triple {39444#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39445#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:08:42,850 INFO L290 TraceCheckUtils]: 44: Hoare triple {39445#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39446#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:08:42,851 INFO L290 TraceCheckUtils]: 45: Hoare triple {39446#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39447#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:08:42,851 INFO L290 TraceCheckUtils]: 46: Hoare triple {39447#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39448#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:08:42,852 INFO L290 TraceCheckUtils]: 47: Hoare triple {39448#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39449#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:08:42,852 INFO L290 TraceCheckUtils]: 48: Hoare triple {39449#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39450#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:08:42,853 INFO L290 TraceCheckUtils]: 49: Hoare triple {39450#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39451#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:08:42,853 INFO L290 TraceCheckUtils]: 50: Hoare triple {39451#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39452#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 03:08:42,854 INFO L290 TraceCheckUtils]: 51: Hoare triple {39452#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39453#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 03:08:42,854 INFO L290 TraceCheckUtils]: 52: Hoare triple {39453#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39454#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 03:08:42,855 INFO L290 TraceCheckUtils]: 53: Hoare triple {39454#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39455#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-28 03:08:42,855 INFO L290 TraceCheckUtils]: 54: Hoare triple {39455#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39456#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-28 03:08:42,856 INFO L290 TraceCheckUtils]: 55: Hoare triple {39456#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39457#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-28 03:08:42,856 INFO L290 TraceCheckUtils]: 56: Hoare triple {39457#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39458#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-28 03:08:42,857 INFO L290 TraceCheckUtils]: 57: Hoare triple {39458#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39459#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-28 03:08:42,857 INFO L290 TraceCheckUtils]: 58: Hoare triple {39459#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39460#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-28 03:08:42,857 INFO L290 TraceCheckUtils]: 59: Hoare triple {39460#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39461#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-28 03:08:42,858 INFO L290 TraceCheckUtils]: 60: Hoare triple {39461#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39462#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-28 03:08:42,858 INFO L290 TraceCheckUtils]: 61: Hoare triple {39462#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39463#(and (<= main_~x~0 112) (<= 112 main_~x~0))} is VALID [2022-04-28 03:08:42,859 INFO L290 TraceCheckUtils]: 62: Hoare triple {39463#(and (<= main_~x~0 112) (<= 112 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39464#(and (<= main_~x~0 114) (<= 114 main_~x~0))} is VALID [2022-04-28 03:08:42,859 INFO L290 TraceCheckUtils]: 63: Hoare triple {39464#(and (<= main_~x~0 114) (<= 114 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39465#(and (<= main_~x~0 116) (<= 116 main_~x~0))} is VALID [2022-04-28 03:08:42,860 INFO L290 TraceCheckUtils]: 64: Hoare triple {39465#(and (<= main_~x~0 116) (<= 116 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39466#(and (<= 118 main_~x~0) (<= main_~x~0 118))} is VALID [2022-04-28 03:08:42,860 INFO L290 TraceCheckUtils]: 65: Hoare triple {39466#(and (<= 118 main_~x~0) (<= main_~x~0 118))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39467#(and (<= main_~x~0 120) (<= 120 main_~x~0))} is VALID [2022-04-28 03:08:42,861 INFO L290 TraceCheckUtils]: 66: Hoare triple {39467#(and (<= main_~x~0 120) (<= 120 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39671#(and (<= 122 main_~x~0) (<= main_~x~0 122))} is VALID [2022-04-28 03:08:42,861 INFO L290 TraceCheckUtils]: 67: Hoare triple {39671#(and (<= 122 main_~x~0) (<= main_~x~0 122))} assume !(~x~0 % 4294967296 < 268435455); {39403#false} is VALID [2022-04-28 03:08:42,861 INFO L272 TraceCheckUtils]: 68: Hoare triple {39403#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {39403#false} is VALID [2022-04-28 03:08:42,861 INFO L290 TraceCheckUtils]: 69: Hoare triple {39403#false} ~cond := #in~cond; {39403#false} is VALID [2022-04-28 03:08:42,861 INFO L290 TraceCheckUtils]: 70: Hoare triple {39403#false} assume 0 == ~cond; {39403#false} is VALID [2022-04-28 03:08:42,861 INFO L290 TraceCheckUtils]: 71: Hoare triple {39403#false} assume !false; {39403#false} is VALID [2022-04-28 03:08:42,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:08:42,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:08:48,432 INFO L290 TraceCheckUtils]: 71: Hoare triple {39403#false} assume !false; {39403#false} is VALID [2022-04-28 03:08:48,432 INFO L290 TraceCheckUtils]: 70: Hoare triple {39403#false} assume 0 == ~cond; {39403#false} is VALID [2022-04-28 03:08:48,432 INFO L290 TraceCheckUtils]: 69: Hoare triple {39403#false} ~cond := #in~cond; {39403#false} is VALID [2022-04-28 03:08:48,432 INFO L272 TraceCheckUtils]: 68: Hoare triple {39403#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {39403#false} is VALID [2022-04-28 03:08:48,432 INFO L290 TraceCheckUtils]: 67: Hoare triple {39699#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {39403#false} is VALID [2022-04-28 03:08:48,434 INFO L290 TraceCheckUtils]: 66: Hoare triple {39703#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39699#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,435 INFO L290 TraceCheckUtils]: 65: Hoare triple {39707#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39703#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,436 INFO L290 TraceCheckUtils]: 64: Hoare triple {39711#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39707#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,436 INFO L290 TraceCheckUtils]: 63: Hoare triple {39715#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39711#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,437 INFO L290 TraceCheckUtils]: 62: Hoare triple {39719#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39715#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,437 INFO L290 TraceCheckUtils]: 61: Hoare triple {39723#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39719#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,438 INFO L290 TraceCheckUtils]: 60: Hoare triple {39727#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39723#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,439 INFO L290 TraceCheckUtils]: 59: Hoare triple {39731#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39727#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,439 INFO L290 TraceCheckUtils]: 58: Hoare triple {39735#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39731#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,440 INFO L290 TraceCheckUtils]: 57: Hoare triple {39739#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39735#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,440 INFO L290 TraceCheckUtils]: 56: Hoare triple {39743#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39739#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,441 INFO L290 TraceCheckUtils]: 55: Hoare triple {39747#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39743#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,442 INFO L290 TraceCheckUtils]: 54: Hoare triple {39751#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39747#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,445 INFO L290 TraceCheckUtils]: 53: Hoare triple {39755#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39751#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,446 INFO L290 TraceCheckUtils]: 52: Hoare triple {39759#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39755#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,447 INFO L290 TraceCheckUtils]: 51: Hoare triple {39763#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39759#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,447 INFO L290 TraceCheckUtils]: 50: Hoare triple {39767#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39763#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,448 INFO L290 TraceCheckUtils]: 49: Hoare triple {39771#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39767#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,449 INFO L290 TraceCheckUtils]: 48: Hoare triple {39775#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39771#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,449 INFO L290 TraceCheckUtils]: 47: Hoare triple {39779#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39775#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,450 INFO L290 TraceCheckUtils]: 46: Hoare triple {39783#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39779#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,450 INFO L290 TraceCheckUtils]: 45: Hoare triple {39787#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39783#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,451 INFO L290 TraceCheckUtils]: 44: Hoare triple {39791#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39787#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,451 INFO L290 TraceCheckUtils]: 43: Hoare triple {39795#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39791#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,452 INFO L290 TraceCheckUtils]: 42: Hoare triple {39799#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39795#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,453 INFO L290 TraceCheckUtils]: 41: Hoare triple {39803#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39799#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,453 INFO L290 TraceCheckUtils]: 40: Hoare triple {39807#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39803#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,454 INFO L290 TraceCheckUtils]: 39: Hoare triple {39811#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39807#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,454 INFO L290 TraceCheckUtils]: 38: Hoare triple {39815#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39811#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,455 INFO L290 TraceCheckUtils]: 37: Hoare triple {39819#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39815#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,456 INFO L290 TraceCheckUtils]: 36: Hoare triple {39823#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39819#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,456 INFO L290 TraceCheckUtils]: 35: Hoare triple {39827#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39823#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,457 INFO L290 TraceCheckUtils]: 34: Hoare triple {39831#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39827#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,457 INFO L290 TraceCheckUtils]: 33: Hoare triple {39835#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39831#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,458 INFO L290 TraceCheckUtils]: 32: Hoare triple {39839#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39835#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,458 INFO L290 TraceCheckUtils]: 31: Hoare triple {39843#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39839#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,459 INFO L290 TraceCheckUtils]: 30: Hoare triple {39847#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39843#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,460 INFO L290 TraceCheckUtils]: 29: Hoare triple {39851#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39847#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,460 INFO L290 TraceCheckUtils]: 28: Hoare triple {39855#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39851#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,461 INFO L290 TraceCheckUtils]: 27: Hoare triple {39859#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39855#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,461 INFO L290 TraceCheckUtils]: 26: Hoare triple {39863#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39859#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,462 INFO L290 TraceCheckUtils]: 25: Hoare triple {39867#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39863#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,462 INFO L290 TraceCheckUtils]: 24: Hoare triple {39871#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39867#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,463 INFO L290 TraceCheckUtils]: 23: Hoare triple {39875#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39871#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,464 INFO L290 TraceCheckUtils]: 22: Hoare triple {39879#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39875#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,464 INFO L290 TraceCheckUtils]: 21: Hoare triple {39883#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39879#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,465 INFO L290 TraceCheckUtils]: 20: Hoare triple {39887#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39883#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,465 INFO L290 TraceCheckUtils]: 19: Hoare triple {39891#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39887#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,466 INFO L290 TraceCheckUtils]: 18: Hoare triple {39895#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39891#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,467 INFO L290 TraceCheckUtils]: 17: Hoare triple {39899#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39895#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,467 INFO L290 TraceCheckUtils]: 16: Hoare triple {39903#(< (mod (+ main_~x~0 102) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39899#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,468 INFO L290 TraceCheckUtils]: 15: Hoare triple {39907#(< (mod (+ 104 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39903#(< (mod (+ main_~x~0 102) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,468 INFO L290 TraceCheckUtils]: 14: Hoare triple {39911#(< (mod (+ 106 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39907#(< (mod (+ 104 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,469 INFO L290 TraceCheckUtils]: 13: Hoare triple {39915#(< (mod (+ 108 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39911#(< (mod (+ 106 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,469 INFO L290 TraceCheckUtils]: 12: Hoare triple {39919#(< (mod (+ 110 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39915#(< (mod (+ 108 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,470 INFO L290 TraceCheckUtils]: 11: Hoare triple {39923#(< (mod (+ 112 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39919#(< (mod (+ 110 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,471 INFO L290 TraceCheckUtils]: 10: Hoare triple {39927#(< (mod (+ main_~x~0 114) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39923#(< (mod (+ 112 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,471 INFO L290 TraceCheckUtils]: 9: Hoare triple {39931#(< (mod (+ 116 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39927#(< (mod (+ main_~x~0 114) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {39935#(< (mod (+ main_~x~0 118) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39931#(< (mod (+ 116 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {39939#(< (mod (+ main_~x~0 120) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39935#(< (mod (+ main_~x~0 118) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,473 INFO L290 TraceCheckUtils]: 6: Hoare triple {39943#(< (mod (+ main_~x~0 122) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {39939#(< (mod (+ main_~x~0 120) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,474 INFO L290 TraceCheckUtils]: 5: Hoare triple {39402#true} ~x~0 := 0; {39943#(< (mod (+ main_~x~0 122) 4294967296) 268435455)} is VALID [2022-04-28 03:08:48,474 INFO L272 TraceCheckUtils]: 4: Hoare triple {39402#true} call #t~ret4 := main(); {39402#true} is VALID [2022-04-28 03:08:48,474 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39402#true} {39402#true} #34#return; {39402#true} is VALID [2022-04-28 03:08:48,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {39402#true} assume true; {39402#true} is VALID [2022-04-28 03:08:48,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {39402#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {39402#true} is VALID [2022-04-28 03:08:48,474 INFO L272 TraceCheckUtils]: 0: Hoare triple {39402#true} call ULTIMATE.init(); {39402#true} is VALID [2022-04-28 03:08:48,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:08:48,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835222409] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:08:48,475 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:08:48,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 64, 64] total 128 [2022-04-28 03:08:48,475 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:08:48,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [242246203] [2022-04-28 03:08:48,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [242246203] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:08:48,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:08:48,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2022-04-28 03:08:48,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526999079] [2022-04-28 03:08:48,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:08:48,476 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 72 [2022-04-28 03:08:48,476 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:08:48,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 65 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:48,511 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:48,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-04-28 03:08:48,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:08:48,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-04-28 03:08:48,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4221, Invalid=12035, Unknown=0, NotChecked=0, Total=16256 [2022-04-28 03:08:48,513 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand has 65 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:55,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:55,686 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2022-04-28 03:08:55,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-04-28 03:08:55,686 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 72 [2022-04-28 03:08:55,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:08:55,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:55,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2022-04-28 03:08:55,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:55,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2022-04-28 03:08:55,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 79 transitions. [2022-04-28 03:08:55,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:08:55,735 INFO L225 Difference]: With dead ends: 79 [2022-04-28 03:08:55,735 INFO L226 Difference]: Without dead ends: 74 [2022-04-28 03:08:55,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2019 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=8435, Invalid=27475, Unknown=0, NotChecked=0, Total=35910 [2022-04-28 03:08:55,737 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 4024 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 4149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 4024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:08:55,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 253 Invalid, 4149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 4024 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-04-28 03:08:55,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-28 03:08:55,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-04-28 03:08:55,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:08:55,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 74 states, 69 states have (on average 1.0144927536231885) internal successors, (70), 69 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:55,843 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 74 states, 69 states have (on average 1.0144927536231885) internal successors, (70), 69 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:55,844 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 74 states, 69 states have (on average 1.0144927536231885) internal successors, (70), 69 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:55,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:55,844 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2022-04-28 03:08:55,844 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2022-04-28 03:08:55,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:08:55,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:08:55,845 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 69 states have (on average 1.0144927536231885) internal successors, (70), 69 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states. [2022-04-28 03:08:55,845 INFO L87 Difference]: Start difference. First operand has 74 states, 69 states have (on average 1.0144927536231885) internal successors, (70), 69 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 74 states. [2022-04-28 03:08:55,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:08:55,845 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2022-04-28 03:08:55,845 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2022-04-28 03:08:55,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:08:55,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:08:55,845 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:08:55,846 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:08:55,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.0144927536231885) internal successors, (70), 69 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:55,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2022-04-28 03:08:55,846 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2022-04-28 03:08:55,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:08:55,846 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2022-04-28 03:08:55,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:08:55,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 74 transitions. [2022-04-28 03:08:55,906 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:55,906 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2022-04-28 03:08:55,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-28 03:08:55,907 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:08:55,907 INFO L195 NwaCegarLoop]: trace histogram [62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:08:55,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Forceful destruction successful, exit code 0 [2022-04-28 03:08:56,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Ended with exit code 0 [2022-04-28 03:08:56,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 122 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable122,SelfDestructingSolverStorable123,123 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:08:56,308 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:08:56,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:08:56,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1182461796, now seen corresponding path program 123 times [2022-04-28 03:08:56,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:08:56,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [824164175] [2022-04-28 03:08:56,568 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:56,570 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:08:56,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1738118199, now seen corresponding path program 1 times [2022-04-28 03:08:56,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:08:56,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637934793] [2022-04-28 03:08:56,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:08:56,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:08:56,575 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_62.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_62.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:08:56,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:08:56,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [890639357] [2022-04-28 03:08:56,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:08:56,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:08:56,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:08:56,579 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:08:56,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Waiting until timeout for monitored process [2022-04-28 03:08:56,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:08:56,621 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:08:56,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:08:56,628 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:08:56,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1182461796, now seen corresponding path program 124 times [2022-04-28 03:08:56,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:08:56,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669932903] [2022-04-28 03:08:56,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:08:56,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:08:56,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:58,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:08:58,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:58,381 INFO L290 TraceCheckUtils]: 0: Hoare triple {40610#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {40542#true} is VALID [2022-04-28 03:08:58,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {40542#true} assume true; {40542#true} is VALID [2022-04-28 03:08:58,381 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40542#true} {40542#true} #34#return; {40542#true} is VALID [2022-04-28 03:08:58,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {40542#true} call ULTIMATE.init(); {40610#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:08:58,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {40610#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {40542#true} is VALID [2022-04-28 03:08:58,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {40542#true} assume true; {40542#true} is VALID [2022-04-28 03:08:58,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40542#true} {40542#true} #34#return; {40542#true} is VALID [2022-04-28 03:08:58,382 INFO L272 TraceCheckUtils]: 4: Hoare triple {40542#true} call #t~ret4 := main(); {40542#true} is VALID [2022-04-28 03:08:58,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {40542#true} ~x~0 := 0; {40547#(= main_~x~0 0)} is VALID [2022-04-28 03:08:58,382 INFO L290 TraceCheckUtils]: 6: Hoare triple {40547#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40548#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:08:58,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {40548#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40549#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:08:58,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {40549#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40550#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:08:58,384 INFO L290 TraceCheckUtils]: 9: Hoare triple {40550#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40551#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:08:58,384 INFO L290 TraceCheckUtils]: 10: Hoare triple {40551#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40552#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:08:58,385 INFO L290 TraceCheckUtils]: 11: Hoare triple {40552#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40553#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:08:58,385 INFO L290 TraceCheckUtils]: 12: Hoare triple {40553#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40554#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:08:58,386 INFO L290 TraceCheckUtils]: 13: Hoare triple {40554#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40555#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:08:58,386 INFO L290 TraceCheckUtils]: 14: Hoare triple {40555#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40556#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:08:58,387 INFO L290 TraceCheckUtils]: 15: Hoare triple {40556#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40557#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:08:58,387 INFO L290 TraceCheckUtils]: 16: Hoare triple {40557#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40558#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:08:58,387 INFO L290 TraceCheckUtils]: 17: Hoare triple {40558#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40559#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:08:58,388 INFO L290 TraceCheckUtils]: 18: Hoare triple {40559#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40560#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:08:58,388 INFO L290 TraceCheckUtils]: 19: Hoare triple {40560#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40561#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:08:58,389 INFO L290 TraceCheckUtils]: 20: Hoare triple {40561#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40562#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:08:58,389 INFO L290 TraceCheckUtils]: 21: Hoare triple {40562#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40563#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:08:58,390 INFO L290 TraceCheckUtils]: 22: Hoare triple {40563#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40564#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:08:58,390 INFO L290 TraceCheckUtils]: 23: Hoare triple {40564#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40565#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:08:58,391 INFO L290 TraceCheckUtils]: 24: Hoare triple {40565#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40566#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:08:58,391 INFO L290 TraceCheckUtils]: 25: Hoare triple {40566#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40567#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:08:58,392 INFO L290 TraceCheckUtils]: 26: Hoare triple {40567#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40568#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:08:58,392 INFO L290 TraceCheckUtils]: 27: Hoare triple {40568#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40569#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:08:58,393 INFO L290 TraceCheckUtils]: 28: Hoare triple {40569#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40570#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:08:58,393 INFO L290 TraceCheckUtils]: 29: Hoare triple {40570#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40571#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:08:58,393 INFO L290 TraceCheckUtils]: 30: Hoare triple {40571#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40572#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:08:58,394 INFO L290 TraceCheckUtils]: 31: Hoare triple {40572#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40573#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:08:58,394 INFO L290 TraceCheckUtils]: 32: Hoare triple {40573#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40574#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:08:58,395 INFO L290 TraceCheckUtils]: 33: Hoare triple {40574#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40575#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:08:58,395 INFO L290 TraceCheckUtils]: 34: Hoare triple {40575#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40576#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:08:58,396 INFO L290 TraceCheckUtils]: 35: Hoare triple {40576#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40577#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:08:58,396 INFO L290 TraceCheckUtils]: 36: Hoare triple {40577#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40578#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:08:58,397 INFO L290 TraceCheckUtils]: 37: Hoare triple {40578#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40579#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:08:58,397 INFO L290 TraceCheckUtils]: 38: Hoare triple {40579#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40580#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:08:58,398 INFO L290 TraceCheckUtils]: 39: Hoare triple {40580#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40581#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:08:58,398 INFO L290 TraceCheckUtils]: 40: Hoare triple {40581#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40582#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:08:58,399 INFO L290 TraceCheckUtils]: 41: Hoare triple {40582#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40583#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:08:58,399 INFO L290 TraceCheckUtils]: 42: Hoare triple {40583#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40584#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:08:58,399 INFO L290 TraceCheckUtils]: 43: Hoare triple {40584#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40585#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:08:58,400 INFO L290 TraceCheckUtils]: 44: Hoare triple {40585#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40586#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:08:58,400 INFO L290 TraceCheckUtils]: 45: Hoare triple {40586#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40587#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:08:58,401 INFO L290 TraceCheckUtils]: 46: Hoare triple {40587#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40588#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:08:58,401 INFO L290 TraceCheckUtils]: 47: Hoare triple {40588#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40589#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:08:58,402 INFO L290 TraceCheckUtils]: 48: Hoare triple {40589#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40590#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:08:58,402 INFO L290 TraceCheckUtils]: 49: Hoare triple {40590#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40591#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:08:58,403 INFO L290 TraceCheckUtils]: 50: Hoare triple {40591#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40592#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 03:08:58,403 INFO L290 TraceCheckUtils]: 51: Hoare triple {40592#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40593#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 03:08:58,404 INFO L290 TraceCheckUtils]: 52: Hoare triple {40593#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40594#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 03:08:58,404 INFO L290 TraceCheckUtils]: 53: Hoare triple {40594#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40595#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-28 03:08:58,405 INFO L290 TraceCheckUtils]: 54: Hoare triple {40595#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40596#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-28 03:08:58,405 INFO L290 TraceCheckUtils]: 55: Hoare triple {40596#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40597#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-28 03:08:58,405 INFO L290 TraceCheckUtils]: 56: Hoare triple {40597#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40598#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-28 03:08:58,406 INFO L290 TraceCheckUtils]: 57: Hoare triple {40598#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40599#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-28 03:08:58,406 INFO L290 TraceCheckUtils]: 58: Hoare triple {40599#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40600#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-28 03:08:58,407 INFO L290 TraceCheckUtils]: 59: Hoare triple {40600#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40601#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-28 03:08:58,407 INFO L290 TraceCheckUtils]: 60: Hoare triple {40601#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40602#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-28 03:08:58,408 INFO L290 TraceCheckUtils]: 61: Hoare triple {40602#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40603#(and (<= main_~x~0 112) (<= 112 main_~x~0))} is VALID [2022-04-28 03:08:58,408 INFO L290 TraceCheckUtils]: 62: Hoare triple {40603#(and (<= main_~x~0 112) (<= 112 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40604#(and (<= main_~x~0 114) (<= 114 main_~x~0))} is VALID [2022-04-28 03:08:58,409 INFO L290 TraceCheckUtils]: 63: Hoare triple {40604#(and (<= main_~x~0 114) (<= 114 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40605#(and (<= main_~x~0 116) (<= 116 main_~x~0))} is VALID [2022-04-28 03:08:58,409 INFO L290 TraceCheckUtils]: 64: Hoare triple {40605#(and (<= main_~x~0 116) (<= 116 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40606#(and (<= 118 main_~x~0) (<= main_~x~0 118))} is VALID [2022-04-28 03:08:58,410 INFO L290 TraceCheckUtils]: 65: Hoare triple {40606#(and (<= 118 main_~x~0) (<= main_~x~0 118))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40607#(and (<= main_~x~0 120) (<= 120 main_~x~0))} is VALID [2022-04-28 03:08:58,410 INFO L290 TraceCheckUtils]: 66: Hoare triple {40607#(and (<= main_~x~0 120) (<= 120 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40608#(and (<= 122 main_~x~0) (<= main_~x~0 122))} is VALID [2022-04-28 03:08:58,411 INFO L290 TraceCheckUtils]: 67: Hoare triple {40608#(and (<= 122 main_~x~0) (<= main_~x~0 122))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40609#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 124))} is VALID [2022-04-28 03:08:58,411 INFO L290 TraceCheckUtils]: 68: Hoare triple {40609#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 124))} assume !(~x~0 % 4294967296 < 268435455); {40543#false} is VALID [2022-04-28 03:08:58,411 INFO L272 TraceCheckUtils]: 69: Hoare triple {40543#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {40543#false} is VALID [2022-04-28 03:08:58,411 INFO L290 TraceCheckUtils]: 70: Hoare triple {40543#false} ~cond := #in~cond; {40543#false} is VALID [2022-04-28 03:08:58,411 INFO L290 TraceCheckUtils]: 71: Hoare triple {40543#false} assume 0 == ~cond; {40543#false} is VALID [2022-04-28 03:08:58,411 INFO L290 TraceCheckUtils]: 72: Hoare triple {40543#false} assume !false; {40543#false} is VALID [2022-04-28 03:08:58,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:08:58,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:08:58,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669932903] [2022-04-28 03:08:58,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669932903] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:08:58,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421138539] [2022-04-28 03:08:58,412 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:08:58,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:08:58,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:08:58,413 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:08:58,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Waiting until timeout for monitored process [2022-04-28 03:08:58,517 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:08:58,517 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:08:58,519 WARN L261 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 127 conjunts are in the unsatisfiable core [2022-04-28 03:08:58,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:08:58,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:08:59,207 INFO L272 TraceCheckUtils]: 0: Hoare triple {40542#true} call ULTIMATE.init(); {40542#true} is VALID [2022-04-28 03:08:59,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {40542#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {40542#true} is VALID [2022-04-28 03:08:59,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {40542#true} assume true; {40542#true} is VALID [2022-04-28 03:08:59,207 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40542#true} {40542#true} #34#return; {40542#true} is VALID [2022-04-28 03:08:59,207 INFO L272 TraceCheckUtils]: 4: Hoare triple {40542#true} call #t~ret4 := main(); {40542#true} is VALID [2022-04-28 03:08:59,208 INFO L290 TraceCheckUtils]: 5: Hoare triple {40542#true} ~x~0 := 0; {40547#(= main_~x~0 0)} is VALID [2022-04-28 03:08:59,208 INFO L290 TraceCheckUtils]: 6: Hoare triple {40547#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40548#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:08:59,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {40548#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40549#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:08:59,209 INFO L290 TraceCheckUtils]: 8: Hoare triple {40549#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40550#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:08:59,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {40550#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40551#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:08:59,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {40551#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40552#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:08:59,210 INFO L290 TraceCheckUtils]: 11: Hoare triple {40552#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40553#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:08:59,211 INFO L290 TraceCheckUtils]: 12: Hoare triple {40553#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40554#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:08:59,211 INFO L290 TraceCheckUtils]: 13: Hoare triple {40554#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40555#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:08:59,212 INFO L290 TraceCheckUtils]: 14: Hoare triple {40555#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40556#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:08:59,212 INFO L290 TraceCheckUtils]: 15: Hoare triple {40556#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40557#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:08:59,213 INFO L290 TraceCheckUtils]: 16: Hoare triple {40557#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40558#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:08:59,213 INFO L290 TraceCheckUtils]: 17: Hoare triple {40558#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40559#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:08:59,214 INFO L290 TraceCheckUtils]: 18: Hoare triple {40559#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40560#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:08:59,214 INFO L290 TraceCheckUtils]: 19: Hoare triple {40560#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40561#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:08:59,215 INFO L290 TraceCheckUtils]: 20: Hoare triple {40561#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40562#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:08:59,215 INFO L290 TraceCheckUtils]: 21: Hoare triple {40562#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40563#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:08:59,216 INFO L290 TraceCheckUtils]: 22: Hoare triple {40563#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40564#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:08:59,216 INFO L290 TraceCheckUtils]: 23: Hoare triple {40564#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40565#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:08:59,217 INFO L290 TraceCheckUtils]: 24: Hoare triple {40565#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40566#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:08:59,217 INFO L290 TraceCheckUtils]: 25: Hoare triple {40566#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40567#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:08:59,217 INFO L290 TraceCheckUtils]: 26: Hoare triple {40567#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40568#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:08:59,218 INFO L290 TraceCheckUtils]: 27: Hoare triple {40568#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40569#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:08:59,218 INFO L290 TraceCheckUtils]: 28: Hoare triple {40569#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40570#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:08:59,219 INFO L290 TraceCheckUtils]: 29: Hoare triple {40570#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40571#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:08:59,219 INFO L290 TraceCheckUtils]: 30: Hoare triple {40571#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40572#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:08:59,220 INFO L290 TraceCheckUtils]: 31: Hoare triple {40572#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40573#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:08:59,220 INFO L290 TraceCheckUtils]: 32: Hoare triple {40573#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40574#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:08:59,221 INFO L290 TraceCheckUtils]: 33: Hoare triple {40574#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40575#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:08:59,221 INFO L290 TraceCheckUtils]: 34: Hoare triple {40575#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40576#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:08:59,222 INFO L290 TraceCheckUtils]: 35: Hoare triple {40576#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40577#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:08:59,222 INFO L290 TraceCheckUtils]: 36: Hoare triple {40577#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40578#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:08:59,223 INFO L290 TraceCheckUtils]: 37: Hoare triple {40578#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40579#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:08:59,223 INFO L290 TraceCheckUtils]: 38: Hoare triple {40579#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40580#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:08:59,224 INFO L290 TraceCheckUtils]: 39: Hoare triple {40580#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40581#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:08:59,224 INFO L290 TraceCheckUtils]: 40: Hoare triple {40581#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40582#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:08:59,225 INFO L290 TraceCheckUtils]: 41: Hoare triple {40582#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40583#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:08:59,225 INFO L290 TraceCheckUtils]: 42: Hoare triple {40583#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40584#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:08:59,225 INFO L290 TraceCheckUtils]: 43: Hoare triple {40584#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40585#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:08:59,226 INFO L290 TraceCheckUtils]: 44: Hoare triple {40585#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40586#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:08:59,226 INFO L290 TraceCheckUtils]: 45: Hoare triple {40586#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40587#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:08:59,227 INFO L290 TraceCheckUtils]: 46: Hoare triple {40587#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40588#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:08:59,227 INFO L290 TraceCheckUtils]: 47: Hoare triple {40588#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40589#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:08:59,228 INFO L290 TraceCheckUtils]: 48: Hoare triple {40589#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40590#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:08:59,228 INFO L290 TraceCheckUtils]: 49: Hoare triple {40590#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40591#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:08:59,229 INFO L290 TraceCheckUtils]: 50: Hoare triple {40591#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40592#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 03:08:59,229 INFO L290 TraceCheckUtils]: 51: Hoare triple {40592#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40593#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 03:08:59,230 INFO L290 TraceCheckUtils]: 52: Hoare triple {40593#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40594#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 03:08:59,230 INFO L290 TraceCheckUtils]: 53: Hoare triple {40594#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40595#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-28 03:08:59,231 INFO L290 TraceCheckUtils]: 54: Hoare triple {40595#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40596#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-28 03:08:59,231 INFO L290 TraceCheckUtils]: 55: Hoare triple {40596#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40597#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-28 03:08:59,232 INFO L290 TraceCheckUtils]: 56: Hoare triple {40597#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40598#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-28 03:08:59,232 INFO L290 TraceCheckUtils]: 57: Hoare triple {40598#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40599#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-28 03:08:59,233 INFO L290 TraceCheckUtils]: 58: Hoare triple {40599#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40600#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-28 03:08:59,233 INFO L290 TraceCheckUtils]: 59: Hoare triple {40600#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40601#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-28 03:08:59,233 INFO L290 TraceCheckUtils]: 60: Hoare triple {40601#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40602#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-28 03:08:59,234 INFO L290 TraceCheckUtils]: 61: Hoare triple {40602#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40603#(and (<= main_~x~0 112) (<= 112 main_~x~0))} is VALID [2022-04-28 03:08:59,234 INFO L290 TraceCheckUtils]: 62: Hoare triple {40603#(and (<= main_~x~0 112) (<= 112 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40604#(and (<= main_~x~0 114) (<= 114 main_~x~0))} is VALID [2022-04-28 03:08:59,235 INFO L290 TraceCheckUtils]: 63: Hoare triple {40604#(and (<= main_~x~0 114) (<= 114 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40605#(and (<= main_~x~0 116) (<= 116 main_~x~0))} is VALID [2022-04-28 03:08:59,235 INFO L290 TraceCheckUtils]: 64: Hoare triple {40605#(and (<= main_~x~0 116) (<= 116 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40606#(and (<= 118 main_~x~0) (<= main_~x~0 118))} is VALID [2022-04-28 03:08:59,236 INFO L290 TraceCheckUtils]: 65: Hoare triple {40606#(and (<= 118 main_~x~0) (<= main_~x~0 118))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40607#(and (<= main_~x~0 120) (<= 120 main_~x~0))} is VALID [2022-04-28 03:08:59,236 INFO L290 TraceCheckUtils]: 66: Hoare triple {40607#(and (<= main_~x~0 120) (<= 120 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40608#(and (<= 122 main_~x~0) (<= main_~x~0 122))} is VALID [2022-04-28 03:08:59,237 INFO L290 TraceCheckUtils]: 67: Hoare triple {40608#(and (<= 122 main_~x~0) (<= main_~x~0 122))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40815#(and (<= 124 main_~x~0) (<= main_~x~0 124))} is VALID [2022-04-28 03:08:59,237 INFO L290 TraceCheckUtils]: 68: Hoare triple {40815#(and (<= 124 main_~x~0) (<= main_~x~0 124))} assume !(~x~0 % 4294967296 < 268435455); {40543#false} is VALID [2022-04-28 03:08:59,237 INFO L272 TraceCheckUtils]: 69: Hoare triple {40543#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {40543#false} is VALID [2022-04-28 03:08:59,237 INFO L290 TraceCheckUtils]: 70: Hoare triple {40543#false} ~cond := #in~cond; {40543#false} is VALID [2022-04-28 03:08:59,237 INFO L290 TraceCheckUtils]: 71: Hoare triple {40543#false} assume 0 == ~cond; {40543#false} is VALID [2022-04-28 03:08:59,238 INFO L290 TraceCheckUtils]: 72: Hoare triple {40543#false} assume !false; {40543#false} is VALID [2022-04-28 03:08:59,238 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:08:59,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:09:04,894 INFO L290 TraceCheckUtils]: 72: Hoare triple {40543#false} assume !false; {40543#false} is VALID [2022-04-28 03:09:04,895 INFO L290 TraceCheckUtils]: 71: Hoare triple {40543#false} assume 0 == ~cond; {40543#false} is VALID [2022-04-28 03:09:04,895 INFO L290 TraceCheckUtils]: 70: Hoare triple {40543#false} ~cond := #in~cond; {40543#false} is VALID [2022-04-28 03:09:04,895 INFO L272 TraceCheckUtils]: 69: Hoare triple {40543#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {40543#false} is VALID [2022-04-28 03:09:04,895 INFO L290 TraceCheckUtils]: 68: Hoare triple {40843#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {40543#false} is VALID [2022-04-28 03:09:04,896 INFO L290 TraceCheckUtils]: 67: Hoare triple {40847#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40843#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,896 INFO L290 TraceCheckUtils]: 66: Hoare triple {40851#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40847#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,897 INFO L290 TraceCheckUtils]: 65: Hoare triple {40855#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40851#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,899 INFO L290 TraceCheckUtils]: 64: Hoare triple {40859#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40855#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,899 INFO L290 TraceCheckUtils]: 63: Hoare triple {40863#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40859#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,900 INFO L290 TraceCheckUtils]: 62: Hoare triple {40867#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40863#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,900 INFO L290 TraceCheckUtils]: 61: Hoare triple {40871#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40867#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,901 INFO L290 TraceCheckUtils]: 60: Hoare triple {40875#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40871#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,901 INFO L290 TraceCheckUtils]: 59: Hoare triple {40879#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40875#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,902 INFO L290 TraceCheckUtils]: 58: Hoare triple {40883#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40879#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,903 INFO L290 TraceCheckUtils]: 57: Hoare triple {40887#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40883#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,903 INFO L290 TraceCheckUtils]: 56: Hoare triple {40891#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40887#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,910 INFO L290 TraceCheckUtils]: 55: Hoare triple {40895#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40891#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,911 INFO L290 TraceCheckUtils]: 54: Hoare triple {40899#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40895#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,912 INFO L290 TraceCheckUtils]: 53: Hoare triple {40903#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40899#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,912 INFO L290 TraceCheckUtils]: 52: Hoare triple {40907#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40903#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,913 INFO L290 TraceCheckUtils]: 51: Hoare triple {40911#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40907#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,913 INFO L290 TraceCheckUtils]: 50: Hoare triple {40915#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40911#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,914 INFO L290 TraceCheckUtils]: 49: Hoare triple {40919#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40915#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,915 INFO L290 TraceCheckUtils]: 48: Hoare triple {40923#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40919#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,915 INFO L290 TraceCheckUtils]: 47: Hoare triple {40927#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40923#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,916 INFO L290 TraceCheckUtils]: 46: Hoare triple {40931#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40927#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,916 INFO L290 TraceCheckUtils]: 45: Hoare triple {40935#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40931#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,917 INFO L290 TraceCheckUtils]: 44: Hoare triple {40939#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40935#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,917 INFO L290 TraceCheckUtils]: 43: Hoare triple {40943#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40939#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,918 INFO L290 TraceCheckUtils]: 42: Hoare triple {40947#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40943#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,919 INFO L290 TraceCheckUtils]: 41: Hoare triple {40951#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40947#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,919 INFO L290 TraceCheckUtils]: 40: Hoare triple {40955#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40951#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,920 INFO L290 TraceCheckUtils]: 39: Hoare triple {40959#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40955#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,920 INFO L290 TraceCheckUtils]: 38: Hoare triple {40963#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40959#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,921 INFO L290 TraceCheckUtils]: 37: Hoare triple {40967#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40963#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,922 INFO L290 TraceCheckUtils]: 36: Hoare triple {40971#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40967#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,923 INFO L290 TraceCheckUtils]: 35: Hoare triple {40975#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40971#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,923 INFO L290 TraceCheckUtils]: 34: Hoare triple {40979#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40975#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,924 INFO L290 TraceCheckUtils]: 33: Hoare triple {40983#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40979#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,924 INFO L290 TraceCheckUtils]: 32: Hoare triple {40987#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40983#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,925 INFO L290 TraceCheckUtils]: 31: Hoare triple {40991#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40987#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,926 INFO L290 TraceCheckUtils]: 30: Hoare triple {40995#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40991#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,926 INFO L290 TraceCheckUtils]: 29: Hoare triple {40999#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40995#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,927 INFO L290 TraceCheckUtils]: 28: Hoare triple {41003#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {40999#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,928 INFO L290 TraceCheckUtils]: 27: Hoare triple {41007#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41003#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,928 INFO L290 TraceCheckUtils]: 26: Hoare triple {41011#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41007#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,929 INFO L290 TraceCheckUtils]: 25: Hoare triple {41015#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41011#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,930 INFO L290 TraceCheckUtils]: 24: Hoare triple {41019#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41015#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,930 INFO L290 TraceCheckUtils]: 23: Hoare triple {41023#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41019#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,931 INFO L290 TraceCheckUtils]: 22: Hoare triple {41027#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41023#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,931 INFO L290 TraceCheckUtils]: 21: Hoare triple {41031#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41027#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {41035#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41031#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,933 INFO L290 TraceCheckUtils]: 19: Hoare triple {41039#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41035#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,933 INFO L290 TraceCheckUtils]: 18: Hoare triple {41043#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41039#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,934 INFO L290 TraceCheckUtils]: 17: Hoare triple {41047#(< (mod (+ main_~x~0 102) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41043#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,934 INFO L290 TraceCheckUtils]: 16: Hoare triple {41051#(< (mod (+ 104 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41047#(< (mod (+ main_~x~0 102) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,935 INFO L290 TraceCheckUtils]: 15: Hoare triple {41055#(< (mod (+ 106 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41051#(< (mod (+ 104 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,936 INFO L290 TraceCheckUtils]: 14: Hoare triple {41059#(< (mod (+ 108 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41055#(< (mod (+ 106 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,936 INFO L290 TraceCheckUtils]: 13: Hoare triple {41063#(< (mod (+ 110 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41059#(< (mod (+ 108 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,937 INFO L290 TraceCheckUtils]: 12: Hoare triple {41067#(< (mod (+ 112 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41063#(< (mod (+ 110 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,937 INFO L290 TraceCheckUtils]: 11: Hoare triple {41071#(< (mod (+ main_~x~0 114) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41067#(< (mod (+ 112 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,938 INFO L290 TraceCheckUtils]: 10: Hoare triple {41075#(< (mod (+ 116 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41071#(< (mod (+ main_~x~0 114) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,938 INFO L290 TraceCheckUtils]: 9: Hoare triple {41079#(< (mod (+ main_~x~0 118) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41075#(< (mod (+ 116 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {41083#(< (mod (+ main_~x~0 120) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41079#(< (mod (+ main_~x~0 118) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {41087#(< (mod (+ main_~x~0 122) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41083#(< (mod (+ main_~x~0 120) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,940 INFO L290 TraceCheckUtils]: 6: Hoare triple {41091#(< (mod (+ main_~x~0 124) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41087#(< (mod (+ main_~x~0 122) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {40542#true} ~x~0 := 0; {41091#(< (mod (+ main_~x~0 124) 4294967296) 268435455)} is VALID [2022-04-28 03:09:04,941 INFO L272 TraceCheckUtils]: 4: Hoare triple {40542#true} call #t~ret4 := main(); {40542#true} is VALID [2022-04-28 03:09:04,941 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40542#true} {40542#true} #34#return; {40542#true} is VALID [2022-04-28 03:09:04,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {40542#true} assume true; {40542#true} is VALID [2022-04-28 03:09:04,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {40542#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {40542#true} is VALID [2022-04-28 03:09:04,941 INFO L272 TraceCheckUtils]: 0: Hoare triple {40542#true} call ULTIMATE.init(); {40542#true} is VALID [2022-04-28 03:09:04,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:09:04,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421138539] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:09:04,941 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:09:04,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 65, 65] total 130 [2022-04-28 03:09:04,942 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:04,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [824164175] [2022-04-28 03:09:04,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [824164175] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:04,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:04,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2022-04-28 03:09:04,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630281305] [2022-04-28 03:09:04,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:04,942 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 65 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-04-28 03:09:04,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:04,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 66 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 65 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:04,978 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:09:04,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-04-28 03:09:04,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:04,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-04-28 03:09:04,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4352, Invalid=12418, Unknown=0, NotChecked=0, Total=16770 [2022-04-28 03:09:04,980 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand has 66 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 65 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:12,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:12,248 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2022-04-28 03:09:12,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-04-28 03:09:12,248 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 65 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2022-04-28 03:09:12,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:12,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 65 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:12,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2022-04-28 03:09:12,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 65 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:12,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2022-04-28 03:09:12,250 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 80 transitions. [2022-04-28 03:09:12,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:12,297 INFO L225 Difference]: With dead ends: 80 [2022-04-28 03:09:12,297 INFO L226 Difference]: Without dead ends: 75 [2022-04-28 03:09:12,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2083 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=8697, Invalid=28359, Unknown=0, NotChecked=0, Total=37056 [2022-04-28 03:09:12,299 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 4028 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 4155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 4028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:09:12,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 133 Invalid, 4155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 4028 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-04-28 03:09:12,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-28 03:09:12,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-04-28 03:09:12,389 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:12,389 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:12,389 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:12,389 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:12,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:12,390 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2022-04-28 03:09:12,390 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2022-04-28 03:09:12,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:12,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:12,390 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states. [2022-04-28 03:09:12,390 INFO L87 Difference]: Start difference. First operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states. [2022-04-28 03:09:12,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:12,391 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2022-04-28 03:09:12,391 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2022-04-28 03:09:12,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:12,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:12,391 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:12,391 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:12,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:12,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2022-04-28 03:09:12,392 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2022-04-28 03:09:12,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:12,392 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2022-04-28 03:09:12,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 65 states have internal predecessors, (69), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:12,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 75 transitions. [2022-04-28 03:09:12,444 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:12,444 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2022-04-28 03:09:12,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-28 03:09:12,444 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:12,444 INFO L195 NwaCegarLoop]: trace histogram [63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:09:12,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Ended with exit code 0 [2022-04-28 03:09:12,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Forceful destruction successful, exit code 0 [2022-04-28 03:09:12,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 125 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,124 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable124,SelfDestructingSolverStorable125 [2022-04-28 03:09:12,845 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:09:12,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:12,846 INFO L85 PathProgramCache]: Analyzing trace with hash 2034851254, now seen corresponding path program 125 times [2022-04-28 03:09:12,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:12,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1165804337] [2022-04-28 03:09:12,978 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:12,980 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:09:12,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1797223543, now seen corresponding path program 1 times [2022-04-28 03:09:12,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:12,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053498482] [2022-04-28 03:09:12,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:12,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:12,985 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_63.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_63.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:09:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:09:12,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1726748829] [2022-04-28 03:09:12,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:12,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:09:12,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:09:12,989 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:09:12,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Waiting until timeout for monitored process [2022-04-28 03:09:13,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:09:13,042 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:09:13,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:09:13,050 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:09:13,050 INFO L85 PathProgramCache]: Analyzing trace with hash 2034851254, now seen corresponding path program 126 times [2022-04-28 03:09:13,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:13,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434116065] [2022-04-28 03:09:13,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:13,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:13,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:14,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:14,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:14,866 INFO L290 TraceCheckUtils]: 0: Hoare triple {41767#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {41698#true} is VALID [2022-04-28 03:09:14,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {41698#true} assume true; {41698#true} is VALID [2022-04-28 03:09:14,867 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41698#true} {41698#true} #34#return; {41698#true} is VALID [2022-04-28 03:09:14,867 INFO L272 TraceCheckUtils]: 0: Hoare triple {41698#true} call ULTIMATE.init(); {41767#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:09:14,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {41767#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {41698#true} is VALID [2022-04-28 03:09:14,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {41698#true} assume true; {41698#true} is VALID [2022-04-28 03:09:14,867 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41698#true} {41698#true} #34#return; {41698#true} is VALID [2022-04-28 03:09:14,867 INFO L272 TraceCheckUtils]: 4: Hoare triple {41698#true} call #t~ret4 := main(); {41698#true} is VALID [2022-04-28 03:09:14,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {41698#true} ~x~0 := 0; {41703#(= main_~x~0 0)} is VALID [2022-04-28 03:09:14,868 INFO L290 TraceCheckUtils]: 6: Hoare triple {41703#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41704#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:09:14,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {41704#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41705#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:09:14,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {41705#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41706#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:09:14,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {41706#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41707#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:09:14,870 INFO L290 TraceCheckUtils]: 10: Hoare triple {41707#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41708#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:09:14,870 INFO L290 TraceCheckUtils]: 11: Hoare triple {41708#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41709#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:09:14,871 INFO L290 TraceCheckUtils]: 12: Hoare triple {41709#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41710#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:09:14,871 INFO L290 TraceCheckUtils]: 13: Hoare triple {41710#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41711#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:09:14,872 INFO L290 TraceCheckUtils]: 14: Hoare triple {41711#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41712#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:09:14,872 INFO L290 TraceCheckUtils]: 15: Hoare triple {41712#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41713#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:09:14,873 INFO L290 TraceCheckUtils]: 16: Hoare triple {41713#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41714#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:09:14,873 INFO L290 TraceCheckUtils]: 17: Hoare triple {41714#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41715#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:09:14,874 INFO L290 TraceCheckUtils]: 18: Hoare triple {41715#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41716#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:09:14,874 INFO L290 TraceCheckUtils]: 19: Hoare triple {41716#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41717#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:09:14,875 INFO L290 TraceCheckUtils]: 20: Hoare triple {41717#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41718#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:09:14,875 INFO L290 TraceCheckUtils]: 21: Hoare triple {41718#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41719#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:09:14,876 INFO L290 TraceCheckUtils]: 22: Hoare triple {41719#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41720#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:09:14,876 INFO L290 TraceCheckUtils]: 23: Hoare triple {41720#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41721#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:09:14,877 INFO L290 TraceCheckUtils]: 24: Hoare triple {41721#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41722#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:09:14,877 INFO L290 TraceCheckUtils]: 25: Hoare triple {41722#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41723#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:09:14,878 INFO L290 TraceCheckUtils]: 26: Hoare triple {41723#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41724#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:09:14,878 INFO L290 TraceCheckUtils]: 27: Hoare triple {41724#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41725#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:09:14,878 INFO L290 TraceCheckUtils]: 28: Hoare triple {41725#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41726#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:09:14,879 INFO L290 TraceCheckUtils]: 29: Hoare triple {41726#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41727#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:09:14,879 INFO L290 TraceCheckUtils]: 30: Hoare triple {41727#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41728#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:09:14,880 INFO L290 TraceCheckUtils]: 31: Hoare triple {41728#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41729#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:09:14,880 INFO L290 TraceCheckUtils]: 32: Hoare triple {41729#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41730#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:09:14,881 INFO L290 TraceCheckUtils]: 33: Hoare triple {41730#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41731#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:09:14,881 INFO L290 TraceCheckUtils]: 34: Hoare triple {41731#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41732#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:09:14,882 INFO L290 TraceCheckUtils]: 35: Hoare triple {41732#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41733#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:09:14,882 INFO L290 TraceCheckUtils]: 36: Hoare triple {41733#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41734#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:09:14,883 INFO L290 TraceCheckUtils]: 37: Hoare triple {41734#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41735#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:09:14,883 INFO L290 TraceCheckUtils]: 38: Hoare triple {41735#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41736#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:09:14,884 INFO L290 TraceCheckUtils]: 39: Hoare triple {41736#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41737#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:09:14,884 INFO L290 TraceCheckUtils]: 40: Hoare triple {41737#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41738#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:09:14,885 INFO L290 TraceCheckUtils]: 41: Hoare triple {41738#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41739#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:09:14,885 INFO L290 TraceCheckUtils]: 42: Hoare triple {41739#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41740#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:09:14,886 INFO L290 TraceCheckUtils]: 43: Hoare triple {41740#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41741#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:09:14,886 INFO L290 TraceCheckUtils]: 44: Hoare triple {41741#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41742#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:09:14,886 INFO L290 TraceCheckUtils]: 45: Hoare triple {41742#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41743#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:09:14,887 INFO L290 TraceCheckUtils]: 46: Hoare triple {41743#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41744#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:09:14,887 INFO L290 TraceCheckUtils]: 47: Hoare triple {41744#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41745#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:09:14,888 INFO L290 TraceCheckUtils]: 48: Hoare triple {41745#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41746#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:09:14,888 INFO L290 TraceCheckUtils]: 49: Hoare triple {41746#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41747#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:09:14,889 INFO L290 TraceCheckUtils]: 50: Hoare triple {41747#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41748#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 03:09:14,889 INFO L290 TraceCheckUtils]: 51: Hoare triple {41748#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41749#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 03:09:14,890 INFO L290 TraceCheckUtils]: 52: Hoare triple {41749#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41750#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 03:09:14,890 INFO L290 TraceCheckUtils]: 53: Hoare triple {41750#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41751#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-28 03:09:14,891 INFO L290 TraceCheckUtils]: 54: Hoare triple {41751#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41752#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-28 03:09:14,891 INFO L290 TraceCheckUtils]: 55: Hoare triple {41752#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41753#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-28 03:09:14,892 INFO L290 TraceCheckUtils]: 56: Hoare triple {41753#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41754#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-28 03:09:14,892 INFO L290 TraceCheckUtils]: 57: Hoare triple {41754#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41755#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-28 03:09:14,892 INFO L290 TraceCheckUtils]: 58: Hoare triple {41755#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41756#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-28 03:09:14,893 INFO L290 TraceCheckUtils]: 59: Hoare triple {41756#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41757#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-28 03:09:14,893 INFO L290 TraceCheckUtils]: 60: Hoare triple {41757#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41758#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-28 03:09:14,894 INFO L290 TraceCheckUtils]: 61: Hoare triple {41758#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41759#(and (<= main_~x~0 112) (<= 112 main_~x~0))} is VALID [2022-04-28 03:09:14,894 INFO L290 TraceCheckUtils]: 62: Hoare triple {41759#(and (<= main_~x~0 112) (<= 112 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41760#(and (<= main_~x~0 114) (<= 114 main_~x~0))} is VALID [2022-04-28 03:09:14,895 INFO L290 TraceCheckUtils]: 63: Hoare triple {41760#(and (<= main_~x~0 114) (<= 114 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41761#(and (<= main_~x~0 116) (<= 116 main_~x~0))} is VALID [2022-04-28 03:09:14,895 INFO L290 TraceCheckUtils]: 64: Hoare triple {41761#(and (<= main_~x~0 116) (<= 116 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41762#(and (<= 118 main_~x~0) (<= main_~x~0 118))} is VALID [2022-04-28 03:09:14,896 INFO L290 TraceCheckUtils]: 65: Hoare triple {41762#(and (<= 118 main_~x~0) (<= main_~x~0 118))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41763#(and (<= main_~x~0 120) (<= 120 main_~x~0))} is VALID [2022-04-28 03:09:14,896 INFO L290 TraceCheckUtils]: 66: Hoare triple {41763#(and (<= main_~x~0 120) (<= 120 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41764#(and (<= 122 main_~x~0) (<= main_~x~0 122))} is VALID [2022-04-28 03:09:14,897 INFO L290 TraceCheckUtils]: 67: Hoare triple {41764#(and (<= 122 main_~x~0) (<= main_~x~0 122))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41765#(and (<= 124 main_~x~0) (<= main_~x~0 124))} is VALID [2022-04-28 03:09:14,897 INFO L290 TraceCheckUtils]: 68: Hoare triple {41765#(and (<= 124 main_~x~0) (<= main_~x~0 124))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41766#(and (<= main_~x~0 126) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:09:14,898 INFO L290 TraceCheckUtils]: 69: Hoare triple {41766#(and (<= main_~x~0 126) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {41699#false} is VALID [2022-04-28 03:09:14,898 INFO L272 TraceCheckUtils]: 70: Hoare triple {41699#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {41699#false} is VALID [2022-04-28 03:09:14,898 INFO L290 TraceCheckUtils]: 71: Hoare triple {41699#false} ~cond := #in~cond; {41699#false} is VALID [2022-04-28 03:09:14,898 INFO L290 TraceCheckUtils]: 72: Hoare triple {41699#false} assume 0 == ~cond; {41699#false} is VALID [2022-04-28 03:09:14,898 INFO L290 TraceCheckUtils]: 73: Hoare triple {41699#false} assume !false; {41699#false} is VALID [2022-04-28 03:09:14,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:09:14,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:14,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434116065] [2022-04-28 03:09:14,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434116065] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:09:14,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724705501] [2022-04-28 03:09:14,899 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:09:14,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:09:14,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:09:14,900 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:09:14,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Waiting until timeout for monitored process [2022-04-28 03:09:40,461 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 33 check-sat command(s) [2022-04-28 03:09:40,461 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:09:40,475 WARN L261 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 135 conjunts are in the unsatisfiable core [2022-04-28 03:09:40,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:40,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:09:41,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {41698#true} call ULTIMATE.init(); {41698#true} is VALID [2022-04-28 03:09:41,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {41698#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {41698#true} is VALID [2022-04-28 03:09:41,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {41698#true} assume true; {41698#true} is VALID [2022-04-28 03:09:41,090 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41698#true} {41698#true} #34#return; {41698#true} is VALID [2022-04-28 03:09:41,090 INFO L272 TraceCheckUtils]: 4: Hoare triple {41698#true} call #t~ret4 := main(); {41698#true} is VALID [2022-04-28 03:09:41,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {41698#true} ~x~0 := 0; {41703#(= main_~x~0 0)} is VALID [2022-04-28 03:09:41,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {41703#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41704#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:09:41,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {41704#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41705#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:09:41,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {41705#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41706#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:09:41,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {41706#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41707#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:09:41,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {41707#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41708#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:09:41,093 INFO L290 TraceCheckUtils]: 11: Hoare triple {41708#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41709#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:09:41,093 INFO L290 TraceCheckUtils]: 12: Hoare triple {41709#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41710#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:09:41,094 INFO L290 TraceCheckUtils]: 13: Hoare triple {41710#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41711#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:09:41,094 INFO L290 TraceCheckUtils]: 14: Hoare triple {41711#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41712#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:09:41,095 INFO L290 TraceCheckUtils]: 15: Hoare triple {41712#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41713#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:09:41,095 INFO L290 TraceCheckUtils]: 16: Hoare triple {41713#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41714#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:09:41,096 INFO L290 TraceCheckUtils]: 17: Hoare triple {41714#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41715#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:09:41,096 INFO L290 TraceCheckUtils]: 18: Hoare triple {41715#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41716#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:09:41,097 INFO L290 TraceCheckUtils]: 19: Hoare triple {41716#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41717#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:09:41,097 INFO L290 TraceCheckUtils]: 20: Hoare triple {41717#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41718#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:09:41,098 INFO L290 TraceCheckUtils]: 21: Hoare triple {41718#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41719#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:09:41,098 INFO L290 TraceCheckUtils]: 22: Hoare triple {41719#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41720#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:09:41,099 INFO L290 TraceCheckUtils]: 23: Hoare triple {41720#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41721#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:09:41,099 INFO L290 TraceCheckUtils]: 24: Hoare triple {41721#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41722#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:09:41,099 INFO L290 TraceCheckUtils]: 25: Hoare triple {41722#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41723#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:09:41,100 INFO L290 TraceCheckUtils]: 26: Hoare triple {41723#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41724#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:09:41,100 INFO L290 TraceCheckUtils]: 27: Hoare triple {41724#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41725#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:09:41,101 INFO L290 TraceCheckUtils]: 28: Hoare triple {41725#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41726#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:09:41,101 INFO L290 TraceCheckUtils]: 29: Hoare triple {41726#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41727#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:09:41,102 INFO L290 TraceCheckUtils]: 30: Hoare triple {41727#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41728#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:09:41,102 INFO L290 TraceCheckUtils]: 31: Hoare triple {41728#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41729#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:09:41,103 INFO L290 TraceCheckUtils]: 32: Hoare triple {41729#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41730#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:09:41,103 INFO L290 TraceCheckUtils]: 33: Hoare triple {41730#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41731#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:09:41,104 INFO L290 TraceCheckUtils]: 34: Hoare triple {41731#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41732#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:09:41,104 INFO L290 TraceCheckUtils]: 35: Hoare triple {41732#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41733#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:09:41,104 INFO L290 TraceCheckUtils]: 36: Hoare triple {41733#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41734#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:09:41,105 INFO L290 TraceCheckUtils]: 37: Hoare triple {41734#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41735#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:09:41,105 INFO L290 TraceCheckUtils]: 38: Hoare triple {41735#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41736#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:09:41,106 INFO L290 TraceCheckUtils]: 39: Hoare triple {41736#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41737#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:09:41,106 INFO L290 TraceCheckUtils]: 40: Hoare triple {41737#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41738#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:09:41,107 INFO L290 TraceCheckUtils]: 41: Hoare triple {41738#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41739#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:09:41,107 INFO L290 TraceCheckUtils]: 42: Hoare triple {41739#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41740#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:09:41,108 INFO L290 TraceCheckUtils]: 43: Hoare triple {41740#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41741#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:09:41,108 INFO L290 TraceCheckUtils]: 44: Hoare triple {41741#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41742#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:09:41,109 INFO L290 TraceCheckUtils]: 45: Hoare triple {41742#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41743#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:09:41,109 INFO L290 TraceCheckUtils]: 46: Hoare triple {41743#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41744#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:09:41,110 INFO L290 TraceCheckUtils]: 47: Hoare triple {41744#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41745#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:09:41,110 INFO L290 TraceCheckUtils]: 48: Hoare triple {41745#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41746#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:09:41,110 INFO L290 TraceCheckUtils]: 49: Hoare triple {41746#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41747#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:09:41,111 INFO L290 TraceCheckUtils]: 50: Hoare triple {41747#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41748#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 03:09:41,111 INFO L290 TraceCheckUtils]: 51: Hoare triple {41748#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41749#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 03:09:41,112 INFO L290 TraceCheckUtils]: 52: Hoare triple {41749#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41750#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 03:09:41,112 INFO L290 TraceCheckUtils]: 53: Hoare triple {41750#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41751#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-28 03:09:41,113 INFO L290 TraceCheckUtils]: 54: Hoare triple {41751#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41752#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-28 03:09:41,113 INFO L290 TraceCheckUtils]: 55: Hoare triple {41752#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41753#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-28 03:09:41,114 INFO L290 TraceCheckUtils]: 56: Hoare triple {41753#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41754#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-28 03:09:41,114 INFO L290 TraceCheckUtils]: 57: Hoare triple {41754#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41755#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-28 03:09:41,115 INFO L290 TraceCheckUtils]: 58: Hoare triple {41755#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41756#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-28 03:09:41,115 INFO L290 TraceCheckUtils]: 59: Hoare triple {41756#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41757#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-28 03:09:41,116 INFO L290 TraceCheckUtils]: 60: Hoare triple {41757#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41758#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-28 03:09:41,116 INFO L290 TraceCheckUtils]: 61: Hoare triple {41758#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41759#(and (<= main_~x~0 112) (<= 112 main_~x~0))} is VALID [2022-04-28 03:09:41,117 INFO L290 TraceCheckUtils]: 62: Hoare triple {41759#(and (<= main_~x~0 112) (<= 112 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41760#(and (<= main_~x~0 114) (<= 114 main_~x~0))} is VALID [2022-04-28 03:09:41,117 INFO L290 TraceCheckUtils]: 63: Hoare triple {41760#(and (<= main_~x~0 114) (<= 114 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41761#(and (<= main_~x~0 116) (<= 116 main_~x~0))} is VALID [2022-04-28 03:09:41,117 INFO L290 TraceCheckUtils]: 64: Hoare triple {41761#(and (<= main_~x~0 116) (<= 116 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41762#(and (<= 118 main_~x~0) (<= main_~x~0 118))} is VALID [2022-04-28 03:09:41,118 INFO L290 TraceCheckUtils]: 65: Hoare triple {41762#(and (<= 118 main_~x~0) (<= main_~x~0 118))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41763#(and (<= main_~x~0 120) (<= 120 main_~x~0))} is VALID [2022-04-28 03:09:41,118 INFO L290 TraceCheckUtils]: 66: Hoare triple {41763#(and (<= main_~x~0 120) (<= 120 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41764#(and (<= 122 main_~x~0) (<= main_~x~0 122))} is VALID [2022-04-28 03:09:41,119 INFO L290 TraceCheckUtils]: 67: Hoare triple {41764#(and (<= 122 main_~x~0) (<= main_~x~0 122))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41765#(and (<= 124 main_~x~0) (<= main_~x~0 124))} is VALID [2022-04-28 03:09:41,119 INFO L290 TraceCheckUtils]: 68: Hoare triple {41765#(and (<= 124 main_~x~0) (<= main_~x~0 124))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {41975#(and (<= 126 main_~x~0) (<= main_~x~0 126))} is VALID [2022-04-28 03:09:41,120 INFO L290 TraceCheckUtils]: 69: Hoare triple {41975#(and (<= 126 main_~x~0) (<= main_~x~0 126))} assume !(~x~0 % 4294967296 < 268435455); {41699#false} is VALID [2022-04-28 03:09:41,120 INFO L272 TraceCheckUtils]: 70: Hoare triple {41699#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {41699#false} is VALID [2022-04-28 03:09:41,120 INFO L290 TraceCheckUtils]: 71: Hoare triple {41699#false} ~cond := #in~cond; {41699#false} is VALID [2022-04-28 03:09:41,120 INFO L290 TraceCheckUtils]: 72: Hoare triple {41699#false} assume 0 == ~cond; {41699#false} is VALID [2022-04-28 03:09:41,120 INFO L290 TraceCheckUtils]: 73: Hoare triple {41699#false} assume !false; {41699#false} is VALID [2022-04-28 03:09:41,120 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:09:41,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:09:48,926 INFO L290 TraceCheckUtils]: 73: Hoare triple {41699#false} assume !false; {41699#false} is VALID [2022-04-28 03:09:48,927 INFO L290 TraceCheckUtils]: 72: Hoare triple {41994#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {41699#false} is VALID [2022-04-28 03:09:48,927 INFO L290 TraceCheckUtils]: 71: Hoare triple {41998#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {41994#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:09:48,928 INFO L272 TraceCheckUtils]: 70: Hoare triple {42002#(not (= (mod main_~x~0 2) 0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {41998#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:09:48,928 INFO L290 TraceCheckUtils]: 69: Hoare triple {42006#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !(~x~0 % 4294967296 < 268435455); {42002#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 03:09:48,929 INFO L290 TraceCheckUtils]: 68: Hoare triple {42010#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42006#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:09:48,932 INFO L290 TraceCheckUtils]: 67: Hoare triple {42014#(or (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42010#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:09:48,933 INFO L290 TraceCheckUtils]: 66: Hoare triple {42018#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42014#(or (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:09:48,934 INFO L290 TraceCheckUtils]: 65: Hoare triple {42022#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42018#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} is VALID [2022-04-28 03:09:48,935 INFO L290 TraceCheckUtils]: 64: Hoare triple {42026#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42022#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} is VALID [2022-04-28 03:09:48,936 INFO L290 TraceCheckUtils]: 63: Hoare triple {42030#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42026#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} is VALID [2022-04-28 03:09:48,940 INFO L290 TraceCheckUtils]: 62: Hoare triple {42034#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42030#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} is VALID [2022-04-28 03:09:48,942 INFO L290 TraceCheckUtils]: 61: Hoare triple {42038#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42034#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:09:48,943 INFO L290 TraceCheckUtils]: 60: Hoare triple {42042#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42038#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:09:48,944 INFO L290 TraceCheckUtils]: 59: Hoare triple {42046#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42042#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:09:48,945 INFO L290 TraceCheckUtils]: 58: Hoare triple {42050#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42046#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} is VALID [2022-04-28 03:09:48,945 INFO L290 TraceCheckUtils]: 57: Hoare triple {42054#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42050#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} is VALID [2022-04-28 03:09:48,946 INFO L290 TraceCheckUtils]: 56: Hoare triple {42058#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42054#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} is VALID [2022-04-28 03:09:48,947 INFO L290 TraceCheckUtils]: 55: Hoare triple {42062#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42058#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} is VALID [2022-04-28 03:09:48,949 INFO L290 TraceCheckUtils]: 54: Hoare triple {42066#(or (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42062#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:09:48,949 INFO L290 TraceCheckUtils]: 53: Hoare triple {42070#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42066#(or (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:09:48,950 INFO L290 TraceCheckUtils]: 52: Hoare triple {42074#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42070#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:09:48,951 INFO L290 TraceCheckUtils]: 51: Hoare triple {42078#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42074#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:09:48,951 INFO L290 TraceCheckUtils]: 50: Hoare triple {42082#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42078#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} is VALID [2022-04-28 03:09:48,952 INFO L290 TraceCheckUtils]: 49: Hoare triple {42086#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42082#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:09:48,953 INFO L290 TraceCheckUtils]: 48: Hoare triple {42090#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42086#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:09:48,954 INFO L290 TraceCheckUtils]: 47: Hoare triple {42094#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42090#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:09:48,955 INFO L290 TraceCheckUtils]: 46: Hoare triple {42098#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42094#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:09:48,955 INFO L290 TraceCheckUtils]: 45: Hoare triple {42102#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42098#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} is VALID [2022-04-28 03:09:48,958 INFO L290 TraceCheckUtils]: 44: Hoare triple {42106#(or (< (mod (+ main_~x~0 50) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42102#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} is VALID [2022-04-28 03:09:48,959 INFO L290 TraceCheckUtils]: 43: Hoare triple {42110#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42106#(or (< (mod (+ main_~x~0 50) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:09:48,972 INFO L290 TraceCheckUtils]: 42: Hoare triple {42114#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42110#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} is VALID [2022-04-28 03:09:48,973 INFO L290 TraceCheckUtils]: 41: Hoare triple {42118#(or (< (mod (+ 56 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42114#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} is VALID [2022-04-28 03:09:48,974 INFO L290 TraceCheckUtils]: 40: Hoare triple {42122#(or (< (mod (+ main_~x~0 58) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42118#(or (< (mod (+ 56 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:09:48,975 INFO L290 TraceCheckUtils]: 39: Hoare triple {42126#(or (< (mod (+ main_~x~0 60) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42122#(or (< (mod (+ main_~x~0 58) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:09:48,977 INFO L290 TraceCheckUtils]: 38: Hoare triple {42130#(or (< (mod (+ main_~x~0 62) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42126#(or (< (mod (+ main_~x~0 60) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:09:48,977 INFO L290 TraceCheckUtils]: 37: Hoare triple {42134#(or (< (mod (+ 64 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42130#(or (< (mod (+ main_~x~0 62) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:09:48,978 INFO L290 TraceCheckUtils]: 36: Hoare triple {42138#(or (< (mod (+ 66 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42134#(or (< (mod (+ 64 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:09:48,979 INFO L290 TraceCheckUtils]: 35: Hoare triple {42142#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 68 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42138#(or (< (mod (+ 66 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:09:48,980 INFO L290 TraceCheckUtils]: 34: Hoare triple {42146#(or (< (mod (+ main_~x~0 70) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42142#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 68 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:09:48,981 INFO L290 TraceCheckUtils]: 33: Hoare triple {42150#(or (< (mod (+ 72 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42146#(or (< (mod (+ main_~x~0 70) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:09:48,981 INFO L290 TraceCheckUtils]: 32: Hoare triple {42154#(or (< (mod (+ main_~x~0 74) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42150#(or (< (mod (+ 72 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:09:48,982 INFO L290 TraceCheckUtils]: 31: Hoare triple {42158#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 76 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42154#(or (< (mod (+ main_~x~0 74) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:09:48,983 INFO L290 TraceCheckUtils]: 30: Hoare triple {42162#(or (< (mod (+ main_~x~0 78) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42158#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 76 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:09:48,985 INFO L290 TraceCheckUtils]: 29: Hoare triple {42166#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 80) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42162#(or (< (mod (+ main_~x~0 78) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:09:48,986 INFO L290 TraceCheckUtils]: 28: Hoare triple {42170#(or (< (mod (+ main_~x~0 82) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42166#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 80) 4294967296) 268435455))} is VALID [2022-04-28 03:09:48,986 INFO L290 TraceCheckUtils]: 27: Hoare triple {42174#(or (< (mod (+ 84 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42170#(or (< (mod (+ main_~x~0 82) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:09:48,987 INFO L290 TraceCheckUtils]: 26: Hoare triple {42178#(or (< (mod (+ main_~x~0 86) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42174#(or (< (mod (+ 84 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:09:48,988 INFO L290 TraceCheckUtils]: 25: Hoare triple {42182#(or (< (mod (+ 88 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42178#(or (< (mod (+ main_~x~0 86) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:09:48,988 INFO L290 TraceCheckUtils]: 24: Hoare triple {42186#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 90) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42182#(or (< (mod (+ 88 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:09:48,993 INFO L290 TraceCheckUtils]: 23: Hoare triple {42190#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 92 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42186#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 90) 4294967296) 268435455))} is VALID [2022-04-28 03:09:48,997 INFO L290 TraceCheckUtils]: 22: Hoare triple {42194#(or (< (mod (+ 94 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42190#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 92 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:09:48,998 INFO L290 TraceCheckUtils]: 21: Hoare triple {42198#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 96) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42194#(or (< (mod (+ 94 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:09:48,999 INFO L290 TraceCheckUtils]: 20: Hoare triple {42202#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 98 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42198#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 96) 4294967296) 268435455))} is VALID [2022-04-28 03:09:48,999 INFO L290 TraceCheckUtils]: 19: Hoare triple {42206#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 100) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42202#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 98 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:09:49,000 INFO L290 TraceCheckUtils]: 18: Hoare triple {42210#(or (< (mod (+ main_~x~0 102) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42206#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 100) 4294967296) 268435455))} is VALID [2022-04-28 03:09:49,001 INFO L290 TraceCheckUtils]: 17: Hoare triple {42214#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 104 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42210#(or (< (mod (+ main_~x~0 102) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:09:49,001 INFO L290 TraceCheckUtils]: 16: Hoare triple {42218#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 106 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42214#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 104 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:09:49,002 INFO L290 TraceCheckUtils]: 15: Hoare triple {42222#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 108 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42218#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 106 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:09:49,008 INFO L290 TraceCheckUtils]: 14: Hoare triple {42226#(or (< (mod (+ 110 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42222#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 108 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:09:49,009 INFO L290 TraceCheckUtils]: 13: Hoare triple {42230#(or (< (mod (+ 112 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42226#(or (< (mod (+ 110 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:09:49,013 INFO L290 TraceCheckUtils]: 12: Hoare triple {42234#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 114) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42230#(or (< (mod (+ 112 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:09:49,013 INFO L290 TraceCheckUtils]: 11: Hoare triple {42238#(or (< (mod (+ 116 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42234#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 114) 4294967296) 268435455))} is VALID [2022-04-28 03:09:49,014 INFO L290 TraceCheckUtils]: 10: Hoare triple {42242#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 118) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42238#(or (< (mod (+ 116 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:09:49,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {42246#(or (< (mod (+ main_~x~0 120) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42242#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 118) 4294967296) 268435455))} is VALID [2022-04-28 03:09:49,017 INFO L290 TraceCheckUtils]: 8: Hoare triple {42250#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 122) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42246#(or (< (mod (+ main_~x~0 120) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:09:49,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {42254#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 124) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42250#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 122) 4294967296) 268435455))} is VALID [2022-04-28 03:09:49,019 INFO L290 TraceCheckUtils]: 6: Hoare triple {42258#(or (< (mod (+ main_~x~0 126) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42254#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 124) 4294967296) 268435455))} is VALID [2022-04-28 03:09:49,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {41698#true} ~x~0 := 0; {42258#(or (< (mod (+ main_~x~0 126) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:09:49,019 INFO L272 TraceCheckUtils]: 4: Hoare triple {41698#true} call #t~ret4 := main(); {41698#true} is VALID [2022-04-28 03:09:49,019 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41698#true} {41698#true} #34#return; {41698#true} is VALID [2022-04-28 03:09:49,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {41698#true} assume true; {41698#true} is VALID [2022-04-28 03:09:49,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {41698#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {41698#true} is VALID [2022-04-28 03:09:49,020 INFO L272 TraceCheckUtils]: 0: Hoare triple {41698#true} call ULTIMATE.init(); {41698#true} is VALID [2022-04-28 03:09:49,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:09:49,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724705501] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:09:49,021 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:09:49,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 66, 69] total 135 [2022-04-28 03:09:49,021 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:09:49,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1165804337] [2022-04-28 03:09:49,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1165804337] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:09:49,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:09:49,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [67] imperfect sequences [] total 67 [2022-04-28 03:09:49,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708892815] [2022-04-28 03:09:49,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:09:49,021 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.044776119402985) internal successors, (70), 66 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-04-28 03:09:49,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:09:49,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 67 states, 67 states have (on average 1.044776119402985) internal successors, (70), 66 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:49,057 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:09:49,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-04-28 03:09:49,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:49,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-04-28 03:09:49,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4555, Invalid=13535, Unknown=0, NotChecked=0, Total=18090 [2022-04-28 03:09:49,059 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand has 67 states, 67 states have (on average 1.044776119402985) internal successors, (70), 66 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:56,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:56,678 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2022-04-28 03:09:56,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-04-28 03:09:56,678 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 1.044776119402985) internal successors, (70), 66 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-04-28 03:09:56,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:09:56,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 1.044776119402985) internal successors, (70), 66 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:56,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2022-04-28 03:09:56,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 1.044776119402985) internal successors, (70), 66 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:56,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2022-04-28 03:09:56,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 81 transitions. [2022-04-28 03:09:56,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:09:56,727 INFO L225 Difference]: With dead ends: 81 [2022-04-28 03:09:56,727 INFO L226 Difference]: Without dead ends: 76 [2022-04-28 03:09:56,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2154 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=9033, Invalid=30369, Unknown=0, NotChecked=0, Total=39402 [2022-04-28 03:09:56,729 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 4274 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 4403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 4274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:09:56,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 253 Invalid, 4403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 4274 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-04-28 03:09:56,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-28 03:09:56,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-28 03:09:56,811 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:09:56,811 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 76 states, 71 states have (on average 1.0140845070422535) internal successors, (72), 71 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:56,811 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 76 states, 71 states have (on average 1.0140845070422535) internal successors, (72), 71 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:56,811 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 76 states, 71 states have (on average 1.0140845070422535) internal successors, (72), 71 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:56,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:56,812 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2022-04-28 03:09:56,812 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2022-04-28 03:09:56,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:56,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:56,812 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 71 states have (on average 1.0140845070422535) internal successors, (72), 71 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 76 states. [2022-04-28 03:09:56,812 INFO L87 Difference]: Start difference. First operand has 76 states, 71 states have (on average 1.0140845070422535) internal successors, (72), 71 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 76 states. [2022-04-28 03:09:56,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:09:56,813 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2022-04-28 03:09:56,813 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2022-04-28 03:09:56,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:09:56,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:09:56,813 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:09:56,813 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:09:56,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 71 states have (on average 1.0140845070422535) internal successors, (72), 71 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:56,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2022-04-28 03:09:56,814 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2022-04-28 03:09:56,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:09:56,814 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2022-04-28 03:09:56,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 1.044776119402985) internal successors, (70), 66 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:09:56,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 76 transitions. [2022-04-28 03:09:56,868 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:56,868 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2022-04-28 03:09:56,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-28 03:09:56,868 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:09:56,868 INFO L195 NwaCegarLoop]: trace histogram [64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:09:56,874 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Forceful destruction successful, exit code 0 [2022-04-28 03:09:57,075 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Forceful destruction successful, exit code 0 [2022-04-28 03:09:57,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 126 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable126,SelfDestructingSolverStorable127,127 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:09:57,270 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:09:57,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:09:57,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1307659300, now seen corresponding path program 127 times [2022-04-28 03:09:57,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:09:57,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1832602355] [2022-04-28 03:09:57,423 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:57,424 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:09:57,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1856328887, now seen corresponding path program 1 times [2022-04-28 03:09:57,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:57,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206860261] [2022-04-28 03:09:57,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:57,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:57,434 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_64.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_64.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:09:57,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:09:57,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1142799866] [2022-04-28 03:09:57,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:57,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:09:57,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:09:57,444 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:09:57,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Waiting until timeout for monitored process [2022-04-28 03:09:57,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:09:57,493 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:09:57,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:09:57,501 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:09:57,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1307659300, now seen corresponding path program 128 times [2022-04-28 03:09:57,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:09:57,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413301507] [2022-04-28 03:09:57,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:09:57,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:09:57,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:59,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:09:59,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:59,346 INFO L290 TraceCheckUtils]: 0: Hoare triple {42943#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {42873#true} is VALID [2022-04-28 03:09:59,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {42873#true} assume true; {42873#true} is VALID [2022-04-28 03:09:59,346 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42873#true} {42873#true} #34#return; {42873#true} is VALID [2022-04-28 03:09:59,347 INFO L272 TraceCheckUtils]: 0: Hoare triple {42873#true} call ULTIMATE.init(); {42943#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:09:59,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {42943#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {42873#true} is VALID [2022-04-28 03:09:59,347 INFO L290 TraceCheckUtils]: 2: Hoare triple {42873#true} assume true; {42873#true} is VALID [2022-04-28 03:09:59,347 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42873#true} {42873#true} #34#return; {42873#true} is VALID [2022-04-28 03:09:59,347 INFO L272 TraceCheckUtils]: 4: Hoare triple {42873#true} call #t~ret4 := main(); {42873#true} is VALID [2022-04-28 03:09:59,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {42873#true} ~x~0 := 0; {42878#(= main_~x~0 0)} is VALID [2022-04-28 03:09:59,355 INFO L290 TraceCheckUtils]: 6: Hoare triple {42878#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42879#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:09:59,355 INFO L290 TraceCheckUtils]: 7: Hoare triple {42879#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42880#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:09:59,356 INFO L290 TraceCheckUtils]: 8: Hoare triple {42880#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42881#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:09:59,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {42881#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42882#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:09:59,357 INFO L290 TraceCheckUtils]: 10: Hoare triple {42882#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42883#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:09:59,357 INFO L290 TraceCheckUtils]: 11: Hoare triple {42883#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42884#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:09:59,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {42884#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42885#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:09:59,358 INFO L290 TraceCheckUtils]: 13: Hoare triple {42885#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42886#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:09:59,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {42886#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42887#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:09:59,359 INFO L290 TraceCheckUtils]: 15: Hoare triple {42887#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42888#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:09:59,359 INFO L290 TraceCheckUtils]: 16: Hoare triple {42888#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42889#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:09:59,360 INFO L290 TraceCheckUtils]: 17: Hoare triple {42889#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42890#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:09:59,360 INFO L290 TraceCheckUtils]: 18: Hoare triple {42890#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42891#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:09:59,361 INFO L290 TraceCheckUtils]: 19: Hoare triple {42891#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42892#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:09:59,361 INFO L290 TraceCheckUtils]: 20: Hoare triple {42892#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42893#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:09:59,362 INFO L290 TraceCheckUtils]: 21: Hoare triple {42893#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42894#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:09:59,362 INFO L290 TraceCheckUtils]: 22: Hoare triple {42894#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42895#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:09:59,363 INFO L290 TraceCheckUtils]: 23: Hoare triple {42895#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42896#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:09:59,363 INFO L290 TraceCheckUtils]: 24: Hoare triple {42896#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42897#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:09:59,364 INFO L290 TraceCheckUtils]: 25: Hoare triple {42897#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42898#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:09:59,364 INFO L290 TraceCheckUtils]: 26: Hoare triple {42898#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42899#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:09:59,365 INFO L290 TraceCheckUtils]: 27: Hoare triple {42899#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42900#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:09:59,365 INFO L290 TraceCheckUtils]: 28: Hoare triple {42900#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42901#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:09:59,366 INFO L290 TraceCheckUtils]: 29: Hoare triple {42901#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42902#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:09:59,366 INFO L290 TraceCheckUtils]: 30: Hoare triple {42902#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42903#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:09:59,366 INFO L290 TraceCheckUtils]: 31: Hoare triple {42903#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42904#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:09:59,367 INFO L290 TraceCheckUtils]: 32: Hoare triple {42904#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42905#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:09:59,367 INFO L290 TraceCheckUtils]: 33: Hoare triple {42905#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42906#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:09:59,368 INFO L290 TraceCheckUtils]: 34: Hoare triple {42906#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42907#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:09:59,368 INFO L290 TraceCheckUtils]: 35: Hoare triple {42907#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42908#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:09:59,369 INFO L290 TraceCheckUtils]: 36: Hoare triple {42908#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42909#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:09:59,369 INFO L290 TraceCheckUtils]: 37: Hoare triple {42909#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42910#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:09:59,370 INFO L290 TraceCheckUtils]: 38: Hoare triple {42910#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42911#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:09:59,370 INFO L290 TraceCheckUtils]: 39: Hoare triple {42911#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42912#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:09:59,371 INFO L290 TraceCheckUtils]: 40: Hoare triple {42912#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42913#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:09:59,371 INFO L290 TraceCheckUtils]: 41: Hoare triple {42913#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42914#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:09:59,372 INFO L290 TraceCheckUtils]: 42: Hoare triple {42914#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42915#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:09:59,372 INFO L290 TraceCheckUtils]: 43: Hoare triple {42915#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42916#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:09:59,372 INFO L290 TraceCheckUtils]: 44: Hoare triple {42916#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42917#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:09:59,373 INFO L290 TraceCheckUtils]: 45: Hoare triple {42917#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42918#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:09:59,373 INFO L290 TraceCheckUtils]: 46: Hoare triple {42918#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42919#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:09:59,374 INFO L290 TraceCheckUtils]: 47: Hoare triple {42919#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42920#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:09:59,374 INFO L290 TraceCheckUtils]: 48: Hoare triple {42920#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42921#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:09:59,375 INFO L290 TraceCheckUtils]: 49: Hoare triple {42921#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42922#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:09:59,375 INFO L290 TraceCheckUtils]: 50: Hoare triple {42922#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42923#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 03:09:59,376 INFO L290 TraceCheckUtils]: 51: Hoare triple {42923#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42924#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 03:09:59,376 INFO L290 TraceCheckUtils]: 52: Hoare triple {42924#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42925#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 03:09:59,377 INFO L290 TraceCheckUtils]: 53: Hoare triple {42925#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42926#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-28 03:09:59,377 INFO L290 TraceCheckUtils]: 54: Hoare triple {42926#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42927#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-28 03:09:59,378 INFO L290 TraceCheckUtils]: 55: Hoare triple {42927#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42928#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-28 03:09:59,378 INFO L290 TraceCheckUtils]: 56: Hoare triple {42928#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42929#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-28 03:09:59,379 INFO L290 TraceCheckUtils]: 57: Hoare triple {42929#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42930#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-28 03:09:59,379 INFO L290 TraceCheckUtils]: 58: Hoare triple {42930#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42931#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-28 03:09:59,379 INFO L290 TraceCheckUtils]: 59: Hoare triple {42931#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42932#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-28 03:09:59,380 INFO L290 TraceCheckUtils]: 60: Hoare triple {42932#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42933#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-28 03:09:59,380 INFO L290 TraceCheckUtils]: 61: Hoare triple {42933#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42934#(and (<= main_~x~0 112) (<= 112 main_~x~0))} is VALID [2022-04-28 03:09:59,381 INFO L290 TraceCheckUtils]: 62: Hoare triple {42934#(and (<= main_~x~0 112) (<= 112 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42935#(and (<= main_~x~0 114) (<= 114 main_~x~0))} is VALID [2022-04-28 03:09:59,381 INFO L290 TraceCheckUtils]: 63: Hoare triple {42935#(and (<= main_~x~0 114) (<= 114 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42936#(and (<= main_~x~0 116) (<= 116 main_~x~0))} is VALID [2022-04-28 03:09:59,382 INFO L290 TraceCheckUtils]: 64: Hoare triple {42936#(and (<= main_~x~0 116) (<= 116 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42937#(and (<= 118 main_~x~0) (<= main_~x~0 118))} is VALID [2022-04-28 03:09:59,382 INFO L290 TraceCheckUtils]: 65: Hoare triple {42937#(and (<= 118 main_~x~0) (<= main_~x~0 118))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42938#(and (<= main_~x~0 120) (<= 120 main_~x~0))} is VALID [2022-04-28 03:09:59,383 INFO L290 TraceCheckUtils]: 66: Hoare triple {42938#(and (<= main_~x~0 120) (<= 120 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42939#(and (<= 122 main_~x~0) (<= main_~x~0 122))} is VALID [2022-04-28 03:09:59,383 INFO L290 TraceCheckUtils]: 67: Hoare triple {42939#(and (<= 122 main_~x~0) (<= main_~x~0 122))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42940#(and (<= 124 main_~x~0) (<= main_~x~0 124))} is VALID [2022-04-28 03:09:59,384 INFO L290 TraceCheckUtils]: 68: Hoare triple {42940#(and (<= 124 main_~x~0) (<= main_~x~0 124))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42941#(and (<= 126 main_~x~0) (<= main_~x~0 126))} is VALID [2022-04-28 03:09:59,384 INFO L290 TraceCheckUtils]: 69: Hoare triple {42941#(and (<= 126 main_~x~0) (<= main_~x~0 126))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42942#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 128))} is VALID [2022-04-28 03:09:59,385 INFO L290 TraceCheckUtils]: 70: Hoare triple {42942#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 128))} assume !(~x~0 % 4294967296 < 268435455); {42874#false} is VALID [2022-04-28 03:09:59,385 INFO L272 TraceCheckUtils]: 71: Hoare triple {42874#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {42874#false} is VALID [2022-04-28 03:09:59,385 INFO L290 TraceCheckUtils]: 72: Hoare triple {42874#false} ~cond := #in~cond; {42874#false} is VALID [2022-04-28 03:09:59,385 INFO L290 TraceCheckUtils]: 73: Hoare triple {42874#false} assume 0 == ~cond; {42874#false} is VALID [2022-04-28 03:09:59,385 INFO L290 TraceCheckUtils]: 74: Hoare triple {42874#false} assume !false; {42874#false} is VALID [2022-04-28 03:09:59,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:09:59,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:09:59,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413301507] [2022-04-28 03:09:59,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413301507] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:09:59,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080080877] [2022-04-28 03:09:59,386 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:09:59,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:09:59,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:09:59,387 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:09:59,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Waiting until timeout for monitored process [2022-04-28 03:09:59,538 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:09:59,538 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:09:59,540 WARN L261 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 131 conjunts are in the unsatisfiable core [2022-04-28 03:09:59,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:09:59,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:10:00,239 INFO L272 TraceCheckUtils]: 0: Hoare triple {42873#true} call ULTIMATE.init(); {42873#true} is VALID [2022-04-28 03:10:00,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {42873#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {42873#true} is VALID [2022-04-28 03:10:00,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {42873#true} assume true; {42873#true} is VALID [2022-04-28 03:10:00,240 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42873#true} {42873#true} #34#return; {42873#true} is VALID [2022-04-28 03:10:00,240 INFO L272 TraceCheckUtils]: 4: Hoare triple {42873#true} call #t~ret4 := main(); {42873#true} is VALID [2022-04-28 03:10:00,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {42873#true} ~x~0 := 0; {42878#(= main_~x~0 0)} is VALID [2022-04-28 03:10:00,241 INFO L290 TraceCheckUtils]: 6: Hoare triple {42878#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42879#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:10:00,241 INFO L290 TraceCheckUtils]: 7: Hoare triple {42879#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42880#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:10:00,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {42880#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42881#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:10:00,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {42881#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42882#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:10:00,242 INFO L290 TraceCheckUtils]: 10: Hoare triple {42882#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42883#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:10:00,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {42883#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42884#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:10:00,243 INFO L290 TraceCheckUtils]: 12: Hoare triple {42884#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42885#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:10:00,244 INFO L290 TraceCheckUtils]: 13: Hoare triple {42885#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42886#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:10:00,244 INFO L290 TraceCheckUtils]: 14: Hoare triple {42886#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42887#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:10:00,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {42887#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42888#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:10:00,245 INFO L290 TraceCheckUtils]: 16: Hoare triple {42888#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42889#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:10:00,246 INFO L290 TraceCheckUtils]: 17: Hoare triple {42889#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42890#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:10:00,246 INFO L290 TraceCheckUtils]: 18: Hoare triple {42890#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42891#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:10:00,247 INFO L290 TraceCheckUtils]: 19: Hoare triple {42891#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42892#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:10:00,247 INFO L290 TraceCheckUtils]: 20: Hoare triple {42892#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42893#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:10:00,248 INFO L290 TraceCheckUtils]: 21: Hoare triple {42893#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42894#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:10:00,248 INFO L290 TraceCheckUtils]: 22: Hoare triple {42894#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42895#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:10:00,249 INFO L290 TraceCheckUtils]: 23: Hoare triple {42895#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42896#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:10:00,249 INFO L290 TraceCheckUtils]: 24: Hoare triple {42896#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42897#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:10:00,250 INFO L290 TraceCheckUtils]: 25: Hoare triple {42897#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42898#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:10:00,250 INFO L290 TraceCheckUtils]: 26: Hoare triple {42898#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42899#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:10:00,250 INFO L290 TraceCheckUtils]: 27: Hoare triple {42899#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42900#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:10:00,251 INFO L290 TraceCheckUtils]: 28: Hoare triple {42900#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42901#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:10:00,251 INFO L290 TraceCheckUtils]: 29: Hoare triple {42901#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42902#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:10:00,252 INFO L290 TraceCheckUtils]: 30: Hoare triple {42902#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42903#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:10:00,252 INFO L290 TraceCheckUtils]: 31: Hoare triple {42903#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42904#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:10:00,253 INFO L290 TraceCheckUtils]: 32: Hoare triple {42904#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42905#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:10:00,253 INFO L290 TraceCheckUtils]: 33: Hoare triple {42905#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42906#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:10:00,254 INFO L290 TraceCheckUtils]: 34: Hoare triple {42906#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42907#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:10:00,254 INFO L290 TraceCheckUtils]: 35: Hoare triple {42907#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42908#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:10:00,255 INFO L290 TraceCheckUtils]: 36: Hoare triple {42908#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42909#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:10:00,255 INFO L290 TraceCheckUtils]: 37: Hoare triple {42909#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42910#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:10:00,256 INFO L290 TraceCheckUtils]: 38: Hoare triple {42910#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42911#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:10:00,256 INFO L290 TraceCheckUtils]: 39: Hoare triple {42911#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42912#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:10:00,257 INFO L290 TraceCheckUtils]: 40: Hoare triple {42912#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42913#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:10:00,257 INFO L290 TraceCheckUtils]: 41: Hoare triple {42913#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42914#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:10:00,258 INFO L290 TraceCheckUtils]: 42: Hoare triple {42914#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42915#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:10:00,258 INFO L290 TraceCheckUtils]: 43: Hoare triple {42915#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42916#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:10:00,259 INFO L290 TraceCheckUtils]: 44: Hoare triple {42916#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42917#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:10:00,259 INFO L290 TraceCheckUtils]: 45: Hoare triple {42917#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42918#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:10:00,259 INFO L290 TraceCheckUtils]: 46: Hoare triple {42918#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42919#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:10:00,260 INFO L290 TraceCheckUtils]: 47: Hoare triple {42919#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42920#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:10:00,260 INFO L290 TraceCheckUtils]: 48: Hoare triple {42920#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42921#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:10:00,261 INFO L290 TraceCheckUtils]: 49: Hoare triple {42921#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42922#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:10:00,261 INFO L290 TraceCheckUtils]: 50: Hoare triple {42922#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42923#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 03:10:00,262 INFO L290 TraceCheckUtils]: 51: Hoare triple {42923#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42924#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 03:10:00,262 INFO L290 TraceCheckUtils]: 52: Hoare triple {42924#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42925#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 03:10:00,263 INFO L290 TraceCheckUtils]: 53: Hoare triple {42925#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42926#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-28 03:10:00,263 INFO L290 TraceCheckUtils]: 54: Hoare triple {42926#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42927#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-28 03:10:00,264 INFO L290 TraceCheckUtils]: 55: Hoare triple {42927#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42928#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-28 03:10:00,264 INFO L290 TraceCheckUtils]: 56: Hoare triple {42928#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42929#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-28 03:10:00,265 INFO L290 TraceCheckUtils]: 57: Hoare triple {42929#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42930#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-28 03:10:00,265 INFO L290 TraceCheckUtils]: 58: Hoare triple {42930#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42931#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-28 03:10:00,265 INFO L290 TraceCheckUtils]: 59: Hoare triple {42931#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42932#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-28 03:10:00,266 INFO L290 TraceCheckUtils]: 60: Hoare triple {42932#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42933#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-28 03:10:00,266 INFO L290 TraceCheckUtils]: 61: Hoare triple {42933#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42934#(and (<= main_~x~0 112) (<= 112 main_~x~0))} is VALID [2022-04-28 03:10:00,267 INFO L290 TraceCheckUtils]: 62: Hoare triple {42934#(and (<= main_~x~0 112) (<= 112 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42935#(and (<= main_~x~0 114) (<= 114 main_~x~0))} is VALID [2022-04-28 03:10:00,267 INFO L290 TraceCheckUtils]: 63: Hoare triple {42935#(and (<= main_~x~0 114) (<= 114 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42936#(and (<= main_~x~0 116) (<= 116 main_~x~0))} is VALID [2022-04-28 03:10:00,268 INFO L290 TraceCheckUtils]: 64: Hoare triple {42936#(and (<= main_~x~0 116) (<= 116 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42937#(and (<= 118 main_~x~0) (<= main_~x~0 118))} is VALID [2022-04-28 03:10:00,268 INFO L290 TraceCheckUtils]: 65: Hoare triple {42937#(and (<= 118 main_~x~0) (<= main_~x~0 118))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42938#(and (<= main_~x~0 120) (<= 120 main_~x~0))} is VALID [2022-04-28 03:10:00,269 INFO L290 TraceCheckUtils]: 66: Hoare triple {42938#(and (<= main_~x~0 120) (<= 120 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42939#(and (<= 122 main_~x~0) (<= main_~x~0 122))} is VALID [2022-04-28 03:10:00,269 INFO L290 TraceCheckUtils]: 67: Hoare triple {42939#(and (<= 122 main_~x~0) (<= main_~x~0 122))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42940#(and (<= 124 main_~x~0) (<= main_~x~0 124))} is VALID [2022-04-28 03:10:00,270 INFO L290 TraceCheckUtils]: 68: Hoare triple {42940#(and (<= 124 main_~x~0) (<= main_~x~0 124))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {42941#(and (<= 126 main_~x~0) (<= main_~x~0 126))} is VALID [2022-04-28 03:10:00,270 INFO L290 TraceCheckUtils]: 69: Hoare triple {42941#(and (<= 126 main_~x~0) (<= main_~x~0 126))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43154#(and (<= 128 main_~x~0) (<= main_~x~0 128))} is VALID [2022-04-28 03:10:00,271 INFO L290 TraceCheckUtils]: 70: Hoare triple {43154#(and (<= 128 main_~x~0) (<= main_~x~0 128))} assume !(~x~0 % 4294967296 < 268435455); {42874#false} is VALID [2022-04-28 03:10:00,271 INFO L272 TraceCheckUtils]: 71: Hoare triple {42874#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {42874#false} is VALID [2022-04-28 03:10:00,271 INFO L290 TraceCheckUtils]: 72: Hoare triple {42874#false} ~cond := #in~cond; {42874#false} is VALID [2022-04-28 03:10:00,271 INFO L290 TraceCheckUtils]: 73: Hoare triple {42874#false} assume 0 == ~cond; {42874#false} is VALID [2022-04-28 03:10:00,271 INFO L290 TraceCheckUtils]: 74: Hoare triple {42874#false} assume !false; {42874#false} is VALID [2022-04-28 03:10:00,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:10:00,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:10:06,309 INFO L290 TraceCheckUtils]: 74: Hoare triple {42874#false} assume !false; {42874#false} is VALID [2022-04-28 03:10:06,310 INFO L290 TraceCheckUtils]: 73: Hoare triple {42874#false} assume 0 == ~cond; {42874#false} is VALID [2022-04-28 03:10:06,310 INFO L290 TraceCheckUtils]: 72: Hoare triple {42874#false} ~cond := #in~cond; {42874#false} is VALID [2022-04-28 03:10:06,310 INFO L272 TraceCheckUtils]: 71: Hoare triple {42874#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {42874#false} is VALID [2022-04-28 03:10:06,310 INFO L290 TraceCheckUtils]: 70: Hoare triple {43182#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {42874#false} is VALID [2022-04-28 03:10:06,311 INFO L290 TraceCheckUtils]: 69: Hoare triple {43186#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43182#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,311 INFO L290 TraceCheckUtils]: 68: Hoare triple {43190#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43186#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,312 INFO L290 TraceCheckUtils]: 67: Hoare triple {43194#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43190#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,313 INFO L290 TraceCheckUtils]: 66: Hoare triple {43198#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43194#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,313 INFO L290 TraceCheckUtils]: 65: Hoare triple {43202#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43198#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,314 INFO L290 TraceCheckUtils]: 64: Hoare triple {43206#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43202#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,314 INFO L290 TraceCheckUtils]: 63: Hoare triple {43210#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43206#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,315 INFO L290 TraceCheckUtils]: 62: Hoare triple {43214#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43210#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,324 INFO L290 TraceCheckUtils]: 61: Hoare triple {43218#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43214#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,325 INFO L290 TraceCheckUtils]: 60: Hoare triple {43222#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43218#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,325 INFO L290 TraceCheckUtils]: 59: Hoare triple {43226#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43222#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,326 INFO L290 TraceCheckUtils]: 58: Hoare triple {43230#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43226#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,327 INFO L290 TraceCheckUtils]: 57: Hoare triple {43234#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43230#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,327 INFO L290 TraceCheckUtils]: 56: Hoare triple {43238#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43234#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,328 INFO L290 TraceCheckUtils]: 55: Hoare triple {43242#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43238#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,328 INFO L290 TraceCheckUtils]: 54: Hoare triple {43246#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43242#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,329 INFO L290 TraceCheckUtils]: 53: Hoare triple {43250#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43246#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,330 INFO L290 TraceCheckUtils]: 52: Hoare triple {43254#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43250#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,330 INFO L290 TraceCheckUtils]: 51: Hoare triple {43258#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43254#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,331 INFO L290 TraceCheckUtils]: 50: Hoare triple {43262#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43258#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,331 INFO L290 TraceCheckUtils]: 49: Hoare triple {43266#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43262#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,332 INFO L290 TraceCheckUtils]: 48: Hoare triple {43270#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43266#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,333 INFO L290 TraceCheckUtils]: 47: Hoare triple {43274#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43270#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,334 INFO L290 TraceCheckUtils]: 46: Hoare triple {43278#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43274#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,335 INFO L290 TraceCheckUtils]: 45: Hoare triple {43282#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43278#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,335 INFO L290 TraceCheckUtils]: 44: Hoare triple {43286#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43282#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,336 INFO L290 TraceCheckUtils]: 43: Hoare triple {43290#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43286#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,336 INFO L290 TraceCheckUtils]: 42: Hoare triple {43294#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43290#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,337 INFO L290 TraceCheckUtils]: 41: Hoare triple {43298#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43294#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,337 INFO L290 TraceCheckUtils]: 40: Hoare triple {43302#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43298#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,338 INFO L290 TraceCheckUtils]: 39: Hoare triple {43306#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43302#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,339 INFO L290 TraceCheckUtils]: 38: Hoare triple {43310#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43306#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,339 INFO L290 TraceCheckUtils]: 37: Hoare triple {43314#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43310#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,340 INFO L290 TraceCheckUtils]: 36: Hoare triple {43318#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43314#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,340 INFO L290 TraceCheckUtils]: 35: Hoare triple {43322#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43318#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,341 INFO L290 TraceCheckUtils]: 34: Hoare triple {43326#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43322#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,342 INFO L290 TraceCheckUtils]: 33: Hoare triple {43330#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43326#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,342 INFO L290 TraceCheckUtils]: 32: Hoare triple {43334#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43330#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,343 INFO L290 TraceCheckUtils]: 31: Hoare triple {43338#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43334#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,344 INFO L290 TraceCheckUtils]: 30: Hoare triple {43342#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43338#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,345 INFO L290 TraceCheckUtils]: 29: Hoare triple {43346#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43342#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,345 INFO L290 TraceCheckUtils]: 28: Hoare triple {43350#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43346#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,346 INFO L290 TraceCheckUtils]: 27: Hoare triple {43354#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43350#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,348 INFO L290 TraceCheckUtils]: 26: Hoare triple {43358#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43354#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,349 INFO L290 TraceCheckUtils]: 25: Hoare triple {43362#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43358#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,350 INFO L290 TraceCheckUtils]: 24: Hoare triple {43366#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43362#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,350 INFO L290 TraceCheckUtils]: 23: Hoare triple {43370#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43366#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,351 INFO L290 TraceCheckUtils]: 22: Hoare triple {43374#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43370#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,351 INFO L290 TraceCheckUtils]: 21: Hoare triple {43378#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43374#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,355 INFO L290 TraceCheckUtils]: 20: Hoare triple {43382#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43378#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,355 INFO L290 TraceCheckUtils]: 19: Hoare triple {43386#(< (mod (+ main_~x~0 102) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43382#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,356 INFO L290 TraceCheckUtils]: 18: Hoare triple {43390#(< (mod (+ 104 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43386#(< (mod (+ main_~x~0 102) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,357 INFO L290 TraceCheckUtils]: 17: Hoare triple {43394#(< (mod (+ 106 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43390#(< (mod (+ 104 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,357 INFO L290 TraceCheckUtils]: 16: Hoare triple {43398#(< (mod (+ 108 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43394#(< (mod (+ 106 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,358 INFO L290 TraceCheckUtils]: 15: Hoare triple {43402#(< (mod (+ 110 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43398#(< (mod (+ 108 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,358 INFO L290 TraceCheckUtils]: 14: Hoare triple {43406#(< (mod (+ 112 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43402#(< (mod (+ 110 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {43410#(< (mod (+ main_~x~0 114) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43406#(< (mod (+ 112 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {43414#(< (mod (+ 116 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43410#(< (mod (+ main_~x~0 114) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {43418#(< (mod (+ main_~x~0 118) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43414#(< (mod (+ 116 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,361 INFO L290 TraceCheckUtils]: 10: Hoare triple {43422#(< (mod (+ main_~x~0 120) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43418#(< (mod (+ main_~x~0 118) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,361 INFO L290 TraceCheckUtils]: 9: Hoare triple {43426#(< (mod (+ main_~x~0 122) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43422#(< (mod (+ main_~x~0 120) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,362 INFO L290 TraceCheckUtils]: 8: Hoare triple {43430#(< (mod (+ main_~x~0 124) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43426#(< (mod (+ main_~x~0 122) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {43434#(< (mod (+ main_~x~0 126) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43430#(< (mod (+ main_~x~0 124) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {43438#(< (mod (+ main_~x~0 128) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {43434#(< (mod (+ main_~x~0 126) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,364 INFO L290 TraceCheckUtils]: 5: Hoare triple {42873#true} ~x~0 := 0; {43438#(< (mod (+ main_~x~0 128) 4294967296) 268435455)} is VALID [2022-04-28 03:10:06,364 INFO L272 TraceCheckUtils]: 4: Hoare triple {42873#true} call #t~ret4 := main(); {42873#true} is VALID [2022-04-28 03:10:06,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42873#true} {42873#true} #34#return; {42873#true} is VALID [2022-04-28 03:10:06,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {42873#true} assume true; {42873#true} is VALID [2022-04-28 03:10:06,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {42873#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {42873#true} is VALID [2022-04-28 03:10:06,364 INFO L272 TraceCheckUtils]: 0: Hoare triple {42873#true} call ULTIMATE.init(); {42873#true} is VALID [2022-04-28 03:10:06,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:10:06,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080080877] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:10:06,365 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:10:06,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 67, 67] total 134 [2022-04-28 03:10:06,365 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:10:06,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1832602355] [2022-04-28 03:10:06,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1832602355] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:06,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:06,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [68] imperfect sequences [] total 68 [2022-04-28 03:10:06,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399690958] [2022-04-28 03:10:06,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:10:06,366 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 67 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-28 03:10:06,366 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:10:06,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 68 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 67 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:06,402 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:10:06,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-04-28 03:10:06,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:06,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-04-28 03:10:06,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4620, Invalid=13202, Unknown=0, NotChecked=0, Total=17822 [2022-04-28 03:10:06,404 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand has 68 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 67 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:14,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:14,367 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2022-04-28 03:10:14,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-04-28 03:10:14,367 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 67 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-28 03:10:14,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:10:14,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 67 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:14,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2022-04-28 03:10:14,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 67 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:14,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2022-04-28 03:10:14,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 82 transitions. [2022-04-28 03:10:14,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:14,416 INFO L225 Difference]: With dead ends: 82 [2022-04-28 03:10:14,417 INFO L226 Difference]: Without dead ends: 77 [2022-04-28 03:10:14,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2214 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=9233, Invalid=30169, Unknown=0, NotChecked=0, Total=39402 [2022-04-28 03:10:14,418 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 4482 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 4613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 4482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:10:14,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 333 Invalid, 4613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 4482 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-28 03:10:14,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-28 03:10:14,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-04-28 03:10:14,495 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:10:14,495 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 77 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:14,495 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 77 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:14,495 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 77 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:14,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:14,496 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2022-04-28 03:10:14,496 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2022-04-28 03:10:14,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:14,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:14,496 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 77 states. [2022-04-28 03:10:14,496 INFO L87 Difference]: Start difference. First operand has 77 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 77 states. [2022-04-28 03:10:14,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:14,497 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2022-04-28 03:10:14,497 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2022-04-28 03:10:14,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:14,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:14,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:10:14,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:10:14,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:14,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2022-04-28 03:10:14,498 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2022-04-28 03:10:14,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:10:14,498 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2022-04-28 03:10:14,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 67 states have internal predecessors, (71), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:14,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 77 transitions. [2022-04-28 03:10:14,551 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:10:14,552 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2022-04-28 03:10:14,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-28 03:10:14,552 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:10:14,552 INFO L195 NwaCegarLoop]: trace histogram [65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:10:14,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Forceful destruction successful, exit code 0 [2022-04-28 03:10:14,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Forceful destruction successful, exit code 0 [2022-04-28 03:10:14,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 129 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable128,SelfDestructingSolverStorable129,128 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:10:14,956 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:10:14,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:10:14,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1846271370, now seen corresponding path program 129 times [2022-04-28 03:10:14,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:14,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1754475834] [2022-04-28 03:10:15,105 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:10:15,107 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:10:15,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1915434231, now seen corresponding path program 1 times [2022-04-28 03:10:15,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:10:15,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806774985] [2022-04-28 03:10:15,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:10:15,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:10:15,112 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 2) .v_it_65.0) (* (- 1) main_~x~0_5) (* 4294967296 (div (+ (* 2 .v_it_65.0) main_~x~0_5) 4294967296)) 268435455) 0)) [2022-04-28 03:10:15,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:10:15,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1735177885] [2022-04-28 03:10:15,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:10:15,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:10:15,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:10:15,116 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:10:15,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (130)] Waiting until timeout for monitored process [2022-04-28 03:10:15,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:10:15,156 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:10:15,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:10:15,163 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:10:15,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1846271370, now seen corresponding path program 130 times [2022-04-28 03:10:15,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:10:15,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893806949] [2022-04-28 03:10:15,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:10:15,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:10:15,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:17,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:10:17,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:17,068 INFO L290 TraceCheckUtils]: 0: Hoare triple {44132#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {44061#true} is VALID [2022-04-28 03:10:17,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {44061#true} assume true; {44061#true} is VALID [2022-04-28 03:10:17,068 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44061#true} {44061#true} #34#return; {44061#true} is VALID [2022-04-28 03:10:17,069 INFO L272 TraceCheckUtils]: 0: Hoare triple {44061#true} call ULTIMATE.init(); {44132#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:10:17,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {44132#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {44061#true} is VALID [2022-04-28 03:10:17,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {44061#true} assume true; {44061#true} is VALID [2022-04-28 03:10:17,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44061#true} {44061#true} #34#return; {44061#true} is VALID [2022-04-28 03:10:17,069 INFO L272 TraceCheckUtils]: 4: Hoare triple {44061#true} call #t~ret4 := main(); {44061#true} is VALID [2022-04-28 03:10:17,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {44061#true} ~x~0 := 0; {44066#(= main_~x~0 0)} is VALID [2022-04-28 03:10:17,070 INFO L290 TraceCheckUtils]: 6: Hoare triple {44066#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44067#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:10:17,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {44067#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44068#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:10:17,071 INFO L290 TraceCheckUtils]: 8: Hoare triple {44068#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44069#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:10:17,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {44069#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44070#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:10:17,072 INFO L290 TraceCheckUtils]: 10: Hoare triple {44070#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44071#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:10:17,072 INFO L290 TraceCheckUtils]: 11: Hoare triple {44071#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44072#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:10:17,073 INFO L290 TraceCheckUtils]: 12: Hoare triple {44072#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44073#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:10:17,073 INFO L290 TraceCheckUtils]: 13: Hoare triple {44073#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44074#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:10:17,074 INFO L290 TraceCheckUtils]: 14: Hoare triple {44074#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44075#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:10:17,074 INFO L290 TraceCheckUtils]: 15: Hoare triple {44075#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44076#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:10:17,074 INFO L290 TraceCheckUtils]: 16: Hoare triple {44076#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44077#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:10:17,075 INFO L290 TraceCheckUtils]: 17: Hoare triple {44077#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44078#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:10:17,075 INFO L290 TraceCheckUtils]: 18: Hoare triple {44078#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44079#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:10:17,076 INFO L290 TraceCheckUtils]: 19: Hoare triple {44079#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44080#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:10:17,076 INFO L290 TraceCheckUtils]: 20: Hoare triple {44080#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44081#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:10:17,077 INFO L290 TraceCheckUtils]: 21: Hoare triple {44081#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44082#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:10:17,077 INFO L290 TraceCheckUtils]: 22: Hoare triple {44082#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44083#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:10:17,078 INFO L290 TraceCheckUtils]: 23: Hoare triple {44083#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44084#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:10:17,078 INFO L290 TraceCheckUtils]: 24: Hoare triple {44084#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44085#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:10:17,079 INFO L290 TraceCheckUtils]: 25: Hoare triple {44085#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44086#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:10:17,079 INFO L290 TraceCheckUtils]: 26: Hoare triple {44086#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44087#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:10:17,080 INFO L290 TraceCheckUtils]: 27: Hoare triple {44087#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44088#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:10:17,080 INFO L290 TraceCheckUtils]: 28: Hoare triple {44088#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44089#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:10:17,081 INFO L290 TraceCheckUtils]: 29: Hoare triple {44089#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44090#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:10:17,081 INFO L290 TraceCheckUtils]: 30: Hoare triple {44090#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44091#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:10:17,082 INFO L290 TraceCheckUtils]: 31: Hoare triple {44091#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44092#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:10:17,082 INFO L290 TraceCheckUtils]: 32: Hoare triple {44092#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44093#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:10:17,082 INFO L290 TraceCheckUtils]: 33: Hoare triple {44093#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44094#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:10:17,083 INFO L290 TraceCheckUtils]: 34: Hoare triple {44094#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44095#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:10:17,083 INFO L290 TraceCheckUtils]: 35: Hoare triple {44095#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44096#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:10:17,084 INFO L290 TraceCheckUtils]: 36: Hoare triple {44096#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44097#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:10:17,084 INFO L290 TraceCheckUtils]: 37: Hoare triple {44097#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44098#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:10:17,085 INFO L290 TraceCheckUtils]: 38: Hoare triple {44098#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44099#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:10:17,085 INFO L290 TraceCheckUtils]: 39: Hoare triple {44099#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44100#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:10:17,086 INFO L290 TraceCheckUtils]: 40: Hoare triple {44100#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44101#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:10:17,086 INFO L290 TraceCheckUtils]: 41: Hoare triple {44101#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44102#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:10:17,087 INFO L290 TraceCheckUtils]: 42: Hoare triple {44102#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44103#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:10:17,087 INFO L290 TraceCheckUtils]: 43: Hoare triple {44103#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44104#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:10:17,088 INFO L290 TraceCheckUtils]: 44: Hoare triple {44104#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44105#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:10:17,088 INFO L290 TraceCheckUtils]: 45: Hoare triple {44105#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44106#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:10:17,089 INFO L290 TraceCheckUtils]: 46: Hoare triple {44106#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44107#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:10:17,089 INFO L290 TraceCheckUtils]: 47: Hoare triple {44107#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44108#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:10:17,089 INFO L290 TraceCheckUtils]: 48: Hoare triple {44108#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44109#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:10:17,090 INFO L290 TraceCheckUtils]: 49: Hoare triple {44109#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44110#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:10:17,090 INFO L290 TraceCheckUtils]: 50: Hoare triple {44110#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44111#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 03:10:17,091 INFO L290 TraceCheckUtils]: 51: Hoare triple {44111#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44112#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 03:10:17,091 INFO L290 TraceCheckUtils]: 52: Hoare triple {44112#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44113#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 03:10:17,092 INFO L290 TraceCheckUtils]: 53: Hoare triple {44113#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44114#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-28 03:10:17,092 INFO L290 TraceCheckUtils]: 54: Hoare triple {44114#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44115#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-28 03:10:17,093 INFO L290 TraceCheckUtils]: 55: Hoare triple {44115#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44116#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-28 03:10:17,093 INFO L290 TraceCheckUtils]: 56: Hoare triple {44116#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44117#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-28 03:10:17,094 INFO L290 TraceCheckUtils]: 57: Hoare triple {44117#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44118#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-28 03:10:17,094 INFO L290 TraceCheckUtils]: 58: Hoare triple {44118#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44119#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-28 03:10:17,095 INFO L290 TraceCheckUtils]: 59: Hoare triple {44119#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44120#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-28 03:10:17,095 INFO L290 TraceCheckUtils]: 60: Hoare triple {44120#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44121#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-28 03:10:17,096 INFO L290 TraceCheckUtils]: 61: Hoare triple {44121#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44122#(and (<= main_~x~0 112) (<= 112 main_~x~0))} is VALID [2022-04-28 03:10:17,096 INFO L290 TraceCheckUtils]: 62: Hoare triple {44122#(and (<= main_~x~0 112) (<= 112 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44123#(and (<= main_~x~0 114) (<= 114 main_~x~0))} is VALID [2022-04-28 03:10:17,096 INFO L290 TraceCheckUtils]: 63: Hoare triple {44123#(and (<= main_~x~0 114) (<= 114 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44124#(and (<= main_~x~0 116) (<= 116 main_~x~0))} is VALID [2022-04-28 03:10:17,097 INFO L290 TraceCheckUtils]: 64: Hoare triple {44124#(and (<= main_~x~0 116) (<= 116 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44125#(and (<= 118 main_~x~0) (<= main_~x~0 118))} is VALID [2022-04-28 03:10:17,097 INFO L290 TraceCheckUtils]: 65: Hoare triple {44125#(and (<= 118 main_~x~0) (<= main_~x~0 118))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44126#(and (<= main_~x~0 120) (<= 120 main_~x~0))} is VALID [2022-04-28 03:10:17,098 INFO L290 TraceCheckUtils]: 66: Hoare triple {44126#(and (<= main_~x~0 120) (<= 120 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44127#(and (<= 122 main_~x~0) (<= main_~x~0 122))} is VALID [2022-04-28 03:10:17,098 INFO L290 TraceCheckUtils]: 67: Hoare triple {44127#(and (<= 122 main_~x~0) (<= main_~x~0 122))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44128#(and (<= 124 main_~x~0) (<= main_~x~0 124))} is VALID [2022-04-28 03:10:17,099 INFO L290 TraceCheckUtils]: 68: Hoare triple {44128#(and (<= 124 main_~x~0) (<= main_~x~0 124))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44129#(and (<= 126 main_~x~0) (<= main_~x~0 126))} is VALID [2022-04-28 03:10:17,099 INFO L290 TraceCheckUtils]: 69: Hoare triple {44129#(and (<= 126 main_~x~0) (<= main_~x~0 126))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44130#(and (<= 128 main_~x~0) (<= main_~x~0 128))} is VALID [2022-04-28 03:10:17,100 INFO L290 TraceCheckUtils]: 70: Hoare triple {44130#(and (<= 128 main_~x~0) (<= main_~x~0 128))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44131#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 130))} is VALID [2022-04-28 03:10:17,100 INFO L290 TraceCheckUtils]: 71: Hoare triple {44131#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 130))} assume !(~x~0 % 4294967296 < 268435455); {44062#false} is VALID [2022-04-28 03:10:17,100 INFO L272 TraceCheckUtils]: 72: Hoare triple {44062#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {44062#false} is VALID [2022-04-28 03:10:17,100 INFO L290 TraceCheckUtils]: 73: Hoare triple {44062#false} ~cond := #in~cond; {44062#false} is VALID [2022-04-28 03:10:17,100 INFO L290 TraceCheckUtils]: 74: Hoare triple {44062#false} assume 0 == ~cond; {44062#false} is VALID [2022-04-28 03:10:17,101 INFO L290 TraceCheckUtils]: 75: Hoare triple {44062#false} assume !false; {44062#false} is VALID [2022-04-28 03:10:17,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:10:17,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:10:17,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893806949] [2022-04-28 03:10:17,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893806949] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:10:17,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639778189] [2022-04-28 03:10:17,101 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:10:17,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:10:17,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:10:17,102 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:10:17,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (131)] Waiting until timeout for monitored process [2022-04-28 03:10:17,530 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:10:17,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:10:17,532 WARN L261 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 133 conjunts are in the unsatisfiable core [2022-04-28 03:10:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:17,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:10:18,262 INFO L272 TraceCheckUtils]: 0: Hoare triple {44061#true} call ULTIMATE.init(); {44061#true} is VALID [2022-04-28 03:10:18,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {44061#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {44061#true} is VALID [2022-04-28 03:10:18,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {44061#true} assume true; {44061#true} is VALID [2022-04-28 03:10:18,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44061#true} {44061#true} #34#return; {44061#true} is VALID [2022-04-28 03:10:18,263 INFO L272 TraceCheckUtils]: 4: Hoare triple {44061#true} call #t~ret4 := main(); {44061#true} is VALID [2022-04-28 03:10:18,263 INFO L290 TraceCheckUtils]: 5: Hoare triple {44061#true} ~x~0 := 0; {44066#(= main_~x~0 0)} is VALID [2022-04-28 03:10:18,263 INFO L290 TraceCheckUtils]: 6: Hoare triple {44066#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44067#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:10:18,264 INFO L290 TraceCheckUtils]: 7: Hoare triple {44067#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44068#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:10:18,264 INFO L290 TraceCheckUtils]: 8: Hoare triple {44068#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44069#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:10:18,265 INFO L290 TraceCheckUtils]: 9: Hoare triple {44069#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44070#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:10:18,265 INFO L290 TraceCheckUtils]: 10: Hoare triple {44070#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44071#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:10:18,266 INFO L290 TraceCheckUtils]: 11: Hoare triple {44071#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44072#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:10:18,266 INFO L290 TraceCheckUtils]: 12: Hoare triple {44072#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44073#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:10:18,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {44073#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44074#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:10:18,267 INFO L290 TraceCheckUtils]: 14: Hoare triple {44074#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44075#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:10:18,268 INFO L290 TraceCheckUtils]: 15: Hoare triple {44075#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44076#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:10:18,268 INFO L290 TraceCheckUtils]: 16: Hoare triple {44076#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44077#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:10:18,269 INFO L290 TraceCheckUtils]: 17: Hoare triple {44077#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44078#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:10:18,269 INFO L290 TraceCheckUtils]: 18: Hoare triple {44078#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44079#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:10:18,269 INFO L290 TraceCheckUtils]: 19: Hoare triple {44079#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44080#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:10:18,270 INFO L290 TraceCheckUtils]: 20: Hoare triple {44080#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44081#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:10:18,270 INFO L290 TraceCheckUtils]: 21: Hoare triple {44081#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44082#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:10:18,271 INFO L290 TraceCheckUtils]: 22: Hoare triple {44082#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44083#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:10:18,271 INFO L290 TraceCheckUtils]: 23: Hoare triple {44083#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44084#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:10:18,272 INFO L290 TraceCheckUtils]: 24: Hoare triple {44084#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44085#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:10:18,272 INFO L290 TraceCheckUtils]: 25: Hoare triple {44085#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44086#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:10:18,273 INFO L290 TraceCheckUtils]: 26: Hoare triple {44086#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44087#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:10:18,273 INFO L290 TraceCheckUtils]: 27: Hoare triple {44087#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44088#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:10:18,274 INFO L290 TraceCheckUtils]: 28: Hoare triple {44088#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44089#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:10:18,274 INFO L290 TraceCheckUtils]: 29: Hoare triple {44089#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44090#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:10:18,275 INFO L290 TraceCheckUtils]: 30: Hoare triple {44090#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44091#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:10:18,275 INFO L290 TraceCheckUtils]: 31: Hoare triple {44091#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44092#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:10:18,276 INFO L290 TraceCheckUtils]: 32: Hoare triple {44092#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44093#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:10:18,276 INFO L290 TraceCheckUtils]: 33: Hoare triple {44093#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44094#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:10:18,277 INFO L290 TraceCheckUtils]: 34: Hoare triple {44094#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44095#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:10:18,277 INFO L290 TraceCheckUtils]: 35: Hoare triple {44095#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44096#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:10:18,278 INFO L290 TraceCheckUtils]: 36: Hoare triple {44096#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44097#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:10:18,278 INFO L290 TraceCheckUtils]: 37: Hoare triple {44097#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44098#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:10:18,278 INFO L290 TraceCheckUtils]: 38: Hoare triple {44098#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44099#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:10:18,279 INFO L290 TraceCheckUtils]: 39: Hoare triple {44099#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44100#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:10:18,279 INFO L290 TraceCheckUtils]: 40: Hoare triple {44100#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44101#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:10:18,280 INFO L290 TraceCheckUtils]: 41: Hoare triple {44101#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44102#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:10:18,280 INFO L290 TraceCheckUtils]: 42: Hoare triple {44102#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44103#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:10:18,290 INFO L290 TraceCheckUtils]: 43: Hoare triple {44103#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44104#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:10:18,291 INFO L290 TraceCheckUtils]: 44: Hoare triple {44104#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44105#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:10:18,291 INFO L290 TraceCheckUtils]: 45: Hoare triple {44105#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44106#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:10:18,292 INFO L290 TraceCheckUtils]: 46: Hoare triple {44106#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44107#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:10:18,292 INFO L290 TraceCheckUtils]: 47: Hoare triple {44107#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44108#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:10:18,293 INFO L290 TraceCheckUtils]: 48: Hoare triple {44108#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44109#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:10:18,293 INFO L290 TraceCheckUtils]: 49: Hoare triple {44109#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44110#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:10:18,294 INFO L290 TraceCheckUtils]: 50: Hoare triple {44110#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44111#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 03:10:18,294 INFO L290 TraceCheckUtils]: 51: Hoare triple {44111#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44112#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 03:10:18,295 INFO L290 TraceCheckUtils]: 52: Hoare triple {44112#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44113#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 03:10:18,295 INFO L290 TraceCheckUtils]: 53: Hoare triple {44113#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44114#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-28 03:10:18,296 INFO L290 TraceCheckUtils]: 54: Hoare triple {44114#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44115#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-28 03:10:18,296 INFO L290 TraceCheckUtils]: 55: Hoare triple {44115#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44116#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-28 03:10:18,296 INFO L290 TraceCheckUtils]: 56: Hoare triple {44116#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44117#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-28 03:10:18,297 INFO L290 TraceCheckUtils]: 57: Hoare triple {44117#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44118#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-28 03:10:18,297 INFO L290 TraceCheckUtils]: 58: Hoare triple {44118#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44119#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-28 03:10:18,298 INFO L290 TraceCheckUtils]: 59: Hoare triple {44119#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44120#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-28 03:10:18,298 INFO L290 TraceCheckUtils]: 60: Hoare triple {44120#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44121#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-28 03:10:18,299 INFO L290 TraceCheckUtils]: 61: Hoare triple {44121#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44122#(and (<= main_~x~0 112) (<= 112 main_~x~0))} is VALID [2022-04-28 03:10:18,299 INFO L290 TraceCheckUtils]: 62: Hoare triple {44122#(and (<= main_~x~0 112) (<= 112 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44123#(and (<= main_~x~0 114) (<= 114 main_~x~0))} is VALID [2022-04-28 03:10:18,300 INFO L290 TraceCheckUtils]: 63: Hoare triple {44123#(and (<= main_~x~0 114) (<= 114 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44124#(and (<= main_~x~0 116) (<= 116 main_~x~0))} is VALID [2022-04-28 03:10:18,300 INFO L290 TraceCheckUtils]: 64: Hoare triple {44124#(and (<= main_~x~0 116) (<= 116 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44125#(and (<= 118 main_~x~0) (<= main_~x~0 118))} is VALID [2022-04-28 03:10:18,301 INFO L290 TraceCheckUtils]: 65: Hoare triple {44125#(and (<= 118 main_~x~0) (<= main_~x~0 118))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44126#(and (<= main_~x~0 120) (<= 120 main_~x~0))} is VALID [2022-04-28 03:10:18,301 INFO L290 TraceCheckUtils]: 66: Hoare triple {44126#(and (<= main_~x~0 120) (<= 120 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44127#(and (<= 122 main_~x~0) (<= main_~x~0 122))} is VALID [2022-04-28 03:10:18,302 INFO L290 TraceCheckUtils]: 67: Hoare triple {44127#(and (<= 122 main_~x~0) (<= main_~x~0 122))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44128#(and (<= 124 main_~x~0) (<= main_~x~0 124))} is VALID [2022-04-28 03:10:18,302 INFO L290 TraceCheckUtils]: 68: Hoare triple {44128#(and (<= 124 main_~x~0) (<= main_~x~0 124))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44129#(and (<= 126 main_~x~0) (<= main_~x~0 126))} is VALID [2022-04-28 03:10:18,303 INFO L290 TraceCheckUtils]: 69: Hoare triple {44129#(and (<= 126 main_~x~0) (<= main_~x~0 126))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44130#(and (<= 128 main_~x~0) (<= main_~x~0 128))} is VALID [2022-04-28 03:10:18,303 INFO L290 TraceCheckUtils]: 70: Hoare triple {44130#(and (<= 128 main_~x~0) (<= main_~x~0 128))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44346#(and (<= 130 main_~x~0) (<= main_~x~0 130))} is VALID [2022-04-28 03:10:18,304 INFO L290 TraceCheckUtils]: 71: Hoare triple {44346#(and (<= 130 main_~x~0) (<= main_~x~0 130))} assume !(~x~0 % 4294967296 < 268435455); {44062#false} is VALID [2022-04-28 03:10:18,304 INFO L272 TraceCheckUtils]: 72: Hoare triple {44062#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {44062#false} is VALID [2022-04-28 03:10:18,304 INFO L290 TraceCheckUtils]: 73: Hoare triple {44062#false} ~cond := #in~cond; {44062#false} is VALID [2022-04-28 03:10:18,304 INFO L290 TraceCheckUtils]: 74: Hoare triple {44062#false} assume 0 == ~cond; {44062#false} is VALID [2022-04-28 03:10:18,304 INFO L290 TraceCheckUtils]: 75: Hoare triple {44062#false} assume !false; {44062#false} is VALID [2022-04-28 03:10:18,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:10:18,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:10:24,490 INFO L290 TraceCheckUtils]: 75: Hoare triple {44062#false} assume !false; {44062#false} is VALID [2022-04-28 03:10:24,490 INFO L290 TraceCheckUtils]: 74: Hoare triple {44062#false} assume 0 == ~cond; {44062#false} is VALID [2022-04-28 03:10:24,490 INFO L290 TraceCheckUtils]: 73: Hoare triple {44062#false} ~cond := #in~cond; {44062#false} is VALID [2022-04-28 03:10:24,490 INFO L272 TraceCheckUtils]: 72: Hoare triple {44062#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {44062#false} is VALID [2022-04-28 03:10:24,490 INFO L290 TraceCheckUtils]: 71: Hoare triple {44374#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {44062#false} is VALID [2022-04-28 03:10:24,491 INFO L290 TraceCheckUtils]: 70: Hoare triple {44378#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44374#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,492 INFO L290 TraceCheckUtils]: 69: Hoare triple {44382#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44378#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,492 INFO L290 TraceCheckUtils]: 68: Hoare triple {44386#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44382#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,493 INFO L290 TraceCheckUtils]: 67: Hoare triple {44390#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44386#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,493 INFO L290 TraceCheckUtils]: 66: Hoare triple {44394#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44390#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,494 INFO L290 TraceCheckUtils]: 65: Hoare triple {44398#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44394#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,495 INFO L290 TraceCheckUtils]: 64: Hoare triple {44402#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44398#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,495 INFO L290 TraceCheckUtils]: 63: Hoare triple {44406#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44402#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,496 INFO L290 TraceCheckUtils]: 62: Hoare triple {44410#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44406#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,496 INFO L290 TraceCheckUtils]: 61: Hoare triple {44414#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44410#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,497 INFO L290 TraceCheckUtils]: 60: Hoare triple {44418#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44414#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,497 INFO L290 TraceCheckUtils]: 59: Hoare triple {44422#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44418#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,498 INFO L290 TraceCheckUtils]: 58: Hoare triple {44426#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44422#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,499 INFO L290 TraceCheckUtils]: 57: Hoare triple {44430#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44426#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,499 INFO L290 TraceCheckUtils]: 56: Hoare triple {44434#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44430#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,500 INFO L290 TraceCheckUtils]: 55: Hoare triple {44438#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44434#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,500 INFO L290 TraceCheckUtils]: 54: Hoare triple {44442#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44438#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,501 INFO L290 TraceCheckUtils]: 53: Hoare triple {44446#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44442#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,501 INFO L290 TraceCheckUtils]: 52: Hoare triple {44450#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44446#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,502 INFO L290 TraceCheckUtils]: 51: Hoare triple {44454#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44450#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,503 INFO L290 TraceCheckUtils]: 50: Hoare triple {44458#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44454#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,503 INFO L290 TraceCheckUtils]: 49: Hoare triple {44462#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44458#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,504 INFO L290 TraceCheckUtils]: 48: Hoare triple {44466#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44462#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,504 INFO L290 TraceCheckUtils]: 47: Hoare triple {44470#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44466#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,505 INFO L290 TraceCheckUtils]: 46: Hoare triple {44474#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44470#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,505 INFO L290 TraceCheckUtils]: 45: Hoare triple {44478#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44474#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,506 INFO L290 TraceCheckUtils]: 44: Hoare triple {44482#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44478#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,507 INFO L290 TraceCheckUtils]: 43: Hoare triple {44486#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44482#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,507 INFO L290 TraceCheckUtils]: 42: Hoare triple {44490#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44486#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,508 INFO L290 TraceCheckUtils]: 41: Hoare triple {44494#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44490#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,508 INFO L290 TraceCheckUtils]: 40: Hoare triple {44498#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44494#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,509 INFO L290 TraceCheckUtils]: 39: Hoare triple {44502#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44498#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,509 INFO L290 TraceCheckUtils]: 38: Hoare triple {44506#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44502#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,510 INFO L290 TraceCheckUtils]: 37: Hoare triple {44510#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44506#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,510 INFO L290 TraceCheckUtils]: 36: Hoare triple {44514#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44510#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,511 INFO L290 TraceCheckUtils]: 35: Hoare triple {44518#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44514#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,512 INFO L290 TraceCheckUtils]: 34: Hoare triple {44522#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44518#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,512 INFO L290 TraceCheckUtils]: 33: Hoare triple {44526#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44522#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,513 INFO L290 TraceCheckUtils]: 32: Hoare triple {44530#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44526#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,513 INFO L290 TraceCheckUtils]: 31: Hoare triple {44534#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44530#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,514 INFO L290 TraceCheckUtils]: 30: Hoare triple {44538#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44534#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,514 INFO L290 TraceCheckUtils]: 29: Hoare triple {44542#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44538#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,515 INFO L290 TraceCheckUtils]: 28: Hoare triple {44546#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44542#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,516 INFO L290 TraceCheckUtils]: 27: Hoare triple {44550#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44546#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,516 INFO L290 TraceCheckUtils]: 26: Hoare triple {44554#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44550#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,517 INFO L290 TraceCheckUtils]: 25: Hoare triple {44558#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44554#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,517 INFO L290 TraceCheckUtils]: 24: Hoare triple {44562#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44558#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,518 INFO L290 TraceCheckUtils]: 23: Hoare triple {44566#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44562#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,518 INFO L290 TraceCheckUtils]: 22: Hoare triple {44570#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44566#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,519 INFO L290 TraceCheckUtils]: 21: Hoare triple {44574#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44570#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,520 INFO L290 TraceCheckUtils]: 20: Hoare triple {44578#(< (mod (+ main_~x~0 102) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44574#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,520 INFO L290 TraceCheckUtils]: 19: Hoare triple {44582#(< (mod (+ 104 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44578#(< (mod (+ main_~x~0 102) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,521 INFO L290 TraceCheckUtils]: 18: Hoare triple {44586#(< (mod (+ 106 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44582#(< (mod (+ 104 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,521 INFO L290 TraceCheckUtils]: 17: Hoare triple {44590#(< (mod (+ 108 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44586#(< (mod (+ 106 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,522 INFO L290 TraceCheckUtils]: 16: Hoare triple {44594#(< (mod (+ 110 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44590#(< (mod (+ 108 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,522 INFO L290 TraceCheckUtils]: 15: Hoare triple {44598#(< (mod (+ 112 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44594#(< (mod (+ 110 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {44602#(< (mod (+ main_~x~0 114) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44598#(< (mod (+ 112 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,524 INFO L290 TraceCheckUtils]: 13: Hoare triple {44606#(< (mod (+ 116 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44602#(< (mod (+ main_~x~0 114) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,524 INFO L290 TraceCheckUtils]: 12: Hoare triple {44610#(< (mod (+ main_~x~0 118) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44606#(< (mod (+ 116 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,525 INFO L290 TraceCheckUtils]: 11: Hoare triple {44614#(< (mod (+ main_~x~0 120) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44610#(< (mod (+ main_~x~0 118) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,525 INFO L290 TraceCheckUtils]: 10: Hoare triple {44618#(< (mod (+ main_~x~0 122) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44614#(< (mod (+ main_~x~0 120) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {44622#(< (mod (+ main_~x~0 124) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44618#(< (mod (+ main_~x~0 122) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,526 INFO L290 TraceCheckUtils]: 8: Hoare triple {44626#(< (mod (+ main_~x~0 126) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44622#(< (mod (+ main_~x~0 124) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,527 INFO L290 TraceCheckUtils]: 7: Hoare triple {44630#(< (mod (+ main_~x~0 128) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44626#(< (mod (+ main_~x~0 126) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,528 INFO L290 TraceCheckUtils]: 6: Hoare triple {44634#(< (mod (+ main_~x~0 130) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {44630#(< (mod (+ main_~x~0 128) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,528 INFO L290 TraceCheckUtils]: 5: Hoare triple {44061#true} ~x~0 := 0; {44634#(< (mod (+ main_~x~0 130) 4294967296) 268435455)} is VALID [2022-04-28 03:10:24,528 INFO L272 TraceCheckUtils]: 4: Hoare triple {44061#true} call #t~ret4 := main(); {44061#true} is VALID [2022-04-28 03:10:24,528 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44061#true} {44061#true} #34#return; {44061#true} is VALID [2022-04-28 03:10:24,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {44061#true} assume true; {44061#true} is VALID [2022-04-28 03:10:24,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {44061#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {44061#true} is VALID [2022-04-28 03:10:24,528 INFO L272 TraceCheckUtils]: 0: Hoare triple {44061#true} call ULTIMATE.init(); {44061#true} is VALID [2022-04-28 03:10:24,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:10:24,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639778189] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:10:24,529 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:10:24,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 68, 68] total 136 [2022-04-28 03:10:24,529 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:10:24,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1754475834] [2022-04-28 03:10:24,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1754475834] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:10:24,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:10:24,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2022-04-28 03:10:24,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048817531] [2022-04-28 03:10:24,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:10:24,530 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 68 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2022-04-28 03:10:24,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:10:24,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 69 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 68 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:24,566 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:10:24,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-04-28 03:10:24,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:24,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-04-28 03:10:24,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4757, Invalid=13603, Unknown=0, NotChecked=0, Total=18360 [2022-04-28 03:10:24,568 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand has 69 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 68 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:32,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:32,736 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2022-04-28 03:10:32,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-04-28 03:10:32,736 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 68 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 76 [2022-04-28 03:10:32,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:10:32,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 68 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:32,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions. [2022-04-28 03:10:32,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 68 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:32,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions. [2022-04-28 03:10:32,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 83 transitions. [2022-04-28 03:10:32,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:32,798 INFO L225 Difference]: With dead ends: 83 [2022-04-28 03:10:32,798 INFO L226 Difference]: Without dead ends: 78 [2022-04-28 03:10:32,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2281 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=9507, Invalid=31095, Unknown=0, NotChecked=0, Total=40602 [2022-04-28 03:10:32,800 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 4622 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 4755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 4622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:10:32,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 343 Invalid, 4755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 4622 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-28 03:10:32,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-28 03:10:32,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-04-28 03:10:32,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:10:32,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 78 states, 73 states have (on average 1.0136986301369864) internal successors, (74), 73 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:32,891 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 78 states, 73 states have (on average 1.0136986301369864) internal successors, (74), 73 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:32,892 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 78 states, 73 states have (on average 1.0136986301369864) internal successors, (74), 73 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:32,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:32,892 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2022-04-28 03:10:32,892 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2022-04-28 03:10:32,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:32,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:32,893 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 73 states have (on average 1.0136986301369864) internal successors, (74), 73 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 78 states. [2022-04-28 03:10:32,893 INFO L87 Difference]: Start difference. First operand has 78 states, 73 states have (on average 1.0136986301369864) internal successors, (74), 73 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 78 states. [2022-04-28 03:10:32,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:10:32,893 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2022-04-28 03:10:32,893 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2022-04-28 03:10:32,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:10:32,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:10:32,894 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:10:32,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:10:32,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.0136986301369864) internal successors, (74), 73 states have internal predecessors, (74), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:32,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2022-04-28 03:10:32,894 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2022-04-28 03:10:32,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:10:32,894 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2022-04-28 03:10:32,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 1.0434782608695652) internal successors, (72), 68 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:10:32,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 78 transitions. [2022-04-28 03:10:32,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:10:32,954 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2022-04-28 03:10:32,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-28 03:10:32,954 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:10:32,954 INFO L195 NwaCegarLoop]: trace histogram [66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:10:32,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (130)] Forceful destruction successful, exit code 0 [2022-04-28 03:10:33,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (131)] Forceful destruction successful, exit code 0 [2022-04-28 03:10:33,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 130 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable130,SelfDestructingSolverStorable131,131 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:10:33,355 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:10:33,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:10:33,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1363376356, now seen corresponding path program 131 times [2022-04-28 03:10:33,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:10:33,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [223969847] [2022-04-28 03:10:33,647 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:10:33,649 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:10:33,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1974539575, now seen corresponding path program 1 times [2022-04-28 03:10:33,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:10:33,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470638716] [2022-04-28 03:10:33,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:10:33,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:10:33,655 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 2) .v_it_66.0) (* (- 1) main_~x~0_5) (* 4294967296 (div (+ (* 2 .v_it_66.0) main_~x~0_5) 4294967296)) 268435455) 0)) [2022-04-28 03:10:33,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:10:33,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1008809192] [2022-04-28 03:10:33,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:10:33,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:10:33,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:10:33,658 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:10:33,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (132)] Waiting until timeout for monitored process [2022-04-28 03:10:33,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:10:33,707 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:10:33,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:10:33,715 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:10:33,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1363376356, now seen corresponding path program 132 times [2022-04-28 03:10:33,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:10:33,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878589671] [2022-04-28 03:10:33,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:10:33,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:10:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:35,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:10:35,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:10:35,693 INFO L290 TraceCheckUtils]: 0: Hoare triple {45337#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {45265#true} is VALID [2022-04-28 03:10:35,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {45265#true} assume true; {45265#true} is VALID [2022-04-28 03:10:35,693 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45265#true} {45265#true} #34#return; {45265#true} is VALID [2022-04-28 03:10:35,694 INFO L272 TraceCheckUtils]: 0: Hoare triple {45265#true} call ULTIMATE.init(); {45337#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:10:35,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {45337#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {45265#true} is VALID [2022-04-28 03:10:35,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {45265#true} assume true; {45265#true} is VALID [2022-04-28 03:10:35,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45265#true} {45265#true} #34#return; {45265#true} is VALID [2022-04-28 03:10:35,694 INFO L272 TraceCheckUtils]: 4: Hoare triple {45265#true} call #t~ret4 := main(); {45265#true} is VALID [2022-04-28 03:10:35,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {45265#true} ~x~0 := 0; {45270#(= main_~x~0 0)} is VALID [2022-04-28 03:10:35,695 INFO L290 TraceCheckUtils]: 6: Hoare triple {45270#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45271#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:10:35,695 INFO L290 TraceCheckUtils]: 7: Hoare triple {45271#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45272#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:10:35,696 INFO L290 TraceCheckUtils]: 8: Hoare triple {45272#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45273#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:10:35,696 INFO L290 TraceCheckUtils]: 9: Hoare triple {45273#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45274#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:10:35,696 INFO L290 TraceCheckUtils]: 10: Hoare triple {45274#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45275#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:10:35,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {45275#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45276#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:10:35,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {45276#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45277#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:10:35,698 INFO L290 TraceCheckUtils]: 13: Hoare triple {45277#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45278#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:10:35,698 INFO L290 TraceCheckUtils]: 14: Hoare triple {45278#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45279#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:10:35,699 INFO L290 TraceCheckUtils]: 15: Hoare triple {45279#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45280#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:10:35,699 INFO L290 TraceCheckUtils]: 16: Hoare triple {45280#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45281#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:10:35,700 INFO L290 TraceCheckUtils]: 17: Hoare triple {45281#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45282#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:10:35,700 INFO L290 TraceCheckUtils]: 18: Hoare triple {45282#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45283#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:10:35,701 INFO L290 TraceCheckUtils]: 19: Hoare triple {45283#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45284#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:10:35,701 INFO L290 TraceCheckUtils]: 20: Hoare triple {45284#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45285#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:10:35,702 INFO L290 TraceCheckUtils]: 21: Hoare triple {45285#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45286#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:10:35,702 INFO L290 TraceCheckUtils]: 22: Hoare triple {45286#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45287#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:10:35,702 INFO L290 TraceCheckUtils]: 23: Hoare triple {45287#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45288#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:10:35,703 INFO L290 TraceCheckUtils]: 24: Hoare triple {45288#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45289#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:10:35,703 INFO L290 TraceCheckUtils]: 25: Hoare triple {45289#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45290#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:10:35,704 INFO L290 TraceCheckUtils]: 26: Hoare triple {45290#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45291#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:10:35,704 INFO L290 TraceCheckUtils]: 27: Hoare triple {45291#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45292#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:10:35,705 INFO L290 TraceCheckUtils]: 28: Hoare triple {45292#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45293#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:10:35,705 INFO L290 TraceCheckUtils]: 29: Hoare triple {45293#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45294#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:10:35,706 INFO L290 TraceCheckUtils]: 30: Hoare triple {45294#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45295#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:10:35,706 INFO L290 TraceCheckUtils]: 31: Hoare triple {45295#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:10:35,707 INFO L290 TraceCheckUtils]: 32: Hoare triple {45296#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45297#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:10:35,707 INFO L290 TraceCheckUtils]: 33: Hoare triple {45297#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45298#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:10:35,708 INFO L290 TraceCheckUtils]: 34: Hoare triple {45298#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45299#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:10:35,708 INFO L290 TraceCheckUtils]: 35: Hoare triple {45299#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45300#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:10:35,708 INFO L290 TraceCheckUtils]: 36: Hoare triple {45300#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45301#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:10:35,709 INFO L290 TraceCheckUtils]: 37: Hoare triple {45301#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45302#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:10:35,709 INFO L290 TraceCheckUtils]: 38: Hoare triple {45302#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45303#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:10:35,710 INFO L290 TraceCheckUtils]: 39: Hoare triple {45303#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45304#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:10:35,710 INFO L290 TraceCheckUtils]: 40: Hoare triple {45304#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45305#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:10:35,711 INFO L290 TraceCheckUtils]: 41: Hoare triple {45305#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45306#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:10:35,711 INFO L290 TraceCheckUtils]: 42: Hoare triple {45306#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45307#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:10:35,712 INFO L290 TraceCheckUtils]: 43: Hoare triple {45307#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45308#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:10:35,712 INFO L290 TraceCheckUtils]: 44: Hoare triple {45308#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45309#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:10:35,713 INFO L290 TraceCheckUtils]: 45: Hoare triple {45309#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45310#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:10:35,713 INFO L290 TraceCheckUtils]: 46: Hoare triple {45310#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45311#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:10:35,714 INFO L290 TraceCheckUtils]: 47: Hoare triple {45311#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45312#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:10:35,714 INFO L290 TraceCheckUtils]: 48: Hoare triple {45312#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45313#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:10:35,714 INFO L290 TraceCheckUtils]: 49: Hoare triple {45313#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45314#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:10:35,715 INFO L290 TraceCheckUtils]: 50: Hoare triple {45314#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45315#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 03:10:35,715 INFO L290 TraceCheckUtils]: 51: Hoare triple {45315#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45316#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 03:10:35,716 INFO L290 TraceCheckUtils]: 52: Hoare triple {45316#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45317#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 03:10:35,716 INFO L290 TraceCheckUtils]: 53: Hoare triple {45317#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45318#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-28 03:10:35,717 INFO L290 TraceCheckUtils]: 54: Hoare triple {45318#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45319#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-28 03:10:35,717 INFO L290 TraceCheckUtils]: 55: Hoare triple {45319#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45320#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-28 03:10:35,718 INFO L290 TraceCheckUtils]: 56: Hoare triple {45320#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45321#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-28 03:10:35,718 INFO L290 TraceCheckUtils]: 57: Hoare triple {45321#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45322#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-28 03:10:35,719 INFO L290 TraceCheckUtils]: 58: Hoare triple {45322#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45323#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-28 03:10:35,719 INFO L290 TraceCheckUtils]: 59: Hoare triple {45323#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45324#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-28 03:10:35,720 INFO L290 TraceCheckUtils]: 60: Hoare triple {45324#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45325#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-28 03:10:35,720 INFO L290 TraceCheckUtils]: 61: Hoare triple {45325#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45326#(and (<= main_~x~0 112) (<= 112 main_~x~0))} is VALID [2022-04-28 03:10:35,720 INFO L290 TraceCheckUtils]: 62: Hoare triple {45326#(and (<= main_~x~0 112) (<= 112 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45327#(and (<= main_~x~0 114) (<= 114 main_~x~0))} is VALID [2022-04-28 03:10:35,721 INFO L290 TraceCheckUtils]: 63: Hoare triple {45327#(and (<= main_~x~0 114) (<= 114 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45328#(and (<= main_~x~0 116) (<= 116 main_~x~0))} is VALID [2022-04-28 03:10:35,721 INFO L290 TraceCheckUtils]: 64: Hoare triple {45328#(and (<= main_~x~0 116) (<= 116 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45329#(and (<= 118 main_~x~0) (<= main_~x~0 118))} is VALID [2022-04-28 03:10:35,722 INFO L290 TraceCheckUtils]: 65: Hoare triple {45329#(and (<= 118 main_~x~0) (<= main_~x~0 118))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45330#(and (<= main_~x~0 120) (<= 120 main_~x~0))} is VALID [2022-04-28 03:10:35,722 INFO L290 TraceCheckUtils]: 66: Hoare triple {45330#(and (<= main_~x~0 120) (<= 120 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45331#(and (<= 122 main_~x~0) (<= main_~x~0 122))} is VALID [2022-04-28 03:10:35,723 INFO L290 TraceCheckUtils]: 67: Hoare triple {45331#(and (<= 122 main_~x~0) (<= main_~x~0 122))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45332#(and (<= 124 main_~x~0) (<= main_~x~0 124))} is VALID [2022-04-28 03:10:35,723 INFO L290 TraceCheckUtils]: 68: Hoare triple {45332#(and (<= 124 main_~x~0) (<= main_~x~0 124))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45333#(and (<= 126 main_~x~0) (<= main_~x~0 126))} is VALID [2022-04-28 03:10:35,724 INFO L290 TraceCheckUtils]: 69: Hoare triple {45333#(and (<= 126 main_~x~0) (<= main_~x~0 126))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45334#(and (<= 128 main_~x~0) (<= main_~x~0 128))} is VALID [2022-04-28 03:10:35,724 INFO L290 TraceCheckUtils]: 70: Hoare triple {45334#(and (<= 128 main_~x~0) (<= main_~x~0 128))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45335#(and (<= 130 main_~x~0) (<= main_~x~0 130))} is VALID [2022-04-28 03:10:35,725 INFO L290 TraceCheckUtils]: 71: Hoare triple {45335#(and (<= 130 main_~x~0) (<= main_~x~0 130))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45336#(and (<= main_~x~0 132) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:10:35,725 INFO L290 TraceCheckUtils]: 72: Hoare triple {45336#(and (<= main_~x~0 132) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {45266#false} is VALID [2022-04-28 03:10:35,725 INFO L272 TraceCheckUtils]: 73: Hoare triple {45266#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {45266#false} is VALID [2022-04-28 03:10:35,725 INFO L290 TraceCheckUtils]: 74: Hoare triple {45266#false} ~cond := #in~cond; {45266#false} is VALID [2022-04-28 03:10:35,725 INFO L290 TraceCheckUtils]: 75: Hoare triple {45266#false} assume 0 == ~cond; {45266#false} is VALID [2022-04-28 03:10:35,725 INFO L290 TraceCheckUtils]: 76: Hoare triple {45266#false} assume !false; {45266#false} is VALID [2022-04-28 03:10:35,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:10:35,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:10:35,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878589671] [2022-04-28 03:10:35,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878589671] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:10:35,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145471630] [2022-04-28 03:10:35,726 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:10:35,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:10:35,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:10:35,727 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 03:10:35,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (133)] Waiting until timeout for monitored process [2022-04-28 03:11:39,005 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2022-04-28 03:11:39,005 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:11:39,035 WARN L261 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 141 conjunts are in the unsatisfiable core [2022-04-28 03:11:39,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:11:39,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:11:39,673 INFO L272 TraceCheckUtils]: 0: Hoare triple {45265#true} call ULTIMATE.init(); {45265#true} is VALID [2022-04-28 03:11:39,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {45265#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {45265#true} is VALID [2022-04-28 03:11:39,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {45265#true} assume true; {45265#true} is VALID [2022-04-28 03:11:39,673 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45265#true} {45265#true} #34#return; {45265#true} is VALID [2022-04-28 03:11:39,673 INFO L272 TraceCheckUtils]: 4: Hoare triple {45265#true} call #t~ret4 := main(); {45265#true} is VALID [2022-04-28 03:11:39,674 INFO L290 TraceCheckUtils]: 5: Hoare triple {45265#true} ~x~0 := 0; {45270#(= main_~x~0 0)} is VALID [2022-04-28 03:11:39,674 INFO L290 TraceCheckUtils]: 6: Hoare triple {45270#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45271#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:11:39,674 INFO L290 TraceCheckUtils]: 7: Hoare triple {45271#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45272#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:11:39,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {45272#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45273#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:11:39,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {45273#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45274#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:11:39,676 INFO L290 TraceCheckUtils]: 10: Hoare triple {45274#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45275#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:11:39,676 INFO L290 TraceCheckUtils]: 11: Hoare triple {45275#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45276#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:11:39,677 INFO L290 TraceCheckUtils]: 12: Hoare triple {45276#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45277#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:11:39,677 INFO L290 TraceCheckUtils]: 13: Hoare triple {45277#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45278#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:11:39,678 INFO L290 TraceCheckUtils]: 14: Hoare triple {45278#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45279#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:11:39,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {45279#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45280#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:11:39,679 INFO L290 TraceCheckUtils]: 16: Hoare triple {45280#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45281#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:11:39,679 INFO L290 TraceCheckUtils]: 17: Hoare triple {45281#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45282#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:11:39,680 INFO L290 TraceCheckUtils]: 18: Hoare triple {45282#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45283#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:11:39,680 INFO L290 TraceCheckUtils]: 19: Hoare triple {45283#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45284#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:11:39,681 INFO L290 TraceCheckUtils]: 20: Hoare triple {45284#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45285#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:11:39,681 INFO L290 TraceCheckUtils]: 21: Hoare triple {45285#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45286#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:11:39,682 INFO L290 TraceCheckUtils]: 22: Hoare triple {45286#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45287#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:11:39,682 INFO L290 TraceCheckUtils]: 23: Hoare triple {45287#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45288#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:11:39,683 INFO L290 TraceCheckUtils]: 24: Hoare triple {45288#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45289#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:11:39,683 INFO L290 TraceCheckUtils]: 25: Hoare triple {45289#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45290#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:11:39,684 INFO L290 TraceCheckUtils]: 26: Hoare triple {45290#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45291#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:11:39,684 INFO L290 TraceCheckUtils]: 27: Hoare triple {45291#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45292#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:11:39,684 INFO L290 TraceCheckUtils]: 28: Hoare triple {45292#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45293#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:11:39,685 INFO L290 TraceCheckUtils]: 29: Hoare triple {45293#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45294#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:11:39,685 INFO L290 TraceCheckUtils]: 30: Hoare triple {45294#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45295#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:11:39,686 INFO L290 TraceCheckUtils]: 31: Hoare triple {45295#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45296#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:11:39,686 INFO L290 TraceCheckUtils]: 32: Hoare triple {45296#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45297#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:11:39,687 INFO L290 TraceCheckUtils]: 33: Hoare triple {45297#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45298#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:11:39,687 INFO L290 TraceCheckUtils]: 34: Hoare triple {45298#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45299#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:11:39,688 INFO L290 TraceCheckUtils]: 35: Hoare triple {45299#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45300#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:11:39,688 INFO L290 TraceCheckUtils]: 36: Hoare triple {45300#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45301#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:11:39,689 INFO L290 TraceCheckUtils]: 37: Hoare triple {45301#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45302#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:11:39,689 INFO L290 TraceCheckUtils]: 38: Hoare triple {45302#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45303#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:11:39,689 INFO L290 TraceCheckUtils]: 39: Hoare triple {45303#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45304#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:11:39,690 INFO L290 TraceCheckUtils]: 40: Hoare triple {45304#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45305#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:11:39,690 INFO L290 TraceCheckUtils]: 41: Hoare triple {45305#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45306#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:11:39,691 INFO L290 TraceCheckUtils]: 42: Hoare triple {45306#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45307#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:11:39,691 INFO L290 TraceCheckUtils]: 43: Hoare triple {45307#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45308#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:11:39,692 INFO L290 TraceCheckUtils]: 44: Hoare triple {45308#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45309#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:11:39,692 INFO L290 TraceCheckUtils]: 45: Hoare triple {45309#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45310#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:11:39,693 INFO L290 TraceCheckUtils]: 46: Hoare triple {45310#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45311#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:11:39,693 INFO L290 TraceCheckUtils]: 47: Hoare triple {45311#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45312#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:11:39,694 INFO L290 TraceCheckUtils]: 48: Hoare triple {45312#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45313#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:11:39,694 INFO L290 TraceCheckUtils]: 49: Hoare triple {45313#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45314#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:11:39,695 INFO L290 TraceCheckUtils]: 50: Hoare triple {45314#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45315#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 03:11:39,695 INFO L290 TraceCheckUtils]: 51: Hoare triple {45315#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45316#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 03:11:39,696 INFO L290 TraceCheckUtils]: 52: Hoare triple {45316#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45317#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 03:11:39,696 INFO L290 TraceCheckUtils]: 53: Hoare triple {45317#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45318#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-28 03:11:39,696 INFO L290 TraceCheckUtils]: 54: Hoare triple {45318#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45319#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-28 03:11:39,697 INFO L290 TraceCheckUtils]: 55: Hoare triple {45319#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45320#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-28 03:11:39,697 INFO L290 TraceCheckUtils]: 56: Hoare triple {45320#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45321#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-28 03:11:39,698 INFO L290 TraceCheckUtils]: 57: Hoare triple {45321#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45322#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-28 03:11:39,698 INFO L290 TraceCheckUtils]: 58: Hoare triple {45322#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45323#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-28 03:11:39,699 INFO L290 TraceCheckUtils]: 59: Hoare triple {45323#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45324#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-28 03:11:39,699 INFO L290 TraceCheckUtils]: 60: Hoare triple {45324#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45325#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-28 03:11:39,700 INFO L290 TraceCheckUtils]: 61: Hoare triple {45325#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45326#(and (<= main_~x~0 112) (<= 112 main_~x~0))} is VALID [2022-04-28 03:11:39,700 INFO L290 TraceCheckUtils]: 62: Hoare triple {45326#(and (<= main_~x~0 112) (<= 112 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45327#(and (<= main_~x~0 114) (<= 114 main_~x~0))} is VALID [2022-04-28 03:11:39,701 INFO L290 TraceCheckUtils]: 63: Hoare triple {45327#(and (<= main_~x~0 114) (<= 114 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45328#(and (<= main_~x~0 116) (<= 116 main_~x~0))} is VALID [2022-04-28 03:11:39,701 INFO L290 TraceCheckUtils]: 64: Hoare triple {45328#(and (<= main_~x~0 116) (<= 116 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45329#(and (<= 118 main_~x~0) (<= main_~x~0 118))} is VALID [2022-04-28 03:11:39,701 INFO L290 TraceCheckUtils]: 65: Hoare triple {45329#(and (<= 118 main_~x~0) (<= main_~x~0 118))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45330#(and (<= main_~x~0 120) (<= 120 main_~x~0))} is VALID [2022-04-28 03:11:39,702 INFO L290 TraceCheckUtils]: 66: Hoare triple {45330#(and (<= main_~x~0 120) (<= 120 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45331#(and (<= 122 main_~x~0) (<= main_~x~0 122))} is VALID [2022-04-28 03:11:39,702 INFO L290 TraceCheckUtils]: 67: Hoare triple {45331#(and (<= 122 main_~x~0) (<= main_~x~0 122))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45332#(and (<= 124 main_~x~0) (<= main_~x~0 124))} is VALID [2022-04-28 03:11:39,703 INFO L290 TraceCheckUtils]: 68: Hoare triple {45332#(and (<= 124 main_~x~0) (<= main_~x~0 124))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45333#(and (<= 126 main_~x~0) (<= main_~x~0 126))} is VALID [2022-04-28 03:11:39,703 INFO L290 TraceCheckUtils]: 69: Hoare triple {45333#(and (<= 126 main_~x~0) (<= main_~x~0 126))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45334#(and (<= 128 main_~x~0) (<= main_~x~0 128))} is VALID [2022-04-28 03:11:39,704 INFO L290 TraceCheckUtils]: 70: Hoare triple {45334#(and (<= 128 main_~x~0) (<= main_~x~0 128))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45335#(and (<= 130 main_~x~0) (<= main_~x~0 130))} is VALID [2022-04-28 03:11:39,704 INFO L290 TraceCheckUtils]: 71: Hoare triple {45335#(and (<= 130 main_~x~0) (<= main_~x~0 130))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45554#(and (<= main_~x~0 132) (<= 132 main_~x~0))} is VALID [2022-04-28 03:11:39,705 INFO L290 TraceCheckUtils]: 72: Hoare triple {45554#(and (<= main_~x~0 132) (<= 132 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {45266#false} is VALID [2022-04-28 03:11:39,705 INFO L272 TraceCheckUtils]: 73: Hoare triple {45266#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {45266#false} is VALID [2022-04-28 03:11:39,705 INFO L290 TraceCheckUtils]: 74: Hoare triple {45266#false} ~cond := #in~cond; {45266#false} is VALID [2022-04-28 03:11:39,705 INFO L290 TraceCheckUtils]: 75: Hoare triple {45266#false} assume 0 == ~cond; {45266#false} is VALID [2022-04-28 03:11:39,705 INFO L290 TraceCheckUtils]: 76: Hoare triple {45266#false} assume !false; {45266#false} is VALID [2022-04-28 03:11:39,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:11:39,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:11:48,142 INFO L290 TraceCheckUtils]: 76: Hoare triple {45266#false} assume !false; {45266#false} is VALID [2022-04-28 03:11:48,143 INFO L290 TraceCheckUtils]: 75: Hoare triple {45573#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {45266#false} is VALID [2022-04-28 03:11:48,143 INFO L290 TraceCheckUtils]: 74: Hoare triple {45577#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {45573#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 03:11:48,144 INFO L272 TraceCheckUtils]: 73: Hoare triple {45581#(not (= (mod main_~x~0 2) 0))} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {45577#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 03:11:48,144 INFO L290 TraceCheckUtils]: 72: Hoare triple {45585#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !(~x~0 % 4294967296 < 268435455); {45581#(not (= (mod main_~x~0 2) 0))} is VALID [2022-04-28 03:11:48,145 INFO L290 TraceCheckUtils]: 71: Hoare triple {45589#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45585#(or (< (mod main_~x~0 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:11:48,145 INFO L290 TraceCheckUtils]: 70: Hoare triple {45593#(or (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45589#(or (< (mod (+ main_~x~0 2) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:11:48,146 INFO L290 TraceCheckUtils]: 69: Hoare triple {45597#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45593#(or (< (mod (+ main_~x~0 4) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:11:48,147 INFO L290 TraceCheckUtils]: 68: Hoare triple {45601#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45597#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 6) 4294967296) 268435455))} is VALID [2022-04-28 03:11:48,148 INFO L290 TraceCheckUtils]: 67: Hoare triple {45605#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45601#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 8) 4294967296) 268435455))} is VALID [2022-04-28 03:11:48,149 INFO L290 TraceCheckUtils]: 66: Hoare triple {45609#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45605#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 10) 4294967296) 268435455))} is VALID [2022-04-28 03:11:48,149 INFO L290 TraceCheckUtils]: 65: Hoare triple {45613#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45609#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 12) 4294967296) 268435455))} is VALID [2022-04-28 03:11:48,150 INFO L290 TraceCheckUtils]: 64: Hoare triple {45617#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45613#(or (< (mod (+ main_~x~0 14) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:11:48,151 INFO L290 TraceCheckUtils]: 63: Hoare triple {45621#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45617#(or (< (mod (+ main_~x~0 16) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:11:48,151 INFO L290 TraceCheckUtils]: 62: Hoare triple {45625#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45621#(or (< (mod (+ main_~x~0 18) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:11:48,152 INFO L290 TraceCheckUtils]: 61: Hoare triple {45629#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45625#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 20) 4294967296) 268435455))} is VALID [2022-04-28 03:11:48,153 INFO L290 TraceCheckUtils]: 60: Hoare triple {45633#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45629#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 22) 4294967296) 268435455))} is VALID [2022-04-28 03:11:48,153 INFO L290 TraceCheckUtils]: 59: Hoare triple {45637#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45633#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 24) 4294967296) 268435455))} is VALID [2022-04-28 03:11:48,157 INFO L290 TraceCheckUtils]: 58: Hoare triple {45641#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45637#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 26) 4294967296) 268435455))} is VALID [2022-04-28 03:11:48,158 INFO L290 TraceCheckUtils]: 57: Hoare triple {45645#(or (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45641#(or (< (mod (+ main_~x~0 28) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:11:48,160 INFO L290 TraceCheckUtils]: 56: Hoare triple {45649#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45645#(or (< (mod (+ 30 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:11:48,162 INFO L290 TraceCheckUtils]: 55: Hoare triple {45653#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45649#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 32 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:11:48,163 INFO L290 TraceCheckUtils]: 54: Hoare triple {45657#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45653#(or (< (mod (+ main_~x~0 34) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:11:48,164 INFO L290 TraceCheckUtils]: 53: Hoare triple {45661#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45657#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 36) 4294967296) 268435455))} is VALID [2022-04-28 03:11:48,165 INFO L290 TraceCheckUtils]: 52: Hoare triple {45665#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45661#(or (< (mod (+ main_~x~0 38) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:11:48,165 INFO L290 TraceCheckUtils]: 51: Hoare triple {45669#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45665#(or (< (mod (+ 40 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:11:48,166 INFO L290 TraceCheckUtils]: 50: Hoare triple {45673#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45669#(or (< (mod (+ 42 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:11:48,167 INFO L290 TraceCheckUtils]: 49: Hoare triple {45677#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45673#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 44 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:11:48,167 INFO L290 TraceCheckUtils]: 48: Hoare triple {45681#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45677#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 46) 4294967296) 268435455))} is VALID [2022-04-28 03:11:48,168 INFO L290 TraceCheckUtils]: 47: Hoare triple {45685#(or (< (mod (+ main_~x~0 50) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45681#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 48) 4294967296) 268435455))} is VALID [2022-04-28 03:11:48,169 INFO L290 TraceCheckUtils]: 46: Hoare triple {45689#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45685#(or (< (mod (+ main_~x~0 50) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:11:48,169 INFO L290 TraceCheckUtils]: 45: Hoare triple {45693#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45689#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 52) 4294967296) 268435455))} is VALID [2022-04-28 03:11:48,170 INFO L290 TraceCheckUtils]: 44: Hoare triple {45697#(or (< (mod (+ 56 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45693#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 54) 4294967296) 268435455))} is VALID [2022-04-28 03:11:48,171 INFO L290 TraceCheckUtils]: 43: Hoare triple {45701#(or (< (mod (+ main_~x~0 58) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45697#(or (< (mod (+ 56 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:11:48,172 INFO L290 TraceCheckUtils]: 42: Hoare triple {45705#(or (< (mod (+ main_~x~0 60) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45701#(or (< (mod (+ main_~x~0 58) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:11:48,172 INFO L290 TraceCheckUtils]: 41: Hoare triple {45709#(or (< (mod (+ main_~x~0 62) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45705#(or (< (mod (+ main_~x~0 60) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:11:48,174 INFO L290 TraceCheckUtils]: 40: Hoare triple {45713#(or (< (mod (+ 64 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45709#(or (< (mod (+ main_~x~0 62) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:11:48,175 INFO L290 TraceCheckUtils]: 39: Hoare triple {45717#(or (< (mod (+ 66 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45713#(or (< (mod (+ 64 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:11:48,176 INFO L290 TraceCheckUtils]: 38: Hoare triple {45721#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 68 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45717#(or (< (mod (+ 66 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:11:48,177 INFO L290 TraceCheckUtils]: 37: Hoare triple {45725#(or (< (mod (+ main_~x~0 70) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45721#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 68 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:11:48,177 INFO L290 TraceCheckUtils]: 36: Hoare triple {45729#(or (< (mod (+ 72 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45725#(or (< (mod (+ main_~x~0 70) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:11:48,178 INFO L290 TraceCheckUtils]: 35: Hoare triple {45733#(or (< (mod (+ main_~x~0 74) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45729#(or (< (mod (+ 72 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:11:48,179 INFO L290 TraceCheckUtils]: 34: Hoare triple {45737#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 76 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45733#(or (< (mod (+ main_~x~0 74) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:11:48,180 INFO L290 TraceCheckUtils]: 33: Hoare triple {45741#(or (< (mod (+ main_~x~0 78) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45737#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 76 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:11:48,185 INFO L290 TraceCheckUtils]: 32: Hoare triple {45745#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 80) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45741#(or (< (mod (+ main_~x~0 78) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:11:48,186 INFO L290 TraceCheckUtils]: 31: Hoare triple {45749#(or (< (mod (+ main_~x~0 82) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45745#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 80) 4294967296) 268435455))} is VALID [2022-04-28 03:11:48,186 INFO L290 TraceCheckUtils]: 30: Hoare triple {45753#(or (< (mod (+ 84 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45749#(or (< (mod (+ main_~x~0 82) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:11:48,187 INFO L290 TraceCheckUtils]: 29: Hoare triple {45757#(or (< (mod (+ main_~x~0 86) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45753#(or (< (mod (+ 84 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:11:48,189 INFO L290 TraceCheckUtils]: 28: Hoare triple {45761#(or (< (mod (+ 88 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45757#(or (< (mod (+ main_~x~0 86) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:11:48,190 INFO L290 TraceCheckUtils]: 27: Hoare triple {45765#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 90) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45761#(or (< (mod (+ 88 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:11:48,192 INFO L290 TraceCheckUtils]: 26: Hoare triple {45769#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 92 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45765#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 90) 4294967296) 268435455))} is VALID [2022-04-28 03:11:48,193 INFO L290 TraceCheckUtils]: 25: Hoare triple {45773#(or (< (mod (+ 94 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45769#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 92 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:11:48,194 INFO L290 TraceCheckUtils]: 24: Hoare triple {45777#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 96) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45773#(or (< (mod (+ 94 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:11:48,194 INFO L290 TraceCheckUtils]: 23: Hoare triple {45781#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 98 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45777#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 96) 4294967296) 268435455))} is VALID [2022-04-28 03:11:48,197 INFO L290 TraceCheckUtils]: 22: Hoare triple {45785#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 100) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45781#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 98 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:11:48,198 INFO L290 TraceCheckUtils]: 21: Hoare triple {45789#(or (< (mod (+ main_~x~0 102) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45785#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 100) 4294967296) 268435455))} is VALID [2022-04-28 03:11:48,199 INFO L290 TraceCheckUtils]: 20: Hoare triple {45793#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 104 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45789#(or (< (mod (+ main_~x~0 102) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:11:48,200 INFO L290 TraceCheckUtils]: 19: Hoare triple {45797#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 106 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45793#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 104 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:11:48,201 INFO L290 TraceCheckUtils]: 18: Hoare triple {45801#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 108 main_~x~0) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45797#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 106 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:11:48,201 INFO L290 TraceCheckUtils]: 17: Hoare triple {45805#(or (< (mod (+ 110 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45801#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ 108 main_~x~0) 4294967296) 268435455))} is VALID [2022-04-28 03:11:48,202 INFO L290 TraceCheckUtils]: 16: Hoare triple {45809#(or (< (mod (+ 112 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45805#(or (< (mod (+ 110 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:11:48,203 INFO L290 TraceCheckUtils]: 15: Hoare triple {45813#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 114) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45809#(or (< (mod (+ 112 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:11:48,204 INFO L290 TraceCheckUtils]: 14: Hoare triple {45817#(or (< (mod (+ 116 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45813#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 114) 4294967296) 268435455))} is VALID [2022-04-28 03:11:48,205 INFO L290 TraceCheckUtils]: 13: Hoare triple {45821#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 118) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45817#(or (< (mod (+ 116 main_~x~0) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:11:48,206 INFO L290 TraceCheckUtils]: 12: Hoare triple {45825#(or (< (mod (+ main_~x~0 120) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45821#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 118) 4294967296) 268435455))} is VALID [2022-04-28 03:11:48,206 INFO L290 TraceCheckUtils]: 11: Hoare triple {45829#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 122) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45825#(or (< (mod (+ main_~x~0 120) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:11:48,207 INFO L290 TraceCheckUtils]: 10: Hoare triple {45833#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 124) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45829#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 122) 4294967296) 268435455))} is VALID [2022-04-28 03:11:48,208 INFO L290 TraceCheckUtils]: 9: Hoare triple {45837#(or (< (mod (+ main_~x~0 126) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45833#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 124) 4294967296) 268435455))} is VALID [2022-04-28 03:11:48,209 INFO L290 TraceCheckUtils]: 8: Hoare triple {45841#(or (< (mod (+ main_~x~0 128) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45837#(or (< (mod (+ main_~x~0 126) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:11:48,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {45845#(or (< (mod (+ main_~x~0 130) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45841#(or (< (mod (+ main_~x~0 128) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:11:48,210 INFO L290 TraceCheckUtils]: 6: Hoare triple {45849#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 132) 4294967296) 268435455))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {45845#(or (< (mod (+ main_~x~0 130) 4294967296) 268435455) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 03:11:48,210 INFO L290 TraceCheckUtils]: 5: Hoare triple {45265#true} ~x~0 := 0; {45849#(or (not (= (mod main_~x~0 2) 0)) (< (mod (+ main_~x~0 132) 4294967296) 268435455))} is VALID [2022-04-28 03:11:48,210 INFO L272 TraceCheckUtils]: 4: Hoare triple {45265#true} call #t~ret4 := main(); {45265#true} is VALID [2022-04-28 03:11:48,210 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45265#true} {45265#true} #34#return; {45265#true} is VALID [2022-04-28 03:11:48,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {45265#true} assume true; {45265#true} is VALID [2022-04-28 03:11:48,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {45265#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {45265#true} is VALID [2022-04-28 03:11:48,211 INFO L272 TraceCheckUtils]: 0: Hoare triple {45265#true} call ULTIMATE.init(); {45265#true} is VALID [2022-04-28 03:11:48,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:11:48,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145471630] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:11:48,211 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:11:48,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 69, 72] total 141 [2022-04-28 03:11:48,212 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:11:48,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [223969847] [2022-04-28 03:11:48,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [223969847] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:11:48,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:11:48,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [70] imperfect sequences [] total 70 [2022-04-28 03:11:48,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195360229] [2022-04-28 03:11:48,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:11:48,212 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 1.042857142857143) internal successors, (73), 69 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-28 03:11:48,213 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:11:48,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 70 states, 70 states have (on average 1.042857142857143) internal successors, (73), 69 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:11:48,253 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:11:48,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-04-28 03:11:48,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:48,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-04-28 03:11:48,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4969, Invalid=14771, Unknown=0, NotChecked=0, Total=19740 [2022-04-28 03:11:48,255 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand has 70 states, 70 states have (on average 1.042857142857143) internal successors, (73), 69 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:11:56,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:56,266 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2022-04-28 03:11:56,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-04-28 03:11:56,266 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 70 states have (on average 1.042857142857143) internal successors, (73), 69 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-28 03:11:56,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:11:56,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 1.042857142857143) internal successors, (73), 69 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:11:56,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2022-04-28 03:11:56,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 70 states have (on average 1.042857142857143) internal successors, (73), 69 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:11:56,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2022-04-28 03:11:56,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 84 transitions. [2022-04-28 03:11:56,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:11:56,318 INFO L225 Difference]: With dead ends: 84 [2022-04-28 03:11:56,318 INFO L226 Difference]: Without dead ends: 79 [2022-04-28 03:11:56,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2355 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=9858, Invalid=33198, Unknown=0, NotChecked=0, Total=43056 [2022-04-28 03:11:56,320 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 4524 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 4659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 4524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:11:56,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 113 Invalid, 4659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 4524 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-28 03:11:56,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-28 03:11:56,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-04-28 03:11:56,398 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:11:56,399 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 79 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:11:56,399 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 79 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:11:56,399 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 79 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:11:56,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:56,399 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2022-04-28 03:11:56,399 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2022-04-28 03:11:56,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:56,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:56,400 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 79 states. [2022-04-28 03:11:56,400 INFO L87 Difference]: Start difference. First operand has 79 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 79 states. [2022-04-28 03:11:56,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:11:56,400 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2022-04-28 03:11:56,400 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2022-04-28 03:11:56,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:11:56,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:11:56,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:11:56,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:11:56,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:11:56,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2022-04-28 03:11:56,401 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2022-04-28 03:11:56,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:11:56,402 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2022-04-28 03:11:56,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 70 states have (on average 1.042857142857143) internal successors, (73), 69 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:11:56,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 79 transitions. [2022-04-28 03:11:56,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:11:56,455 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2022-04-28 03:11:56,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-28 03:11:56,456 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:11:56,456 INFO L195 NwaCegarLoop]: trace histogram [67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:11:56,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (133)] Forceful destruction successful, exit code 0 [2022-04-28 03:11:56,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (132)] Ended with exit code 0 [2022-04-28 03:11:56,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 133 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable132,132 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable133 [2022-04-28 03:11:56,857 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:11:56,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:11:56,857 INFO L85 PathProgramCache]: Analyzing trace with hash 721467190, now seen corresponding path program 133 times [2022-04-28 03:11:56,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:11:56,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1303951593] [2022-04-28 03:11:58,929 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:11:59,007 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:11:59,009 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:11:59,010 INFO L85 PathProgramCache]: Analyzing trace with hash 2033644919, now seen corresponding path program 1 times [2022-04-28 03:11:59,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:11:59,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770933094] [2022-04-28 03:11:59,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:11:59,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:11:59,014 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_67.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_67.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:11:59,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:11:59,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [417115205] [2022-04-28 03:11:59,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:11:59,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:11:59,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:11:59,017 INFO L229 MonitoredProcess]: Starting monitored process 134 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:11:59,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (134)] Waiting until timeout for monitored process [2022-04-28 03:11:59,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:11:59,062 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:11:59,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:11:59,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:11:59,090 INFO L85 PathProgramCache]: Analyzing trace with hash 721467190, now seen corresponding path program 134 times [2022-04-28 03:11:59,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:11:59,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850023966] [2022-04-28 03:11:59,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:11:59,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:11:59,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:01,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:12:01,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:01,118 INFO L290 TraceCheckUtils]: 0: Hoare triple {46561#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {46488#true} is VALID [2022-04-28 03:12:01,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {46488#true} assume true; {46488#true} is VALID [2022-04-28 03:12:01,118 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46488#true} {46488#true} #34#return; {46488#true} is VALID [2022-04-28 03:12:01,119 INFO L272 TraceCheckUtils]: 0: Hoare triple {46488#true} call ULTIMATE.init(); {46561#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:12:01,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {46561#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {46488#true} is VALID [2022-04-28 03:12:01,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {46488#true} assume true; {46488#true} is VALID [2022-04-28 03:12:01,119 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46488#true} {46488#true} #34#return; {46488#true} is VALID [2022-04-28 03:12:01,119 INFO L272 TraceCheckUtils]: 4: Hoare triple {46488#true} call #t~ret4 := main(); {46488#true} is VALID [2022-04-28 03:12:01,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {46488#true} ~x~0 := 0; {46493#(= main_~x~0 0)} is VALID [2022-04-28 03:12:01,120 INFO L290 TraceCheckUtils]: 6: Hoare triple {46493#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46494#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:12:01,120 INFO L290 TraceCheckUtils]: 7: Hoare triple {46494#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46495#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:12:01,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {46495#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46496#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:12:01,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {46496#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46497#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:12:01,122 INFO L290 TraceCheckUtils]: 10: Hoare triple {46497#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46498#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:12:01,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {46498#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46499#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:12:01,123 INFO L290 TraceCheckUtils]: 12: Hoare triple {46499#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46500#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:12:01,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {46500#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46501#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:12:01,124 INFO L290 TraceCheckUtils]: 14: Hoare triple {46501#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46502#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:12:01,124 INFO L290 TraceCheckUtils]: 15: Hoare triple {46502#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46503#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:12:01,124 INFO L290 TraceCheckUtils]: 16: Hoare triple {46503#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46504#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:12:01,125 INFO L290 TraceCheckUtils]: 17: Hoare triple {46504#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46505#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:12:01,125 INFO L290 TraceCheckUtils]: 18: Hoare triple {46505#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46506#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:12:01,126 INFO L290 TraceCheckUtils]: 19: Hoare triple {46506#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46507#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:12:01,126 INFO L290 TraceCheckUtils]: 20: Hoare triple {46507#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46508#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:12:01,127 INFO L290 TraceCheckUtils]: 21: Hoare triple {46508#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46509#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:12:01,127 INFO L290 TraceCheckUtils]: 22: Hoare triple {46509#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46510#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:12:01,128 INFO L290 TraceCheckUtils]: 23: Hoare triple {46510#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46511#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:12:01,128 INFO L290 TraceCheckUtils]: 24: Hoare triple {46511#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46512#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:12:01,129 INFO L290 TraceCheckUtils]: 25: Hoare triple {46512#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46513#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:12:01,129 INFO L290 TraceCheckUtils]: 26: Hoare triple {46513#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46514#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:12:01,130 INFO L290 TraceCheckUtils]: 27: Hoare triple {46514#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46515#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:12:01,130 INFO L290 TraceCheckUtils]: 28: Hoare triple {46515#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46516#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:12:01,130 INFO L290 TraceCheckUtils]: 29: Hoare triple {46516#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46517#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:12:01,131 INFO L290 TraceCheckUtils]: 30: Hoare triple {46517#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46518#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:12:01,131 INFO L290 TraceCheckUtils]: 31: Hoare triple {46518#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46519#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:12:01,132 INFO L290 TraceCheckUtils]: 32: Hoare triple {46519#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46520#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:12:01,132 INFO L290 TraceCheckUtils]: 33: Hoare triple {46520#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46521#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:12:01,133 INFO L290 TraceCheckUtils]: 34: Hoare triple {46521#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46522#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:12:01,133 INFO L290 TraceCheckUtils]: 35: Hoare triple {46522#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46523#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:12:01,134 INFO L290 TraceCheckUtils]: 36: Hoare triple {46523#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46524#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:12:01,134 INFO L290 TraceCheckUtils]: 37: Hoare triple {46524#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46525#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:12:01,135 INFO L290 TraceCheckUtils]: 38: Hoare triple {46525#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46526#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:12:01,135 INFO L290 TraceCheckUtils]: 39: Hoare triple {46526#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46527#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:12:01,136 INFO L290 TraceCheckUtils]: 40: Hoare triple {46527#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46528#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:12:01,136 INFO L290 TraceCheckUtils]: 41: Hoare triple {46528#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46529#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:12:01,137 INFO L290 TraceCheckUtils]: 42: Hoare triple {46529#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46530#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:12:01,137 INFO L290 TraceCheckUtils]: 43: Hoare triple {46530#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46531#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:12:01,137 INFO L290 TraceCheckUtils]: 44: Hoare triple {46531#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46532#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:12:01,138 INFO L290 TraceCheckUtils]: 45: Hoare triple {46532#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46533#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:12:01,138 INFO L290 TraceCheckUtils]: 46: Hoare triple {46533#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46534#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:12:01,139 INFO L290 TraceCheckUtils]: 47: Hoare triple {46534#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46535#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:12:01,139 INFO L290 TraceCheckUtils]: 48: Hoare triple {46535#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46536#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:12:01,140 INFO L290 TraceCheckUtils]: 49: Hoare triple {46536#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46537#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:12:01,140 INFO L290 TraceCheckUtils]: 50: Hoare triple {46537#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46538#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 03:12:01,141 INFO L290 TraceCheckUtils]: 51: Hoare triple {46538#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46539#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 03:12:01,141 INFO L290 TraceCheckUtils]: 52: Hoare triple {46539#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46540#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 03:12:01,142 INFO L290 TraceCheckUtils]: 53: Hoare triple {46540#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46541#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-28 03:12:01,142 INFO L290 TraceCheckUtils]: 54: Hoare triple {46541#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46542#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-28 03:12:01,143 INFO L290 TraceCheckUtils]: 55: Hoare triple {46542#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46543#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-28 03:12:01,143 INFO L290 TraceCheckUtils]: 56: Hoare triple {46543#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46544#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-28 03:12:01,143 INFO L290 TraceCheckUtils]: 57: Hoare triple {46544#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46545#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-28 03:12:01,144 INFO L290 TraceCheckUtils]: 58: Hoare triple {46545#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46546#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-28 03:12:01,144 INFO L290 TraceCheckUtils]: 59: Hoare triple {46546#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46547#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-28 03:12:01,145 INFO L290 TraceCheckUtils]: 60: Hoare triple {46547#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46548#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-28 03:12:01,145 INFO L290 TraceCheckUtils]: 61: Hoare triple {46548#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46549#(and (<= main_~x~0 112) (<= 112 main_~x~0))} is VALID [2022-04-28 03:12:01,146 INFO L290 TraceCheckUtils]: 62: Hoare triple {46549#(and (<= main_~x~0 112) (<= 112 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46550#(and (<= main_~x~0 114) (<= 114 main_~x~0))} is VALID [2022-04-28 03:12:01,146 INFO L290 TraceCheckUtils]: 63: Hoare triple {46550#(and (<= main_~x~0 114) (<= 114 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46551#(and (<= main_~x~0 116) (<= 116 main_~x~0))} is VALID [2022-04-28 03:12:01,147 INFO L290 TraceCheckUtils]: 64: Hoare triple {46551#(and (<= main_~x~0 116) (<= 116 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46552#(and (<= 118 main_~x~0) (<= main_~x~0 118))} is VALID [2022-04-28 03:12:01,147 INFO L290 TraceCheckUtils]: 65: Hoare triple {46552#(and (<= 118 main_~x~0) (<= main_~x~0 118))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46553#(and (<= main_~x~0 120) (<= 120 main_~x~0))} is VALID [2022-04-28 03:12:01,148 INFO L290 TraceCheckUtils]: 66: Hoare triple {46553#(and (<= main_~x~0 120) (<= 120 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46554#(and (<= 122 main_~x~0) (<= main_~x~0 122))} is VALID [2022-04-28 03:12:01,148 INFO L290 TraceCheckUtils]: 67: Hoare triple {46554#(and (<= 122 main_~x~0) (<= main_~x~0 122))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46555#(and (<= 124 main_~x~0) (<= main_~x~0 124))} is VALID [2022-04-28 03:12:01,149 INFO L290 TraceCheckUtils]: 68: Hoare triple {46555#(and (<= 124 main_~x~0) (<= main_~x~0 124))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46556#(and (<= 126 main_~x~0) (<= main_~x~0 126))} is VALID [2022-04-28 03:12:01,149 INFO L290 TraceCheckUtils]: 69: Hoare triple {46556#(and (<= 126 main_~x~0) (<= main_~x~0 126))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46557#(and (<= 128 main_~x~0) (<= main_~x~0 128))} is VALID [2022-04-28 03:12:01,150 INFO L290 TraceCheckUtils]: 70: Hoare triple {46557#(and (<= 128 main_~x~0) (<= main_~x~0 128))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46558#(and (<= 130 main_~x~0) (<= main_~x~0 130))} is VALID [2022-04-28 03:12:01,150 INFO L290 TraceCheckUtils]: 71: Hoare triple {46558#(and (<= 130 main_~x~0) (<= main_~x~0 130))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46559#(and (<= main_~x~0 132) (<= 132 main_~x~0))} is VALID [2022-04-28 03:12:01,151 INFO L290 TraceCheckUtils]: 72: Hoare triple {46559#(and (<= main_~x~0 132) (<= 132 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46560#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 134))} is VALID [2022-04-28 03:12:01,151 INFO L290 TraceCheckUtils]: 73: Hoare triple {46560#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 134))} assume !(~x~0 % 4294967296 < 268435455); {46489#false} is VALID [2022-04-28 03:12:01,151 INFO L272 TraceCheckUtils]: 74: Hoare triple {46489#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {46489#false} is VALID [2022-04-28 03:12:01,151 INFO L290 TraceCheckUtils]: 75: Hoare triple {46489#false} ~cond := #in~cond; {46489#false} is VALID [2022-04-28 03:12:01,151 INFO L290 TraceCheckUtils]: 76: Hoare triple {46489#false} assume 0 == ~cond; {46489#false} is VALID [2022-04-28 03:12:01,151 INFO L290 TraceCheckUtils]: 77: Hoare triple {46489#false} assume !false; {46489#false} is VALID [2022-04-28 03:12:01,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:12:01,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:12:01,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850023966] [2022-04-28 03:12:01,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850023966] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:12:01,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1800872038] [2022-04-28 03:12:01,152 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 03:12:01,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:12:01,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:12:01,153 INFO L229 MonitoredProcess]: Starting monitored process 135 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:12:01,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (135)] Waiting until timeout for monitored process [2022-04-28 03:12:01,282 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 03:12:01,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:12:01,284 WARN L261 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 137 conjunts are in the unsatisfiable core [2022-04-28 03:12:01,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:01,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:12:02,015 INFO L272 TraceCheckUtils]: 0: Hoare triple {46488#true} call ULTIMATE.init(); {46488#true} is VALID [2022-04-28 03:12:02,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {46488#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {46488#true} is VALID [2022-04-28 03:12:02,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {46488#true} assume true; {46488#true} is VALID [2022-04-28 03:12:02,015 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46488#true} {46488#true} #34#return; {46488#true} is VALID [2022-04-28 03:12:02,015 INFO L272 TraceCheckUtils]: 4: Hoare triple {46488#true} call #t~ret4 := main(); {46488#true} is VALID [2022-04-28 03:12:02,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {46488#true} ~x~0 := 0; {46493#(= main_~x~0 0)} is VALID [2022-04-28 03:12:02,016 INFO L290 TraceCheckUtils]: 6: Hoare triple {46493#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46494#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:12:02,016 INFO L290 TraceCheckUtils]: 7: Hoare triple {46494#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46495#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:12:02,017 INFO L290 TraceCheckUtils]: 8: Hoare triple {46495#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46496#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:12:02,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {46496#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46497#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:12:02,018 INFO L290 TraceCheckUtils]: 10: Hoare triple {46497#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46498#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:12:02,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {46498#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46499#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:12:02,019 INFO L290 TraceCheckUtils]: 12: Hoare triple {46499#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46500#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:12:02,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {46500#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46501#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:12:02,020 INFO L290 TraceCheckUtils]: 14: Hoare triple {46501#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46502#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:12:02,020 INFO L290 TraceCheckUtils]: 15: Hoare triple {46502#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46503#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:12:02,020 INFO L290 TraceCheckUtils]: 16: Hoare triple {46503#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46504#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:12:02,021 INFO L290 TraceCheckUtils]: 17: Hoare triple {46504#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46505#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:12:02,021 INFO L290 TraceCheckUtils]: 18: Hoare triple {46505#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46506#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:12:02,022 INFO L290 TraceCheckUtils]: 19: Hoare triple {46506#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46507#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:12:02,022 INFO L290 TraceCheckUtils]: 20: Hoare triple {46507#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46508#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:12:02,023 INFO L290 TraceCheckUtils]: 21: Hoare triple {46508#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46509#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:12:02,023 INFO L290 TraceCheckUtils]: 22: Hoare triple {46509#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46510#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:12:02,024 INFO L290 TraceCheckUtils]: 23: Hoare triple {46510#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46511#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:12:02,024 INFO L290 TraceCheckUtils]: 24: Hoare triple {46511#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46512#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:12:02,025 INFO L290 TraceCheckUtils]: 25: Hoare triple {46512#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46513#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:12:02,025 INFO L290 TraceCheckUtils]: 26: Hoare triple {46513#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46514#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:12:02,026 INFO L290 TraceCheckUtils]: 27: Hoare triple {46514#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46515#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:12:02,026 INFO L290 TraceCheckUtils]: 28: Hoare triple {46515#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46516#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:12:02,027 INFO L290 TraceCheckUtils]: 29: Hoare triple {46516#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46517#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:12:02,027 INFO L290 TraceCheckUtils]: 30: Hoare triple {46517#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46518#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:12:02,028 INFO L290 TraceCheckUtils]: 31: Hoare triple {46518#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46519#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:12:02,028 INFO L290 TraceCheckUtils]: 32: Hoare triple {46519#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46520#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:12:02,029 INFO L290 TraceCheckUtils]: 33: Hoare triple {46520#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46521#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:12:02,029 INFO L290 TraceCheckUtils]: 34: Hoare triple {46521#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46522#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:12:02,029 INFO L290 TraceCheckUtils]: 35: Hoare triple {46522#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46523#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:12:02,030 INFO L290 TraceCheckUtils]: 36: Hoare triple {46523#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46524#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:12:02,030 INFO L290 TraceCheckUtils]: 37: Hoare triple {46524#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46525#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:12:02,031 INFO L290 TraceCheckUtils]: 38: Hoare triple {46525#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46526#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:12:02,031 INFO L290 TraceCheckUtils]: 39: Hoare triple {46526#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46527#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:12:02,032 INFO L290 TraceCheckUtils]: 40: Hoare triple {46527#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46528#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:12:02,032 INFO L290 TraceCheckUtils]: 41: Hoare triple {46528#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46529#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:12:02,033 INFO L290 TraceCheckUtils]: 42: Hoare triple {46529#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46530#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:12:02,033 INFO L290 TraceCheckUtils]: 43: Hoare triple {46530#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46531#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:12:02,034 INFO L290 TraceCheckUtils]: 44: Hoare triple {46531#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46532#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:12:02,034 INFO L290 TraceCheckUtils]: 45: Hoare triple {46532#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46533#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:12:02,035 INFO L290 TraceCheckUtils]: 46: Hoare triple {46533#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46534#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:12:02,035 INFO L290 TraceCheckUtils]: 47: Hoare triple {46534#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46535#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:12:02,035 INFO L290 TraceCheckUtils]: 48: Hoare triple {46535#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46536#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:12:02,036 INFO L290 TraceCheckUtils]: 49: Hoare triple {46536#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46537#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:12:02,036 INFO L290 TraceCheckUtils]: 50: Hoare triple {46537#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46538#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 03:12:02,037 INFO L290 TraceCheckUtils]: 51: Hoare triple {46538#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46539#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 03:12:02,037 INFO L290 TraceCheckUtils]: 52: Hoare triple {46539#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46540#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 03:12:02,038 INFO L290 TraceCheckUtils]: 53: Hoare triple {46540#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46541#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-28 03:12:02,038 INFO L290 TraceCheckUtils]: 54: Hoare triple {46541#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46542#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-28 03:12:02,039 INFO L290 TraceCheckUtils]: 55: Hoare triple {46542#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46543#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-28 03:12:02,039 INFO L290 TraceCheckUtils]: 56: Hoare triple {46543#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46544#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-28 03:12:02,040 INFO L290 TraceCheckUtils]: 57: Hoare triple {46544#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46545#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-28 03:12:02,040 INFO L290 TraceCheckUtils]: 58: Hoare triple {46545#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46546#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-28 03:12:02,041 INFO L290 TraceCheckUtils]: 59: Hoare triple {46546#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46547#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-28 03:12:02,041 INFO L290 TraceCheckUtils]: 60: Hoare triple {46547#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46548#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-28 03:12:02,042 INFO L290 TraceCheckUtils]: 61: Hoare triple {46548#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46549#(and (<= main_~x~0 112) (<= 112 main_~x~0))} is VALID [2022-04-28 03:12:02,042 INFO L290 TraceCheckUtils]: 62: Hoare triple {46549#(and (<= main_~x~0 112) (<= 112 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46550#(and (<= main_~x~0 114) (<= 114 main_~x~0))} is VALID [2022-04-28 03:12:02,043 INFO L290 TraceCheckUtils]: 63: Hoare triple {46550#(and (<= main_~x~0 114) (<= 114 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46551#(and (<= main_~x~0 116) (<= 116 main_~x~0))} is VALID [2022-04-28 03:12:02,043 INFO L290 TraceCheckUtils]: 64: Hoare triple {46551#(and (<= main_~x~0 116) (<= 116 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46552#(and (<= 118 main_~x~0) (<= main_~x~0 118))} is VALID [2022-04-28 03:12:02,043 INFO L290 TraceCheckUtils]: 65: Hoare triple {46552#(and (<= 118 main_~x~0) (<= main_~x~0 118))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46553#(and (<= main_~x~0 120) (<= 120 main_~x~0))} is VALID [2022-04-28 03:12:02,044 INFO L290 TraceCheckUtils]: 66: Hoare triple {46553#(and (<= main_~x~0 120) (<= 120 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46554#(and (<= 122 main_~x~0) (<= main_~x~0 122))} is VALID [2022-04-28 03:12:02,044 INFO L290 TraceCheckUtils]: 67: Hoare triple {46554#(and (<= 122 main_~x~0) (<= main_~x~0 122))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46555#(and (<= 124 main_~x~0) (<= main_~x~0 124))} is VALID [2022-04-28 03:12:02,045 INFO L290 TraceCheckUtils]: 68: Hoare triple {46555#(and (<= 124 main_~x~0) (<= main_~x~0 124))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46556#(and (<= 126 main_~x~0) (<= main_~x~0 126))} is VALID [2022-04-28 03:12:02,045 INFO L290 TraceCheckUtils]: 69: Hoare triple {46556#(and (<= 126 main_~x~0) (<= main_~x~0 126))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46557#(and (<= 128 main_~x~0) (<= main_~x~0 128))} is VALID [2022-04-28 03:12:02,046 INFO L290 TraceCheckUtils]: 70: Hoare triple {46557#(and (<= 128 main_~x~0) (<= main_~x~0 128))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46558#(and (<= 130 main_~x~0) (<= main_~x~0 130))} is VALID [2022-04-28 03:12:02,046 INFO L290 TraceCheckUtils]: 71: Hoare triple {46558#(and (<= 130 main_~x~0) (<= main_~x~0 130))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46559#(and (<= main_~x~0 132) (<= 132 main_~x~0))} is VALID [2022-04-28 03:12:02,047 INFO L290 TraceCheckUtils]: 72: Hoare triple {46559#(and (<= main_~x~0 132) (<= 132 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46781#(and (<= 134 main_~x~0) (<= main_~x~0 134))} is VALID [2022-04-28 03:12:02,047 INFO L290 TraceCheckUtils]: 73: Hoare triple {46781#(and (<= 134 main_~x~0) (<= main_~x~0 134))} assume !(~x~0 % 4294967296 < 268435455); {46489#false} is VALID [2022-04-28 03:12:02,047 INFO L272 TraceCheckUtils]: 74: Hoare triple {46489#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {46489#false} is VALID [2022-04-28 03:12:02,047 INFO L290 TraceCheckUtils]: 75: Hoare triple {46489#false} ~cond := #in~cond; {46489#false} is VALID [2022-04-28 03:12:02,047 INFO L290 TraceCheckUtils]: 76: Hoare triple {46489#false} assume 0 == ~cond; {46489#false} is VALID [2022-04-28 03:12:02,047 INFO L290 TraceCheckUtils]: 77: Hoare triple {46489#false} assume !false; {46489#false} is VALID [2022-04-28 03:12:02,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:12:02,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:12:08,652 INFO L290 TraceCheckUtils]: 77: Hoare triple {46489#false} assume !false; {46489#false} is VALID [2022-04-28 03:12:08,653 INFO L290 TraceCheckUtils]: 76: Hoare triple {46489#false} assume 0 == ~cond; {46489#false} is VALID [2022-04-28 03:12:08,653 INFO L290 TraceCheckUtils]: 75: Hoare triple {46489#false} ~cond := #in~cond; {46489#false} is VALID [2022-04-28 03:12:08,653 INFO L272 TraceCheckUtils]: 74: Hoare triple {46489#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {46489#false} is VALID [2022-04-28 03:12:08,653 INFO L290 TraceCheckUtils]: 73: Hoare triple {46809#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {46489#false} is VALID [2022-04-28 03:12:08,654 INFO L290 TraceCheckUtils]: 72: Hoare triple {46813#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46809#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,655 INFO L290 TraceCheckUtils]: 71: Hoare triple {46817#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46813#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,656 INFO L290 TraceCheckUtils]: 70: Hoare triple {46821#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46817#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,656 INFO L290 TraceCheckUtils]: 69: Hoare triple {46825#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46821#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,657 INFO L290 TraceCheckUtils]: 68: Hoare triple {46829#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46825#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,657 INFO L290 TraceCheckUtils]: 67: Hoare triple {46833#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46829#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,658 INFO L290 TraceCheckUtils]: 66: Hoare triple {46837#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46833#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,659 INFO L290 TraceCheckUtils]: 65: Hoare triple {46841#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46837#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,659 INFO L290 TraceCheckUtils]: 64: Hoare triple {46845#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46841#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,660 INFO L290 TraceCheckUtils]: 63: Hoare triple {46849#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46845#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,660 INFO L290 TraceCheckUtils]: 62: Hoare triple {46853#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46849#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,661 INFO L290 TraceCheckUtils]: 61: Hoare triple {46857#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46853#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,662 INFO L290 TraceCheckUtils]: 60: Hoare triple {46861#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46857#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,662 INFO L290 TraceCheckUtils]: 59: Hoare triple {46865#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46861#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,663 INFO L290 TraceCheckUtils]: 58: Hoare triple {46869#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46865#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,663 INFO L290 TraceCheckUtils]: 57: Hoare triple {46873#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46869#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,664 INFO L290 TraceCheckUtils]: 56: Hoare triple {46877#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46873#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,665 INFO L290 TraceCheckUtils]: 55: Hoare triple {46881#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46877#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,665 INFO L290 TraceCheckUtils]: 54: Hoare triple {46885#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46881#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,666 INFO L290 TraceCheckUtils]: 53: Hoare triple {46889#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46885#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,666 INFO L290 TraceCheckUtils]: 52: Hoare triple {46893#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46889#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,667 INFO L290 TraceCheckUtils]: 51: Hoare triple {46897#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46893#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,667 INFO L290 TraceCheckUtils]: 50: Hoare triple {46901#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46897#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,668 INFO L290 TraceCheckUtils]: 49: Hoare triple {46905#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46901#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,669 INFO L290 TraceCheckUtils]: 48: Hoare triple {46909#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46905#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,669 INFO L290 TraceCheckUtils]: 47: Hoare triple {46913#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46909#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,670 INFO L290 TraceCheckUtils]: 46: Hoare triple {46917#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46913#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,670 INFO L290 TraceCheckUtils]: 45: Hoare triple {46921#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46917#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,671 INFO L290 TraceCheckUtils]: 44: Hoare triple {46925#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46921#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,672 INFO L290 TraceCheckUtils]: 43: Hoare triple {46929#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46925#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,672 INFO L290 TraceCheckUtils]: 42: Hoare triple {46933#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46929#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,673 INFO L290 TraceCheckUtils]: 41: Hoare triple {46937#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46933#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,673 INFO L290 TraceCheckUtils]: 40: Hoare triple {46941#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46937#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,674 INFO L290 TraceCheckUtils]: 39: Hoare triple {46945#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46941#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,674 INFO L290 TraceCheckUtils]: 38: Hoare triple {46949#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46945#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,675 INFO L290 TraceCheckUtils]: 37: Hoare triple {46953#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46949#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,676 INFO L290 TraceCheckUtils]: 36: Hoare triple {46957#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46953#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,676 INFO L290 TraceCheckUtils]: 35: Hoare triple {46961#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46957#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,677 INFO L290 TraceCheckUtils]: 34: Hoare triple {46965#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46961#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,677 INFO L290 TraceCheckUtils]: 33: Hoare triple {46969#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46965#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,678 INFO L290 TraceCheckUtils]: 32: Hoare triple {46973#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46969#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,679 INFO L290 TraceCheckUtils]: 31: Hoare triple {46977#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46973#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,679 INFO L290 TraceCheckUtils]: 30: Hoare triple {46981#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46977#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,680 INFO L290 TraceCheckUtils]: 29: Hoare triple {46985#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46981#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,680 INFO L290 TraceCheckUtils]: 28: Hoare triple {46989#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46985#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,681 INFO L290 TraceCheckUtils]: 27: Hoare triple {46993#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46989#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,681 INFO L290 TraceCheckUtils]: 26: Hoare triple {46997#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46993#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,682 INFO L290 TraceCheckUtils]: 25: Hoare triple {47001#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {46997#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,683 INFO L290 TraceCheckUtils]: 24: Hoare triple {47005#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47001#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,683 INFO L290 TraceCheckUtils]: 23: Hoare triple {47009#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47005#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,684 INFO L290 TraceCheckUtils]: 22: Hoare triple {47013#(< (mod (+ main_~x~0 102) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47009#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,684 INFO L290 TraceCheckUtils]: 21: Hoare triple {47017#(< (mod (+ 104 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47013#(< (mod (+ main_~x~0 102) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,685 INFO L290 TraceCheckUtils]: 20: Hoare triple {47021#(< (mod (+ 106 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47017#(< (mod (+ 104 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,686 INFO L290 TraceCheckUtils]: 19: Hoare triple {47025#(< (mod (+ 108 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47021#(< (mod (+ 106 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,686 INFO L290 TraceCheckUtils]: 18: Hoare triple {47029#(< (mod (+ 110 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47025#(< (mod (+ 108 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,687 INFO L290 TraceCheckUtils]: 17: Hoare triple {47033#(< (mod (+ 112 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47029#(< (mod (+ 110 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,687 INFO L290 TraceCheckUtils]: 16: Hoare triple {47037#(< (mod (+ main_~x~0 114) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47033#(< (mod (+ 112 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,688 INFO L290 TraceCheckUtils]: 15: Hoare triple {47041#(< (mod (+ 116 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47037#(< (mod (+ main_~x~0 114) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {47045#(< (mod (+ main_~x~0 118) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47041#(< (mod (+ 116 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,689 INFO L290 TraceCheckUtils]: 13: Hoare triple {47049#(< (mod (+ main_~x~0 120) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47045#(< (mod (+ main_~x~0 118) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,690 INFO L290 TraceCheckUtils]: 12: Hoare triple {47053#(< (mod (+ main_~x~0 122) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47049#(< (mod (+ main_~x~0 120) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {47057#(< (mod (+ main_~x~0 124) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47053#(< (mod (+ main_~x~0 122) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,692 INFO L290 TraceCheckUtils]: 10: Hoare triple {47061#(< (mod (+ main_~x~0 126) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47057#(< (mod (+ main_~x~0 124) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,692 INFO L290 TraceCheckUtils]: 9: Hoare triple {47065#(< (mod (+ main_~x~0 128) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47061#(< (mod (+ main_~x~0 126) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,693 INFO L290 TraceCheckUtils]: 8: Hoare triple {47069#(< (mod (+ main_~x~0 130) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47065#(< (mod (+ main_~x~0 128) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,693 INFO L290 TraceCheckUtils]: 7: Hoare triple {47073#(< (mod (+ main_~x~0 132) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47069#(< (mod (+ main_~x~0 130) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,694 INFO L290 TraceCheckUtils]: 6: Hoare triple {47077#(< (mod (+ main_~x~0 134) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47073#(< (mod (+ main_~x~0 132) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {46488#true} ~x~0 := 0; {47077#(< (mod (+ main_~x~0 134) 4294967296) 268435455)} is VALID [2022-04-28 03:12:08,694 INFO L272 TraceCheckUtils]: 4: Hoare triple {46488#true} call #t~ret4 := main(); {46488#true} is VALID [2022-04-28 03:12:08,695 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46488#true} {46488#true} #34#return; {46488#true} is VALID [2022-04-28 03:12:08,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {46488#true} assume true; {46488#true} is VALID [2022-04-28 03:12:08,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {46488#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {46488#true} is VALID [2022-04-28 03:12:08,695 INFO L272 TraceCheckUtils]: 0: Hoare triple {46488#true} call ULTIMATE.init(); {46488#true} is VALID [2022-04-28 03:12:08,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:12:08,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1800872038] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:12:08,696 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:12:08,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 70, 70] total 140 [2022-04-28 03:12:08,696 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:12:08,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1303951593] [2022-04-28 03:12:08,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1303951593] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:08,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:12:08,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [71] imperfect sequences [] total 71 [2022-04-28 03:12:08,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079442851] [2022-04-28 03:12:08,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:12:08,697 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 1.0422535211267605) internal successors, (74), 70 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2022-04-28 03:12:08,697 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:12:08,697 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 71 states, 71 states have (on average 1.0422535211267605) internal successors, (74), 70 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:12:08,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:12:08,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-04-28 03:12:08,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:08,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-04-28 03:12:08,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5037, Invalid=14423, Unknown=0, NotChecked=0, Total=19460 [2022-04-28 03:12:08,737 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand has 71 states, 71 states have (on average 1.0422535211267605) internal successors, (74), 70 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:12:17,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:17,271 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2022-04-28 03:12:17,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-04-28 03:12:17,271 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 1.0422535211267605) internal successors, (74), 70 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2022-04-28 03:12:17,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:12:17,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.0422535211267605) internal successors, (74), 70 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:12:17,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 85 transitions. [2022-04-28 03:12:17,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.0422535211267605) internal successors, (74), 70 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:12:17,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 85 transitions. [2022-04-28 03:12:17,273 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 85 transitions. [2022-04-28 03:12:17,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:12:17,349 INFO L225 Difference]: With dead ends: 85 [2022-04-28 03:12:17,349 INFO L226 Difference]: Without dead ends: 80 [2022-04-28 03:12:17,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2418 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=10067, Invalid=32989, Unknown=0, NotChecked=0, Total=43056 [2022-04-28 03:12:17,352 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 4803 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 4940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 4803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:12:17,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 258 Invalid, 4940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 4803 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-04-28 03:12:17,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-28 03:12:17,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-04-28 03:12:17,432 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:12:17,433 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 80 states, 75 states have (on average 1.0133333333333334) internal successors, (76), 75 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:12:17,433 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 80 states, 75 states have (on average 1.0133333333333334) internal successors, (76), 75 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:12:17,433 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 80 states, 75 states have (on average 1.0133333333333334) internal successors, (76), 75 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:12:17,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:17,433 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2022-04-28 03:12:17,433 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2022-04-28 03:12:17,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:17,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:17,434 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 75 states have (on average 1.0133333333333334) internal successors, (76), 75 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 80 states. [2022-04-28 03:12:17,434 INFO L87 Difference]: Start difference. First operand has 80 states, 75 states have (on average 1.0133333333333334) internal successors, (76), 75 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 80 states. [2022-04-28 03:12:17,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:17,434 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2022-04-28 03:12:17,435 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2022-04-28 03:12:17,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:17,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:17,435 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:12:17,435 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:12:17,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.0133333333333334) internal successors, (76), 75 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:12:17,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2022-04-28 03:12:17,436 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2022-04-28 03:12:17,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:12:17,436 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2022-04-28 03:12:17,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 1.0422535211267605) internal successors, (74), 70 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:12:17,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 80 transitions. [2022-04-28 03:12:17,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:12:17,499 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2022-04-28 03:12:17,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-28 03:12:17,499 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:12:17,499 INFO L195 NwaCegarLoop]: trace histogram [68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:12:17,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (135)] Ended with exit code 0 [2022-04-28 03:12:17,704 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (134)] Forceful destruction successful, exit code 0 [2022-04-28 03:12:17,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 135 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,134 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable134,SelfDestructingSolverStorable135 [2022-04-28 03:12:17,900 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:12:17,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:12:17,900 INFO L85 PathProgramCache]: Analyzing trace with hash 927107676, now seen corresponding path program 135 times [2022-04-28 03:12:17,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:17,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [146275707] [2022-04-28 03:12:18,756 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:12:18,757 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:12:18,759 INFO L85 PathProgramCache]: Analyzing trace with hash 2092750263, now seen corresponding path program 1 times [2022-04-28 03:12:18,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:12:18,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520136019] [2022-04-28 03:12:18,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:18,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:12:18,762 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_68.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_68.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:12:18,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:12:18,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1845557044] [2022-04-28 03:12:18,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:18,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:12:18,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:12:18,766 INFO L229 MonitoredProcess]: Starting monitored process 136 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:12:18,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (136)] Waiting until timeout for monitored process [2022-04-28 03:12:18,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:12:18,809 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:12:18,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:12:18,837 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:12:18,838 INFO L85 PathProgramCache]: Analyzing trace with hash 927107676, now seen corresponding path program 136 times [2022-04-28 03:12:18,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:12:18,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807052509] [2022-04-28 03:12:18,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:18,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:12:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:20,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:12:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:20,901 INFO L290 TraceCheckUtils]: 0: Hoare triple {47798#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {47724#true} is VALID [2022-04-28 03:12:20,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {47724#true} assume true; {47724#true} is VALID [2022-04-28 03:12:20,902 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47724#true} {47724#true} #34#return; {47724#true} is VALID [2022-04-28 03:12:20,902 INFO L272 TraceCheckUtils]: 0: Hoare triple {47724#true} call ULTIMATE.init(); {47798#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:12:20,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {47798#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {47724#true} is VALID [2022-04-28 03:12:20,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {47724#true} assume true; {47724#true} is VALID [2022-04-28 03:12:20,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47724#true} {47724#true} #34#return; {47724#true} is VALID [2022-04-28 03:12:20,902 INFO L272 TraceCheckUtils]: 4: Hoare triple {47724#true} call #t~ret4 := main(); {47724#true} is VALID [2022-04-28 03:12:20,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {47724#true} ~x~0 := 0; {47729#(= main_~x~0 0)} is VALID [2022-04-28 03:12:20,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {47729#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47730#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:12:20,903 INFO L290 TraceCheckUtils]: 7: Hoare triple {47730#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47731#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:12:20,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {47731#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47732#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:12:20,904 INFO L290 TraceCheckUtils]: 9: Hoare triple {47732#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47733#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:12:20,905 INFO L290 TraceCheckUtils]: 10: Hoare triple {47733#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47734#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:12:20,905 INFO L290 TraceCheckUtils]: 11: Hoare triple {47734#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47735#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:12:20,906 INFO L290 TraceCheckUtils]: 12: Hoare triple {47735#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47736#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:12:20,906 INFO L290 TraceCheckUtils]: 13: Hoare triple {47736#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47737#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:12:20,907 INFO L290 TraceCheckUtils]: 14: Hoare triple {47737#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47738#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:12:20,907 INFO L290 TraceCheckUtils]: 15: Hoare triple {47738#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47739#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:12:20,908 INFO L290 TraceCheckUtils]: 16: Hoare triple {47739#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47740#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:12:20,908 INFO L290 TraceCheckUtils]: 17: Hoare triple {47740#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47741#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:12:20,908 INFO L290 TraceCheckUtils]: 18: Hoare triple {47741#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47742#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:12:20,909 INFO L290 TraceCheckUtils]: 19: Hoare triple {47742#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47743#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:12:20,909 INFO L290 TraceCheckUtils]: 20: Hoare triple {47743#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47744#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:12:20,910 INFO L290 TraceCheckUtils]: 21: Hoare triple {47744#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47745#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:12:20,910 INFO L290 TraceCheckUtils]: 22: Hoare triple {47745#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47746#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:12:20,911 INFO L290 TraceCheckUtils]: 23: Hoare triple {47746#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47747#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:12:20,911 INFO L290 TraceCheckUtils]: 24: Hoare triple {47747#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47748#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:12:20,912 INFO L290 TraceCheckUtils]: 25: Hoare triple {47748#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47749#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:12:20,912 INFO L290 TraceCheckUtils]: 26: Hoare triple {47749#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47750#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:12:20,913 INFO L290 TraceCheckUtils]: 27: Hoare triple {47750#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47751#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:12:20,913 INFO L290 TraceCheckUtils]: 28: Hoare triple {47751#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47752#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:12:20,914 INFO L290 TraceCheckUtils]: 29: Hoare triple {47752#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47753#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:12:20,914 INFO L290 TraceCheckUtils]: 30: Hoare triple {47753#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47754#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:12:20,914 INFO L290 TraceCheckUtils]: 31: Hoare triple {47754#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47755#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:12:20,915 INFO L290 TraceCheckUtils]: 32: Hoare triple {47755#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47756#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:12:20,915 INFO L290 TraceCheckUtils]: 33: Hoare triple {47756#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47757#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:12:20,916 INFO L290 TraceCheckUtils]: 34: Hoare triple {47757#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47758#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:12:20,916 INFO L290 TraceCheckUtils]: 35: Hoare triple {47758#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47759#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:12:20,917 INFO L290 TraceCheckUtils]: 36: Hoare triple {47759#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47760#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:12:20,917 INFO L290 TraceCheckUtils]: 37: Hoare triple {47760#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47761#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:12:20,918 INFO L290 TraceCheckUtils]: 38: Hoare triple {47761#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47762#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:12:20,918 INFO L290 TraceCheckUtils]: 39: Hoare triple {47762#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47763#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:12:20,919 INFO L290 TraceCheckUtils]: 40: Hoare triple {47763#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47764#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:12:20,919 INFO L290 TraceCheckUtils]: 41: Hoare triple {47764#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47765#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:12:20,919 INFO L290 TraceCheckUtils]: 42: Hoare triple {47765#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47766#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:12:20,920 INFO L290 TraceCheckUtils]: 43: Hoare triple {47766#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47767#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:12:20,920 INFO L290 TraceCheckUtils]: 44: Hoare triple {47767#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47768#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:12:20,921 INFO L290 TraceCheckUtils]: 45: Hoare triple {47768#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47769#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:12:20,921 INFO L290 TraceCheckUtils]: 46: Hoare triple {47769#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47770#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:12:20,922 INFO L290 TraceCheckUtils]: 47: Hoare triple {47770#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47771#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:12:20,922 INFO L290 TraceCheckUtils]: 48: Hoare triple {47771#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47772#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:12:20,923 INFO L290 TraceCheckUtils]: 49: Hoare triple {47772#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47773#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:12:20,923 INFO L290 TraceCheckUtils]: 50: Hoare triple {47773#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47774#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 03:12:20,924 INFO L290 TraceCheckUtils]: 51: Hoare triple {47774#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47775#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 03:12:20,924 INFO L290 TraceCheckUtils]: 52: Hoare triple {47775#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47776#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 03:12:20,925 INFO L290 TraceCheckUtils]: 53: Hoare triple {47776#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47777#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-28 03:12:20,925 INFO L290 TraceCheckUtils]: 54: Hoare triple {47777#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47778#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-28 03:12:20,925 INFO L290 TraceCheckUtils]: 55: Hoare triple {47778#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47779#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-28 03:12:20,926 INFO L290 TraceCheckUtils]: 56: Hoare triple {47779#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47780#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-28 03:12:20,926 INFO L290 TraceCheckUtils]: 57: Hoare triple {47780#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47781#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-28 03:12:20,927 INFO L290 TraceCheckUtils]: 58: Hoare triple {47781#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47782#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-28 03:12:20,927 INFO L290 TraceCheckUtils]: 59: Hoare triple {47782#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47783#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-28 03:12:20,928 INFO L290 TraceCheckUtils]: 60: Hoare triple {47783#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47784#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-28 03:12:20,928 INFO L290 TraceCheckUtils]: 61: Hoare triple {47784#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47785#(and (<= main_~x~0 112) (<= 112 main_~x~0))} is VALID [2022-04-28 03:12:20,929 INFO L290 TraceCheckUtils]: 62: Hoare triple {47785#(and (<= main_~x~0 112) (<= 112 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47786#(and (<= main_~x~0 114) (<= 114 main_~x~0))} is VALID [2022-04-28 03:12:20,929 INFO L290 TraceCheckUtils]: 63: Hoare triple {47786#(and (<= main_~x~0 114) (<= 114 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47787#(and (<= main_~x~0 116) (<= 116 main_~x~0))} is VALID [2022-04-28 03:12:20,930 INFO L290 TraceCheckUtils]: 64: Hoare triple {47787#(and (<= main_~x~0 116) (<= 116 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47788#(and (<= 118 main_~x~0) (<= main_~x~0 118))} is VALID [2022-04-28 03:12:20,930 INFO L290 TraceCheckUtils]: 65: Hoare triple {47788#(and (<= 118 main_~x~0) (<= main_~x~0 118))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47789#(and (<= main_~x~0 120) (<= 120 main_~x~0))} is VALID [2022-04-28 03:12:20,931 INFO L290 TraceCheckUtils]: 66: Hoare triple {47789#(and (<= main_~x~0 120) (<= 120 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47790#(and (<= 122 main_~x~0) (<= main_~x~0 122))} is VALID [2022-04-28 03:12:20,931 INFO L290 TraceCheckUtils]: 67: Hoare triple {47790#(and (<= 122 main_~x~0) (<= main_~x~0 122))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47791#(and (<= 124 main_~x~0) (<= main_~x~0 124))} is VALID [2022-04-28 03:12:20,932 INFO L290 TraceCheckUtils]: 68: Hoare triple {47791#(and (<= 124 main_~x~0) (<= main_~x~0 124))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47792#(and (<= 126 main_~x~0) (<= main_~x~0 126))} is VALID [2022-04-28 03:12:20,932 INFO L290 TraceCheckUtils]: 69: Hoare triple {47792#(and (<= 126 main_~x~0) (<= main_~x~0 126))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47793#(and (<= 128 main_~x~0) (<= main_~x~0 128))} is VALID [2022-04-28 03:12:20,932 INFO L290 TraceCheckUtils]: 70: Hoare triple {47793#(and (<= 128 main_~x~0) (<= main_~x~0 128))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47794#(and (<= 130 main_~x~0) (<= main_~x~0 130))} is VALID [2022-04-28 03:12:20,933 INFO L290 TraceCheckUtils]: 71: Hoare triple {47794#(and (<= 130 main_~x~0) (<= main_~x~0 130))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47795#(and (<= main_~x~0 132) (<= 132 main_~x~0))} is VALID [2022-04-28 03:12:20,933 INFO L290 TraceCheckUtils]: 72: Hoare triple {47795#(and (<= main_~x~0 132) (<= 132 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47796#(and (<= 134 main_~x~0) (<= main_~x~0 134))} is VALID [2022-04-28 03:12:20,934 INFO L290 TraceCheckUtils]: 73: Hoare triple {47796#(and (<= 134 main_~x~0) (<= main_~x~0 134))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47797#(and (<= main_~x~0 136) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:12:20,934 INFO L290 TraceCheckUtils]: 74: Hoare triple {47797#(and (<= main_~x~0 136) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {47725#false} is VALID [2022-04-28 03:12:20,934 INFO L272 TraceCheckUtils]: 75: Hoare triple {47725#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {47725#false} is VALID [2022-04-28 03:12:20,934 INFO L290 TraceCheckUtils]: 76: Hoare triple {47725#false} ~cond := #in~cond; {47725#false} is VALID [2022-04-28 03:12:20,935 INFO L290 TraceCheckUtils]: 77: Hoare triple {47725#false} assume 0 == ~cond; {47725#false} is VALID [2022-04-28 03:12:20,935 INFO L290 TraceCheckUtils]: 78: Hoare triple {47725#false} assume !false; {47725#false} is VALID [2022-04-28 03:12:20,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:12:20,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:12:20,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807052509] [2022-04-28 03:12:20,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807052509] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:12:20,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516724870] [2022-04-28 03:12:20,935 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 03:12:20,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:12:20,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:12:20,937 INFO L229 MonitoredProcess]: Starting monitored process 137 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:12:20,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (137)] Waiting until timeout for monitored process [2022-04-28 03:12:21,079 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 03:12:21,079 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 03:12:21,081 WARN L261 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 139 conjunts are in the unsatisfiable core [2022-04-28 03:12:21,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:21,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:12:21,810 INFO L272 TraceCheckUtils]: 0: Hoare triple {47724#true} call ULTIMATE.init(); {47724#true} is VALID [2022-04-28 03:12:21,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {47724#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {47724#true} is VALID [2022-04-28 03:12:21,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {47724#true} assume true; {47724#true} is VALID [2022-04-28 03:12:21,810 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47724#true} {47724#true} #34#return; {47724#true} is VALID [2022-04-28 03:12:21,810 INFO L272 TraceCheckUtils]: 4: Hoare triple {47724#true} call #t~ret4 := main(); {47724#true} is VALID [2022-04-28 03:12:21,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {47724#true} ~x~0 := 0; {47729#(= main_~x~0 0)} is VALID [2022-04-28 03:12:21,811 INFO L290 TraceCheckUtils]: 6: Hoare triple {47729#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47730#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:12:21,812 INFO L290 TraceCheckUtils]: 7: Hoare triple {47730#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47731#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:12:21,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {47731#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47732#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:12:21,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {47732#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47733#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:12:21,813 INFO L290 TraceCheckUtils]: 10: Hoare triple {47733#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47734#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:12:21,814 INFO L290 TraceCheckUtils]: 11: Hoare triple {47734#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47735#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:12:21,814 INFO L290 TraceCheckUtils]: 12: Hoare triple {47735#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47736#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:12:21,814 INFO L290 TraceCheckUtils]: 13: Hoare triple {47736#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47737#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:12:21,815 INFO L290 TraceCheckUtils]: 14: Hoare triple {47737#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47738#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:12:21,815 INFO L290 TraceCheckUtils]: 15: Hoare triple {47738#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47739#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:12:21,816 INFO L290 TraceCheckUtils]: 16: Hoare triple {47739#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47740#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:12:21,816 INFO L290 TraceCheckUtils]: 17: Hoare triple {47740#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47741#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:12:21,817 INFO L290 TraceCheckUtils]: 18: Hoare triple {47741#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47742#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:12:21,817 INFO L290 TraceCheckUtils]: 19: Hoare triple {47742#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47743#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:12:21,818 INFO L290 TraceCheckUtils]: 20: Hoare triple {47743#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47744#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:12:21,818 INFO L290 TraceCheckUtils]: 21: Hoare triple {47744#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47745#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:12:21,819 INFO L290 TraceCheckUtils]: 22: Hoare triple {47745#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47746#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:12:21,819 INFO L290 TraceCheckUtils]: 23: Hoare triple {47746#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47747#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:12:21,820 INFO L290 TraceCheckUtils]: 24: Hoare triple {47747#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47748#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:12:21,820 INFO L290 TraceCheckUtils]: 25: Hoare triple {47748#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47749#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:12:21,820 INFO L290 TraceCheckUtils]: 26: Hoare triple {47749#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47750#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:12:21,821 INFO L290 TraceCheckUtils]: 27: Hoare triple {47750#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47751#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:12:21,821 INFO L290 TraceCheckUtils]: 28: Hoare triple {47751#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47752#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:12:21,822 INFO L290 TraceCheckUtils]: 29: Hoare triple {47752#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47753#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:12:21,822 INFO L290 TraceCheckUtils]: 30: Hoare triple {47753#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47754#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:12:21,823 INFO L290 TraceCheckUtils]: 31: Hoare triple {47754#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47755#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:12:21,823 INFO L290 TraceCheckUtils]: 32: Hoare triple {47755#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47756#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:12:21,824 INFO L290 TraceCheckUtils]: 33: Hoare triple {47756#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47757#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:12:21,824 INFO L290 TraceCheckUtils]: 34: Hoare triple {47757#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47758#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:12:21,825 INFO L290 TraceCheckUtils]: 35: Hoare triple {47758#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47759#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:12:21,825 INFO L290 TraceCheckUtils]: 36: Hoare triple {47759#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47760#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:12:21,826 INFO L290 TraceCheckUtils]: 37: Hoare triple {47760#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47761#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:12:21,826 INFO L290 TraceCheckUtils]: 38: Hoare triple {47761#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47762#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:12:21,827 INFO L290 TraceCheckUtils]: 39: Hoare triple {47762#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47763#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:12:21,827 INFO L290 TraceCheckUtils]: 40: Hoare triple {47763#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47764#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:12:21,827 INFO L290 TraceCheckUtils]: 41: Hoare triple {47764#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47765#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:12:21,828 INFO L290 TraceCheckUtils]: 42: Hoare triple {47765#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47766#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:12:21,828 INFO L290 TraceCheckUtils]: 43: Hoare triple {47766#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47767#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:12:21,829 INFO L290 TraceCheckUtils]: 44: Hoare triple {47767#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47768#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:12:21,829 INFO L290 TraceCheckUtils]: 45: Hoare triple {47768#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47769#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:12:21,830 INFO L290 TraceCheckUtils]: 46: Hoare triple {47769#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47770#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:12:21,830 INFO L290 TraceCheckUtils]: 47: Hoare triple {47770#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47771#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:12:21,831 INFO L290 TraceCheckUtils]: 48: Hoare triple {47771#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47772#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:12:21,831 INFO L290 TraceCheckUtils]: 49: Hoare triple {47772#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47773#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:12:21,832 INFO L290 TraceCheckUtils]: 50: Hoare triple {47773#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47774#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 03:12:21,832 INFO L290 TraceCheckUtils]: 51: Hoare triple {47774#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47775#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 03:12:21,833 INFO L290 TraceCheckUtils]: 52: Hoare triple {47775#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47776#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 03:12:21,833 INFO L290 TraceCheckUtils]: 53: Hoare triple {47776#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47777#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-28 03:12:21,833 INFO L290 TraceCheckUtils]: 54: Hoare triple {47777#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47778#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-28 03:12:21,834 INFO L290 TraceCheckUtils]: 55: Hoare triple {47778#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47779#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-28 03:12:21,834 INFO L290 TraceCheckUtils]: 56: Hoare triple {47779#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47780#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-28 03:12:21,835 INFO L290 TraceCheckUtils]: 57: Hoare triple {47780#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47781#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-28 03:12:21,835 INFO L290 TraceCheckUtils]: 58: Hoare triple {47781#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47782#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-28 03:12:21,836 INFO L290 TraceCheckUtils]: 59: Hoare triple {47782#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47783#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-28 03:12:21,836 INFO L290 TraceCheckUtils]: 60: Hoare triple {47783#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47784#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-28 03:12:21,837 INFO L290 TraceCheckUtils]: 61: Hoare triple {47784#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47785#(and (<= main_~x~0 112) (<= 112 main_~x~0))} is VALID [2022-04-28 03:12:21,837 INFO L290 TraceCheckUtils]: 62: Hoare triple {47785#(and (<= main_~x~0 112) (<= 112 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47786#(and (<= main_~x~0 114) (<= 114 main_~x~0))} is VALID [2022-04-28 03:12:21,838 INFO L290 TraceCheckUtils]: 63: Hoare triple {47786#(and (<= main_~x~0 114) (<= 114 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47787#(and (<= main_~x~0 116) (<= 116 main_~x~0))} is VALID [2022-04-28 03:12:21,838 INFO L290 TraceCheckUtils]: 64: Hoare triple {47787#(and (<= main_~x~0 116) (<= 116 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47788#(and (<= 118 main_~x~0) (<= main_~x~0 118))} is VALID [2022-04-28 03:12:21,838 INFO L290 TraceCheckUtils]: 65: Hoare triple {47788#(and (<= 118 main_~x~0) (<= main_~x~0 118))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47789#(and (<= main_~x~0 120) (<= 120 main_~x~0))} is VALID [2022-04-28 03:12:21,839 INFO L290 TraceCheckUtils]: 66: Hoare triple {47789#(and (<= main_~x~0 120) (<= 120 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47790#(and (<= 122 main_~x~0) (<= main_~x~0 122))} is VALID [2022-04-28 03:12:21,839 INFO L290 TraceCheckUtils]: 67: Hoare triple {47790#(and (<= 122 main_~x~0) (<= main_~x~0 122))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47791#(and (<= 124 main_~x~0) (<= main_~x~0 124))} is VALID [2022-04-28 03:12:21,840 INFO L290 TraceCheckUtils]: 68: Hoare triple {47791#(and (<= 124 main_~x~0) (<= main_~x~0 124))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47792#(and (<= 126 main_~x~0) (<= main_~x~0 126))} is VALID [2022-04-28 03:12:21,840 INFO L290 TraceCheckUtils]: 69: Hoare triple {47792#(and (<= 126 main_~x~0) (<= main_~x~0 126))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47793#(and (<= 128 main_~x~0) (<= main_~x~0 128))} is VALID [2022-04-28 03:12:21,841 INFO L290 TraceCheckUtils]: 70: Hoare triple {47793#(and (<= 128 main_~x~0) (<= main_~x~0 128))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47794#(and (<= 130 main_~x~0) (<= main_~x~0 130))} is VALID [2022-04-28 03:12:21,841 INFO L290 TraceCheckUtils]: 71: Hoare triple {47794#(and (<= 130 main_~x~0) (<= main_~x~0 130))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47795#(and (<= main_~x~0 132) (<= 132 main_~x~0))} is VALID [2022-04-28 03:12:21,842 INFO L290 TraceCheckUtils]: 72: Hoare triple {47795#(and (<= main_~x~0 132) (<= 132 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {47796#(and (<= 134 main_~x~0) (<= main_~x~0 134))} is VALID [2022-04-28 03:12:21,842 INFO L290 TraceCheckUtils]: 73: Hoare triple {47796#(and (<= 134 main_~x~0) (<= main_~x~0 134))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48021#(and (<= main_~x~0 136) (<= 136 main_~x~0))} is VALID [2022-04-28 03:12:21,843 INFO L290 TraceCheckUtils]: 74: Hoare triple {48021#(and (<= main_~x~0 136) (<= 136 main_~x~0))} assume !(~x~0 % 4294967296 < 268435455); {47725#false} is VALID [2022-04-28 03:12:21,843 INFO L272 TraceCheckUtils]: 75: Hoare triple {47725#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {47725#false} is VALID [2022-04-28 03:12:21,843 INFO L290 TraceCheckUtils]: 76: Hoare triple {47725#false} ~cond := #in~cond; {47725#false} is VALID [2022-04-28 03:12:21,843 INFO L290 TraceCheckUtils]: 77: Hoare triple {47725#false} assume 0 == ~cond; {47725#false} is VALID [2022-04-28 03:12:21,843 INFO L290 TraceCheckUtils]: 78: Hoare triple {47725#false} assume !false; {47725#false} is VALID [2022-04-28 03:12:21,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:12:21,843 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:12:28,635 INFO L290 TraceCheckUtils]: 78: Hoare triple {47725#false} assume !false; {47725#false} is VALID [2022-04-28 03:12:28,635 INFO L290 TraceCheckUtils]: 77: Hoare triple {47725#false} assume 0 == ~cond; {47725#false} is VALID [2022-04-28 03:12:28,635 INFO L290 TraceCheckUtils]: 76: Hoare triple {47725#false} ~cond := #in~cond; {47725#false} is VALID [2022-04-28 03:12:28,635 INFO L272 TraceCheckUtils]: 75: Hoare triple {47725#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {47725#false} is VALID [2022-04-28 03:12:28,635 INFO L290 TraceCheckUtils]: 74: Hoare triple {48049#(< (mod main_~x~0 4294967296) 268435455)} assume !(~x~0 % 4294967296 < 268435455); {47725#false} is VALID [2022-04-28 03:12:28,637 INFO L290 TraceCheckUtils]: 73: Hoare triple {48053#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48049#(< (mod main_~x~0 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,638 INFO L290 TraceCheckUtils]: 72: Hoare triple {48057#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48053#(< (mod (+ main_~x~0 2) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,638 INFO L290 TraceCheckUtils]: 71: Hoare triple {48061#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48057#(< (mod (+ main_~x~0 4) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,640 INFO L290 TraceCheckUtils]: 70: Hoare triple {48065#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48061#(< (mod (+ main_~x~0 6) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,641 INFO L290 TraceCheckUtils]: 69: Hoare triple {48069#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48065#(< (mod (+ main_~x~0 8) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,641 INFO L290 TraceCheckUtils]: 68: Hoare triple {48073#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48069#(< (mod (+ main_~x~0 10) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,642 INFO L290 TraceCheckUtils]: 67: Hoare triple {48077#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48073#(< (mod (+ main_~x~0 12) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,642 INFO L290 TraceCheckUtils]: 66: Hoare triple {48081#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48077#(< (mod (+ main_~x~0 14) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,643 INFO L290 TraceCheckUtils]: 65: Hoare triple {48085#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48081#(< (mod (+ main_~x~0 16) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,643 INFO L290 TraceCheckUtils]: 64: Hoare triple {48089#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48085#(< (mod (+ main_~x~0 18) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,644 INFO L290 TraceCheckUtils]: 63: Hoare triple {48093#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48089#(< (mod (+ main_~x~0 20) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,645 INFO L290 TraceCheckUtils]: 62: Hoare triple {48097#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48093#(< (mod (+ main_~x~0 22) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,645 INFO L290 TraceCheckUtils]: 61: Hoare triple {48101#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48097#(< (mod (+ main_~x~0 24) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,646 INFO L290 TraceCheckUtils]: 60: Hoare triple {48105#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48101#(< (mod (+ main_~x~0 26) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,646 INFO L290 TraceCheckUtils]: 59: Hoare triple {48109#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48105#(< (mod (+ main_~x~0 28) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,647 INFO L290 TraceCheckUtils]: 58: Hoare triple {48113#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48109#(< (mod (+ 30 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,647 INFO L290 TraceCheckUtils]: 57: Hoare triple {48117#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48113#(< (mod (+ 32 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,648 INFO L290 TraceCheckUtils]: 56: Hoare triple {48121#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48117#(< (mod (+ main_~x~0 34) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,649 INFO L290 TraceCheckUtils]: 55: Hoare triple {48125#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48121#(< (mod (+ main_~x~0 36) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,649 INFO L290 TraceCheckUtils]: 54: Hoare triple {48129#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48125#(< (mod (+ main_~x~0 38) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,650 INFO L290 TraceCheckUtils]: 53: Hoare triple {48133#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48129#(< (mod (+ 40 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,650 INFO L290 TraceCheckUtils]: 52: Hoare triple {48137#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48133#(< (mod (+ 42 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,651 INFO L290 TraceCheckUtils]: 51: Hoare triple {48141#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48137#(< (mod (+ 44 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,652 INFO L290 TraceCheckUtils]: 50: Hoare triple {48145#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48141#(< (mod (+ main_~x~0 46) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,652 INFO L290 TraceCheckUtils]: 49: Hoare triple {48149#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48145#(< (mod (+ main_~x~0 48) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,653 INFO L290 TraceCheckUtils]: 48: Hoare triple {48153#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48149#(< (mod (+ main_~x~0 50) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,653 INFO L290 TraceCheckUtils]: 47: Hoare triple {48157#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48153#(< (mod (+ main_~x~0 52) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,654 INFO L290 TraceCheckUtils]: 46: Hoare triple {48161#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48157#(< (mod (+ main_~x~0 54) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,654 INFO L290 TraceCheckUtils]: 45: Hoare triple {48165#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48161#(< (mod (+ 56 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,655 INFO L290 TraceCheckUtils]: 44: Hoare triple {48169#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48165#(< (mod (+ main_~x~0 58) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,656 INFO L290 TraceCheckUtils]: 43: Hoare triple {48173#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48169#(< (mod (+ main_~x~0 60) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,656 INFO L290 TraceCheckUtils]: 42: Hoare triple {48177#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48173#(< (mod (+ main_~x~0 62) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,657 INFO L290 TraceCheckUtils]: 41: Hoare triple {48181#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48177#(< (mod (+ 64 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,657 INFO L290 TraceCheckUtils]: 40: Hoare triple {48185#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48181#(< (mod (+ 66 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,658 INFO L290 TraceCheckUtils]: 39: Hoare triple {48189#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48185#(< (mod (+ 68 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,659 INFO L290 TraceCheckUtils]: 38: Hoare triple {48193#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48189#(< (mod (+ main_~x~0 70) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,659 INFO L290 TraceCheckUtils]: 37: Hoare triple {48197#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48193#(< (mod (+ 72 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,660 INFO L290 TraceCheckUtils]: 36: Hoare triple {48201#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48197#(< (mod (+ main_~x~0 74) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,660 INFO L290 TraceCheckUtils]: 35: Hoare triple {48205#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48201#(< (mod (+ 76 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,661 INFO L290 TraceCheckUtils]: 34: Hoare triple {48209#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48205#(< (mod (+ main_~x~0 78) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,662 INFO L290 TraceCheckUtils]: 33: Hoare triple {48213#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48209#(< (mod (+ main_~x~0 80) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,662 INFO L290 TraceCheckUtils]: 32: Hoare triple {48217#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48213#(< (mod (+ main_~x~0 82) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,663 INFO L290 TraceCheckUtils]: 31: Hoare triple {48221#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48217#(< (mod (+ 84 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,663 INFO L290 TraceCheckUtils]: 30: Hoare triple {48225#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48221#(< (mod (+ main_~x~0 86) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,664 INFO L290 TraceCheckUtils]: 29: Hoare triple {48229#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48225#(< (mod (+ 88 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,665 INFO L290 TraceCheckUtils]: 28: Hoare triple {48233#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48229#(< (mod (+ main_~x~0 90) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,665 INFO L290 TraceCheckUtils]: 27: Hoare triple {48237#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48233#(< (mod (+ 92 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,666 INFO L290 TraceCheckUtils]: 26: Hoare triple {48241#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48237#(< (mod (+ 94 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,666 INFO L290 TraceCheckUtils]: 25: Hoare triple {48245#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48241#(< (mod (+ main_~x~0 96) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,667 INFO L290 TraceCheckUtils]: 24: Hoare triple {48249#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48245#(< (mod (+ 98 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,667 INFO L290 TraceCheckUtils]: 23: Hoare triple {48253#(< (mod (+ main_~x~0 102) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48249#(< (mod (+ main_~x~0 100) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,668 INFO L290 TraceCheckUtils]: 22: Hoare triple {48257#(< (mod (+ 104 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48253#(< (mod (+ main_~x~0 102) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,669 INFO L290 TraceCheckUtils]: 21: Hoare triple {48261#(< (mod (+ 106 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48257#(< (mod (+ 104 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,669 INFO L290 TraceCheckUtils]: 20: Hoare triple {48265#(< (mod (+ 108 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48261#(< (mod (+ 106 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,670 INFO L290 TraceCheckUtils]: 19: Hoare triple {48269#(< (mod (+ 110 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48265#(< (mod (+ 108 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,670 INFO L290 TraceCheckUtils]: 18: Hoare triple {48273#(< (mod (+ 112 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48269#(< (mod (+ 110 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,671 INFO L290 TraceCheckUtils]: 17: Hoare triple {48277#(< (mod (+ main_~x~0 114) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48273#(< (mod (+ 112 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,671 INFO L290 TraceCheckUtils]: 16: Hoare triple {48281#(< (mod (+ 116 main_~x~0) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48277#(< (mod (+ main_~x~0 114) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,672 INFO L290 TraceCheckUtils]: 15: Hoare triple {48285#(< (mod (+ main_~x~0 118) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48281#(< (mod (+ 116 main_~x~0) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,673 INFO L290 TraceCheckUtils]: 14: Hoare triple {48289#(< (mod (+ main_~x~0 120) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48285#(< (mod (+ main_~x~0 118) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,673 INFO L290 TraceCheckUtils]: 13: Hoare triple {48293#(< (mod (+ main_~x~0 122) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48289#(< (mod (+ main_~x~0 120) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,674 INFO L290 TraceCheckUtils]: 12: Hoare triple {48297#(< (mod (+ main_~x~0 124) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48293#(< (mod (+ main_~x~0 122) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,674 INFO L290 TraceCheckUtils]: 11: Hoare triple {48301#(< (mod (+ main_~x~0 126) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48297#(< (mod (+ main_~x~0 124) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,675 INFO L290 TraceCheckUtils]: 10: Hoare triple {48305#(< (mod (+ main_~x~0 128) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48301#(< (mod (+ main_~x~0 126) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,676 INFO L290 TraceCheckUtils]: 9: Hoare triple {48309#(< (mod (+ main_~x~0 130) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48305#(< (mod (+ main_~x~0 128) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,676 INFO L290 TraceCheckUtils]: 8: Hoare triple {48313#(< (mod (+ main_~x~0 132) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48309#(< (mod (+ main_~x~0 130) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {48317#(< (mod (+ main_~x~0 134) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48313#(< (mod (+ main_~x~0 132) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,677 INFO L290 TraceCheckUtils]: 6: Hoare triple {48321#(< (mod (+ main_~x~0 136) 4294967296) 268435455)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48317#(< (mod (+ main_~x~0 134) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {47724#true} ~x~0 := 0; {48321#(< (mod (+ main_~x~0 136) 4294967296) 268435455)} is VALID [2022-04-28 03:12:28,678 INFO L272 TraceCheckUtils]: 4: Hoare triple {47724#true} call #t~ret4 := main(); {47724#true} is VALID [2022-04-28 03:12:28,678 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47724#true} {47724#true} #34#return; {47724#true} is VALID [2022-04-28 03:12:28,678 INFO L290 TraceCheckUtils]: 2: Hoare triple {47724#true} assume true; {47724#true} is VALID [2022-04-28 03:12:28,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {47724#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {47724#true} is VALID [2022-04-28 03:12:28,678 INFO L272 TraceCheckUtils]: 0: Hoare triple {47724#true} call ULTIMATE.init(); {47724#true} is VALID [2022-04-28 03:12:28,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:12:28,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516724870] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:12:28,679 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:12:28,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 71, 71] total 142 [2022-04-28 03:12:28,679 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:12:28,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [146275707] [2022-04-28 03:12:28,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [146275707] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:12:28,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:12:28,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [72] imperfect sequences [] total 72 [2022-04-28 03:12:28,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976696400] [2022-04-28 03:12:28,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:12:28,680 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 71 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 79 [2022-04-28 03:12:28,680 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:12:28,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 72 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 71 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:12:28,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:12:28,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-04-28 03:12:28,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:28,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-04-28 03:12:28,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5180, Invalid=14842, Unknown=0, NotChecked=0, Total=20022 [2022-04-28 03:12:28,721 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand has 72 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 71 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:12:37,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:37,337 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2022-04-28 03:12:37,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-04-28 03:12:37,338 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 71 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 79 [2022-04-28 03:12:37,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:12:37,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 71 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:12:37,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2022-04-28 03:12:37,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 71 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:12:37,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2022-04-28 03:12:37,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 72 states and 86 transitions. [2022-04-28 03:12:37,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:12:37,390 INFO L225 Difference]: With dead ends: 86 [2022-04-28 03:12:37,390 INFO L226 Difference]: Without dead ends: 81 [2022-04-28 03:12:37,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2488 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=10353, Invalid=33957, Unknown=0, NotChecked=0, Total=44310 [2022-04-28 03:12:37,392 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 4799 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 4938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 4799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:12:37,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 118 Invalid, 4938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 4799 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-04-28 03:12:37,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-28 03:12:37,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-04-28 03:12:37,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:12:37,485 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 81 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:12:37,486 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 81 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:12:37,486 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 81 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:12:37,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:37,486 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2022-04-28 03:12:37,486 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2022-04-28 03:12:37,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:37,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:37,487 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 81 states. [2022-04-28 03:12:37,487 INFO L87 Difference]: Start difference. First operand has 81 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 81 states. [2022-04-28 03:12:37,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:12:37,487 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2022-04-28 03:12:37,487 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2022-04-28 03:12:37,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:12:37,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:12:37,488 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:12:37,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:12:37,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 76 states have (on average 1.013157894736842) internal successors, (77), 76 states have internal predecessors, (77), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:12:37,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2022-04-28 03:12:37,488 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2022-04-28 03:12:37,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:12:37,489 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2022-04-28 03:12:37,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 1.0416666666666667) internal successors, (75), 71 states have internal predecessors, (75), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:12:37,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 81 transitions. [2022-04-28 03:12:37,550 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:12:37,550 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2022-04-28 03:12:37,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-28 03:12:37,550 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:12:37,550 INFO L195 NwaCegarLoop]: trace histogram [69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:12:37,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (137)] Ended with exit code 0 [2022-04-28 03:12:37,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (136)] Forceful destruction successful, exit code 0 [2022-04-28 03:12:37,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable137,137 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,136 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable136 [2022-04-28 03:12:37,951 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:12:37,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:12:37,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1287971850, now seen corresponding path program 137 times [2022-04-28 03:12:37,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:12:37,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2129463640] [2022-04-28 03:12:40,102 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:12:40,104 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:12:40,105 INFO L85 PathProgramCache]: Analyzing trace with hash -2143111689, now seen corresponding path program 1 times [2022-04-28 03:12:40,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:12:40,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582870130] [2022-04-28 03:12:40,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:40,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:12:40,109 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_69.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_69.0)) 4294967296)) 268435455) 0)) [2022-04-28 03:12:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 03:12:40,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [712518158] [2022-04-28 03:12:40,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:40,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:12:40,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:12:40,113 INFO L229 MonitoredProcess]: Starting monitored process 138 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:12:40,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (138)] Waiting until timeout for monitored process [2022-04-28 03:12:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:12:40,156 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 03:12:40,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 03:12:40,163 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 03:12:40,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1287971850, now seen corresponding path program 138 times [2022-04-28 03:12:40,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:12:40,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629887709] [2022-04-28 03:12:40,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:12:40,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:12:40,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:42,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:12:42,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:12:42,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {49051#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {48976#true} is VALID [2022-04-28 03:12:42,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {48976#true} assume true; {48976#true} is VALID [2022-04-28 03:12:42,312 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48976#true} {48976#true} #34#return; {48976#true} is VALID [2022-04-28 03:12:42,313 INFO L272 TraceCheckUtils]: 0: Hoare triple {48976#true} call ULTIMATE.init(); {49051#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:12:42,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {49051#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {48976#true} is VALID [2022-04-28 03:12:42,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {48976#true} assume true; {48976#true} is VALID [2022-04-28 03:12:42,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48976#true} {48976#true} #34#return; {48976#true} is VALID [2022-04-28 03:12:42,313 INFO L272 TraceCheckUtils]: 4: Hoare triple {48976#true} call #t~ret4 := main(); {48976#true} is VALID [2022-04-28 03:12:42,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {48976#true} ~x~0 := 0; {48981#(= main_~x~0 0)} is VALID [2022-04-28 03:12:42,314 INFO L290 TraceCheckUtils]: 6: Hoare triple {48981#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48982#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 03:12:42,314 INFO L290 TraceCheckUtils]: 7: Hoare triple {48982#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48983#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 03:12:42,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {48983#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48984#(and (<= 6 main_~x~0) (<= main_~x~0 6))} is VALID [2022-04-28 03:12:42,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {48984#(and (<= 6 main_~x~0) (<= main_~x~0 6))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48985#(and (<= main_~x~0 8) (<= 8 main_~x~0))} is VALID [2022-04-28 03:12:42,316 INFO L290 TraceCheckUtils]: 10: Hoare triple {48985#(and (<= main_~x~0 8) (<= 8 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48986#(and (<= main_~x~0 10) (<= 10 main_~x~0))} is VALID [2022-04-28 03:12:42,316 INFO L290 TraceCheckUtils]: 11: Hoare triple {48986#(and (<= main_~x~0 10) (<= 10 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48987#(and (<= main_~x~0 12) (<= 12 main_~x~0))} is VALID [2022-04-28 03:12:42,317 INFO L290 TraceCheckUtils]: 12: Hoare triple {48987#(and (<= main_~x~0 12) (<= 12 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48988#(and (<= 14 main_~x~0) (<= main_~x~0 14))} is VALID [2022-04-28 03:12:42,318 INFO L290 TraceCheckUtils]: 13: Hoare triple {48988#(and (<= 14 main_~x~0) (<= main_~x~0 14))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48989#(and (<= main_~x~0 16) (<= 16 main_~x~0))} is VALID [2022-04-28 03:12:42,318 INFO L290 TraceCheckUtils]: 14: Hoare triple {48989#(and (<= main_~x~0 16) (<= 16 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48990#(and (<= main_~x~0 18) (<= 18 main_~x~0))} is VALID [2022-04-28 03:12:42,319 INFO L290 TraceCheckUtils]: 15: Hoare triple {48990#(and (<= main_~x~0 18) (<= 18 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48991#(and (<= main_~x~0 20) (<= 20 main_~x~0))} is VALID [2022-04-28 03:12:42,319 INFO L290 TraceCheckUtils]: 16: Hoare triple {48991#(and (<= main_~x~0 20) (<= 20 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48992#(and (<= 22 main_~x~0) (<= main_~x~0 22))} is VALID [2022-04-28 03:12:42,320 INFO L290 TraceCheckUtils]: 17: Hoare triple {48992#(and (<= 22 main_~x~0) (<= main_~x~0 22))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48993#(and (<= main_~x~0 24) (<= 24 main_~x~0))} is VALID [2022-04-28 03:12:42,320 INFO L290 TraceCheckUtils]: 18: Hoare triple {48993#(and (<= main_~x~0 24) (<= 24 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48994#(and (<= main_~x~0 26) (<= 26 main_~x~0))} is VALID [2022-04-28 03:12:42,320 INFO L290 TraceCheckUtils]: 19: Hoare triple {48994#(and (<= main_~x~0 26) (<= 26 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48995#(and (<= 28 main_~x~0) (<= main_~x~0 28))} is VALID [2022-04-28 03:12:42,321 INFO L290 TraceCheckUtils]: 20: Hoare triple {48995#(and (<= 28 main_~x~0) (<= main_~x~0 28))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48996#(and (<= 30 main_~x~0) (<= main_~x~0 30))} is VALID [2022-04-28 03:12:42,321 INFO L290 TraceCheckUtils]: 21: Hoare triple {48996#(and (<= 30 main_~x~0) (<= main_~x~0 30))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48997#(and (<= main_~x~0 32) (<= 32 main_~x~0))} is VALID [2022-04-28 03:12:42,322 INFO L290 TraceCheckUtils]: 22: Hoare triple {48997#(and (<= main_~x~0 32) (<= 32 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48998#(and (<= main_~x~0 34) (<= 34 main_~x~0))} is VALID [2022-04-28 03:12:42,322 INFO L290 TraceCheckUtils]: 23: Hoare triple {48998#(and (<= main_~x~0 34) (<= 34 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {48999#(and (<= main_~x~0 36) (<= 36 main_~x~0))} is VALID [2022-04-28 03:12:42,323 INFO L290 TraceCheckUtils]: 24: Hoare triple {48999#(and (<= main_~x~0 36) (<= 36 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49000#(and (<= main_~x~0 38) (<= 38 main_~x~0))} is VALID [2022-04-28 03:12:42,323 INFO L290 TraceCheckUtils]: 25: Hoare triple {49000#(and (<= main_~x~0 38) (<= 38 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49001#(and (<= main_~x~0 40) (<= 40 main_~x~0))} is VALID [2022-04-28 03:12:42,324 INFO L290 TraceCheckUtils]: 26: Hoare triple {49001#(and (<= main_~x~0 40) (<= 40 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49002#(and (<= main_~x~0 42) (<= 42 main_~x~0))} is VALID [2022-04-28 03:12:42,324 INFO L290 TraceCheckUtils]: 27: Hoare triple {49002#(and (<= main_~x~0 42) (<= 42 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49003#(and (<= 44 main_~x~0) (<= main_~x~0 44))} is VALID [2022-04-28 03:12:42,325 INFO L290 TraceCheckUtils]: 28: Hoare triple {49003#(and (<= 44 main_~x~0) (<= main_~x~0 44))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49004#(and (<= 46 main_~x~0) (<= main_~x~0 46))} is VALID [2022-04-28 03:12:42,325 INFO L290 TraceCheckUtils]: 29: Hoare triple {49004#(and (<= 46 main_~x~0) (<= main_~x~0 46))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49005#(and (<= main_~x~0 48) (<= 48 main_~x~0))} is VALID [2022-04-28 03:12:42,326 INFO L290 TraceCheckUtils]: 30: Hoare triple {49005#(and (<= main_~x~0 48) (<= 48 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49006#(and (<= main_~x~0 50) (<= 50 main_~x~0))} is VALID [2022-04-28 03:12:42,326 INFO L290 TraceCheckUtils]: 31: Hoare triple {49006#(and (<= main_~x~0 50) (<= 50 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49007#(and (<= main_~x~0 52) (<= 52 main_~x~0))} is VALID [2022-04-28 03:12:42,327 INFO L290 TraceCheckUtils]: 32: Hoare triple {49007#(and (<= main_~x~0 52) (<= 52 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49008#(and (<= main_~x~0 54) (<= 54 main_~x~0))} is VALID [2022-04-28 03:12:42,327 INFO L290 TraceCheckUtils]: 33: Hoare triple {49008#(and (<= main_~x~0 54) (<= 54 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49009#(and (<= main_~x~0 56) (<= 56 main_~x~0))} is VALID [2022-04-28 03:12:42,328 INFO L290 TraceCheckUtils]: 34: Hoare triple {49009#(and (<= main_~x~0 56) (<= 56 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49010#(and (<= 58 main_~x~0) (<= main_~x~0 58))} is VALID [2022-04-28 03:12:42,328 INFO L290 TraceCheckUtils]: 35: Hoare triple {49010#(and (<= 58 main_~x~0) (<= main_~x~0 58))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49011#(and (<= main_~x~0 60) (<= 60 main_~x~0))} is VALID [2022-04-28 03:12:42,328 INFO L290 TraceCheckUtils]: 36: Hoare triple {49011#(and (<= main_~x~0 60) (<= 60 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49012#(and (<= 62 main_~x~0) (<= main_~x~0 62))} is VALID [2022-04-28 03:12:42,329 INFO L290 TraceCheckUtils]: 37: Hoare triple {49012#(and (<= 62 main_~x~0) (<= main_~x~0 62))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49013#(and (<= main_~x~0 64) (<= 64 main_~x~0))} is VALID [2022-04-28 03:12:42,329 INFO L290 TraceCheckUtils]: 38: Hoare triple {49013#(and (<= main_~x~0 64) (<= 64 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49014#(and (<= 66 main_~x~0) (<= main_~x~0 66))} is VALID [2022-04-28 03:12:42,330 INFO L290 TraceCheckUtils]: 39: Hoare triple {49014#(and (<= 66 main_~x~0) (<= main_~x~0 66))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49015#(and (<= main_~x~0 68) (<= 68 main_~x~0))} is VALID [2022-04-28 03:12:42,330 INFO L290 TraceCheckUtils]: 40: Hoare triple {49015#(and (<= main_~x~0 68) (<= 68 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49016#(and (<= main_~x~0 70) (<= 70 main_~x~0))} is VALID [2022-04-28 03:12:42,331 INFO L290 TraceCheckUtils]: 41: Hoare triple {49016#(and (<= main_~x~0 70) (<= 70 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49017#(and (<= 72 main_~x~0) (<= main_~x~0 72))} is VALID [2022-04-28 03:12:42,331 INFO L290 TraceCheckUtils]: 42: Hoare triple {49017#(and (<= 72 main_~x~0) (<= main_~x~0 72))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49018#(and (<= 74 main_~x~0) (<= main_~x~0 74))} is VALID [2022-04-28 03:12:42,332 INFO L290 TraceCheckUtils]: 43: Hoare triple {49018#(and (<= 74 main_~x~0) (<= main_~x~0 74))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49019#(and (<= 76 main_~x~0) (<= main_~x~0 76))} is VALID [2022-04-28 03:12:42,332 INFO L290 TraceCheckUtils]: 44: Hoare triple {49019#(and (<= 76 main_~x~0) (<= main_~x~0 76))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49020#(and (<= 78 main_~x~0) (<= main_~x~0 78))} is VALID [2022-04-28 03:12:42,333 INFO L290 TraceCheckUtils]: 45: Hoare triple {49020#(and (<= 78 main_~x~0) (<= main_~x~0 78))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49021#(and (<= 80 main_~x~0) (<= main_~x~0 80))} is VALID [2022-04-28 03:12:42,333 INFO L290 TraceCheckUtils]: 46: Hoare triple {49021#(and (<= 80 main_~x~0) (<= main_~x~0 80))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49022#(and (<= 82 main_~x~0) (<= main_~x~0 82))} is VALID [2022-04-28 03:12:42,334 INFO L290 TraceCheckUtils]: 47: Hoare triple {49022#(and (<= 82 main_~x~0) (<= main_~x~0 82))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49023#(and (<= 84 main_~x~0) (<= main_~x~0 84))} is VALID [2022-04-28 03:12:42,334 INFO L290 TraceCheckUtils]: 48: Hoare triple {49023#(and (<= 84 main_~x~0) (<= main_~x~0 84))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49024#(and (<= main_~x~0 86) (<= 86 main_~x~0))} is VALID [2022-04-28 03:12:42,335 INFO L290 TraceCheckUtils]: 49: Hoare triple {49024#(and (<= main_~x~0 86) (<= 86 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49025#(and (<= main_~x~0 88) (<= 88 main_~x~0))} is VALID [2022-04-28 03:12:42,335 INFO L290 TraceCheckUtils]: 50: Hoare triple {49025#(and (<= main_~x~0 88) (<= 88 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49026#(and (<= 90 main_~x~0) (<= main_~x~0 90))} is VALID [2022-04-28 03:12:42,336 INFO L290 TraceCheckUtils]: 51: Hoare triple {49026#(and (<= 90 main_~x~0) (<= main_~x~0 90))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49027#(and (<= main_~x~0 92) (<= 92 main_~x~0))} is VALID [2022-04-28 03:12:42,336 INFO L290 TraceCheckUtils]: 52: Hoare triple {49027#(and (<= main_~x~0 92) (<= 92 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49028#(and (<= 94 main_~x~0) (<= main_~x~0 94))} is VALID [2022-04-28 03:12:42,337 INFO L290 TraceCheckUtils]: 53: Hoare triple {49028#(and (<= 94 main_~x~0) (<= main_~x~0 94))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49029#(and (<= 96 main_~x~0) (<= main_~x~0 96))} is VALID [2022-04-28 03:12:42,337 INFO L290 TraceCheckUtils]: 54: Hoare triple {49029#(and (<= 96 main_~x~0) (<= main_~x~0 96))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49030#(and (<= 98 main_~x~0) (<= main_~x~0 98))} is VALID [2022-04-28 03:12:42,338 INFO L290 TraceCheckUtils]: 55: Hoare triple {49030#(and (<= 98 main_~x~0) (<= main_~x~0 98))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49031#(and (<= 100 main_~x~0) (<= main_~x~0 100))} is VALID [2022-04-28 03:12:42,338 INFO L290 TraceCheckUtils]: 56: Hoare triple {49031#(and (<= 100 main_~x~0) (<= main_~x~0 100))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49032#(and (<= main_~x~0 102) (<= 102 main_~x~0))} is VALID [2022-04-28 03:12:42,338 INFO L290 TraceCheckUtils]: 57: Hoare triple {49032#(and (<= main_~x~0 102) (<= 102 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49033#(and (<= main_~x~0 104) (<= 104 main_~x~0))} is VALID [2022-04-28 03:12:42,339 INFO L290 TraceCheckUtils]: 58: Hoare triple {49033#(and (<= main_~x~0 104) (<= 104 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49034#(and (<= 106 main_~x~0) (<= main_~x~0 106))} is VALID [2022-04-28 03:12:42,339 INFO L290 TraceCheckUtils]: 59: Hoare triple {49034#(and (<= 106 main_~x~0) (<= main_~x~0 106))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49035#(and (<= 108 main_~x~0) (<= main_~x~0 108))} is VALID [2022-04-28 03:12:42,340 INFO L290 TraceCheckUtils]: 60: Hoare triple {49035#(and (<= 108 main_~x~0) (<= main_~x~0 108))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49036#(and (<= 110 main_~x~0) (<= main_~x~0 110))} is VALID [2022-04-28 03:12:42,340 INFO L290 TraceCheckUtils]: 61: Hoare triple {49036#(and (<= 110 main_~x~0) (<= main_~x~0 110))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49037#(and (<= main_~x~0 112) (<= 112 main_~x~0))} is VALID [2022-04-28 03:12:42,341 INFO L290 TraceCheckUtils]: 62: Hoare triple {49037#(and (<= main_~x~0 112) (<= 112 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49038#(and (<= main_~x~0 114) (<= 114 main_~x~0))} is VALID [2022-04-28 03:12:42,341 INFO L290 TraceCheckUtils]: 63: Hoare triple {49038#(and (<= main_~x~0 114) (<= 114 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49039#(and (<= main_~x~0 116) (<= 116 main_~x~0))} is VALID [2022-04-28 03:12:42,342 INFO L290 TraceCheckUtils]: 64: Hoare triple {49039#(and (<= main_~x~0 116) (<= 116 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49040#(and (<= 118 main_~x~0) (<= main_~x~0 118))} is VALID [2022-04-28 03:12:42,342 INFO L290 TraceCheckUtils]: 65: Hoare triple {49040#(and (<= 118 main_~x~0) (<= main_~x~0 118))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49041#(and (<= main_~x~0 120) (<= 120 main_~x~0))} is VALID [2022-04-28 03:12:42,343 INFO L290 TraceCheckUtils]: 66: Hoare triple {49041#(and (<= main_~x~0 120) (<= 120 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49042#(and (<= 122 main_~x~0) (<= main_~x~0 122))} is VALID [2022-04-28 03:12:42,343 INFO L290 TraceCheckUtils]: 67: Hoare triple {49042#(and (<= 122 main_~x~0) (<= main_~x~0 122))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49043#(and (<= 124 main_~x~0) (<= main_~x~0 124))} is VALID [2022-04-28 03:12:42,344 INFO L290 TraceCheckUtils]: 68: Hoare triple {49043#(and (<= 124 main_~x~0) (<= main_~x~0 124))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49044#(and (<= 126 main_~x~0) (<= main_~x~0 126))} is VALID [2022-04-28 03:12:42,344 INFO L290 TraceCheckUtils]: 69: Hoare triple {49044#(and (<= 126 main_~x~0) (<= main_~x~0 126))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49045#(and (<= 128 main_~x~0) (<= main_~x~0 128))} is VALID [2022-04-28 03:12:42,345 INFO L290 TraceCheckUtils]: 70: Hoare triple {49045#(and (<= 128 main_~x~0) (<= main_~x~0 128))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49046#(and (<= 130 main_~x~0) (<= main_~x~0 130))} is VALID [2022-04-28 03:12:42,345 INFO L290 TraceCheckUtils]: 71: Hoare triple {49046#(and (<= 130 main_~x~0) (<= main_~x~0 130))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49047#(and (<= main_~x~0 132) (<= 132 main_~x~0))} is VALID [2022-04-28 03:12:42,346 INFO L290 TraceCheckUtils]: 72: Hoare triple {49047#(and (<= main_~x~0 132) (<= 132 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49048#(and (<= 134 main_~x~0) (<= main_~x~0 134))} is VALID [2022-04-28 03:12:42,346 INFO L290 TraceCheckUtils]: 73: Hoare triple {49048#(and (<= 134 main_~x~0) (<= main_~x~0 134))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49049#(and (<= main_~x~0 136) (<= 136 main_~x~0))} is VALID [2022-04-28 03:12:42,347 INFO L290 TraceCheckUtils]: 74: Hoare triple {49049#(and (<= main_~x~0 136) (<= 136 main_~x~0))} assume !!(~x~0 % 4294967296 < 268435455);~x~0 := 2 + ~x~0; {49050#(and (<= main_~x~0 138) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 03:12:42,347 INFO L290 TraceCheckUtils]: 75: Hoare triple {49050#(and (<= main_~x~0 138) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 268435455); {48977#false} is VALID [2022-04-28 03:12:42,347 INFO L272 TraceCheckUtils]: 76: Hoare triple {48977#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {48977#false} is VALID [2022-04-28 03:12:42,347 INFO L290 TraceCheckUtils]: 77: Hoare triple {48977#false} ~cond := #in~cond; {48977#false} is VALID [2022-04-28 03:12:42,347 INFO L290 TraceCheckUtils]: 78: Hoare triple {48977#false} assume 0 == ~cond; {48977#false} is VALID [2022-04-28 03:12:42,347 INFO L290 TraceCheckUtils]: 79: Hoare triple {48977#false} assume !false; {48977#false} is VALID [2022-04-28 03:12:42,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:12:42,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:12:42,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629887709] [2022-04-28 03:12:42,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629887709] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:12:42,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620702261] [2022-04-28 03:12:42,348 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 03:12:42,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:12:42,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:12:42,349 INFO L229 MonitoredProcess]: Starting monitored process 139 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:12:42,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (139)] Waiting until timeout for monitored process