/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/phases_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 02:57:41,034 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 02:57:41,035 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 02:57:41,058 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 02:57:41,058 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 02:57:41,060 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 02:57:41,064 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 02:57:41,067 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 02:57:41,069 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 02:57:41,072 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 02:57:41,073 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 02:57:41,074 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 02:57:41,074 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 02:57:41,076 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 02:57:41,076 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 02:57:41,077 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 02:57:41,077 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 02:57:41,078 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 02:57:41,081 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 02:57:41,085 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 02:57:41,086 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 02:57:41,087 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 02:57:41,087 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 02:57:41,088 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 02:57:41,088 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 02:57:41,093 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 02:57:41,093 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 02:57:41,094 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 02:57:41,094 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 02:57:41,094 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 02:57:41,095 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 02:57:41,095 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 02:57:41,096 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 02:57:41,097 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 02:57:41,097 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 02:57:41,098 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 02:57:41,098 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 02:57:41,098 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 02:57:41,098 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 02:57:41,099 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 02:57:41,099 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 02:57:41,101 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 02:57:41,101 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 02:57:41,107 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 02:57:41,108 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 02:57:41,109 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 02:57:41,109 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 02:57:41,109 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 02:57:41,109 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 02:57:41,110 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 02:57:41,110 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 02:57:41,110 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 02:57:41,110 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 02:57:41,110 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 02:57:41,111 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 02:57:41,111 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 02:57:41,111 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 02:57:41,111 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 02:57:41,111 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 02:57:41,111 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 02:57:41,111 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 02:57:41,111 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:57:41,111 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 02:57:41,112 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 02:57:41,112 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 02:57:41,112 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 02:57:41,112 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 02:57:41,112 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 02:57:41,112 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 02:57:41,285 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 02:57:41,305 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 02:57:41,307 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 02:57:41,307 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 02:57:41,308 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 02:57:41,309 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/phases_1-1.c [2022-04-28 02:57:41,360 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a0c5c1ef/e8d68f5e7ede4028bae76502415b603f/FLAGb47929ed2 [2022-04-28 02:57:41,707 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 02:57:41,707 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/phases_1-1.c [2022-04-28 02:57:41,711 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a0c5c1ef/e8d68f5e7ede4028bae76502415b603f/FLAGb47929ed2 [2022-04-28 02:57:42,154 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a0c5c1ef/e8d68f5e7ede4028bae76502415b603f [2022-04-28 02:57:42,156 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 02:57:42,160 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 02:57:42,162 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 02:57:42,162 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 02:57:42,165 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 02:57:42,166 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:57:42" (1/1) ... [2022-04-28 02:57:42,166 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4078fa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:57:42, skipping insertion in model container [2022-04-28 02:57:42,167 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:57:42" (1/1) ... [2022-04-28 02:57:42,171 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 02:57:42,178 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 02:57:42,290 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/phases_1-1.c[322,335] [2022-04-28 02:57:42,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:57:42,304 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 02:57:42,311 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/phases_1-1.c[322,335] [2022-04-28 02:57:42,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:57:42,320 INFO L208 MainTranslator]: Completed translation [2022-04-28 02:57:42,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:57:42 WrapperNode [2022-04-28 02:57:42,321 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 02:57:42,321 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 02:57:42,321 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 02:57:42,322 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 02:57:42,328 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:57:42" (1/1) ... [2022-04-28 02:57:42,328 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:57:42" (1/1) ... [2022-04-28 02:57:42,333 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:57:42" (1/1) ... [2022-04-28 02:57:42,333 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:57:42" (1/1) ... [2022-04-28 02:57:42,336 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:57:42" (1/1) ... [2022-04-28 02:57:42,338 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:57:42" (1/1) ... [2022-04-28 02:57:42,338 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:57:42" (1/1) ... [2022-04-28 02:57:42,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 02:57:42,339 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 02:57:42,340 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 02:57:42,340 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 02:57:42,340 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:57:42" (1/1) ... [2022-04-28 02:57:42,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:57:42,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:57:42,381 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 02:57:42,404 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 02:57:42,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 02:57:42,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 02:57:42,429 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 02:57:42,429 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 02:57:42,429 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 02:57:42,429 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 02:57:42,429 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 02:57:42,429 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 02:57:42,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 02:57:42,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 02:57:42,430 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 02:57:42,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 02:57:42,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 02:57:42,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 02:57:42,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 02:57:42,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 02:57:42,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 02:57:42,478 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 02:57:42,479 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 02:57:42,555 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 02:57:42,559 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 02:57:42,559 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 02:57:42,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:57:42 BoogieIcfgContainer [2022-04-28 02:57:42,560 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 02:57:42,561 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 02:57:42,561 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 02:57:42,566 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 02:57:42,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:57:42" (1/3) ... [2022-04-28 02:57:42,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b14d075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:57:42, skipping insertion in model container [2022-04-28 02:57:42,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:57:42" (2/3) ... [2022-04-28 02:57:42,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b14d075 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:57:42, skipping insertion in model container [2022-04-28 02:57:42,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:57:42" (3/3) ... [2022-04-28 02:57:42,568 INFO L111 eAbstractionObserver]: Analyzing ICFG phases_1-1.c [2022-04-28 02:57:42,576 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 02:57:42,576 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 02:57:42,601 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 02:57:42,605 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@5a55bb38, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4b53e69a [2022-04-28 02:57:42,605 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 02:57:42,610 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 02:57:42,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 02:57:42,615 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:57:42,615 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:42,615 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:57:42,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:57:42,619 INFO L85 PathProgramCache]: Analyzing trace with hash 491760044, now seen corresponding path program 1 times [2022-04-28 02:57:42,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:42,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2023903177] [2022-04-28 02:57:42,630 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 02:57:42,630 INFO L85 PathProgramCache]: Analyzing trace with hash 491760044, now seen corresponding path program 2 times [2022-04-28 02:57:42,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:42,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421244552] [2022-04-28 02:57:42,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:42,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:42,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:42,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:42,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:42,739 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {22#true} is VALID [2022-04-28 02:57:42,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-28 02:57:42,739 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #40#return; {22#true} is VALID [2022-04-28 02:57:42,741 INFO L272 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:42,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {22#true} is VALID [2022-04-28 02:57:42,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-28 02:57:42,743 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} #40#return; {22#true} is VALID [2022-04-28 02:57:42,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {22#true} call #t~ret5 := main(); {22#true} is VALID [2022-04-28 02:57:42,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#true} ~x~0 := 0; {22#true} is VALID [2022-04-28 02:57:42,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {22#true} assume !true; {23#false} is VALID [2022-04-28 02:57:42,745 INFO L272 TraceCheckUtils]: 7: Hoare triple {23#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {23#false} is VALID [2022-04-28 02:57:42,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2022-04-28 02:57:42,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2022-04-28 02:57:42,746 INFO L290 TraceCheckUtils]: 10: Hoare triple {23#false} assume !false; {23#false} is VALID [2022-04-28 02:57:42,746 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 02:57:42,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:42,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421244552] [2022-04-28 02:57:42,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421244552] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:42,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:42,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 02:57:42,752 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:42,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2023903177] [2022-04-28 02:57:42,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2023903177] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:42,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:42,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 02:57:42,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20206470] [2022-04-28 02:57:42,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:42,760 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 02:57:42,762 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:42,764 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 02:57:42,809 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 02:57:42,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 02:57:42,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:42,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 02:57:42,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 02:57:42,830 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:42,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:42,880 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-04-28 02:57:42,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 02:57:42,881 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 02:57:42,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:57:42,882 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 02:57:42,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-04-28 02:57:42,887 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 02:57:42,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-04-28 02:57:42,891 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 34 transitions. [2022-04-28 02:57:42,952 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 02:57:42,957 INFO L225 Difference]: With dead ends: 30 [2022-04-28 02:57:42,957 INFO L226 Difference]: Without dead ends: 13 [2022-04-28 02:57:42,959 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 02:57:42,961 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:57:42,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 22 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:57:42,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-28 02:57:42,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-28 02:57:42,988 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:57:42,990 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:42,990 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:42,991 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:42,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:42,993 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-28 02:57:42,993 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-28 02:57:42,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:42,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:42,994 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-28 02:57:42,994 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-28 02:57:42,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:42,996 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-28 02:57:42,996 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-28 02:57:42,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:42,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:42,996 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:57:42,996 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:57:42,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:42,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-04-28 02:57:42,998 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2022-04-28 02:57:42,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:57:42,999 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-04-28 02:57:42,999 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 02:57:42,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 14 transitions. [2022-04-28 02:57:43,013 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 02:57:43,013 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-28 02:57:43,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 02:57:43,013 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:57:43,014 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:43,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 02:57:43,014 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:57:43,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:57:43,015 INFO L85 PathProgramCache]: Analyzing trace with hash 482524834, now seen corresponding path program 1 times [2022-04-28 02:57:43,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:43,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [545603216] [2022-04-28 02:57:43,016 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 02:57:43,016 INFO L85 PathProgramCache]: Analyzing trace with hash 482524834, now seen corresponding path program 2 times [2022-04-28 02:57:43,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:43,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406100353] [2022-04-28 02:57:43,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:43,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:43,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:43,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:43,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:43,118 INFO L290 TraceCheckUtils]: 0: Hoare triple {148#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {142#true} is VALID [2022-04-28 02:57:43,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {142#true} assume true; {142#true} is VALID [2022-04-28 02:57:43,119 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {142#true} {142#true} #40#return; {142#true} is VALID [2022-04-28 02:57:43,120 INFO L272 TraceCheckUtils]: 0: Hoare triple {142#true} call ULTIMATE.init(); {148#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:43,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {148#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {142#true} is VALID [2022-04-28 02:57:43,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {142#true} assume true; {142#true} is VALID [2022-04-28 02:57:43,122 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {142#true} {142#true} #40#return; {142#true} is VALID [2022-04-28 02:57:43,122 INFO L272 TraceCheckUtils]: 4: Hoare triple {142#true} call #t~ret5 := main(); {142#true} is VALID [2022-04-28 02:57:43,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {142#true} ~x~0 := 0; {147#(= main_~x~0 0)} is VALID [2022-04-28 02:57:43,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {147#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 268435455); {143#false} is VALID [2022-04-28 02:57:43,124 INFO L272 TraceCheckUtils]: 7: Hoare triple {143#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {143#false} is VALID [2022-04-28 02:57:43,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {143#false} ~cond := #in~cond; {143#false} is VALID [2022-04-28 02:57:43,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {143#false} assume 0 == ~cond; {143#false} is VALID [2022-04-28 02:57:43,125 INFO L290 TraceCheckUtils]: 10: Hoare triple {143#false} assume !false; {143#false} is VALID [2022-04-28 02:57:43,126 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 02:57:43,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:43,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406100353] [2022-04-28 02:57:43,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406100353] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:43,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:43,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:57:43,128 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:43,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [545603216] [2022-04-28 02:57:43,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [545603216] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:43,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:43,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:57:43,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119461265] [2022-04-28 02:57:43,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:43,131 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 02:57:43,131 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:43,131 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 02:57:43,145 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 02:57:43,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:57:43,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:43,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:57:43,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:57:43,149 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:43,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:43,240 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-28 02:57:43,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:57:43,240 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 02:57:43,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:57:43,240 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 02:57:43,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-28 02:57:43,242 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 02:57:43,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-28 02:57:43,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 26 transitions. [2022-04-28 02:57:43,267 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 02:57:43,271 INFO L225 Difference]: With dead ends: 22 [2022-04-28 02:57:43,271 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 02:57:43,272 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 02:57:43,274 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:57:43,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 19 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:57:43,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 02:57:43,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-28 02:57:43,284 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:57:43,284 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 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 02:57:43,285 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 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 02:57:43,285 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 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 02:57:43,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:43,289 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-28 02:57:43,290 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 02:57:43,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:43,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:43,290 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 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 15 states. [2022-04-28 02:57:43,291 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 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 15 states. [2022-04-28 02:57:43,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:43,294 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-28 02:57:43,294 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 02:57:43,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:43,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:43,295 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:57:43,295 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:57:43,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 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 02:57:43,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-28 02:57:43,302 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 11 [2022-04-28 02:57:43,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:57:43,303 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-28 02:57:43,304 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 02:57:43,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-28 02:57:43,320 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 02:57:43,321 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 02:57:43,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 02:57:43,322 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:57:43,322 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:43,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 02:57:43,326 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:57:43,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:57:43,328 INFO L85 PathProgramCache]: Analyzing trace with hash 925229631, now seen corresponding path program 1 times [2022-04-28 02:57:43,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:43,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [675258792] [2022-04-28 02:57:46,016 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 02:57:46,201 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:57:46,203 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:57:46,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1303175503, now seen corresponding path program 1 times [2022-04-28 02:57:46,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:46,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830222352] [2022-04-28 02:57:46,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:46,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:46,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:46,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:46,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:46,287 INFO L290 TraceCheckUtils]: 0: Hoare triple {264#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {257#true} is VALID [2022-04-28 02:57:46,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {257#true} assume true; {257#true} is VALID [2022-04-28 02:57:46,288 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {257#true} {257#true} #40#return; {257#true} is VALID [2022-04-28 02:57:46,288 INFO L272 TraceCheckUtils]: 0: Hoare triple {257#true} call ULTIMATE.init(); {264#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:46,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {264#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {257#true} is VALID [2022-04-28 02:57:46,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {257#true} assume true; {257#true} is VALID [2022-04-28 02:57:46,289 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {257#true} {257#true} #40#return; {257#true} is VALID [2022-04-28 02:57:46,289 INFO L272 TraceCheckUtils]: 4: Hoare triple {257#true} call #t~ret5 := main(); {257#true} is VALID [2022-04-28 02:57:46,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {257#true} ~x~0 := 0; {262#(= main_~x~0 0)} is VALID [2022-04-28 02:57:46,290 INFO L290 TraceCheckUtils]: 6: Hoare triple {262#(= main_~x~0 0)} [46] L16-2-->L15-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_11 v_main_~x~0_10)) (.cse1 (= |v_main_#t~post4_4| |v_main_#t~post4_3|)) (.cse2 (mod v_main_~x~0_11 4294967296))) (or (and .cse0 .cse1) (and .cse0 (<= 65520 .cse2) .cse1) (and (< .cse2 65520) (<= (div (+ (* (- 1) v_main_~x~0_10) 65520) (- 4294967296)) (+ (div (+ v_main_~x~0_11 (- 4294967295)) 4294967296) 1)) (< v_main_~x~0_11 v_main_~x~0_10)))) InVars {main_~x~0=v_main_~x~0_11, main_#t~post4=|v_main_#t~post4_4|} OutVars{main_~x~0=v_main_~x~0_10, main_#t~post4=|v_main_#t~post4_3|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {263#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 65521))} is VALID [2022-04-28 02:57:46,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {263#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 65521))} [45] L15-2_primed-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {258#false} is VALID [2022-04-28 02:57:46,291 INFO L272 TraceCheckUtils]: 8: Hoare triple {258#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {258#false} is VALID [2022-04-28 02:57:46,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {258#false} ~cond := #in~cond; {258#false} is VALID [2022-04-28 02:57:46,292 INFO L290 TraceCheckUtils]: 10: Hoare triple {258#false} assume 0 == ~cond; {258#false} is VALID [2022-04-28 02:57:46,292 INFO L290 TraceCheckUtils]: 11: Hoare triple {258#false} assume !false; {258#false} is VALID [2022-04-28 02:57:46,292 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 02:57:46,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:46,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830222352] [2022-04-28 02:57:46,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830222352] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:46,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:46,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:57:46,384 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:57:46,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [675258792] [2022-04-28 02:57:46,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [675258792] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:57:46,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:57:46,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:57:46,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838689381] [2022-04-28 02:57:46,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:57:46,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 02:57:46,386 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:57:46,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:46,397 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 02:57:46,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 02:57:46,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:46,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 02:57:46,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-04-28 02:57:46,398 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:46,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:46,490 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-28 02:57:46,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 02:57:46,490 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 02:57:46,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:57:46,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:46,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-04-28 02:57:46,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:46,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2022-04-28 02:57:46,494 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 24 transitions. [2022-04-28 02:57:46,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:57:46,521 INFO L225 Difference]: With dead ends: 22 [2022-04-28 02:57:46,521 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 02:57:46,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-28 02:57:46,522 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:57:46,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 18 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:57:46,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 02:57:46,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 02:57:46,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:57:46,530 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 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 02:57:46,531 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 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 02:57:46,531 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 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 02:57:46,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:46,532 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 02:57:46,532 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 02:57:46,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:46,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:46,532 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 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 17 states. [2022-04-28 02:57:46,532 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 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 17 states. [2022-04-28 02:57:46,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:57:46,533 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 02:57:46,533 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 02:57:46,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:57:46,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:57:46,534 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:57:46,534 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:57:46,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 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 02:57:46,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-28 02:57:46,535 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2022-04-28 02:57:46,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:57:46,535 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-28 02:57:46,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:57:46,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-28 02:57:46,552 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 02:57:46,552 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 02:57:46,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 02:57:46,553 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:57:46,553 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:57:46,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 02:57:46,553 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:57:46,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:57:46,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1220035546, now seen corresponding path program 1 times [2022-04-28 02:57:46,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:57:46,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [63751587] [2022-04-28 02:57:49,005 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:57:49,279 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 02:57:49,281 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:57:49,284 INFO L85 PathProgramCache]: Analyzing trace with hash 442797488, now seen corresponding path program 1 times [2022-04-28 02:57:49,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:57:49,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152689612] [2022-04-28 02:57:49,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:49,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:57:49,298 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 2) .v_it_3.0) (* (- 1) main_~x~0_6) (* 4294967296 (div (+ (* 2 .v_it_3.0) main_~x~0_6) 4294967296)) 65520) 0) [2022-04-28 02:57:49,321 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 2) .v_it_3.0) (* (- 1) main_~x~0_6) (* 4294967296 (div (+ (* 2 .v_it_3.0) main_~x~0_6) 4294967296)) 268435455) 0)) [2022-04-28 02:57:49,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:49,397 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 2) .v_it_3.1) (* (- 1) main_~x~0_6) (* 4294967296 (div (+ (* 2 .v_it_3.1) main_~x~0_6) 4294967296)) 65520) 0) [2022-04-28 02:57:49,398 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 2) .v_it_3.1) (* (- 1) main_~x~0_6) (* 4294967296 (div (+ (* 2 .v_it_3.1) main_~x~0_6) 4294967296)) 268435455) 0)) [2022-04-28 02:57:49,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:57:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:49,500 INFO L290 TraceCheckUtils]: 0: Hoare triple {396#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {385#true} is VALID [2022-04-28 02:57:49,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-28 02:57:49,501 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {385#true} {385#true} #40#return; {385#true} is VALID [2022-04-28 02:57:49,501 INFO L272 TraceCheckUtils]: 0: Hoare triple {385#true} call ULTIMATE.init(); {396#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:57:49,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {396#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {385#true} is VALID [2022-04-28 02:57:49,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-28 02:57:49,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {385#true} {385#true} #40#return; {385#true} is VALID [2022-04-28 02:57:49,502 INFO L272 TraceCheckUtils]: 4: Hoare triple {385#true} call #t~ret5 := main(); {385#true} is VALID [2022-04-28 02:57:49,504 INFO L290 TraceCheckUtils]: 5: Hoare triple {385#true} ~x~0 := 0; {390#(= main_~x~0 0)} is VALID [2022-04-28 02:57:49,505 INFO L290 TraceCheckUtils]: 6: Hoare triple {390#(= main_~x~0 0)} [48] L16-2-->L15-2_primed: Formula: (let ((.cse0 (mod v_main_~x~0_18 4294967296)) (.cse1 (= v_main_~x~0_18 v_main_~x~0_17)) (.cse2 (= |v_main_#t~post4_9| |v_main_#t~post4_8|))) (or (and (< .cse0 65520) (< v_main_~x~0_18 v_main_~x~0_17) (<= (div (+ 65520 (* (- 1) v_main_~x~0_17)) (- 4294967296)) (+ (div (+ v_main_~x~0_18 (- 4294967295)) 4294967296) 1))) (and .cse1 .cse2 (<= 65520 .cse0)) (and .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_18, main_#t~post4=|v_main_#t~post4_9|} OutVars{main_~x~0=v_main_~x~0_17, main_#t~post4=|v_main_#t~post4_8|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {391#(or (and (<= 1 main_~x~0) (<= (div (+ 65520 (* (- 1) main_~x~0)) (- 4294967296)) 0)) (and (<= main_~x~0 0) (<= 0 main_~x~0)))} is VALID [2022-04-28 02:57:49,505 INFO L290 TraceCheckUtils]: 7: Hoare triple {391#(or (and (<= 1 main_~x~0) (<= (div (+ 65520 (* (- 1) main_~x~0)) (- 4294967296)) 0)) (and (<= main_~x~0 0) (<= 0 main_~x~0)))} [49] L15-2_primed-->L16-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {391#(or (and (<= 1 main_~x~0) (<= (div (+ 65520 (* (- 1) main_~x~0)) (- 4294967296)) 0)) (and (<= main_~x~0 0) (<= 0 main_~x~0)))} is VALID [2022-04-28 02:57:49,510 INFO L290 TraceCheckUtils]: 8: Hoare triple {391#(or (and (<= 1 main_~x~0) (<= (div (+ 65520 (* (- 1) main_~x~0)) (- 4294967296)) 0)) (and (<= main_~x~0 0) (<= 0 main_~x~0)))} [50] L16-2-->L15-2_primed: Formula: (let ((.cse4 (mod v_main_~x~0_20 4294967296))) (let ((.cse0 (<= 65520 .cse4)) (.cse2 (< .cse4 268435455)) (.cse3 (= v_main_~x~0_20 v_main_~x~0_19))) (or (and .cse0 (forall ((v_it_3 Int)) (or (let ((.cse1 (mod (+ (* v_it_3 2) v_main_~x~0_20) 4294967296))) (and (< .cse1 268435455) (<= 65520 .cse1))) (not (<= 1 v_it_3)) (not (<= (+ v_it_3 1) (div (+ v_main_~x~0_19 (* (- 1) v_main_~x~0_20)) 2))))) (= (mod (+ v_main_~x~0_20 v_main_~x~0_19) 2) 0) .cse2 (< 0 (div (+ v_main_~x~0_19 (* (- 1) v_main_~x~0_20)) 2))) (and (or (not .cse0) (not .cse2)) .cse3) .cse3))) InVars {main_~x~0=v_main_~x~0_20} OutVars{main_~x~0=v_main_~x~0_19} AuxVars[] AssignedVars[main_~x~0] {392#(or (and (<= main_~x~0 65520) (not (<= (+ (div main_~x~0 4294967296) 1) 0))) (<= main_~x~0 (* (div main_~x~0 2) 2)))} is VALID [2022-04-28 02:57:49,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {392#(or (and (<= main_~x~0 65520) (not (<= (+ (div main_~x~0 4294967296) 1) 0))) (<= main_~x~0 (* (div main_~x~0 2) 2)))} [47] L15-2_primed-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {393#(<= main_~x~0 (* (div main_~x~0 2) 2))} is VALID [2022-04-28 02:57:49,512 INFO L272 TraceCheckUtils]: 10: Hoare triple {393#(<= main_~x~0 (* (div main_~x~0 2) 2))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {394#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 02:57:49,513 INFO L290 TraceCheckUtils]: 11: Hoare triple {394#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {395#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 02:57:49,513 INFO L290 TraceCheckUtils]: 12: Hoare triple {395#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {386#false} is VALID [2022-04-28 02:57:49,513 INFO L290 TraceCheckUtils]: 13: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-28 02:57:49,513 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:57:49,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:57:49,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152689612] [2022-04-28 02:57:49,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152689612] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:57:49,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036190175] [2022-04-28 02:57:49,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:57:49,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:57:49,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:57:49,515 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 02:57:49,517 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 02:57:49,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:49,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 02:57:49,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:57:49,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:58:04,454 INFO L272 TraceCheckUtils]: 0: Hoare triple {385#true} call ULTIMATE.init(); {385#true} is VALID [2022-04-28 02:58:04,454 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {385#true} is VALID [2022-04-28 02:58:04,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-28 02:58:04,455 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {385#true} {385#true} #40#return; {385#true} is VALID [2022-04-28 02:58:04,455 INFO L272 TraceCheckUtils]: 4: Hoare triple {385#true} call #t~ret5 := main(); {385#true} is VALID [2022-04-28 02:58:04,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {385#true} ~x~0 := 0; {390#(= main_~x~0 0)} is VALID [2022-04-28 02:58:04,459 INFO L290 TraceCheckUtils]: 6: Hoare triple {390#(= main_~x~0 0)} [48] L16-2-->L15-2_primed: Formula: (let ((.cse0 (mod v_main_~x~0_18 4294967296)) (.cse1 (= v_main_~x~0_18 v_main_~x~0_17)) (.cse2 (= |v_main_#t~post4_9| |v_main_#t~post4_8|))) (or (and (< .cse0 65520) (< v_main_~x~0_18 v_main_~x~0_17) (<= (div (+ 65520 (* (- 1) v_main_~x~0_17)) (- 4294967296)) (+ (div (+ v_main_~x~0_18 (- 4294967295)) 4294967296) 1))) (and .cse1 .cse2 (<= 65520 .cse0)) (and .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_18, main_#t~post4=|v_main_#t~post4_9|} OutVars{main_~x~0=v_main_~x~0_17, main_#t~post4=|v_main_#t~post4_8|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {391#(or (and (<= 1 main_~x~0) (<= (div (+ 65520 (* (- 1) main_~x~0)) (- 4294967296)) 0)) (and (<= main_~x~0 0) (<= 0 main_~x~0)))} is VALID [2022-04-28 02:58:04,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {391#(or (and (<= 1 main_~x~0) (<= (div (+ 65520 (* (- 1) main_~x~0)) (- 4294967296)) 0)) (and (<= main_~x~0 0) (<= 0 main_~x~0)))} [49] L15-2_primed-->L16-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {391#(or (and (<= 1 main_~x~0) (<= (div (+ 65520 (* (- 1) main_~x~0)) (- 4294967296)) 0)) (and (<= main_~x~0 0) (<= 0 main_~x~0)))} is VALID [2022-04-28 02:58:04,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {391#(or (and (<= 1 main_~x~0) (<= (div (+ 65520 (* (- 1) main_~x~0)) (- 4294967296)) 0)) (and (<= main_~x~0 0) (<= 0 main_~x~0)))} [50] L16-2-->L15-2_primed: Formula: (let ((.cse4 (mod v_main_~x~0_20 4294967296))) (let ((.cse0 (<= 65520 .cse4)) (.cse2 (< .cse4 268435455)) (.cse3 (= v_main_~x~0_20 v_main_~x~0_19))) (or (and .cse0 (forall ((v_it_3 Int)) (or (let ((.cse1 (mod (+ (* v_it_3 2) v_main_~x~0_20) 4294967296))) (and (< .cse1 268435455) (<= 65520 .cse1))) (not (<= 1 v_it_3)) (not (<= (+ v_it_3 1) (div (+ v_main_~x~0_19 (* (- 1) v_main_~x~0_20)) 2))))) (= (mod (+ v_main_~x~0_20 v_main_~x~0_19) 2) 0) .cse2 (< 0 (div (+ v_main_~x~0_19 (* (- 1) v_main_~x~0_20)) 2))) (and (or (not .cse0) (not .cse2)) .cse3) .cse3))) InVars {main_~x~0=v_main_~x~0_20} OutVars{main_~x~0=v_main_~x~0_19} AuxVars[] AssignedVars[main_~x~0] {424#(or (exists ((aux_div_v_main_~x~0_28_31 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_28_31_42_169 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_28_31_42_169_56 Int) (aux_div_aux_mod_v_main_~x~0_28_31_42 Int)) (and (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_28_31_42_169_56 2) (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_31_42_169 2) 1) main_~x~0) (<= (div (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_28_31_42_169_56 2) 65520 (* (- 1) main_~x~0) (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_31_42_169 2)) (- 4294967296)) 0) (< 0 aux_div_aux_mod_aux_mod_v_main_~x~0_28_31_42_169) (<= 0 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_28_31_42_169_56 2)) (< main_~x~0 (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_28_31_42_169_56 2) (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_31_42_169 2) (* aux_div_v_main_~x~0_28_31 4294967296) 4294967296 (* aux_div_aux_mod_v_main_~x~0_28_31_42 4294967296))) (< main_~x~0 (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_28_31_42_169_56 2) 268435455 (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_31_42_169 2) (* aux_div_v_main_~x~0_28_31 4294967296))) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_28_31_42_169_56 2) 2) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_28_31_42_169_56 2) 65520 (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_31_42_169 2) (* aux_div_v_main_~x~0_28_31 4294967296) (* aux_div_aux_mod_v_main_~x~0_28_31_42 4294967296)) main_~x~0) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_28_31_42_169_56 2) (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_31_42_169 2) (* aux_div_v_main_~x~0_28_31 4294967296)) main_~x~0) (forall ((v_it_3 Int)) (or (and (<= 65520 (mod (+ (* v_it_3 2) main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_31_42_169 4294967294) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_28_31_42_169_56 4294967294)) 4294967296)) (< (mod (+ (* v_it_3 2) main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_31_42_169 4294967294) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_28_31_42_169_56 4294967294)) 4294967296) 268435455)) (not (<= 1 v_it_3)) (not (<= (+ v_it_3 1) (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_28_31_42_169_56 aux_div_aux_mod_aux_mod_v_main_~x~0_28_31_42_169))))))) (and (<= 1 main_~x~0) (<= (div (+ 65520 (* (- 1) main_~x~0)) (- 4294967296)) 0)) (and (<= main_~x~0 0) (<= 0 main_~x~0)))} is VALID [2022-04-28 02:58:04,998 INFO L290 TraceCheckUtils]: 9: Hoare triple {424#(or (exists ((aux_div_v_main_~x~0_28_31 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_28_31_42_169 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_28_31_42_169_56 Int) (aux_div_aux_mod_v_main_~x~0_28_31_42 Int)) (and (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_28_31_42_169_56 2) (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_31_42_169 2) 1) main_~x~0) (<= (div (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_28_31_42_169_56 2) 65520 (* (- 1) main_~x~0) (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_31_42_169 2)) (- 4294967296)) 0) (< 0 aux_div_aux_mod_aux_mod_v_main_~x~0_28_31_42_169) (<= 0 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_28_31_42_169_56 2)) (< main_~x~0 (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_28_31_42_169_56 2) (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_31_42_169 2) (* aux_div_v_main_~x~0_28_31 4294967296) 4294967296 (* aux_div_aux_mod_v_main_~x~0_28_31_42 4294967296))) (< main_~x~0 (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_28_31_42_169_56 2) 268435455 (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_31_42_169 2) (* aux_div_v_main_~x~0_28_31 4294967296))) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_28_31_42_169_56 2) 2) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_28_31_42_169_56 2) 65520 (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_31_42_169 2) (* aux_div_v_main_~x~0_28_31 4294967296) (* aux_div_aux_mod_v_main_~x~0_28_31_42 4294967296)) main_~x~0) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_28_31_42_169_56 2) (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_31_42_169 2) (* aux_div_v_main_~x~0_28_31 4294967296)) main_~x~0) (forall ((v_it_3 Int)) (or (and (<= 65520 (mod (+ (* v_it_3 2) main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_31_42_169 4294967294) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_28_31_42_169_56 4294967294)) 4294967296)) (< (mod (+ (* v_it_3 2) main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_31_42_169 4294967294) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_28_31_42_169_56 4294967294)) 4294967296) 268435455)) (not (<= 1 v_it_3)) (not (<= (+ v_it_3 1) (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_28_31_42_169_56 aux_div_aux_mod_aux_mod_v_main_~x~0_28_31_42_169))))))) (and (<= 1 main_~x~0) (<= (div (+ 65520 (* (- 1) main_~x~0)) (- 4294967296)) 0)) (and (<= main_~x~0 0) (<= 0 main_~x~0)))} [47] L15-2_primed-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {428#(and (exists ((aux_div_v_main_~x~0_28_31 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_28_31_42_169 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_28_31_42_169_56 Int) (aux_div_aux_mod_v_main_~x~0_28_31_42 Int)) (and (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_28_31_42_169_56 2) (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_31_42_169 2) 1) main_~x~0) (<= (div (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_28_31_42_169_56 2) 65520 (* (- 1) main_~x~0) (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_31_42_169 2)) (- 4294967296)) 0) (< 0 aux_div_aux_mod_aux_mod_v_main_~x~0_28_31_42_169) (<= 0 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_28_31_42_169_56 2)) (< main_~x~0 (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_28_31_42_169_56 2) (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_31_42_169 2) (* aux_div_v_main_~x~0_28_31 4294967296) 4294967296 (* aux_div_aux_mod_v_main_~x~0_28_31_42 4294967296))) (< main_~x~0 (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_28_31_42_169_56 2) 268435455 (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_31_42_169 2) (* aux_div_v_main_~x~0_28_31 4294967296))) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_28_31_42_169_56 2) 2) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_28_31_42_169_56 2) 65520 (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_31_42_169 2) (* aux_div_v_main_~x~0_28_31 4294967296) (* aux_div_aux_mod_v_main_~x~0_28_31_42 4294967296)) main_~x~0) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_28_31_42_169_56 2) (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_31_42_169 2) (* aux_div_v_main_~x~0_28_31 4294967296)) main_~x~0) (forall ((v_it_3 Int)) (or (and (<= 65520 (mod (+ (* v_it_3 2) main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_31_42_169 4294967294) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_28_31_42_169_56 4294967294)) 4294967296)) (< (mod (+ (* v_it_3 2) main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_31_42_169 4294967294) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_28_31_42_169_56 4294967294)) 4294967296) 268435455)) (not (<= 1 v_it_3)) (not (<= (+ v_it_3 1) (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_28_31_42_169_56 aux_div_aux_mod_aux_mod_v_main_~x~0_28_31_42_169))))))) (not (< (mod main_~x~0 4294967296) 268435455)))} is VALID [2022-04-28 02:58:05,001 INFO L272 TraceCheckUtils]: 10: Hoare triple {428#(and (exists ((aux_div_v_main_~x~0_28_31 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_28_31_42_169 Int) (aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_28_31_42_169_56 Int) (aux_div_aux_mod_v_main_~x~0_28_31_42 Int)) (and (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_28_31_42_169_56 2) (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_31_42_169 2) 1) main_~x~0) (<= (div (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_28_31_42_169_56 2) 65520 (* (- 1) main_~x~0) (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_31_42_169 2)) (- 4294967296)) 0) (< 0 aux_div_aux_mod_aux_mod_v_main_~x~0_28_31_42_169) (<= 0 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_28_31_42_169_56 2)) (< main_~x~0 (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_28_31_42_169_56 2) (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_31_42_169 2) (* aux_div_v_main_~x~0_28_31 4294967296) 4294967296 (* aux_div_aux_mod_v_main_~x~0_28_31_42 4294967296))) (< main_~x~0 (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_28_31_42_169_56 2) 268435455 (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_31_42_169 2) (* aux_div_v_main_~x~0_28_31 4294967296))) (< (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_28_31_42_169_56 2) 2) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_28_31_42_169_56 2) 65520 (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_31_42_169 2) (* aux_div_v_main_~x~0_28_31 4294967296) (* aux_div_aux_mod_v_main_~x~0_28_31_42 4294967296)) main_~x~0) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_28_31_42_169_56 2) (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_31_42_169 2) (* aux_div_v_main_~x~0_28_31 4294967296)) main_~x~0) (forall ((v_it_3 Int)) (or (and (<= 65520 (mod (+ (* v_it_3 2) main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_31_42_169 4294967294) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_28_31_42_169_56 4294967294)) 4294967296)) (< (mod (+ (* v_it_3 2) main_~x~0 (* aux_div_aux_mod_aux_mod_v_main_~x~0_28_31_42_169 4294967294) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_28_31_42_169_56 4294967294)) 4294967296) 268435455)) (not (<= 1 v_it_3)) (not (<= (+ v_it_3 1) (+ aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_28_31_42_169_56 aux_div_aux_mod_aux_mod_v_main_~x~0_28_31_42_169))))))) (not (< (mod main_~x~0 4294967296) 268435455)))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {432#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:58:05,002 INFO L290 TraceCheckUtils]: 11: Hoare triple {432#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {436#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:58:05,019 INFO L290 TraceCheckUtils]: 12: Hoare triple {436#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {386#false} is VALID [2022-04-28 02:58:05,020 INFO L290 TraceCheckUtils]: 13: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-28 02:58:05,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:58:05,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:58:14,497 INFO L290 TraceCheckUtils]: 13: Hoare triple {386#false} assume !false; {386#false} is VALID [2022-04-28 02:58:14,498 INFO L290 TraceCheckUtils]: 12: Hoare triple {436#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {386#false} is VALID [2022-04-28 02:58:14,498 INFO L290 TraceCheckUtils]: 11: Hoare triple {432#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {436#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:58:14,499 INFO L272 TraceCheckUtils]: 10: Hoare triple {393#(<= main_~x~0 (* (div main_~x~0 2) 2))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {432#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:58:14,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {455#(or (< (mod main_~x~0 4294967296) 268435455) (<= main_~x~0 (* (div main_~x~0 2) 2)))} [47] L15-2_primed-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {393#(<= main_~x~0 (* (div main_~x~0 2) 2))} is VALID [2022-04-28 02:58:16,508 WARN L290 TraceCheckUtils]: 8: Hoare triple {459#(and (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (<= (div (+ (* (- 1) main_~x~0) 268435454) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1))) (or (<= (div main_~x~0 (- 2)) (+ (div (+ (- 2) (* (- 1) main_~x~0)) 2) 1)) (not (<= 65520 (mod main_~x~0 4294967296))) (forall ((aux_div_aux_mod_aux_mod_v_main_~x~0_29_22_78_58 Int) (aux_div_aux_mod_v_main_~x~0_29_22_78 Int)) (or (exists ((v_it_3 Int)) (and (or (not (<= 65520 (mod (+ (* v_it_3 2) main_~x~0) 4294967296))) (not (< (mod (+ (* v_it_3 2) main_~x~0) 4294967296) 268435455))) (<= 1 v_it_3) (<= (+ v_it_3 main_~x~0 1) (+ aux_div_aux_mod_aux_mod_v_main_~x~0_29_22_78_58 (* aux_div_aux_mod_v_main_~x~0_29_22_78 2147483648))))) (< (* aux_div_aux_mod_aux_mod_v_main_~x~0_29_22_78_58 2) (+ main_~x~0 268435455)) (<= (+ aux_div_aux_mod_aux_mod_v_main_~x~0_29_22_78_58 (* aux_div_aux_mod_v_main_~x~0_29_22_78 2147483648)) main_~x~0) (<= (+ main_~x~0 4294967296) (* aux_div_aux_mod_aux_mod_v_main_~x~0_29_22_78_58 2))))))} [50] L16-2-->L15-2_primed: Formula: (let ((.cse4 (mod v_main_~x~0_20 4294967296))) (let ((.cse0 (<= 65520 .cse4)) (.cse2 (< .cse4 268435455)) (.cse3 (= v_main_~x~0_20 v_main_~x~0_19))) (or (and .cse0 (forall ((v_it_3 Int)) (or (let ((.cse1 (mod (+ (* v_it_3 2) v_main_~x~0_20) 4294967296))) (and (< .cse1 268435455) (<= 65520 .cse1))) (not (<= 1 v_it_3)) (not (<= (+ v_it_3 1) (div (+ v_main_~x~0_19 (* (- 1) v_main_~x~0_20)) 2))))) (= (mod (+ v_main_~x~0_20 v_main_~x~0_19) 2) 0) .cse2 (< 0 (div (+ v_main_~x~0_19 (* (- 1) v_main_~x~0_20)) 2))) (and (or (not .cse0) (not .cse2)) .cse3) .cse3))) InVars {main_~x~0=v_main_~x~0_20} OutVars{main_~x~0=v_main_~x~0_19} AuxVars[] AssignedVars[main_~x~0] {455#(or (< (mod main_~x~0 4294967296) 268435455) (<= main_~x~0 (* (div main_~x~0 2) 2)))} is UNKNOWN [2022-04-28 02:58:16,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {459#(and (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (<= (div (+ (* (- 1) main_~x~0) 268435454) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1))) (or (<= (div main_~x~0 (- 2)) (+ (div (+ (- 2) (* (- 1) main_~x~0)) 2) 1)) (not (<= 65520 (mod main_~x~0 4294967296))) (forall ((aux_div_aux_mod_aux_mod_v_main_~x~0_29_22_78_58 Int) (aux_div_aux_mod_v_main_~x~0_29_22_78 Int)) (or (exists ((v_it_3 Int)) (and (or (not (<= 65520 (mod (+ (* v_it_3 2) main_~x~0) 4294967296))) (not (< (mod (+ (* v_it_3 2) main_~x~0) 4294967296) 268435455))) (<= 1 v_it_3) (<= (+ v_it_3 main_~x~0 1) (+ aux_div_aux_mod_aux_mod_v_main_~x~0_29_22_78_58 (* aux_div_aux_mod_v_main_~x~0_29_22_78 2147483648))))) (< (* aux_div_aux_mod_aux_mod_v_main_~x~0_29_22_78_58 2) (+ main_~x~0 268435455)) (<= (+ aux_div_aux_mod_aux_mod_v_main_~x~0_29_22_78_58 (* aux_div_aux_mod_v_main_~x~0_29_22_78 2147483648)) main_~x~0) (<= (+ main_~x~0 4294967296) (* aux_div_aux_mod_aux_mod_v_main_~x~0_29_22_78_58 2))))))} [49] L15-2_primed-->L16-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {459#(and (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (<= (div (+ (* (- 1) main_~x~0) 268435454) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1))) (or (<= (div main_~x~0 (- 2)) (+ (div (+ (- 2) (* (- 1) main_~x~0)) 2) 1)) (not (<= 65520 (mod main_~x~0 4294967296))) (forall ((aux_div_aux_mod_aux_mod_v_main_~x~0_29_22_78_58 Int) (aux_div_aux_mod_v_main_~x~0_29_22_78 Int)) (or (exists ((v_it_3 Int)) (and (or (not (<= 65520 (mod (+ (* v_it_3 2) main_~x~0) 4294967296))) (not (< (mod (+ (* v_it_3 2) main_~x~0) 4294967296) 268435455))) (<= 1 v_it_3) (<= (+ v_it_3 main_~x~0 1) (+ aux_div_aux_mod_aux_mod_v_main_~x~0_29_22_78_58 (* aux_div_aux_mod_v_main_~x~0_29_22_78 2147483648))))) (< (* aux_div_aux_mod_aux_mod_v_main_~x~0_29_22_78_58 2) (+ main_~x~0 268435455)) (<= (+ aux_div_aux_mod_aux_mod_v_main_~x~0_29_22_78_58 (* aux_div_aux_mod_v_main_~x~0_29_22_78 2147483648)) main_~x~0) (<= (+ main_~x~0 4294967296) (* aux_div_aux_mod_aux_mod_v_main_~x~0_29_22_78_58 2))))))} is VALID [2022-04-28 02:58:18,518 WARN L290 TraceCheckUtils]: 6: Hoare triple {459#(and (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (<= (div (+ (* (- 1) main_~x~0) 268435454) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1))) (or (<= (div main_~x~0 (- 2)) (+ (div (+ (- 2) (* (- 1) main_~x~0)) 2) 1)) (not (<= 65520 (mod main_~x~0 4294967296))) (forall ((aux_div_aux_mod_aux_mod_v_main_~x~0_29_22_78_58 Int) (aux_div_aux_mod_v_main_~x~0_29_22_78 Int)) (or (exists ((v_it_3 Int)) (and (or (not (<= 65520 (mod (+ (* v_it_3 2) main_~x~0) 4294967296))) (not (< (mod (+ (* v_it_3 2) main_~x~0) 4294967296) 268435455))) (<= 1 v_it_3) (<= (+ v_it_3 main_~x~0 1) (+ aux_div_aux_mod_aux_mod_v_main_~x~0_29_22_78_58 (* aux_div_aux_mod_v_main_~x~0_29_22_78 2147483648))))) (< (* aux_div_aux_mod_aux_mod_v_main_~x~0_29_22_78_58 2) (+ main_~x~0 268435455)) (<= (+ aux_div_aux_mod_aux_mod_v_main_~x~0_29_22_78_58 (* aux_div_aux_mod_v_main_~x~0_29_22_78 2147483648)) main_~x~0) (<= (+ main_~x~0 4294967296) (* aux_div_aux_mod_aux_mod_v_main_~x~0_29_22_78_58 2))))))} [48] L16-2-->L15-2_primed: Formula: (let ((.cse0 (mod v_main_~x~0_18 4294967296)) (.cse1 (= v_main_~x~0_18 v_main_~x~0_17)) (.cse2 (= |v_main_#t~post4_9| |v_main_#t~post4_8|))) (or (and (< .cse0 65520) (< v_main_~x~0_18 v_main_~x~0_17) (<= (div (+ 65520 (* (- 1) v_main_~x~0_17)) (- 4294967296)) (+ (div (+ v_main_~x~0_18 (- 4294967295)) 4294967296) 1))) (and .cse1 .cse2 (<= 65520 .cse0)) (and .cse1 .cse2))) InVars {main_~x~0=v_main_~x~0_18, main_#t~post4=|v_main_#t~post4_9|} OutVars{main_~x~0=v_main_~x~0_17, main_#t~post4=|v_main_#t~post4_8|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {459#(and (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (<= (div (+ (* (- 1) main_~x~0) 268435454) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1))) (or (<= (div main_~x~0 (- 2)) (+ (div (+ (- 2) (* (- 1) main_~x~0)) 2) 1)) (not (<= 65520 (mod main_~x~0 4294967296))) (forall ((aux_div_aux_mod_aux_mod_v_main_~x~0_29_22_78_58 Int) (aux_div_aux_mod_v_main_~x~0_29_22_78 Int)) (or (exists ((v_it_3 Int)) (and (or (not (<= 65520 (mod (+ (* v_it_3 2) main_~x~0) 4294967296))) (not (< (mod (+ (* v_it_3 2) main_~x~0) 4294967296) 268435455))) (<= 1 v_it_3) (<= (+ v_it_3 main_~x~0 1) (+ aux_div_aux_mod_aux_mod_v_main_~x~0_29_22_78_58 (* aux_div_aux_mod_v_main_~x~0_29_22_78 2147483648))))) (< (* aux_div_aux_mod_aux_mod_v_main_~x~0_29_22_78_58 2) (+ main_~x~0 268435455)) (<= (+ aux_div_aux_mod_aux_mod_v_main_~x~0_29_22_78_58 (* aux_div_aux_mod_v_main_~x~0_29_22_78 2147483648)) main_~x~0) (<= (+ main_~x~0 4294967296) (* aux_div_aux_mod_aux_mod_v_main_~x~0_29_22_78_58 2))))))} is UNKNOWN [2022-04-28 02:58:18,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {385#true} ~x~0 := 0; {459#(and (or (<= (div (- main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (<= (div (+ (* (- 1) main_~x~0) 268435454) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1))) (or (<= (div main_~x~0 (- 2)) (+ (div (+ (- 2) (* (- 1) main_~x~0)) 2) 1)) (not (<= 65520 (mod main_~x~0 4294967296))) (forall ((aux_div_aux_mod_aux_mod_v_main_~x~0_29_22_78_58 Int) (aux_div_aux_mod_v_main_~x~0_29_22_78 Int)) (or (exists ((v_it_3 Int)) (and (or (not (<= 65520 (mod (+ (* v_it_3 2) main_~x~0) 4294967296))) (not (< (mod (+ (* v_it_3 2) main_~x~0) 4294967296) 268435455))) (<= 1 v_it_3) (<= (+ v_it_3 main_~x~0 1) (+ aux_div_aux_mod_aux_mod_v_main_~x~0_29_22_78_58 (* aux_div_aux_mod_v_main_~x~0_29_22_78 2147483648))))) (< (* aux_div_aux_mod_aux_mod_v_main_~x~0_29_22_78_58 2) (+ main_~x~0 268435455)) (<= (+ aux_div_aux_mod_aux_mod_v_main_~x~0_29_22_78_58 (* aux_div_aux_mod_v_main_~x~0_29_22_78 2147483648)) main_~x~0) (<= (+ main_~x~0 4294967296) (* aux_div_aux_mod_aux_mod_v_main_~x~0_29_22_78_58 2))))))} is VALID [2022-04-28 02:58:18,521 INFO L272 TraceCheckUtils]: 4: Hoare triple {385#true} call #t~ret5 := main(); {385#true} is VALID [2022-04-28 02:58:18,521 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {385#true} {385#true} #40#return; {385#true} is VALID [2022-04-28 02:58:18,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {385#true} assume true; {385#true} is VALID [2022-04-28 02:58:18,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {385#true} is VALID [2022-04-28 02:58:18,523 INFO L272 TraceCheckUtils]: 0: Hoare triple {385#true} call ULTIMATE.init(); {385#true} is VALID [2022-04-28 02:58:18,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 02:58:18,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036190175] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:58:18,524 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:58:18,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 15 [2022-04-28 02:58:18,764 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:58:18,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [63751587] [2022-04-28 02:58:18,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [63751587] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:58:18,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:58:18,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 02:58:18,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185040773] [2022-04-28 02:58:18,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:58:18,765 INFO L78 Accepts]: Start accepts. Automaton has has 9 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 02:58:18,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:58:18,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 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 02:58:18,787 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 02:58:18,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 02:58:18,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:58:18,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 02:58:18,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-04-28 02:58:18,788 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 9 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 02:58:19,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:19,152 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-04-28 02:58:19,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 02:58:19,152 INFO L78 Accepts]: Start accepts. Automaton has has 9 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 02:58:19,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:58:19,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 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 02:58:19,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2022-04-28 02:58:19,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 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 02:58:19,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2022-04-28 02:58:19,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 38 transitions. [2022-04-28 02:58:19,199 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 02:58:19,201 INFO L225 Difference]: With dead ends: 31 [2022-04-28 02:58:19,201 INFO L226 Difference]: Without dead ends: 21 [2022-04-28 02:58:19,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 21 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2022-04-28 02:58:19,204 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 19 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:58:19,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 36 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:58:19,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-28 02:58:19,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-28 02:58:19,221 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:58:19,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:19,227 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:19,228 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:19,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:19,229 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-28 02:58:19,229 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-28 02:58:19,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:58:19,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:58:19,230 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-28 02:58:19,230 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-28 02:58:19,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:58:19,231 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-28 02:58:19,231 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-28 02:58:19,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:58:19,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:58:19,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:58:19,231 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:58:19,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:58:19,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-04-28 02:58:19,232 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 15 [2022-04-28 02:58:19,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:58:19,232 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-04-28 02:58:19,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 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 02:58:19,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 24 transitions. [2022-04-28 02:58:19,257 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 02:58:19,257 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-28 02:58:19,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 02:58:19,258 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:58:19,258 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:58:19,263 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 02:58:19,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:58:19,463 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:58:19,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:58:19,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1815013998, now seen corresponding path program 2 times [2022-04-28 02:58:19,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:58:19,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1517633201] [2022-04-28 02:58:21,555 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 02:58:21,698 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:58:21,950 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 02:58:21,952 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:58:21,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1802637648, now seen corresponding path program 1 times [2022-04-28 02:58:21,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:58:21,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12347030] [2022-04-28 02:58:21,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:58:21,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:58:21,964 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) main_~x~0_6) (* (- 2) .v_it_5.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_5.0)) 4294967296)) 65520) 0) [2022-04-28 02:58:21,964 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_6) (* (- 2) .v_it_5.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_5.0)) 4294967296)) 268435455) 0)) [2022-04-28 02:58:21,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:21,989 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) main_~x~0_6) (* (- 2) .v_it_5.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_5.1)) 4294967296)) 65520) 0) [2022-04-28 02:58:21,989 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_6) (* (- 2) .v_it_5.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_5.1)) 4294967296)) 268435455) 0)) [2022-04-28 02:58:22,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:58:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:22,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {657#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {646#true} is VALID [2022-04-28 02:58:22,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {646#true} assume true; {646#true} is VALID [2022-04-28 02:58:22,084 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {646#true} {646#true} #40#return; {646#true} is VALID [2022-04-28 02:58:22,084 INFO L272 TraceCheckUtils]: 0: Hoare triple {646#true} call ULTIMATE.init(); {657#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:58:22,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {657#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {646#true} is VALID [2022-04-28 02:58:22,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {646#true} assume true; {646#true} is VALID [2022-04-28 02:58:22,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {646#true} {646#true} #40#return; {646#true} is VALID [2022-04-28 02:58:22,085 INFO L272 TraceCheckUtils]: 4: Hoare triple {646#true} call #t~ret5 := main(); {646#true} is VALID [2022-04-28 02:58:22,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {646#true} ~x~0 := 0; {651#(= main_~x~0 0)} is VALID [2022-04-28 02:58:22,087 INFO L290 TraceCheckUtils]: 6: Hoare triple {651#(= main_~x~0 0)} [52] L16-2-->L15-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_37 v_main_~x~0_36)) (.cse2 (mod v_main_~x~0_37 4294967296)) (.cse1 (= |v_main_#t~post4_16| |v_main_#t~post4_15|))) (or (and .cse0 .cse1) (and (<= (div (+ (* (- 1) v_main_~x~0_36) 65520) (- 4294967296)) (+ (div (+ v_main_~x~0_37 (- 4294967295)) 4294967296) 1)) (< v_main_~x~0_37 v_main_~x~0_36) (< .cse2 65520)) (and .cse0 (<= 65520 .cse2) .cse1))) InVars {main_~x~0=v_main_~x~0_37, main_#t~post4=|v_main_#t~post4_16|} OutVars{main_~x~0=v_main_~x~0_36, main_#t~post4=|v_main_#t~post4_15|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {652#(and (<= (div (+ 65520 (* (- 1) main_~x~0)) (- 4294967296)) 0) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2022-04-28 02:58:22,092 INFO L290 TraceCheckUtils]: 7: Hoare triple {652#(and (<= (div (+ 65520 (* (- 1) main_~x~0)) (- 4294967296)) 0) (< 0 (+ (div main_~x~0 4294967296) 1)))} [53] L15-2_primed-->L16-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {652#(and (<= (div (+ 65520 (* (- 1) main_~x~0)) (- 4294967296)) 0) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2022-04-28 02:58:22,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {652#(and (<= (div (+ 65520 (* (- 1) main_~x~0)) (- 4294967296)) 0) (< 0 (+ (div main_~x~0 4294967296) 1)))} [54] L16-2-->L15-2_primed: Formula: (let ((.cse4 (mod v_main_~x~0_39 4294967296))) (let ((.cse1 (< .cse4 268435455)) (.cse0 (<= 65520 .cse4)) (.cse2 (= v_main_~x~0_39 v_main_~x~0_38))) (or (and (or (not .cse0) (not .cse1)) .cse2) (and (< 0 (div (+ v_main_~x~0_39 (* (- 1) v_main_~x~0_38)) (- 2))) (forall ((v_it_5 Int)) (or (not (<= 1 v_it_5)) (not (<= (+ v_it_5 1) (div (+ v_main_~x~0_39 (* (- 1) v_main_~x~0_38)) (- 2)))) (let ((.cse3 (mod (+ v_main_~x~0_39 (* v_it_5 2)) 4294967296))) (and (< .cse3 268435455) (<= 65520 .cse3))))) .cse1 (= (mod (+ v_main_~x~0_39 v_main_~x~0_38) 2) 0) .cse0) .cse2))) InVars {main_~x~0=v_main_~x~0_39} OutVars{main_~x~0=v_main_~x~0_38} AuxVars[] AssignedVars[main_~x~0] {653#(or (<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 268435454)) (<= main_~x~0 (* (div main_~x~0 2) 2)))} is VALID [2022-04-28 02:58:22,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {653#(or (<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 268435454)) (<= main_~x~0 (* (div main_~x~0 2) 2)))} [51] L15-2_primed-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {654#(<= main_~x~0 (* (div main_~x~0 2) 2))} is VALID [2022-04-28 02:58:22,110 INFO L272 TraceCheckUtils]: 10: Hoare triple {654#(<= main_~x~0 (* (div main_~x~0 2) 2))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {655#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 02:58:22,111 INFO L290 TraceCheckUtils]: 11: Hoare triple {655#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {656#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 02:58:22,113 INFO L290 TraceCheckUtils]: 12: Hoare triple {656#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {647#false} is VALID [2022-04-28 02:58:22,113 INFO L290 TraceCheckUtils]: 13: Hoare triple {647#false} assume !false; {647#false} is VALID [2022-04-28 02:58:22,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:58:22,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:58:22,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12347030] [2022-04-28 02:58:22,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12347030] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:58:22,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765026945] [2022-04-28 02:58:22,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:58:22,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:58:22,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:58:22,114 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 02:58:22,156 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 02:58:22,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:22,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 02:58:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:58:22,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:58:43,270 INFO L272 TraceCheckUtils]: 0: Hoare triple {646#true} call ULTIMATE.init(); {646#true} is VALID [2022-04-28 02:58:43,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {646#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {646#true} is VALID [2022-04-28 02:58:43,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {646#true} assume true; {646#true} is VALID [2022-04-28 02:58:43,271 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {646#true} {646#true} #40#return; {646#true} is VALID [2022-04-28 02:58:43,271 INFO L272 TraceCheckUtils]: 4: Hoare triple {646#true} call #t~ret5 := main(); {646#true} is VALID [2022-04-28 02:58:43,271 INFO L290 TraceCheckUtils]: 5: Hoare triple {646#true} ~x~0 := 0; {651#(= main_~x~0 0)} is VALID [2022-04-28 02:58:43,272 INFO L290 TraceCheckUtils]: 6: Hoare triple {651#(= main_~x~0 0)} [52] L16-2-->L15-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_37 v_main_~x~0_36)) (.cse2 (mod v_main_~x~0_37 4294967296)) (.cse1 (= |v_main_#t~post4_16| |v_main_#t~post4_15|))) (or (and .cse0 .cse1) (and (<= (div (+ (* (- 1) v_main_~x~0_36) 65520) (- 4294967296)) (+ (div (+ v_main_~x~0_37 (- 4294967295)) 4294967296) 1)) (< v_main_~x~0_37 v_main_~x~0_36) (< .cse2 65520)) (and .cse0 (<= 65520 .cse2) .cse1))) InVars {main_~x~0=v_main_~x~0_37, main_#t~post4=|v_main_#t~post4_16|} OutVars{main_~x~0=v_main_~x~0_36, main_#t~post4=|v_main_#t~post4_15|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {652#(and (<= (div (+ 65520 (* (- 1) main_~x~0)) (- 4294967296)) 0) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2022-04-28 02:58:43,273 INFO L290 TraceCheckUtils]: 7: Hoare triple {652#(and (<= (div (+ 65520 (* (- 1) main_~x~0)) (- 4294967296)) 0) (< 0 (+ (div main_~x~0 4294967296) 1)))} [53] L15-2_primed-->L16-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {652#(and (<= (div (+ 65520 (* (- 1) main_~x~0)) (- 4294967296)) 0) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2022-04-28 02:58:43,325 INFO L290 TraceCheckUtils]: 8: Hoare triple {652#(and (<= (div (+ 65520 (* (- 1) main_~x~0)) (- 4294967296)) 0) (< 0 (+ (div main_~x~0 4294967296) 1)))} [54] L16-2-->L15-2_primed: Formula: (let ((.cse4 (mod v_main_~x~0_39 4294967296))) (let ((.cse1 (< .cse4 268435455)) (.cse0 (<= 65520 .cse4)) (.cse2 (= v_main_~x~0_39 v_main_~x~0_38))) (or (and (or (not .cse0) (not .cse1)) .cse2) (and (< 0 (div (+ v_main_~x~0_39 (* (- 1) v_main_~x~0_38)) (- 2))) (forall ((v_it_5 Int)) (or (not (<= 1 v_it_5)) (not (<= (+ v_it_5 1) (div (+ v_main_~x~0_39 (* (- 1) v_main_~x~0_38)) (- 2)))) (let ((.cse3 (mod (+ v_main_~x~0_39 (* v_it_5 2)) 4294967296))) (and (< .cse3 268435455) (<= 65520 .cse3))))) .cse1 (= (mod (+ v_main_~x~0_39 v_main_~x~0_38) 2) 0) .cse0) .cse2))) InVars {main_~x~0=v_main_~x~0_39} OutVars{main_~x~0=v_main_~x~0_38} AuxVars[] AssignedVars[main_~x~0] {685#(exists ((aux_div_v_main_~x~0_47_55 Int) (aux_div_aux_mod_v_main_~x~0_47_55_103 Int)) (and (or (and (<= (* aux_div_aux_mod_v_main_~x~0_47_55_103 4294967296) main_~x~0) (<= main_~x~0 (+ 65520 (* aux_div_v_main_~x~0_47_55 4294967296)))) (exists ((aux_div_aux_mod_aux_mod_v_main_~x~0_47_55_103_59 Int)) (and (<= 65520 (mod (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_55_103_59) (* main_~x~0 4294967295)) 4294967296)) (<= main_~x~0 (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_55_103_59)) (<= (+ (* aux_div_aux_mod_v_main_~x~0_47_55_103 4294967296) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_55_103_59)) (+ main_~x~0 65520 (* aux_div_v_main_~x~0_47_55 4294967296))) (forall ((v_it_5 Int)) (or (and (<= 65520 (mod (+ (* v_it_5 2) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_55_103_59) (* main_~x~0 4294967295)) 4294967296)) (< (mod (+ (* v_it_5 2) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_55_103_59) (* main_~x~0 4294967295)) 4294967296) 268435455)) (not (<= 1 v_it_5)) (not (<= (+ v_it_5 aux_div_aux_mod_aux_mod_v_main_~x~0_47_55_103_59 1 (* aux_div_aux_mod_v_main_~x~0_47_55_103 2147483648)) main_~x~0)))) (< (+ aux_div_aux_mod_aux_mod_v_main_~x~0_47_55_103_59 (* aux_div_aux_mod_v_main_~x~0_47_55_103 2147483648)) main_~x~0)))) (<= aux_div_v_main_~x~0_47_55 0) (< 0 (+ aux_div_aux_mod_v_main_~x~0_47_55_103 1))))} is VALID [2022-04-28 02:58:45,335 WARN L290 TraceCheckUtils]: 9: Hoare triple {685#(exists ((aux_div_v_main_~x~0_47_55 Int) (aux_div_aux_mod_v_main_~x~0_47_55_103 Int)) (and (or (and (<= (* aux_div_aux_mod_v_main_~x~0_47_55_103 4294967296) main_~x~0) (<= main_~x~0 (+ 65520 (* aux_div_v_main_~x~0_47_55 4294967296)))) (exists ((aux_div_aux_mod_aux_mod_v_main_~x~0_47_55_103_59 Int)) (and (<= 65520 (mod (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_55_103_59) (* main_~x~0 4294967295)) 4294967296)) (<= main_~x~0 (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_55_103_59)) (<= (+ (* aux_div_aux_mod_v_main_~x~0_47_55_103 4294967296) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_55_103_59)) (+ main_~x~0 65520 (* aux_div_v_main_~x~0_47_55 4294967296))) (forall ((v_it_5 Int)) (or (and (<= 65520 (mod (+ (* v_it_5 2) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_55_103_59) (* main_~x~0 4294967295)) 4294967296)) (< (mod (+ (* v_it_5 2) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_55_103_59) (* main_~x~0 4294967295)) 4294967296) 268435455)) (not (<= 1 v_it_5)) (not (<= (+ v_it_5 aux_div_aux_mod_aux_mod_v_main_~x~0_47_55_103_59 1 (* aux_div_aux_mod_v_main_~x~0_47_55_103 2147483648)) main_~x~0)))) (< (+ aux_div_aux_mod_aux_mod_v_main_~x~0_47_55_103_59 (* aux_div_aux_mod_v_main_~x~0_47_55_103 2147483648)) main_~x~0)))) (<= aux_div_v_main_~x~0_47_55 0) (< 0 (+ aux_div_aux_mod_v_main_~x~0_47_55_103 1))))} [51] L15-2_primed-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {689#(and (not (< (mod main_~x~0 4294967296) 268435455)) (exists ((aux_div_v_main_~x~0_47_55 Int) (aux_div_aux_mod_v_main_~x~0_47_55_103 Int)) (and (<= aux_div_v_main_~x~0_47_55 0) (exists ((aux_div_aux_mod_aux_mod_v_main_~x~0_47_55_103_59 Int)) (and (<= 65520 (mod (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_55_103_59) (* main_~x~0 4294967295)) 4294967296)) (<= main_~x~0 (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_55_103_59)) (<= (+ (* aux_div_aux_mod_v_main_~x~0_47_55_103 4294967296) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_55_103_59)) (+ main_~x~0 65520 (* aux_div_v_main_~x~0_47_55 4294967296))) (forall ((v_it_5 Int)) (or (and (<= 65520 (mod (+ (* v_it_5 2) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_55_103_59) (* main_~x~0 4294967295)) 4294967296)) (< (mod (+ (* v_it_5 2) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_55_103_59) (* main_~x~0 4294967295)) 4294967296) 268435455)) (not (<= 1 v_it_5)) (not (<= (+ v_it_5 aux_div_aux_mod_aux_mod_v_main_~x~0_47_55_103_59 1 (* aux_div_aux_mod_v_main_~x~0_47_55_103 2147483648)) main_~x~0)))) (< (+ aux_div_aux_mod_aux_mod_v_main_~x~0_47_55_103_59 (* aux_div_aux_mod_v_main_~x~0_47_55_103 2147483648)) main_~x~0))) (< 0 (+ aux_div_aux_mod_v_main_~x~0_47_55_103 1)))))} is UNKNOWN [2022-04-28 02:58:45,343 INFO L272 TraceCheckUtils]: 10: Hoare triple {689#(and (not (< (mod main_~x~0 4294967296) 268435455)) (exists ((aux_div_v_main_~x~0_47_55 Int) (aux_div_aux_mod_v_main_~x~0_47_55_103 Int)) (and (<= aux_div_v_main_~x~0_47_55 0) (exists ((aux_div_aux_mod_aux_mod_v_main_~x~0_47_55_103_59 Int)) (and (<= 65520 (mod (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_55_103_59) (* main_~x~0 4294967295)) 4294967296)) (<= main_~x~0 (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_55_103_59)) (<= (+ (* aux_div_aux_mod_v_main_~x~0_47_55_103 4294967296) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_55_103_59)) (+ main_~x~0 65520 (* aux_div_v_main_~x~0_47_55 4294967296))) (forall ((v_it_5 Int)) (or (and (<= 65520 (mod (+ (* v_it_5 2) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_55_103_59) (* main_~x~0 4294967295)) 4294967296)) (< (mod (+ (* v_it_5 2) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_47_55_103_59) (* main_~x~0 4294967295)) 4294967296) 268435455)) (not (<= 1 v_it_5)) (not (<= (+ v_it_5 aux_div_aux_mod_aux_mod_v_main_~x~0_47_55_103_59 1 (* aux_div_aux_mod_v_main_~x~0_47_55_103 2147483648)) main_~x~0)))) (< (+ aux_div_aux_mod_aux_mod_v_main_~x~0_47_55_103_59 (* aux_div_aux_mod_v_main_~x~0_47_55_103 2147483648)) main_~x~0))) (< 0 (+ aux_div_aux_mod_v_main_~x~0_47_55_103 1)))))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {693#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:58:45,343 INFO L290 TraceCheckUtils]: 11: Hoare triple {693#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {697#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:58:45,344 INFO L290 TraceCheckUtils]: 12: Hoare triple {697#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {647#false} is VALID [2022-04-28 02:58:45,344 INFO L290 TraceCheckUtils]: 13: Hoare triple {647#false} assume !false; {647#false} is VALID [2022-04-28 02:58:45,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:58:45,344 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:58:57,875 WARN L232 SmtUtils]: Spent 8.67s on a formula simplification. DAG size of input: 63 DAG size of output: 61 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 02:59:06,958 INFO L290 TraceCheckUtils]: 13: Hoare triple {647#false} assume !false; {647#false} is VALID [2022-04-28 02:59:06,959 INFO L290 TraceCheckUtils]: 12: Hoare triple {697#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {647#false} is VALID [2022-04-28 02:59:06,960 INFO L290 TraceCheckUtils]: 11: Hoare triple {693#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {697#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 02:59:06,960 INFO L272 TraceCheckUtils]: 10: Hoare triple {654#(<= main_~x~0 (* (div main_~x~0 2) 2))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {693#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:59:06,961 INFO L290 TraceCheckUtils]: 9: Hoare triple {653#(or (<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 268435454)) (<= main_~x~0 (* (div main_~x~0 2) 2)))} [51] L15-2_primed-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {654#(<= main_~x~0 (* (div main_~x~0 2) 2))} is VALID [2022-04-28 02:59:09,216 WARN L290 TraceCheckUtils]: 8: Hoare triple {719#(and (or (forall ((aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_78_58 Int) (aux_div_v_main_~x~0_48_31 Int) (aux_div_aux_mod_v_main_~x~0_48_31_78 Int)) (or (<= (+ main_~x~0 4294967296 (* aux_div_v_main_~x~0_48_31 4294967296)) (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_78_58) (* aux_div_aux_mod_v_main_~x~0_48_31_78 2))) (<= (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_78_58) main_~x~0) (exists ((v_it_5 Int)) (and (or (not (<= 65520 (mod (+ main_~x~0 (* v_it_5 2)) 4294967296))) (not (< (mod (+ main_~x~0 (* v_it_5 2)) 4294967296) 268435455))) (<= 1 v_it_5) (<= (+ v_it_5 main_~x~0 1) (+ aux_div_aux_mod_v_main_~x~0_48_31_78 aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_78_58)))) (<= (+ main_~x~0 2) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_78_58)) (<= (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_78_58) (* aux_div_aux_mod_v_main_~x~0_48_31_78 2)) (+ main_~x~0 (* aux_div_v_main_~x~0_48_31 4294967296) 268435454)) (<= (+ aux_div_aux_mod_v_main_~x~0_48_31_78 aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_78_58) main_~x~0))) (not (<= 65520 (mod main_~x~0 4294967296)))) (or (<= (div (* (- 1) main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (<= (div (+ (* (- 1) main_~x~0) 268435454) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1))))} [54] L16-2-->L15-2_primed: Formula: (let ((.cse4 (mod v_main_~x~0_39 4294967296))) (let ((.cse1 (< .cse4 268435455)) (.cse0 (<= 65520 .cse4)) (.cse2 (= v_main_~x~0_39 v_main_~x~0_38))) (or (and (or (not .cse0) (not .cse1)) .cse2) (and (< 0 (div (+ v_main_~x~0_39 (* (- 1) v_main_~x~0_38)) (- 2))) (forall ((v_it_5 Int)) (or (not (<= 1 v_it_5)) (not (<= (+ v_it_5 1) (div (+ v_main_~x~0_39 (* (- 1) v_main_~x~0_38)) (- 2)))) (let ((.cse3 (mod (+ v_main_~x~0_39 (* v_it_5 2)) 4294967296))) (and (< .cse3 268435455) (<= 65520 .cse3))))) .cse1 (= (mod (+ v_main_~x~0_39 v_main_~x~0_38) 2) 0) .cse0) .cse2))) InVars {main_~x~0=v_main_~x~0_39} OutVars{main_~x~0=v_main_~x~0_38} AuxVars[] AssignedVars[main_~x~0] {653#(or (<= main_~x~0 (+ (* 4294967296 (div main_~x~0 4294967296)) 268435454)) (<= main_~x~0 (* (div main_~x~0 2) 2)))} is UNKNOWN [2022-04-28 02:59:09,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {719#(and (or (forall ((aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_78_58 Int) (aux_div_v_main_~x~0_48_31 Int) (aux_div_aux_mod_v_main_~x~0_48_31_78 Int)) (or (<= (+ main_~x~0 4294967296 (* aux_div_v_main_~x~0_48_31 4294967296)) (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_78_58) (* aux_div_aux_mod_v_main_~x~0_48_31_78 2))) (<= (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_78_58) main_~x~0) (exists ((v_it_5 Int)) (and (or (not (<= 65520 (mod (+ main_~x~0 (* v_it_5 2)) 4294967296))) (not (< (mod (+ main_~x~0 (* v_it_5 2)) 4294967296) 268435455))) (<= 1 v_it_5) (<= (+ v_it_5 main_~x~0 1) (+ aux_div_aux_mod_v_main_~x~0_48_31_78 aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_78_58)))) (<= (+ main_~x~0 2) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_78_58)) (<= (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_78_58) (* aux_div_aux_mod_v_main_~x~0_48_31_78 2)) (+ main_~x~0 (* aux_div_v_main_~x~0_48_31 4294967296) 268435454)) (<= (+ aux_div_aux_mod_v_main_~x~0_48_31_78 aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_78_58) main_~x~0))) (not (<= 65520 (mod main_~x~0 4294967296)))) (or (<= (div (* (- 1) main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (<= (div (+ (* (- 1) main_~x~0) 268435454) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1))))} [53] L15-2_primed-->L16-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {719#(and (or (forall ((aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_78_58 Int) (aux_div_v_main_~x~0_48_31 Int) (aux_div_aux_mod_v_main_~x~0_48_31_78 Int)) (or (<= (+ main_~x~0 4294967296 (* aux_div_v_main_~x~0_48_31 4294967296)) (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_78_58) (* aux_div_aux_mod_v_main_~x~0_48_31_78 2))) (<= (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_78_58) main_~x~0) (exists ((v_it_5 Int)) (and (or (not (<= 65520 (mod (+ main_~x~0 (* v_it_5 2)) 4294967296))) (not (< (mod (+ main_~x~0 (* v_it_5 2)) 4294967296) 268435455))) (<= 1 v_it_5) (<= (+ v_it_5 main_~x~0 1) (+ aux_div_aux_mod_v_main_~x~0_48_31_78 aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_78_58)))) (<= (+ main_~x~0 2) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_78_58)) (<= (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_78_58) (* aux_div_aux_mod_v_main_~x~0_48_31_78 2)) (+ main_~x~0 (* aux_div_v_main_~x~0_48_31 4294967296) 268435454)) (<= (+ aux_div_aux_mod_v_main_~x~0_48_31_78 aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_78_58) main_~x~0))) (not (<= 65520 (mod main_~x~0 4294967296)))) (or (<= (div (* (- 1) main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (<= (div (+ (* (- 1) main_~x~0) 268435454) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1))))} is VALID [2022-04-28 02:59:11,264 WARN L290 TraceCheckUtils]: 6: Hoare triple {719#(and (or (forall ((aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_78_58 Int) (aux_div_v_main_~x~0_48_31 Int) (aux_div_aux_mod_v_main_~x~0_48_31_78 Int)) (or (<= (+ main_~x~0 4294967296 (* aux_div_v_main_~x~0_48_31 4294967296)) (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_78_58) (* aux_div_aux_mod_v_main_~x~0_48_31_78 2))) (<= (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_78_58) main_~x~0) (exists ((v_it_5 Int)) (and (or (not (<= 65520 (mod (+ main_~x~0 (* v_it_5 2)) 4294967296))) (not (< (mod (+ main_~x~0 (* v_it_5 2)) 4294967296) 268435455))) (<= 1 v_it_5) (<= (+ v_it_5 main_~x~0 1) (+ aux_div_aux_mod_v_main_~x~0_48_31_78 aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_78_58)))) (<= (+ main_~x~0 2) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_78_58)) (<= (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_78_58) (* aux_div_aux_mod_v_main_~x~0_48_31_78 2)) (+ main_~x~0 (* aux_div_v_main_~x~0_48_31 4294967296) 268435454)) (<= (+ aux_div_aux_mod_v_main_~x~0_48_31_78 aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_78_58) main_~x~0))) (not (<= 65520 (mod main_~x~0 4294967296)))) (or (<= (div (* (- 1) main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (<= (div (+ (* (- 1) main_~x~0) 268435454) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1))))} [52] L16-2-->L15-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_37 v_main_~x~0_36)) (.cse2 (mod v_main_~x~0_37 4294967296)) (.cse1 (= |v_main_#t~post4_16| |v_main_#t~post4_15|))) (or (and .cse0 .cse1) (and (<= (div (+ (* (- 1) v_main_~x~0_36) 65520) (- 4294967296)) (+ (div (+ v_main_~x~0_37 (- 4294967295)) 4294967296) 1)) (< v_main_~x~0_37 v_main_~x~0_36) (< .cse2 65520)) (and .cse0 (<= 65520 .cse2) .cse1))) InVars {main_~x~0=v_main_~x~0_37, main_#t~post4=|v_main_#t~post4_16|} OutVars{main_~x~0=v_main_~x~0_36, main_#t~post4=|v_main_#t~post4_15|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {719#(and (or (forall ((aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_78_58 Int) (aux_div_v_main_~x~0_48_31 Int) (aux_div_aux_mod_v_main_~x~0_48_31_78 Int)) (or (<= (+ main_~x~0 4294967296 (* aux_div_v_main_~x~0_48_31 4294967296)) (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_78_58) (* aux_div_aux_mod_v_main_~x~0_48_31_78 2))) (<= (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_78_58) main_~x~0) (exists ((v_it_5 Int)) (and (or (not (<= 65520 (mod (+ main_~x~0 (* v_it_5 2)) 4294967296))) (not (< (mod (+ main_~x~0 (* v_it_5 2)) 4294967296) 268435455))) (<= 1 v_it_5) (<= (+ v_it_5 main_~x~0 1) (+ aux_div_aux_mod_v_main_~x~0_48_31_78 aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_78_58)))) (<= (+ main_~x~0 2) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_78_58)) (<= (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_78_58) (* aux_div_aux_mod_v_main_~x~0_48_31_78 2)) (+ main_~x~0 (* aux_div_v_main_~x~0_48_31 4294967296) 268435454)) (<= (+ aux_div_aux_mod_v_main_~x~0_48_31_78 aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_78_58) main_~x~0))) (not (<= 65520 (mod main_~x~0 4294967296)))) (or (<= (div (* (- 1) main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (<= (div (+ (* (- 1) main_~x~0) 268435454) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1))))} is UNKNOWN [2022-04-28 02:59:11,266 INFO L290 TraceCheckUtils]: 5: Hoare triple {646#true} ~x~0 := 0; {719#(and (or (forall ((aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_78_58 Int) (aux_div_v_main_~x~0_48_31 Int) (aux_div_aux_mod_v_main_~x~0_48_31_78 Int)) (or (<= (+ main_~x~0 4294967296 (* aux_div_v_main_~x~0_48_31 4294967296)) (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_78_58) (* aux_div_aux_mod_v_main_~x~0_48_31_78 2))) (<= (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_78_58) main_~x~0) (exists ((v_it_5 Int)) (and (or (not (<= 65520 (mod (+ main_~x~0 (* v_it_5 2)) 4294967296))) (not (< (mod (+ main_~x~0 (* v_it_5 2)) 4294967296) 268435455))) (<= 1 v_it_5) (<= (+ v_it_5 main_~x~0 1) (+ aux_div_aux_mod_v_main_~x~0_48_31_78 aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_78_58)))) (<= (+ main_~x~0 2) (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_78_58)) (<= (+ (* 2 aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_78_58) (* aux_div_aux_mod_v_main_~x~0_48_31_78 2)) (+ main_~x~0 (* aux_div_v_main_~x~0_48_31 4294967296) 268435454)) (<= (+ aux_div_aux_mod_v_main_~x~0_48_31_78 aux_div_aux_mod_aux_mod_v_main_~x~0_48_31_78_58) main_~x~0))) (not (<= 65520 (mod main_~x~0 4294967296)))) (or (<= (div (* (- 1) main_~x~0) (- 2)) (+ (div (+ (- 2) main_~x~0) 2) 1)) (<= (div (+ (* (- 1) main_~x~0) 268435454) (- 4294967296)) (+ (div (+ main_~x~0 (- 4294967296)) 4294967296) 1))))} is VALID [2022-04-28 02:59:11,266 INFO L272 TraceCheckUtils]: 4: Hoare triple {646#true} call #t~ret5 := main(); {646#true} is VALID [2022-04-28 02:59:11,266 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {646#true} {646#true} #40#return; {646#true} is VALID [2022-04-28 02:59:11,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {646#true} assume true; {646#true} is VALID [2022-04-28 02:59:11,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {646#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {646#true} is VALID [2022-04-28 02:59:11,266 INFO L272 TraceCheckUtils]: 0: Hoare triple {646#true} call ULTIMATE.init(); {646#true} is VALID [2022-04-28 02:59:11,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-28 02:59:11,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765026945] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:59:11,267 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:59:11,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 14 [2022-04-28 02:59:20,735 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:59:20,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1517633201] [2022-04-28 02:59:20,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1517633201] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:59:20,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:59:20,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 02:59:20,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870555158] [2022-04-28 02:59:20,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:59:20,736 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 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 02:59:20,736 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:59:20,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 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 02:59:20,763 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 02:59:20,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 02:59:20,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:59:20,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 02:59:20,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=207, Unknown=5, NotChecked=0, Total=272 [2022-04-28 02:59:20,764 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 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 02:59:21,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:21,428 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-28 02:59:21,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 02:59:21,428 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 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 02:59:21,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:59:21,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 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 02:59:21,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-28 02:59:21,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 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 02:59:21,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-28 02:59:21,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2022-04-28 02:59:21,476 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 02:59:21,477 INFO L225 Difference]: With dead ends: 30 [2022-04-28 02:59:21,477 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 02:59:21,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 22 SyntacticMatches, 10 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 25.4s TimeCoverageRelationStatistics Valid=101, Invalid=356, Unknown=5, NotChecked=0, Total=462 [2022-04-28 02:59:21,478 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 17 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 02:59:21,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 38 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 02:59:21,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 02:59:21,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 02:59:21,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:59:21,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 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 02:59:21,500 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 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 02:59:21,500 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 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 02:59:21,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:21,503 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-28 02:59:21,503 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-28 02:59:21,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:59:21,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:59:21,504 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 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 23 states. [2022-04-28 02:59:21,504 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 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 23 states. [2022-04-28 02:59:21,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:59:21,506 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-04-28 02:59:21,506 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-28 02:59:21,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:59:21,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:59:21,508 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:59:21,508 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:59:21,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 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 02:59:21,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-04-28 02:59:21,509 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 19 [2022-04-28 02:59:21,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:59:21,509 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-04-28 02:59:21,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 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 02:59:21,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 26 transitions. [2022-04-28 02:59:21,536 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 02:59:21,536 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-04-28 02:59:21,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 02:59:21,540 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:59:21,540 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:59:21,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-28 02:59:21,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:59:21,745 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:59:21,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:59:21,745 INFO L85 PathProgramCache]: Analyzing trace with hash -205744403, now seen corresponding path program 3 times [2022-04-28 02:59:21,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:59:21,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [85602443] [2022-04-28 02:59:22,212 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 02:59:24,499 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 02:59:24,501 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:59:24,505 INFO L85 PathProgramCache]: Analyzing trace with hash 246894512, now seen corresponding path program 1 times [2022-04-28 02:59:24,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:59:24,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385123311] [2022-04-28 02:59:24,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:59:24,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:59:24,513 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_6) (* (- 2) .v_it_7.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_7.0)) 4294967296)) 268435455) 0)) [2022-04-28 02:59:24,513 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) main_~x~0_6) (* (- 2) .v_it_7.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_7.0)) 4294967296)) 65520) 0) [2022-04-28 02:59:24,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:24,534 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_6) (* (- 2) .v_it_7.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_7.1)) 4294967296)) 268435455) 0)) [2022-04-28 02:59:24,535 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (<= (+ (* (- 1) main_~x~0_6) (* (- 2) .v_it_7.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_7.1)) 4294967296)) 65520) 0) [2022-04-28 02:59:24,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:59:24,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:24,740 INFO L290 TraceCheckUtils]: 0: Hoare triple {922#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {911#true} is VALID [2022-04-28 02:59:24,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {911#true} assume true; {911#true} is VALID [2022-04-28 02:59:24,740 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {911#true} {911#true} #40#return; {911#true} is VALID [2022-04-28 02:59:24,741 INFO L272 TraceCheckUtils]: 0: Hoare triple {911#true} call ULTIMATE.init(); {922#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:59:24,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {922#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {911#true} is VALID [2022-04-28 02:59:24,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {911#true} assume true; {911#true} is VALID [2022-04-28 02:59:24,741 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {911#true} {911#true} #40#return; {911#true} is VALID [2022-04-28 02:59:24,741 INFO L272 TraceCheckUtils]: 4: Hoare triple {911#true} call #t~ret5 := main(); {911#true} is VALID [2022-04-28 02:59:24,741 INFO L290 TraceCheckUtils]: 5: Hoare triple {911#true} ~x~0 := 0; {916#(= main_~x~0 0)} is VALID [2022-04-28 02:59:24,743 INFO L290 TraceCheckUtils]: 6: Hoare triple {916#(= main_~x~0 0)} [56] L16-2-->L15-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_58 v_main_~x~0_57)) (.cse1 (= |v_main_#t~post4_23| |v_main_#t~post4_22|)) (.cse2 (mod v_main_~x~0_58 4294967296))) (or (and .cse0 .cse1 (<= 65520 .cse2)) (and .cse0 .cse1) (and (< v_main_~x~0_58 v_main_~x~0_57) (<= (div (+ 65520 (* (- 1) v_main_~x~0_57)) (- 4294967296)) (+ (div (+ v_main_~x~0_58 (- 4294967295)) 4294967296) 1)) (< .cse2 65520)))) InVars {main_~x~0=v_main_~x~0_58, main_#t~post4=|v_main_#t~post4_23|} OutVars{main_~x~0=v_main_~x~0_57, main_#t~post4=|v_main_#t~post4_22|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {917#(and (<= (div (+ 65520 (* (- 1) main_~x~0)) (- 4294967296)) 0) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2022-04-28 02:59:24,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {917#(and (<= (div (+ 65520 (* (- 1) main_~x~0)) (- 4294967296)) 0) (< 0 (+ (div main_~x~0 4294967296) 1)))} [57] L15-2_primed-->L16-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {917#(and (<= (div (+ 65520 (* (- 1) main_~x~0)) (- 4294967296)) 0) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2022-04-28 02:59:24,746 INFO L290 TraceCheckUtils]: 8: Hoare triple {917#(and (<= (div (+ 65520 (* (- 1) main_~x~0)) (- 4294967296)) 0) (< 0 (+ (div main_~x~0 4294967296) 1)))} [58] L16-2-->L15-2_primed: Formula: (let ((.cse4 (mod v_main_~x~0_60 4294967296))) (let ((.cse3 (= v_main_~x~0_60 v_main_~x~0_59)) (.cse2 (< .cse4 268435455)) (.cse1 (<= 65520 .cse4))) (or (and (forall ((v_it_7 Int)) (or (let ((.cse0 (mod (+ v_main_~x~0_60 (* v_it_7 2)) 4294967296))) (and (<= 65520 .cse0) (< .cse0 268435455))) (not (<= (+ v_it_7 1) (div (+ v_main_~x~0_60 (* (- 1) v_main_~x~0_59)) (- 2)))) (not (<= 1 v_it_7)))) .cse1 .cse2 (< 0 (div (+ v_main_~x~0_60 (* (- 1) v_main_~x~0_59)) (- 2))) (= (mod (+ v_main_~x~0_60 v_main_~x~0_59) 2) 0)) .cse3 (and .cse3 (or (not .cse2) (not .cse1)))))) InVars {main_~x~0=v_main_~x~0_60} OutVars{main_~x~0=v_main_~x~0_59} AuxVars[] AssignedVars[main_~x~0] {918#(or (<= main_~x~0 (* (div main_~x~0 2) 2)) (<= main_~x~0 (+ 65520 (* 4294967296 (div main_~x~0 4294967296)))))} is VALID [2022-04-28 02:59:24,747 INFO L290 TraceCheckUtils]: 9: Hoare triple {918#(or (<= main_~x~0 (* (div main_~x~0 2) 2)) (<= main_~x~0 (+ 65520 (* 4294967296 (div main_~x~0 4294967296)))))} [55] L15-2_primed-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {919#(<= main_~x~0 (* (div main_~x~0 2) 2))} is VALID [2022-04-28 02:59:24,748 INFO L272 TraceCheckUtils]: 10: Hoare triple {919#(<= main_~x~0 (* (div main_~x~0 2) 2))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {920#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 02:59:24,748 INFO L290 TraceCheckUtils]: 11: Hoare triple {920#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {921#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 02:59:24,748 INFO L290 TraceCheckUtils]: 12: Hoare triple {921#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {912#false} is VALID [2022-04-28 02:59:24,748 INFO L290 TraceCheckUtils]: 13: Hoare triple {912#false} assume !false; {912#false} is VALID [2022-04-28 02:59:24,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:59:24,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:59:24,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385123311] [2022-04-28 02:59:24,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385123311] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:59:24,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925098214] [2022-04-28 02:59:24,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:59:24,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:59:24,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:59:24,764 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 02:59:24,764 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 02:59:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:24,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 02:59:24,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:59:24,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:09:29,456 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((aux_div_aux_mod_v_main_~x~0_68_31_111 Int) (aux_div_v_main_~x~0_68_31 Int)) (and (<= aux_div_aux_mod_v_main_~x~0_68_31_111 0) (exists ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145 Int) (aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 Int) (aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_111_142 Int)) (let ((.cse7 (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78 4294967296)) (.cse5 (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 2))) (let ((.cse3 (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_111_142 4294967296)) (.cse1 (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_111_142 4294967294)) (.cse2 (* 2 c_main_~x~0)) (.cse0 (+ .cse7 .cse5 (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145 4294967296))) (.cse4 (+ .cse7 .cse5))) (and (< .cse0 (+ .cse1 .cse2 2)) (<= (+ (* aux_div_v_main_~x~0_68_31 4294967296) c_main_~x~0 .cse3) .cse0) (<= .cse0 (+ 65520 c_main_~x~0 (* aux_div_aux_mod_v_main_~x~0_68_31_111 4294967296) .cse3)) (< 0 aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_111_142) (< .cse4 (+ 4294967296 c_main_~x~0)) (<= c_main_~x~0 .cse5) (forall ((v_it_7 Int)) (or (let ((.cse6 (mod (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 2) (* v_it_7 2) (* 4294967295 c_main_~x~0)) 4294967296))) (and (< .cse6 268435455) (<= 65520 .cse6))) (not (<= (+ v_it_7 aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78 2147483648) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145 2147483648) 1) (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_111_142 2147483648) c_main_~x~0))) (not (<= 1 v_it_7)))) (<= (+ .cse1 .cse2) .cse0) (<= (+ 65520 c_main_~x~0) .cse4) (< .cse5 (+ 268435455 c_main_~x~0)))))) (< 0 (+ aux_div_v_main_~x~0_68_31 1)))) (not (< (mod c_main_~x~0 4294967296) 268435455))) is different from false [2022-04-28 03:12:09,693 INFO L272 TraceCheckUtils]: 0: Hoare triple {911#true} call ULTIMATE.init(); {911#true} is VALID [2022-04-28 03:12:09,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {911#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {911#true} is VALID [2022-04-28 03:12:09,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {911#true} assume true; {911#true} is VALID [2022-04-28 03:12:09,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {911#true} {911#true} #40#return; {911#true} is VALID [2022-04-28 03:12:09,694 INFO L272 TraceCheckUtils]: 4: Hoare triple {911#true} call #t~ret5 := main(); {911#true} is VALID [2022-04-28 03:12:09,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {911#true} ~x~0 := 0; {916#(= main_~x~0 0)} is VALID [2022-04-28 03:12:09,697 INFO L290 TraceCheckUtils]: 6: Hoare triple {916#(= main_~x~0 0)} [56] L16-2-->L15-2_primed: Formula: (let ((.cse0 (= v_main_~x~0_58 v_main_~x~0_57)) (.cse1 (= |v_main_#t~post4_23| |v_main_#t~post4_22|)) (.cse2 (mod v_main_~x~0_58 4294967296))) (or (and .cse0 .cse1 (<= 65520 .cse2)) (and .cse0 .cse1) (and (< v_main_~x~0_58 v_main_~x~0_57) (<= (div (+ 65520 (* (- 1) v_main_~x~0_57)) (- 4294967296)) (+ (div (+ v_main_~x~0_58 (- 4294967295)) 4294967296) 1)) (< .cse2 65520)))) InVars {main_~x~0=v_main_~x~0_58, main_#t~post4=|v_main_#t~post4_23|} OutVars{main_~x~0=v_main_~x~0_57, main_#t~post4=|v_main_#t~post4_22|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {917#(and (<= (div (+ 65520 (* (- 1) main_~x~0)) (- 4294967296)) 0) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2022-04-28 03:12:09,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {917#(and (<= (div (+ 65520 (* (- 1) main_~x~0)) (- 4294967296)) 0) (< 0 (+ (div main_~x~0 4294967296) 1)))} [57] L15-2_primed-->L16-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {917#(and (<= (div (+ 65520 (* (- 1) main_~x~0)) (- 4294967296)) 0) (< 0 (+ (div main_~x~0 4294967296) 1)))} is VALID [2022-04-28 03:12:09,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {917#(and (<= (div (+ 65520 (* (- 1) main_~x~0)) (- 4294967296)) 0) (< 0 (+ (div main_~x~0 4294967296) 1)))} [58] L16-2-->L15-2_primed: Formula: (let ((.cse4 (mod v_main_~x~0_60 4294967296))) (let ((.cse3 (= v_main_~x~0_60 v_main_~x~0_59)) (.cse2 (< .cse4 268435455)) (.cse1 (<= 65520 .cse4))) (or (and (forall ((v_it_7 Int)) (or (let ((.cse0 (mod (+ v_main_~x~0_60 (* v_it_7 2)) 4294967296))) (and (<= 65520 .cse0) (< .cse0 268435455))) (not (<= (+ v_it_7 1) (div (+ v_main_~x~0_60 (* (- 1) v_main_~x~0_59)) (- 2)))) (not (<= 1 v_it_7)))) .cse1 .cse2 (< 0 (div (+ v_main_~x~0_60 (* (- 1) v_main_~x~0_59)) (- 2))) (= (mod (+ v_main_~x~0_60 v_main_~x~0_59) 2) 0)) .cse3 (and .cse3 (or (not .cse2) (not .cse1)))))) InVars {main_~x~0=v_main_~x~0_60} OutVars{main_~x~0=v_main_~x~0_59} AuxVars[] AssignedVars[main_~x~0] {950#(exists ((aux_div_aux_mod_v_main_~x~0_68_31_111 Int) (aux_div_v_main_~x~0_68_31 Int)) (and (or (exists ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145 Int) (aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 Int) (aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_111_142 Int)) (and (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78 2147483648) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145 2147483648) 1) (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_111_142 2147483648) main_~x~0))) (and (< (mod (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 2) (* v_it_7 2) (* main_~x~0 4294967295)) 4294967296) 268435455) (<= 65520 (mod (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 2) (* v_it_7 2) (* main_~x~0 4294967295)) 4294967296))) (not (<= 1 v_it_7)))) (< (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 2) (+ main_~x~0 268435455)) (<= main_~x~0 (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 2)) (< 0 aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_111_142) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 2)) (+ main_~x~0 4294967296)) (<= (+ (* main_~x~0 2) (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_111_142 4294967294)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 2) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145 4294967296))) (<= (+ main_~x~0 (* aux_div_v_main_~x~0_68_31 4294967296) (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_111_142 4294967296)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 2) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145 4294967296))) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 2) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145 4294967296)) (+ (* main_~x~0 2) (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_111_142 4294967294) 2)) (<= (+ main_~x~0 65520) (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 2))) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 2) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145 4294967296)) (+ main_~x~0 65520 (* aux_div_aux_mod_v_main_~x~0_68_31_111 4294967296) (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_111_142 4294967296))))) (and (<= (* aux_div_v_main_~x~0_68_31 4294967296) main_~x~0) (<= main_~x~0 (+ 65520 (* aux_div_aux_mod_v_main_~x~0_68_31_111 4294967296))))) (<= aux_div_aux_mod_v_main_~x~0_68_31_111 0) (< 0 (+ aux_div_v_main_~x~0_68_31 1))))} is VALID [2022-04-28 03:12:11,743 WARN L290 TraceCheckUtils]: 9: Hoare triple {950#(exists ((aux_div_aux_mod_v_main_~x~0_68_31_111 Int) (aux_div_v_main_~x~0_68_31 Int)) (and (or (exists ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145 Int) (aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 Int) (aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_111_142 Int)) (and (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78 2147483648) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145 2147483648) 1) (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_111_142 2147483648) main_~x~0))) (and (< (mod (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 2) (* v_it_7 2) (* main_~x~0 4294967295)) 4294967296) 268435455) (<= 65520 (mod (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 2) (* v_it_7 2) (* main_~x~0 4294967295)) 4294967296))) (not (<= 1 v_it_7)))) (< (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 2) (+ main_~x~0 268435455)) (<= main_~x~0 (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 2)) (< 0 aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_111_142) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 2)) (+ main_~x~0 4294967296)) (<= (+ (* main_~x~0 2) (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_111_142 4294967294)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 2) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145 4294967296))) (<= (+ main_~x~0 (* aux_div_v_main_~x~0_68_31 4294967296) (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_111_142 4294967296)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 2) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145 4294967296))) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 2) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145 4294967296)) (+ (* main_~x~0 2) (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_111_142 4294967294) 2)) (<= (+ main_~x~0 65520) (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 2))) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 2) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145 4294967296)) (+ main_~x~0 65520 (* aux_div_aux_mod_v_main_~x~0_68_31_111 4294967296) (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_111_142 4294967296))))) (and (<= (* aux_div_v_main_~x~0_68_31 4294967296) main_~x~0) (<= main_~x~0 (+ 65520 (* aux_div_aux_mod_v_main_~x~0_68_31_111 4294967296))))) (<= aux_div_aux_mod_v_main_~x~0_68_31_111 0) (< 0 (+ aux_div_v_main_~x~0_68_31 1))))} [55] L15-2_primed-->L15-2: Formula: (not (< (mod v_main_~x~0_8 4294967296) 268435455)) InVars {main_~x~0=v_main_~x~0_8} OutVars{main_~x~0=v_main_~x~0_8} AuxVars[] AssignedVars[] {954#(and (not (< (mod main_~x~0 4294967296) 268435455)) (exists ((aux_div_aux_mod_v_main_~x~0_68_31_111 Int) (aux_div_v_main_~x~0_68_31 Int)) (and (exists ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145 Int) (aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 Int) (aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_111_142 Int)) (and (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78 2147483648) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145 2147483648) 1) (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_111_142 2147483648) main_~x~0))) (and (< (mod (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 2) (* v_it_7 2) (* main_~x~0 4294967295)) 4294967296) 268435455) (<= 65520 (mod (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 2) (* v_it_7 2) (* main_~x~0 4294967295)) 4294967296))) (not (<= 1 v_it_7)))) (< (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 2) (+ main_~x~0 268435455)) (<= main_~x~0 (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 2)) (< 0 aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_111_142) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 2)) (+ main_~x~0 4294967296)) (<= (+ (* main_~x~0 2) (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_111_142 4294967294)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 2) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145 4294967296))) (<= (+ main_~x~0 (* aux_div_v_main_~x~0_68_31 4294967296) (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_111_142 4294967296)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 2) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145 4294967296))) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 2) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145 4294967296)) (+ (* main_~x~0 2) (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_111_142 4294967294) 2)) (<= (+ main_~x~0 65520) (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 2))) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 2) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145 4294967296)) (+ main_~x~0 65520 (* aux_div_aux_mod_v_main_~x~0_68_31_111 4294967296) (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_111_142 4294967296))))) (<= aux_div_aux_mod_v_main_~x~0_68_31_111 0) (< 0 (+ aux_div_v_main_~x~0_68_31 1)))))} is UNKNOWN [2022-04-28 03:12:11,777 INFO L272 TraceCheckUtils]: 10: Hoare triple {954#(and (not (< (mod main_~x~0 4294967296) 268435455)) (exists ((aux_div_aux_mod_v_main_~x~0_68_31_111 Int) (aux_div_v_main_~x~0_68_31 Int)) (and (exists ((aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145 Int) (aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 Int) (aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78 Int) (aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_111_142 Int)) (and (forall ((v_it_7 Int)) (or (not (<= (+ v_it_7 aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78 2147483648) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145 2147483648) 1) (+ (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_111_142 2147483648) main_~x~0))) (and (< (mod (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 2) (* v_it_7 2) (* main_~x~0 4294967295)) 4294967296) 268435455) (<= 65520 (mod (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 2) (* v_it_7 2) (* main_~x~0 4294967295)) 4294967296))) (not (<= 1 v_it_7)))) (< (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 2) (+ main_~x~0 268435455)) (<= main_~x~0 (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 2)) (< 0 aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_111_142) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 2)) (+ main_~x~0 4294967296)) (<= (+ (* main_~x~0 2) (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_111_142 4294967294)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 2) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145 4294967296))) (<= (+ main_~x~0 (* aux_div_v_main_~x~0_68_31 4294967296) (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_111_142 4294967296)) (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 2) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145 4294967296))) (< (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 2) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145 4294967296)) (+ (* main_~x~0 2) (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_111_142 4294967294) 2)) (<= (+ main_~x~0 65520) (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 2))) (<= (+ (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145_78_94 2) (* aux_div_aux_mod_aux_mod_aux_mod_v_main_~x~0_68_31_111_142_145 4294967296)) (+ main_~x~0 65520 (* aux_div_aux_mod_v_main_~x~0_68_31_111 4294967296) (* aux_div_aux_mod_aux_mod_v_main_~x~0_68_31_111_142 4294967296))))) (<= aux_div_aux_mod_v_main_~x~0_68_31_111 0) (< 0 (+ aux_div_v_main_~x~0_68_31 1)))))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {958#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 03:12:11,778 INFO L290 TraceCheckUtils]: 11: Hoare triple {958#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {962#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 03:12:11,779 INFO L290 TraceCheckUtils]: 12: Hoare triple {962#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {912#false} is VALID [2022-04-28 03:12:11,779 INFO L290 TraceCheckUtils]: 13: Hoare triple {912#false} assume !false; {912#false} is VALID [2022-04-28 03:12:11,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:12:11,779 INFO L328 TraceCheckSpWp]: Computing backward predicates...