/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/nla-digbench-scaling/hard-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 09:17:35,884 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 09:17:35,886 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 09:17:35,919 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 09:17:35,919 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 09:17:35,920 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 09:17:35,922 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 09:17:35,924 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 09:17:35,925 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 09:17:35,928 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 09:17:35,929 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 09:17:35,930 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 09:17:35,930 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 09:17:35,932 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 09:17:35,932 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 09:17:35,934 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 09:17:35,935 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 09:17:35,935 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 09:17:35,937 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 09:17:35,940 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 09:17:35,942 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 09:17:35,942 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 09:17:35,943 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 09:17:35,943 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 09:17:35,944 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 09:17:35,949 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 09:17:35,949 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 09:17:35,949 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 09:17:35,949 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 09:17:35,950 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 09:17:35,951 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 09:17:35,951 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 09:17:35,952 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 09:17:35,952 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 09:17:35,953 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 09:17:35,953 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 09:17:35,953 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 09:17:35,954 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 09:17:35,954 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 09:17:35,954 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 09:17:35,955 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 09:17:35,956 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 09:17:35,956 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 09:17:35,964 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 09:17:35,964 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 09:17:35,965 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 09:17:35,965 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 09:17:35,965 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 09:17:35,965 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 09:17:35,965 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 09:17:35,966 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 09:17:35,966 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 09:17:35,966 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 09:17:35,966 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 09:17:35,966 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 09:17:35,967 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 09:17:35,967 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 09:17:35,967 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 09:17:35,967 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 09:17:35,967 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 09:17:35,967 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 09:17:35,967 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 09:17:35,967 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 09:17:35,968 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 09:17:35,968 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 09:17:35,968 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 09:17:35,968 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 09:17:35,968 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 09:17:35,968 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 09:17:36,140 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 09:17:36,156 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 09:17:36,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 09:17:36,158 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 09:17:36,158 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 09:17:36,159 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard-ll_unwindbound20.c [2022-04-15 09:17:36,224 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/700c7fe34/2a1bf8e3e9e64caa92ac9937bc58e605/FLAGd45492f47 [2022-04-15 09:17:36,563 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 09:17:36,564 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-ll_unwindbound20.c [2022-04-15 09:17:36,571 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/700c7fe34/2a1bf8e3e9e64caa92ac9937bc58e605/FLAGd45492f47 [2022-04-15 09:17:36,970 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/700c7fe34/2a1bf8e3e9e64caa92ac9937bc58e605 [2022-04-15 09:17:36,972 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 09:17:36,973 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 09:17:36,984 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 09:17:36,984 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 09:17:36,987 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 09:17:36,987 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 09:17:36" (1/1) ... [2022-04-15 09:17:36,988 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7945355d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:17:36, skipping insertion in model container [2022-04-15 09:17:36,988 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 09:17:36" (1/1) ... [2022-04-15 09:17:36,992 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 09:17:37,003 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 09:17:37,130 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-ll_unwindbound20.c[538,551] [2022-04-15 09:17:37,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 09:17:37,146 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 09:17:37,153 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-ll_unwindbound20.c[538,551] [2022-04-15 09:17:37,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 09:17:37,166 INFO L208 MainTranslator]: Completed translation [2022-04-15 09:17:37,166 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:17:37 WrapperNode [2022-04-15 09:17:37,166 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 09:17:37,167 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 09:17:37,167 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 09:17:37,167 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 09:17:37,173 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:17:37" (1/1) ... [2022-04-15 09:17:37,173 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:17:37" (1/1) ... [2022-04-15 09:17:37,177 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:17:37" (1/1) ... [2022-04-15 09:17:37,177 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:17:37" (1/1) ... [2022-04-15 09:17:37,181 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:17:37" (1/1) ... [2022-04-15 09:17:37,184 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:17:37" (1/1) ... [2022-04-15 09:17:37,184 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:17:37" (1/1) ... [2022-04-15 09:17:37,185 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 09:17:37,186 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 09:17:37,186 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 09:17:37,186 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 09:17:37,186 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:17:37" (1/1) ... [2022-04-15 09:17:37,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 09:17:37,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:17:37,215 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 09:17:37,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 09:17:37,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 09:17:37,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 09:17:37,257 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 09:17:37,257 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 09:17:37,257 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 09:17:37,257 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 09:17:37,258 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 09:17:37,258 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 09:17:37,258 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 09:17:37,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 09:17:37,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 09:17:37,259 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 09:17:37,259 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 09:17:37,260 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 09:17:37,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 09:17:37,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 09:17:37,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 09:17:37,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 09:17:37,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 09:17:37,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 09:17:37,308 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 09:17:37,309 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 09:17:37,419 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 09:17:37,424 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 09:17:37,424 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 09:17:37,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 09:17:37 BoogieIcfgContainer [2022-04-15 09:17:37,425 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 09:17:37,426 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 09:17:37,426 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 09:17:37,433 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 09:17:37,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 09:17:36" (1/3) ... [2022-04-15 09:17:37,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41f25dcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 09:17:37, skipping insertion in model container [2022-04-15 09:17:37,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:17:37" (2/3) ... [2022-04-15 09:17:37,434 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41f25dcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 09:17:37, skipping insertion in model container [2022-04-15 09:17:37,434 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 09:17:37" (3/3) ... [2022-04-15 09:17:37,434 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-ll_unwindbound20.c [2022-04-15 09:17:37,437 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 09:17:37,437 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 09:17:37,461 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 09:17:37,465 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 09:17:37,465 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 09:17:37,476 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 09:17:37,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 09:17:37,481 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:17:37,481 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:17:37,482 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:17:37,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:17:37,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1191571617, now seen corresponding path program 1 times [2022-04-15 09:17:37,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:17:37,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [388455030] [2022-04-15 09:17:37,496 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:17:37,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1191571617, now seen corresponding path program 2 times [2022-04-15 09:17:37,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:17:37,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337408250] [2022-04-15 09:17:37,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:17:37,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:17:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:17:37,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 09:17:37,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:17:37,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {40#true} is VALID [2022-04-15 09:17:37,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-15 09:17:37,626 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} #96#return; {40#true} is VALID [2022-04-15 09:17:37,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 09:17:37,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:17:37,633 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-15 09:17:37,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-15 09:17:37,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-15 09:17:37,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {40#true} #80#return; {41#false} is VALID [2022-04-15 09:17:37,634 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 09:17:37,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {40#true} is VALID [2022-04-15 09:17:37,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-15 09:17:37,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #96#return; {40#true} is VALID [2022-04-15 09:17:37,635 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret8 := main(); {40#true} is VALID [2022-04-15 09:17:37,635 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {40#true} is VALID [2022-04-15 09:17:37,635 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {40#true} is VALID [2022-04-15 09:17:37,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-15 09:17:37,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-15 09:17:37,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-15 09:17:37,636 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} #80#return; {41#false} is VALID [2022-04-15 09:17:37,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {41#false} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {41#false} is VALID [2022-04-15 09:17:37,637 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-15 09:17:37,637 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-15 09:17:37,637 INFO L272 TraceCheckUtils]: 14: Hoare triple {41#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {41#false} is VALID [2022-04-15 09:17:37,637 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-15 09:17:37,637 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-15 09:17:37,638 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-15 09:17:37,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 09:17:37,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:17:37,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337408250] [2022-04-15 09:17:37,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337408250] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:17:37,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:17:37,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 09:17:37,641 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:17:37,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [388455030] [2022-04-15 09:17:37,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [388455030] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:17:37,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:17:37,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 09:17:37,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710331927] [2022-04-15 09:17:37,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:17:37,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-15 09:17:37,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:17:37,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 09:17:37,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:17:37,665 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 09:17:37,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:17:37,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 09:17:37,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 09:17:37,680 INFO L87 Difference]: Start difference. First operand has 37 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 09:17:37,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:17:37,806 INFO L93 Difference]: Finished difference Result 66 states and 101 transitions. [2022-04-15 09:17:37,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 09:17:37,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-15 09:17:37,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:17:37,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 09:17:37,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-15 09:17:37,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 09:17:37,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-15 09:17:37,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2022-04-15 09:17:37,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:17:37,915 INFO L225 Difference]: With dead ends: 66 [2022-04-15 09:17:37,915 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 09:17:37,917 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 09:17:37,919 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 09:17:37,920 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 49 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 09:17:37,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 09:17:37,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-04-15 09:17:37,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:17:37,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 09:17:37,941 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 09:17:37,942 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 09:17:37,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:17:37,945 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-15 09:17:37,945 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-15 09:17:37,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:17:37,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:17:37,946 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 33 states. [2022-04-15 09:17:37,947 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 33 states. [2022-04-15 09:17:37,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:17:37,950 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-15 09:17:37,950 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-15 09:17:37,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:17:37,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:17:37,951 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:17:37,951 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:17:37,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 09:17:37,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-15 09:17:37,954 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 18 [2022-04-15 09:17:37,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:17:37,954 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-15 09:17:37,955 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 09:17:37,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 42 transitions. [2022-04-15 09:17:38,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:17:38,000 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-15 09:17:38,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 09:17:38,001 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:17:38,001 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:17:38,001 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 09:17:38,001 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:17:38,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:17:38,003 INFO L85 PathProgramCache]: Analyzing trace with hash 336486197, now seen corresponding path program 1 times [2022-04-15 09:17:38,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:17:38,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [630563564] [2022-04-15 09:17:38,007 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:17:38,008 INFO L85 PathProgramCache]: Analyzing trace with hash 336486197, now seen corresponding path program 2 times [2022-04-15 09:17:38,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:17:38,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193394963] [2022-04-15 09:17:38,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:17:38,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:17:38,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:17:38,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 09:17:38,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:17:38,113 INFO L290 TraceCheckUtils]: 0: Hoare triple {326#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {314#true} is VALID [2022-04-15 09:17:38,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {314#true} assume true; {314#true} is VALID [2022-04-15 09:17:38,114 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {314#true} {314#true} #96#return; {314#true} is VALID [2022-04-15 09:17:38,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 09:17:38,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:17:38,122 INFO L290 TraceCheckUtils]: 0: Hoare triple {314#true} ~cond := #in~cond; {314#true} is VALID [2022-04-15 09:17:38,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {314#true} assume !(0 == ~cond); {314#true} is VALID [2022-04-15 09:17:38,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {314#true} assume true; {314#true} is VALID [2022-04-15 09:17:38,123 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {314#true} {314#true} #80#return; {314#true} is VALID [2022-04-15 09:17:38,124 INFO L272 TraceCheckUtils]: 0: Hoare triple {314#true} call ULTIMATE.init(); {326#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 09:17:38,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {326#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {314#true} is VALID [2022-04-15 09:17:38,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {314#true} assume true; {314#true} is VALID [2022-04-15 09:17:38,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {314#true} {314#true} #96#return; {314#true} is VALID [2022-04-15 09:17:38,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {314#true} call #t~ret8 := main(); {314#true} is VALID [2022-04-15 09:17:38,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {314#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {314#true} is VALID [2022-04-15 09:17:38,125 INFO L272 TraceCheckUtils]: 6: Hoare triple {314#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {314#true} is VALID [2022-04-15 09:17:38,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {314#true} ~cond := #in~cond; {314#true} is VALID [2022-04-15 09:17:38,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {314#true} assume !(0 == ~cond); {314#true} is VALID [2022-04-15 09:17:38,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {314#true} assume true; {314#true} is VALID [2022-04-15 09:17:38,126 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {314#true} {314#true} #80#return; {314#true} is VALID [2022-04-15 09:17:38,126 INFO L290 TraceCheckUtils]: 11: Hoare triple {314#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {323#(= main_~q~0 0)} is VALID [2022-04-15 09:17:38,127 INFO L290 TraceCheckUtils]: 12: Hoare triple {323#(= main_~q~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {323#(= main_~q~0 0)} is VALID [2022-04-15 09:17:38,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {323#(= main_~q~0 0)} assume !!(#t~post6 < 20);havoc #t~post6; {323#(= main_~q~0 0)} is VALID [2022-04-15 09:17:38,128 INFO L272 TraceCheckUtils]: 14: Hoare triple {323#(= main_~q~0 0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {324#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:17:38,128 INFO L290 TraceCheckUtils]: 15: Hoare triple {324#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {325#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 09:17:38,129 INFO L290 TraceCheckUtils]: 16: Hoare triple {325#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {315#false} is VALID [2022-04-15 09:17:38,129 INFO L290 TraceCheckUtils]: 17: Hoare triple {315#false} assume !false; {315#false} is VALID [2022-04-15 09:17:38,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 09:17:38,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:17:38,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193394963] [2022-04-15 09:17:38,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193394963] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:17:38,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:17:38,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 09:17:38,130 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:17:38,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [630563564] [2022-04-15 09:17:38,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [630563564] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:17:38,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:17:38,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 09:17:38,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45018547] [2022-04-15 09:17:38,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:17:38,132 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-15 09:17:38,132 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:17:38,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 09:17:38,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:17:38,145 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 09:17:38,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:17:38,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 09:17:38,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 09:17:38,146 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 09:17:38,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:17:38,459 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-04-15 09:17:38,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 09:17:38,460 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-15 09:17:38,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:17:38,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 09:17:38,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-15 09:17:38,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 09:17:38,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-15 09:17:38,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2022-04-15 09:17:38,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:17:38,532 INFO L225 Difference]: With dead ends: 47 [2022-04-15 09:17:38,533 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 09:17:38,533 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-15 09:17:38,539 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 28 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 09:17:38,540 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 90 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 09:17:38,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 09:17:38,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2022-04-15 09:17:38,545 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:17:38,545 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 09:17:38,546 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 09:17:38,546 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 09:17:38,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:17:38,549 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-15 09:17:38,549 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-04-15 09:17:38,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:17:38,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:17:38,550 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-15 09:17:38,551 INFO L87 Difference]: Start difference. First operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-15 09:17:38,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:17:38,553 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-15 09:17:38,553 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-04-15 09:17:38,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:17:38,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:17:38,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:17:38,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:17:38,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 09:17:38,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-04-15 09:17:38,556 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 18 [2022-04-15 09:17:38,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:17:38,556 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-04-15 09:17:38,557 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 09:17:38,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 45 transitions. [2022-04-15 09:17:38,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:17:38,594 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-15 09:17:38,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 09:17:38,596 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:17:38,596 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:17:38,596 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 09:17:38,596 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:17:38,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:17:38,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1819267188, now seen corresponding path program 1 times [2022-04-15 09:17:38,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:17:38,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [560676075] [2022-04-15 09:17:38,597 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:17:38,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1819267188, now seen corresponding path program 2 times [2022-04-15 09:17:38,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:17:38,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047691379] [2022-04-15 09:17:38,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:17:38,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:17:38,617 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:17:38,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [260894152] [2022-04-15 09:17:38,617 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:17:38,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:17:38,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:17:38,619 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:17:38,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 09:17:38,661 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 09:17:38,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:17:38,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 09:17:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:17:38,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:17:38,785 INFO L272 TraceCheckUtils]: 0: Hoare triple {593#true} call ULTIMATE.init(); {593#true} is VALID [2022-04-15 09:17:38,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {593#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {601#(<= ~counter~0 0)} is VALID [2022-04-15 09:17:38,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {601#(<= ~counter~0 0)} assume true; {601#(<= ~counter~0 0)} is VALID [2022-04-15 09:17:38,787 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {601#(<= ~counter~0 0)} {593#true} #96#return; {601#(<= ~counter~0 0)} is VALID [2022-04-15 09:17:38,788 INFO L272 TraceCheckUtils]: 4: Hoare triple {601#(<= ~counter~0 0)} call #t~ret8 := main(); {601#(<= ~counter~0 0)} is VALID [2022-04-15 09:17:38,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {601#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {601#(<= ~counter~0 0)} is VALID [2022-04-15 09:17:38,789 INFO L272 TraceCheckUtils]: 6: Hoare triple {601#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {601#(<= ~counter~0 0)} is VALID [2022-04-15 09:17:38,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {601#(<= ~counter~0 0)} ~cond := #in~cond; {601#(<= ~counter~0 0)} is VALID [2022-04-15 09:17:38,790 INFO L290 TraceCheckUtils]: 8: Hoare triple {601#(<= ~counter~0 0)} assume !(0 == ~cond); {601#(<= ~counter~0 0)} is VALID [2022-04-15 09:17:38,790 INFO L290 TraceCheckUtils]: 9: Hoare triple {601#(<= ~counter~0 0)} assume true; {601#(<= ~counter~0 0)} is VALID [2022-04-15 09:17:38,791 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {601#(<= ~counter~0 0)} {601#(<= ~counter~0 0)} #80#return; {601#(<= ~counter~0 0)} is VALID [2022-04-15 09:17:38,791 INFO L290 TraceCheckUtils]: 11: Hoare triple {601#(<= ~counter~0 0)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {601#(<= ~counter~0 0)} is VALID [2022-04-15 09:17:38,792 INFO L290 TraceCheckUtils]: 12: Hoare triple {601#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {635#(<= |main_#t~post6| 0)} is VALID [2022-04-15 09:17:38,792 INFO L290 TraceCheckUtils]: 13: Hoare triple {635#(<= |main_#t~post6| 0)} assume !(#t~post6 < 20);havoc #t~post6; {594#false} is VALID [2022-04-15 09:17:38,793 INFO L290 TraceCheckUtils]: 14: Hoare triple {594#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {594#false} is VALID [2022-04-15 09:17:38,793 INFO L290 TraceCheckUtils]: 15: Hoare triple {594#false} assume !(#t~post7 < 20);havoc #t~post7; {594#false} is VALID [2022-04-15 09:17:38,793 INFO L272 TraceCheckUtils]: 16: Hoare triple {594#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {594#false} is VALID [2022-04-15 09:17:38,793 INFO L290 TraceCheckUtils]: 17: Hoare triple {594#false} ~cond := #in~cond; {594#false} is VALID [2022-04-15 09:17:38,793 INFO L290 TraceCheckUtils]: 18: Hoare triple {594#false} assume 0 == ~cond; {594#false} is VALID [2022-04-15 09:17:38,794 INFO L290 TraceCheckUtils]: 19: Hoare triple {594#false} assume !false; {594#false} is VALID [2022-04-15 09:17:38,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 09:17:38,794 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 09:17:38,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:17:38,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047691379] [2022-04-15 09:17:38,795 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:17:38,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260894152] [2022-04-15 09:17:38,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260894152] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:17:38,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:17:38,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 09:17:38,796 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:17:38,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [560676075] [2022-04-15 09:17:38,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [560676075] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:17:38,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:17:38,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 09:17:38,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622329165] [2022-04-15 09:17:38,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:17:38,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-15 09:17:38,797 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:17:38,798 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 09:17:38,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:17:38,828 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 09:17:38,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:17:38,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 09:17:38,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 09:17:38,829 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 09:17:38,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:17:38,893 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2022-04-15 09:17:38,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 09:17:38,893 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-15 09:17:38,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:17:38,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 09:17:38,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-15 09:17:38,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 09:17:38,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-15 09:17:38,896 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 64 transitions. [2022-04-15 09:17:38,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:17:38,931 INFO L225 Difference]: With dead ends: 52 [2022-04-15 09:17:38,931 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 09:17:38,932 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 09:17:38,932 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 09:17:38,933 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 09:17:38,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 09:17:38,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-15 09:17:38,952 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:17:38,952 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 09:17:38,953 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 09:17:38,953 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 09:17:38,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:17:38,955 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-15 09:17:38,955 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-15 09:17:38,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:17:38,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:17:38,956 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 38 states. [2022-04-15 09:17:38,956 INFO L87 Difference]: Start difference. First operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 38 states. [2022-04-15 09:17:38,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:17:38,957 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-15 09:17:38,958 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-15 09:17:38,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:17:38,958 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:17:38,958 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:17:38,958 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:17:38,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 09:17:38,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2022-04-15 09:17:38,960 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 20 [2022-04-15 09:17:38,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:17:38,960 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2022-04-15 09:17:38,960 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 09:17:38,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 47 transitions. [2022-04-15 09:17:38,992 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:17:38,993 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-15 09:17:38,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 09:17:38,993 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:17:38,994 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:17:39,024 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 09:17:39,210 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:17:39,210 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:17:39,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:17:39,211 INFO L85 PathProgramCache]: Analyzing trace with hash -784889968, now seen corresponding path program 1 times [2022-04-15 09:17:39,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:17:39,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1924397208] [2022-04-15 09:17:39,212 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:17:39,212 INFO L85 PathProgramCache]: Analyzing trace with hash -784889968, now seen corresponding path program 2 times [2022-04-15 09:17:39,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:17:39,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607307532] [2022-04-15 09:17:39,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:17:39,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:17:39,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:17:39,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 09:17:39,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:17:39,302 INFO L290 TraceCheckUtils]: 0: Hoare triple {928#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {912#true} is VALID [2022-04-15 09:17:39,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-15 09:17:39,302 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {912#true} {912#true} #96#return; {912#true} is VALID [2022-04-15 09:17:39,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 09:17:39,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:17:39,319 INFO L290 TraceCheckUtils]: 0: Hoare triple {912#true} ~cond := #in~cond; {912#true} is VALID [2022-04-15 09:17:39,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#true} assume !(0 == ~cond); {912#true} is VALID [2022-04-15 09:17:39,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-15 09:17:39,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {912#true} {912#true} #80#return; {912#true} is VALID [2022-04-15 09:17:39,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-15 09:17:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:17:39,326 INFO L290 TraceCheckUtils]: 0: Hoare triple {912#true} ~cond := #in~cond; {912#true} is VALID [2022-04-15 09:17:39,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#true} assume !(0 == ~cond); {912#true} is VALID [2022-04-15 09:17:39,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-15 09:17:39,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {912#true} {921#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} #82#return; {921#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} is VALID [2022-04-15 09:17:39,327 INFO L272 TraceCheckUtils]: 0: Hoare triple {912#true} call ULTIMATE.init(); {928#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 09:17:39,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {928#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {912#true} is VALID [2022-04-15 09:17:39,328 INFO L290 TraceCheckUtils]: 2: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-15 09:17:39,328 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {912#true} {912#true} #96#return; {912#true} is VALID [2022-04-15 09:17:39,328 INFO L272 TraceCheckUtils]: 4: Hoare triple {912#true} call #t~ret8 := main(); {912#true} is VALID [2022-04-15 09:17:39,328 INFO L290 TraceCheckUtils]: 5: Hoare triple {912#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {912#true} is VALID [2022-04-15 09:17:39,328 INFO L272 TraceCheckUtils]: 6: Hoare triple {912#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {912#true} is VALID [2022-04-15 09:17:39,328 INFO L290 TraceCheckUtils]: 7: Hoare triple {912#true} ~cond := #in~cond; {912#true} is VALID [2022-04-15 09:17:39,329 INFO L290 TraceCheckUtils]: 8: Hoare triple {912#true} assume !(0 == ~cond); {912#true} is VALID [2022-04-15 09:17:39,329 INFO L290 TraceCheckUtils]: 9: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-15 09:17:39,329 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {912#true} {912#true} #80#return; {912#true} is VALID [2022-04-15 09:17:39,330 INFO L290 TraceCheckUtils]: 11: Hoare triple {912#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {921#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} is VALID [2022-04-15 09:17:39,330 INFO L290 TraceCheckUtils]: 12: Hoare triple {921#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {921#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} is VALID [2022-04-15 09:17:39,331 INFO L290 TraceCheckUtils]: 13: Hoare triple {921#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} assume !!(#t~post6 < 20);havoc #t~post6; {921#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} is VALID [2022-04-15 09:17:39,331 INFO L272 TraceCheckUtils]: 14: Hoare triple {921#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {912#true} is VALID [2022-04-15 09:17:39,331 INFO L290 TraceCheckUtils]: 15: Hoare triple {912#true} ~cond := #in~cond; {912#true} is VALID [2022-04-15 09:17:39,331 INFO L290 TraceCheckUtils]: 16: Hoare triple {912#true} assume !(0 == ~cond); {912#true} is VALID [2022-04-15 09:17:39,331 INFO L290 TraceCheckUtils]: 17: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-15 09:17:39,332 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {912#true} {921#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} #82#return; {921#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} is VALID [2022-04-15 09:17:39,332 INFO L272 TraceCheckUtils]: 19: Hoare triple {921#(= main_~A~0 (+ main_~r~0 (* (div main_~A~0 4294967296) 4294967296)))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {926#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:17:39,333 INFO L290 TraceCheckUtils]: 20: Hoare triple {926#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {927#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 09:17:39,333 INFO L290 TraceCheckUtils]: 21: Hoare triple {927#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {913#false} is VALID [2022-04-15 09:17:39,333 INFO L290 TraceCheckUtils]: 22: Hoare triple {913#false} assume !false; {913#false} is VALID [2022-04-15 09:17:39,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 09:17:39,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:17:39,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607307532] [2022-04-15 09:17:39,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607307532] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:17:39,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:17:39,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 09:17:39,334 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:17:39,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1924397208] [2022-04-15 09:17:39,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1924397208] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:17:39,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:17:39,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 09:17:39,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290549044] [2022-04-15 09:17:39,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:17:39,335 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-15 09:17:39,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:17:39,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 09:17:39,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:17:39,351 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 09:17:39,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:17:39,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 09:17:39,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 09:17:39,352 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 09:17:39,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:17:39,659 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-15 09:17:39,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 09:17:39,660 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-15 09:17:39,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:17:39,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 09:17:39,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-15 09:17:39,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 09:17:39,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-15 09:17:39,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2022-04-15 09:17:39,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:17:39,718 INFO L225 Difference]: With dead ends: 52 [2022-04-15 09:17:39,719 INFO L226 Difference]: Without dead ends: 50 [2022-04-15 09:17:39,719 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-15 09:17:39,724 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 23 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 09:17:39,725 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 83 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 09:17:39,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-15 09:17:39,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2022-04-15 09:17:39,742 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:17:39,742 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 09:17:39,742 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 09:17:39,743 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 09:17:39,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:17:39,751 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-15 09:17:39,751 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-15 09:17:39,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:17:39,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:17:39,755 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 50 states. [2022-04-15 09:17:39,755 INFO L87 Difference]: Start difference. First operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 50 states. [2022-04-15 09:17:39,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:17:39,757 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-15 09:17:39,757 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-15 09:17:39,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:17:39,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:17:39,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:17:39,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:17:39,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 09:17:39,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-04-15 09:17:39,759 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 23 [2022-04-15 09:17:39,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:17:39,759 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-04-15 09:17:39,760 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 09:17:39,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 50 transitions. [2022-04-15 09:17:39,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:17:39,796 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-04-15 09:17:39,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 09:17:39,796 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:17:39,796 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:17:39,796 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 09:17:39,797 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:17:39,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:17:39,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1024624683, now seen corresponding path program 1 times [2022-04-15 09:17:39,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:17:39,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1597099532] [2022-04-15 09:17:39,798 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:17:39,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1024624683, now seen corresponding path program 2 times [2022-04-15 09:17:39,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:17:39,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303623662] [2022-04-15 09:17:39,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:17:39,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:17:39,822 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:17:39,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [754804556] [2022-04-15 09:17:39,822 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:17:39,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:17:39,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:17:39,832 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:17:39,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 09:17:39,902 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:17:39,902 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:17:39,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 09:17:39,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:17:39,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:17:40,018 INFO L272 TraceCheckUtils]: 0: Hoare triple {1227#true} call ULTIMATE.init(); {1227#true} is VALID [2022-04-15 09:17:40,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {1227#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1227#true} is VALID [2022-04-15 09:17:40,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {1227#true} assume true; {1227#true} is VALID [2022-04-15 09:17:40,019 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1227#true} {1227#true} #96#return; {1227#true} is VALID [2022-04-15 09:17:40,019 INFO L272 TraceCheckUtils]: 4: Hoare triple {1227#true} call #t~ret8 := main(); {1227#true} is VALID [2022-04-15 09:17:40,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {1227#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {1227#true} is VALID [2022-04-15 09:17:40,019 INFO L272 TraceCheckUtils]: 6: Hoare triple {1227#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1227#true} is VALID [2022-04-15 09:17:40,020 INFO L290 TraceCheckUtils]: 7: Hoare triple {1227#true} ~cond := #in~cond; {1227#true} is VALID [2022-04-15 09:17:40,020 INFO L290 TraceCheckUtils]: 8: Hoare triple {1227#true} assume !(0 == ~cond); {1227#true} is VALID [2022-04-15 09:17:40,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {1227#true} assume true; {1227#true} is VALID [2022-04-15 09:17:40,020 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1227#true} {1227#true} #80#return; {1227#true} is VALID [2022-04-15 09:17:40,020 INFO L290 TraceCheckUtils]: 11: Hoare triple {1227#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {1265#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-15 09:17:40,021 INFO L290 TraceCheckUtils]: 12: Hoare triple {1265#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1265#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-15 09:17:40,021 INFO L290 TraceCheckUtils]: 13: Hoare triple {1265#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {1265#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-15 09:17:40,021 INFO L272 TraceCheckUtils]: 14: Hoare triple {1265#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1227#true} is VALID [2022-04-15 09:17:40,022 INFO L290 TraceCheckUtils]: 15: Hoare triple {1227#true} ~cond := #in~cond; {1227#true} is VALID [2022-04-15 09:17:40,022 INFO L290 TraceCheckUtils]: 16: Hoare triple {1227#true} assume !(0 == ~cond); {1227#true} is VALID [2022-04-15 09:17:40,022 INFO L290 TraceCheckUtils]: 17: Hoare triple {1227#true} assume true; {1227#true} is VALID [2022-04-15 09:17:40,022 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1227#true} {1265#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #82#return; {1265#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-15 09:17:40,023 INFO L272 TraceCheckUtils]: 19: Hoare triple {1265#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {1227#true} is VALID [2022-04-15 09:17:40,023 INFO L290 TraceCheckUtils]: 20: Hoare triple {1227#true} ~cond := #in~cond; {1227#true} is VALID [2022-04-15 09:17:40,023 INFO L290 TraceCheckUtils]: 21: Hoare triple {1227#true} assume !(0 == ~cond); {1227#true} is VALID [2022-04-15 09:17:40,023 INFO L290 TraceCheckUtils]: 22: Hoare triple {1227#true} assume true; {1227#true} is VALID [2022-04-15 09:17:40,024 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1227#true} {1265#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #84#return; {1265#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-15 09:17:40,024 INFO L272 TraceCheckUtils]: 24: Hoare triple {1265#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {1305#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 09:17:40,025 INFO L290 TraceCheckUtils]: 25: Hoare triple {1305#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1309#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:17:40,025 INFO L290 TraceCheckUtils]: 26: Hoare triple {1309#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1228#false} is VALID [2022-04-15 09:17:40,025 INFO L290 TraceCheckUtils]: 27: Hoare triple {1228#false} assume !false; {1228#false} is VALID [2022-04-15 09:17:40,025 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 09:17:40,025 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 09:17:40,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:17:40,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303623662] [2022-04-15 09:17:40,026 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:17:40,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754804556] [2022-04-15 09:17:40,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754804556] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:17:40,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:17:40,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 09:17:40,026 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:17:40,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1597099532] [2022-04-15 09:17:40,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1597099532] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:17:40,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:17:40,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 09:17:40,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472796705] [2022-04-15 09:17:40,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:17:40,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-15 09:17:40,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:17:40,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 09:17:40,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:17:40,051 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 09:17:40,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:17:40,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 09:17:40,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 09:17:40,052 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 09:17:40,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:17:40,231 INFO L93 Difference]: Finished difference Result 71 states and 93 transitions. [2022-04-15 09:17:40,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 09:17:40,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-15 09:17:40,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:17:40,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 09:17:40,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-04-15 09:17:40,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 09:17:40,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 87 transitions. [2022-04-15 09:17:40,238 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 87 transitions. [2022-04-15 09:17:40,293 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:17:40,295 INFO L225 Difference]: With dead ends: 71 [2022-04-15 09:17:40,295 INFO L226 Difference]: Without dead ends: 56 [2022-04-15 09:17:40,295 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 09:17:40,298 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 10 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 09:17:40,298 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 143 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 09:17:40,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-15 09:17:40,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-15 09:17:40,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:17:40,321 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 35 states have internal predecessors, (41), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 09:17:40,321 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 35 states have internal predecessors, (41), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 09:17:40,321 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 35 states have internal predecessors, (41), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 09:17:40,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:17:40,324 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2022-04-15 09:17:40,324 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2022-04-15 09:17:40,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:17:40,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:17:40,325 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 35 states have internal predecessors, (41), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 56 states. [2022-04-15 09:17:40,325 INFO L87 Difference]: Start difference. First operand has 56 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 35 states have internal predecessors, (41), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 56 states. [2022-04-15 09:17:40,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:17:40,329 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2022-04-15 09:17:40,329 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2022-04-15 09:17:40,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:17:40,330 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:17:40,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:17:40,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:17:40,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 35 states have internal predecessors, (41), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 09:17:40,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2022-04-15 09:17:40,332 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 28 [2022-04-15 09:17:40,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:17:40,333 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2022-04-15 09:17:40,333 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 09:17:40,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 70 transitions. [2022-04-15 09:17:40,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:17:40,385 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2022-04-15 09:17:40,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 09:17:40,386 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:17:40,386 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:17:40,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 09:17:40,602 WARN L460 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-15 09:17:40,603 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:17:40,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:17:40,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1301357193, now seen corresponding path program 1 times [2022-04-15 09:17:40,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:17:40,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [819218504] [2022-04-15 09:17:40,605 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:17:40,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1301357193, now seen corresponding path program 2 times [2022-04-15 09:17:40,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:17:40,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035836541] [2022-04-15 09:17:40,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:17:40,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:17:40,615 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:17:40,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1811757093] [2022-04-15 09:17:40,615 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:17:40,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:17:40,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:17:40,629 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:17:40,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 09:17:40,666 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:17:40,666 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:17:40,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 09:17:40,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:17:40,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:17:40,787 INFO L272 TraceCheckUtils]: 0: Hoare triple {1683#true} call ULTIMATE.init(); {1683#true} is VALID [2022-04-15 09:17:40,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {1683#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1691#(<= ~counter~0 0)} is VALID [2022-04-15 09:17:40,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {1691#(<= ~counter~0 0)} assume true; {1691#(<= ~counter~0 0)} is VALID [2022-04-15 09:17:40,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1691#(<= ~counter~0 0)} {1683#true} #96#return; {1691#(<= ~counter~0 0)} is VALID [2022-04-15 09:17:40,788 INFO L272 TraceCheckUtils]: 4: Hoare triple {1691#(<= ~counter~0 0)} call #t~ret8 := main(); {1691#(<= ~counter~0 0)} is VALID [2022-04-15 09:17:40,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {1691#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {1691#(<= ~counter~0 0)} is VALID [2022-04-15 09:17:40,789 INFO L272 TraceCheckUtils]: 6: Hoare triple {1691#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1691#(<= ~counter~0 0)} is VALID [2022-04-15 09:17:40,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {1691#(<= ~counter~0 0)} ~cond := #in~cond; {1691#(<= ~counter~0 0)} is VALID [2022-04-15 09:17:40,790 INFO L290 TraceCheckUtils]: 8: Hoare triple {1691#(<= ~counter~0 0)} assume !(0 == ~cond); {1691#(<= ~counter~0 0)} is VALID [2022-04-15 09:17:40,790 INFO L290 TraceCheckUtils]: 9: Hoare triple {1691#(<= ~counter~0 0)} assume true; {1691#(<= ~counter~0 0)} is VALID [2022-04-15 09:17:40,790 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1691#(<= ~counter~0 0)} {1691#(<= ~counter~0 0)} #80#return; {1691#(<= ~counter~0 0)} is VALID [2022-04-15 09:17:40,792 INFO L290 TraceCheckUtils]: 11: Hoare triple {1691#(<= ~counter~0 0)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {1691#(<= ~counter~0 0)} is VALID [2022-04-15 09:17:40,792 INFO L290 TraceCheckUtils]: 12: Hoare triple {1691#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1725#(<= ~counter~0 1)} is VALID [2022-04-15 09:17:40,793 INFO L290 TraceCheckUtils]: 13: Hoare triple {1725#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {1725#(<= ~counter~0 1)} is VALID [2022-04-15 09:17:40,793 INFO L272 TraceCheckUtils]: 14: Hoare triple {1725#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1725#(<= ~counter~0 1)} is VALID [2022-04-15 09:17:40,793 INFO L290 TraceCheckUtils]: 15: Hoare triple {1725#(<= ~counter~0 1)} ~cond := #in~cond; {1725#(<= ~counter~0 1)} is VALID [2022-04-15 09:17:40,793 INFO L290 TraceCheckUtils]: 16: Hoare triple {1725#(<= ~counter~0 1)} assume !(0 == ~cond); {1725#(<= ~counter~0 1)} is VALID [2022-04-15 09:17:40,794 INFO L290 TraceCheckUtils]: 17: Hoare triple {1725#(<= ~counter~0 1)} assume true; {1725#(<= ~counter~0 1)} is VALID [2022-04-15 09:17:40,794 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1725#(<= ~counter~0 1)} {1725#(<= ~counter~0 1)} #82#return; {1725#(<= ~counter~0 1)} is VALID [2022-04-15 09:17:40,794 INFO L272 TraceCheckUtils]: 19: Hoare triple {1725#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {1725#(<= ~counter~0 1)} is VALID [2022-04-15 09:17:40,795 INFO L290 TraceCheckUtils]: 20: Hoare triple {1725#(<= ~counter~0 1)} ~cond := #in~cond; {1725#(<= ~counter~0 1)} is VALID [2022-04-15 09:17:40,795 INFO L290 TraceCheckUtils]: 21: Hoare triple {1725#(<= ~counter~0 1)} assume !(0 == ~cond); {1725#(<= ~counter~0 1)} is VALID [2022-04-15 09:17:40,795 INFO L290 TraceCheckUtils]: 22: Hoare triple {1725#(<= ~counter~0 1)} assume true; {1725#(<= ~counter~0 1)} is VALID [2022-04-15 09:17:40,796 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1725#(<= ~counter~0 1)} {1725#(<= ~counter~0 1)} #84#return; {1725#(<= ~counter~0 1)} is VALID [2022-04-15 09:17:40,796 INFO L272 TraceCheckUtils]: 24: Hoare triple {1725#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {1725#(<= ~counter~0 1)} is VALID [2022-04-15 09:17:40,796 INFO L290 TraceCheckUtils]: 25: Hoare triple {1725#(<= ~counter~0 1)} ~cond := #in~cond; {1725#(<= ~counter~0 1)} is VALID [2022-04-15 09:17:40,797 INFO L290 TraceCheckUtils]: 26: Hoare triple {1725#(<= ~counter~0 1)} assume !(0 == ~cond); {1725#(<= ~counter~0 1)} is VALID [2022-04-15 09:17:40,797 INFO L290 TraceCheckUtils]: 27: Hoare triple {1725#(<= ~counter~0 1)} assume true; {1725#(<= ~counter~0 1)} is VALID [2022-04-15 09:17:40,797 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1725#(<= ~counter~0 1)} {1725#(<= ~counter~0 1)} #86#return; {1725#(<= ~counter~0 1)} is VALID [2022-04-15 09:17:40,797 INFO L290 TraceCheckUtils]: 29: Hoare triple {1725#(<= ~counter~0 1)} assume !(~r~0 >= ~d~0); {1725#(<= ~counter~0 1)} is VALID [2022-04-15 09:17:40,798 INFO L290 TraceCheckUtils]: 30: Hoare triple {1725#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1780#(<= |main_#t~post7| 1)} is VALID [2022-04-15 09:17:40,798 INFO L290 TraceCheckUtils]: 31: Hoare triple {1780#(<= |main_#t~post7| 1)} assume !(#t~post7 < 20);havoc #t~post7; {1684#false} is VALID [2022-04-15 09:17:40,798 INFO L272 TraceCheckUtils]: 32: Hoare triple {1684#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {1684#false} is VALID [2022-04-15 09:17:40,798 INFO L290 TraceCheckUtils]: 33: Hoare triple {1684#false} ~cond := #in~cond; {1684#false} is VALID [2022-04-15 09:17:40,799 INFO L290 TraceCheckUtils]: 34: Hoare triple {1684#false} assume 0 == ~cond; {1684#false} is VALID [2022-04-15 09:17:40,799 INFO L290 TraceCheckUtils]: 35: Hoare triple {1684#false} assume !false; {1684#false} is VALID [2022-04-15 09:17:40,799 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 09:17:40,799 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 09:17:40,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:17:40,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035836541] [2022-04-15 09:17:40,799 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:17:40,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1811757093] [2022-04-15 09:17:40,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1811757093] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:17:40,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:17:40,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 09:17:40,800 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:17:40,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [819218504] [2022-04-15 09:17:40,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [819218504] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:17:40,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:17:40,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 09:17:40,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725287225] [2022-04-15 09:17:40,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:17:40,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2022-04-15 09:17:40,801 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:17:40,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 09:17:40,816 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:17:40,816 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 09:17:40,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:17:40,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 09:17:40,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 09:17:40,817 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 09:17:40,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:17:40,899 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2022-04-15 09:17:40,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 09:17:40,900 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2022-04-15 09:17:40,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:17:40,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 09:17:40,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-15 09:17:40,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 09:17:40,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-15 09:17:40,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-15 09:17:40,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:17:40,953 INFO L225 Difference]: With dead ends: 76 [2022-04-15 09:17:40,953 INFO L226 Difference]: Without dead ends: 69 [2022-04-15 09:17:40,954 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 09:17:40,954 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 09:17:40,954 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 117 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 09:17:40,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-15 09:17:40,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-04-15 09:17:40,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:17:40,982 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 68 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 44 states have internal predecessors, (49), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 09:17:40,982 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 68 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 44 states have internal predecessors, (49), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 09:17:40,982 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 68 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 44 states have internal predecessors, (49), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 09:17:40,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:17:40,984 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2022-04-15 09:17:40,984 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2022-04-15 09:17:40,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:17:40,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:17:40,985 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 44 states have internal predecessors, (49), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 69 states. [2022-04-15 09:17:40,985 INFO L87 Difference]: Start difference. First operand has 68 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 44 states have internal predecessors, (49), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 69 states. [2022-04-15 09:17:40,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:17:41,004 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2022-04-15 09:17:41,005 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2022-04-15 09:17:41,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:17:41,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:17:41,005 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:17:41,005 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:17:41,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 44 states have internal predecessors, (49), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 09:17:41,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2022-04-15 09:17:41,007 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 36 [2022-04-15 09:17:41,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:17:41,007 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2022-04-15 09:17:41,007 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 09:17:41,008 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 78 transitions. [2022-04-15 09:17:41,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:17:41,069 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2022-04-15 09:17:41,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 09:17:41,069 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:17:41,069 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:17:41,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 09:17:41,282 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:17:41,283 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:17:41,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:17:41,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1303085071, now seen corresponding path program 1 times [2022-04-15 09:17:41,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:17:41,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [544611581] [2022-04-15 09:17:41,284 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:17:41,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1303085071, now seen corresponding path program 2 times [2022-04-15 09:17:41,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:17:41,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791248147] [2022-04-15 09:17:41,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:17:41,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:17:41,302 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:17:41,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [138651562] [2022-04-15 09:17:41,303 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:17:41,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:17:41,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:17:41,304 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:17:41,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 09:17:41,365 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:17:41,365 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:17:41,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 09:17:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:17:41,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:17:41,498 INFO L272 TraceCheckUtils]: 0: Hoare triple {2221#true} call ULTIMATE.init(); {2221#true} is VALID [2022-04-15 09:17:41,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {2221#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2221#true} is VALID [2022-04-15 09:17:41,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {2221#true} assume true; {2221#true} is VALID [2022-04-15 09:17:41,498 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2221#true} {2221#true} #96#return; {2221#true} is VALID [2022-04-15 09:17:41,498 INFO L272 TraceCheckUtils]: 4: Hoare triple {2221#true} call #t~ret8 := main(); {2221#true} is VALID [2022-04-15 09:17:41,499 INFO L290 TraceCheckUtils]: 5: Hoare triple {2221#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {2221#true} is VALID [2022-04-15 09:17:41,499 INFO L272 TraceCheckUtils]: 6: Hoare triple {2221#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2221#true} is VALID [2022-04-15 09:17:41,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {2221#true} ~cond := #in~cond; {2221#true} is VALID [2022-04-15 09:17:41,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {2221#true} assume !(0 == ~cond); {2221#true} is VALID [2022-04-15 09:17:41,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {2221#true} assume true; {2221#true} is VALID [2022-04-15 09:17:41,499 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2221#true} {2221#true} #80#return; {2221#true} is VALID [2022-04-15 09:17:41,505 INFO L290 TraceCheckUtils]: 11: Hoare triple {2221#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {2259#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 09:17:41,505 INFO L290 TraceCheckUtils]: 12: Hoare triple {2259#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2259#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 09:17:41,506 INFO L290 TraceCheckUtils]: 13: Hoare triple {2259#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 20);havoc #t~post6; {2259#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 09:17:41,506 INFO L272 TraceCheckUtils]: 14: Hoare triple {2259#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2221#true} is VALID [2022-04-15 09:17:41,506 INFO L290 TraceCheckUtils]: 15: Hoare triple {2221#true} ~cond := #in~cond; {2221#true} is VALID [2022-04-15 09:17:41,506 INFO L290 TraceCheckUtils]: 16: Hoare triple {2221#true} assume !(0 == ~cond); {2221#true} is VALID [2022-04-15 09:17:41,506 INFO L290 TraceCheckUtils]: 17: Hoare triple {2221#true} assume true; {2221#true} is VALID [2022-04-15 09:17:41,507 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2221#true} {2259#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #82#return; {2259#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 09:17:41,507 INFO L272 TraceCheckUtils]: 19: Hoare triple {2259#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {2221#true} is VALID [2022-04-15 09:17:41,507 INFO L290 TraceCheckUtils]: 20: Hoare triple {2221#true} ~cond := #in~cond; {2221#true} is VALID [2022-04-15 09:17:41,507 INFO L290 TraceCheckUtils]: 21: Hoare triple {2221#true} assume !(0 == ~cond); {2221#true} is VALID [2022-04-15 09:17:41,507 INFO L290 TraceCheckUtils]: 22: Hoare triple {2221#true} assume true; {2221#true} is VALID [2022-04-15 09:17:41,508 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2221#true} {2259#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #84#return; {2259#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 09:17:41,508 INFO L272 TraceCheckUtils]: 24: Hoare triple {2259#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {2221#true} is VALID [2022-04-15 09:17:41,508 INFO L290 TraceCheckUtils]: 25: Hoare triple {2221#true} ~cond := #in~cond; {2221#true} is VALID [2022-04-15 09:17:41,508 INFO L290 TraceCheckUtils]: 26: Hoare triple {2221#true} assume !(0 == ~cond); {2221#true} is VALID [2022-04-15 09:17:41,508 INFO L290 TraceCheckUtils]: 27: Hoare triple {2221#true} assume true; {2221#true} is VALID [2022-04-15 09:17:41,509 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2221#true} {2259#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #86#return; {2259#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 09:17:41,509 INFO L290 TraceCheckUtils]: 29: Hoare triple {2259#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} assume !(~r~0 >= ~d~0); {2259#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 09:17:41,509 INFO L290 TraceCheckUtils]: 30: Hoare triple {2259#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2259#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 09:17:41,510 INFO L290 TraceCheckUtils]: 31: Hoare triple {2259#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} assume !!(#t~post7 < 20);havoc #t~post7; {2259#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 09:17:41,510 INFO L272 TraceCheckUtils]: 32: Hoare triple {2259#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {2323#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 09:17:41,511 INFO L290 TraceCheckUtils]: 33: Hoare triple {2323#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2327#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:17:41,511 INFO L290 TraceCheckUtils]: 34: Hoare triple {2327#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2222#false} is VALID [2022-04-15 09:17:41,511 INFO L290 TraceCheckUtils]: 35: Hoare triple {2222#false} assume !false; {2222#false} is VALID [2022-04-15 09:17:41,511 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 09:17:41,512 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 09:17:41,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:17:41,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791248147] [2022-04-15 09:17:41,512 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:17:41,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138651562] [2022-04-15 09:17:41,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138651562] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:17:41,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:17:41,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 09:17:41,512 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:17:41,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [544611581] [2022-04-15 09:17:41,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [544611581] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:17:41,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:17:41,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 09:17:41,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134718066] [2022-04-15 09:17:41,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:17:41,513 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-15 09:17:41,513 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:17:41,513 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 09:17:41,539 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:17:41,539 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 09:17:41,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:17:41,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 09:17:41,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 09:17:41,540 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 09:17:41,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:17:41,685 INFO L93 Difference]: Finished difference Result 82 states and 97 transitions. [2022-04-15 09:17:41,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 09:17:41,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-15 09:17:41,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:17:41,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 09:17:41,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-04-15 09:17:41,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 09:17:41,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-04-15 09:17:41,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 61 transitions. [2022-04-15 09:17:41,718 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:17:41,719 INFO L225 Difference]: With dead ends: 82 [2022-04-15 09:17:41,719 INFO L226 Difference]: Without dead ends: 70 [2022-04-15 09:17:41,720 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 09:17:41,720 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 11 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 09:17:41,720 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 118 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 09:17:41,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-15 09:17:41,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2022-04-15 09:17:41,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:17:41,759 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 69 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 45 states have internal predecessors, (52), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 09:17:41,759 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 69 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 45 states have internal predecessors, (52), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 09:17:41,759 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 69 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 45 states have internal predecessors, (52), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 09:17:41,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:17:41,761 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2022-04-15 09:17:41,761 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-15 09:17:41,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:17:41,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:17:41,762 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 45 states have internal predecessors, (52), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 70 states. [2022-04-15 09:17:41,762 INFO L87 Difference]: Start difference. First operand has 69 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 45 states have internal predecessors, (52), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 70 states. [2022-04-15 09:17:41,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:17:41,764 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2022-04-15 09:17:41,764 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-04-15 09:17:41,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:17:41,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:17:41,764 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:17:41,764 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:17:41,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 45 states have internal predecessors, (52), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 09:17:41,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 82 transitions. [2022-04-15 09:17:41,766 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 82 transitions. Word has length 36 [2022-04-15 09:17:41,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:17:41,766 INFO L478 AbstractCegarLoop]: Abstraction has 69 states and 82 transitions. [2022-04-15 09:17:41,766 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 09:17:41,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 82 transitions. [2022-04-15 09:17:41,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:17:41,833 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 82 transitions. [2022-04-15 09:17:41,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 09:17:41,833 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:17:41,834 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:17:41,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 09:17:42,034 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:17:42,034 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:17:42,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:17:42,035 INFO L85 PathProgramCache]: Analyzing trace with hash 817878903, now seen corresponding path program 1 times [2022-04-15 09:17:42,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:17:42,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2013413753] [2022-04-15 09:17:51,798 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:17:51,798 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:17:51,798 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:17:51,798 INFO L85 PathProgramCache]: Analyzing trace with hash 817878903, now seen corresponding path program 2 times [2022-04-15 09:17:51,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:17:51,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486568851] [2022-04-15 09:17:51,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:17:51,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:17:51,822 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:17:51,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [205644375] [2022-04-15 09:17:51,822 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:17:51,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:17:51,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:17:51,832 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:17:51,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 09:17:51,886 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:17:51,886 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:17:51,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 09:17:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:17:51,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:17:52,051 INFO L272 TraceCheckUtils]: 0: Hoare triple {2777#true} call ULTIMATE.init(); {2777#true} is VALID [2022-04-15 09:17:52,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {2777#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2785#(<= ~counter~0 0)} is VALID [2022-04-15 09:17:52,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {2785#(<= ~counter~0 0)} assume true; {2785#(<= ~counter~0 0)} is VALID [2022-04-15 09:17:52,052 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2785#(<= ~counter~0 0)} {2777#true} #96#return; {2785#(<= ~counter~0 0)} is VALID [2022-04-15 09:17:52,053 INFO L272 TraceCheckUtils]: 4: Hoare triple {2785#(<= ~counter~0 0)} call #t~ret8 := main(); {2785#(<= ~counter~0 0)} is VALID [2022-04-15 09:17:52,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {2785#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {2785#(<= ~counter~0 0)} is VALID [2022-04-15 09:17:52,053 INFO L272 TraceCheckUtils]: 6: Hoare triple {2785#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2785#(<= ~counter~0 0)} is VALID [2022-04-15 09:17:52,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {2785#(<= ~counter~0 0)} ~cond := #in~cond; {2785#(<= ~counter~0 0)} is VALID [2022-04-15 09:17:52,054 INFO L290 TraceCheckUtils]: 8: Hoare triple {2785#(<= ~counter~0 0)} assume !(0 == ~cond); {2785#(<= ~counter~0 0)} is VALID [2022-04-15 09:17:52,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {2785#(<= ~counter~0 0)} assume true; {2785#(<= ~counter~0 0)} is VALID [2022-04-15 09:17:52,055 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2785#(<= ~counter~0 0)} {2785#(<= ~counter~0 0)} #80#return; {2785#(<= ~counter~0 0)} is VALID [2022-04-15 09:17:52,055 INFO L290 TraceCheckUtils]: 11: Hoare triple {2785#(<= ~counter~0 0)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {2785#(<= ~counter~0 0)} is VALID [2022-04-15 09:17:52,056 INFO L290 TraceCheckUtils]: 12: Hoare triple {2785#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2819#(<= ~counter~0 1)} is VALID [2022-04-15 09:17:52,056 INFO L290 TraceCheckUtils]: 13: Hoare triple {2819#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {2819#(<= ~counter~0 1)} is VALID [2022-04-15 09:17:52,057 INFO L272 TraceCheckUtils]: 14: Hoare triple {2819#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2819#(<= ~counter~0 1)} is VALID [2022-04-15 09:17:52,057 INFO L290 TraceCheckUtils]: 15: Hoare triple {2819#(<= ~counter~0 1)} ~cond := #in~cond; {2819#(<= ~counter~0 1)} is VALID [2022-04-15 09:17:52,057 INFO L290 TraceCheckUtils]: 16: Hoare triple {2819#(<= ~counter~0 1)} assume !(0 == ~cond); {2819#(<= ~counter~0 1)} is VALID [2022-04-15 09:17:52,058 INFO L290 TraceCheckUtils]: 17: Hoare triple {2819#(<= ~counter~0 1)} assume true; {2819#(<= ~counter~0 1)} is VALID [2022-04-15 09:17:52,058 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2819#(<= ~counter~0 1)} {2819#(<= ~counter~0 1)} #82#return; {2819#(<= ~counter~0 1)} is VALID [2022-04-15 09:17:52,059 INFO L272 TraceCheckUtils]: 19: Hoare triple {2819#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {2819#(<= ~counter~0 1)} is VALID [2022-04-15 09:17:52,059 INFO L290 TraceCheckUtils]: 20: Hoare triple {2819#(<= ~counter~0 1)} ~cond := #in~cond; {2819#(<= ~counter~0 1)} is VALID [2022-04-15 09:17:52,060 INFO L290 TraceCheckUtils]: 21: Hoare triple {2819#(<= ~counter~0 1)} assume !(0 == ~cond); {2819#(<= ~counter~0 1)} is VALID [2022-04-15 09:17:52,060 INFO L290 TraceCheckUtils]: 22: Hoare triple {2819#(<= ~counter~0 1)} assume true; {2819#(<= ~counter~0 1)} is VALID [2022-04-15 09:17:52,060 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2819#(<= ~counter~0 1)} {2819#(<= ~counter~0 1)} #84#return; {2819#(<= ~counter~0 1)} is VALID [2022-04-15 09:17:52,061 INFO L272 TraceCheckUtils]: 24: Hoare triple {2819#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {2819#(<= ~counter~0 1)} is VALID [2022-04-15 09:17:52,061 INFO L290 TraceCheckUtils]: 25: Hoare triple {2819#(<= ~counter~0 1)} ~cond := #in~cond; {2819#(<= ~counter~0 1)} is VALID [2022-04-15 09:17:52,062 INFO L290 TraceCheckUtils]: 26: Hoare triple {2819#(<= ~counter~0 1)} assume !(0 == ~cond); {2819#(<= ~counter~0 1)} is VALID [2022-04-15 09:17:52,062 INFO L290 TraceCheckUtils]: 27: Hoare triple {2819#(<= ~counter~0 1)} assume true; {2819#(<= ~counter~0 1)} is VALID [2022-04-15 09:17:52,063 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2819#(<= ~counter~0 1)} {2819#(<= ~counter~0 1)} #86#return; {2819#(<= ~counter~0 1)} is VALID [2022-04-15 09:17:52,063 INFO L290 TraceCheckUtils]: 29: Hoare triple {2819#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2819#(<= ~counter~0 1)} is VALID [2022-04-15 09:17:52,063 INFO L290 TraceCheckUtils]: 30: Hoare triple {2819#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2874#(<= |main_#t~post6| 1)} is VALID [2022-04-15 09:17:52,064 INFO L290 TraceCheckUtils]: 31: Hoare triple {2874#(<= |main_#t~post6| 1)} assume !(#t~post6 < 20);havoc #t~post6; {2778#false} is VALID [2022-04-15 09:17:52,064 INFO L290 TraceCheckUtils]: 32: Hoare triple {2778#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2778#false} is VALID [2022-04-15 09:17:52,064 INFO L290 TraceCheckUtils]: 33: Hoare triple {2778#false} assume !(#t~post7 < 20);havoc #t~post7; {2778#false} is VALID [2022-04-15 09:17:52,064 INFO L272 TraceCheckUtils]: 34: Hoare triple {2778#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {2778#false} is VALID [2022-04-15 09:17:52,064 INFO L290 TraceCheckUtils]: 35: Hoare triple {2778#false} ~cond := #in~cond; {2778#false} is VALID [2022-04-15 09:17:52,064 INFO L290 TraceCheckUtils]: 36: Hoare triple {2778#false} assume !(0 == ~cond); {2778#false} is VALID [2022-04-15 09:17:52,065 INFO L290 TraceCheckUtils]: 37: Hoare triple {2778#false} assume true; {2778#false} is VALID [2022-04-15 09:17:52,065 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2778#false} {2778#false} #92#return; {2778#false} is VALID [2022-04-15 09:17:52,065 INFO L272 TraceCheckUtils]: 39: Hoare triple {2778#false} call __VERIFIER_assert((if ~B~0 % 4294967296 == ~d~0 then 1 else 0)); {2778#false} is VALID [2022-04-15 09:17:52,065 INFO L290 TraceCheckUtils]: 40: Hoare triple {2778#false} ~cond := #in~cond; {2778#false} is VALID [2022-04-15 09:17:52,065 INFO L290 TraceCheckUtils]: 41: Hoare triple {2778#false} assume 0 == ~cond; {2778#false} is VALID [2022-04-15 09:17:52,065 INFO L290 TraceCheckUtils]: 42: Hoare triple {2778#false} assume !false; {2778#false} is VALID [2022-04-15 09:17:52,065 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-15 09:17:52,066 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:17:52,241 INFO L290 TraceCheckUtils]: 42: Hoare triple {2778#false} assume !false; {2778#false} is VALID [2022-04-15 09:17:52,241 INFO L290 TraceCheckUtils]: 41: Hoare triple {2778#false} assume 0 == ~cond; {2778#false} is VALID [2022-04-15 09:17:52,241 INFO L290 TraceCheckUtils]: 40: Hoare triple {2778#false} ~cond := #in~cond; {2778#false} is VALID [2022-04-15 09:17:52,241 INFO L272 TraceCheckUtils]: 39: Hoare triple {2778#false} call __VERIFIER_assert((if ~B~0 % 4294967296 == ~d~0 then 1 else 0)); {2778#false} is VALID [2022-04-15 09:17:52,242 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2777#true} {2778#false} #92#return; {2778#false} is VALID [2022-04-15 09:17:52,242 INFO L290 TraceCheckUtils]: 37: Hoare triple {2777#true} assume true; {2777#true} is VALID [2022-04-15 09:17:52,242 INFO L290 TraceCheckUtils]: 36: Hoare triple {2777#true} assume !(0 == ~cond); {2777#true} is VALID [2022-04-15 09:17:52,242 INFO L290 TraceCheckUtils]: 35: Hoare triple {2777#true} ~cond := #in~cond; {2777#true} is VALID [2022-04-15 09:17:52,242 INFO L272 TraceCheckUtils]: 34: Hoare triple {2778#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {2777#true} is VALID [2022-04-15 09:17:52,242 INFO L290 TraceCheckUtils]: 33: Hoare triple {2778#false} assume !(#t~post7 < 20);havoc #t~post7; {2778#false} is VALID [2022-04-15 09:17:52,242 INFO L290 TraceCheckUtils]: 32: Hoare triple {2778#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2778#false} is VALID [2022-04-15 09:17:52,243 INFO L290 TraceCheckUtils]: 31: Hoare triple {2944#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {2778#false} is VALID [2022-04-15 09:17:52,243 INFO L290 TraceCheckUtils]: 30: Hoare triple {2948#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2944#(< |main_#t~post6| 20)} is VALID [2022-04-15 09:17:52,243 INFO L290 TraceCheckUtils]: 29: Hoare triple {2948#(< ~counter~0 20)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2948#(< ~counter~0 20)} is VALID [2022-04-15 09:17:52,244 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2777#true} {2948#(< ~counter~0 20)} #86#return; {2948#(< ~counter~0 20)} is VALID [2022-04-15 09:17:52,244 INFO L290 TraceCheckUtils]: 27: Hoare triple {2777#true} assume true; {2777#true} is VALID [2022-04-15 09:17:52,244 INFO L290 TraceCheckUtils]: 26: Hoare triple {2777#true} assume !(0 == ~cond); {2777#true} is VALID [2022-04-15 09:17:52,244 INFO L290 TraceCheckUtils]: 25: Hoare triple {2777#true} ~cond := #in~cond; {2777#true} is VALID [2022-04-15 09:17:52,245 INFO L272 TraceCheckUtils]: 24: Hoare triple {2948#(< ~counter~0 20)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {2777#true} is VALID [2022-04-15 09:17:52,245 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2777#true} {2948#(< ~counter~0 20)} #84#return; {2948#(< ~counter~0 20)} is VALID [2022-04-15 09:17:52,245 INFO L290 TraceCheckUtils]: 22: Hoare triple {2777#true} assume true; {2777#true} is VALID [2022-04-15 09:17:52,245 INFO L290 TraceCheckUtils]: 21: Hoare triple {2777#true} assume !(0 == ~cond); {2777#true} is VALID [2022-04-15 09:17:52,245 INFO L290 TraceCheckUtils]: 20: Hoare triple {2777#true} ~cond := #in~cond; {2777#true} is VALID [2022-04-15 09:17:52,246 INFO L272 TraceCheckUtils]: 19: Hoare triple {2948#(< ~counter~0 20)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {2777#true} is VALID [2022-04-15 09:17:52,246 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2777#true} {2948#(< ~counter~0 20)} #82#return; {2948#(< ~counter~0 20)} is VALID [2022-04-15 09:17:52,246 INFO L290 TraceCheckUtils]: 17: Hoare triple {2777#true} assume true; {2777#true} is VALID [2022-04-15 09:17:52,246 INFO L290 TraceCheckUtils]: 16: Hoare triple {2777#true} assume !(0 == ~cond); {2777#true} is VALID [2022-04-15 09:17:52,246 INFO L290 TraceCheckUtils]: 15: Hoare triple {2777#true} ~cond := #in~cond; {2777#true} is VALID [2022-04-15 09:17:52,246 INFO L272 TraceCheckUtils]: 14: Hoare triple {2948#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2777#true} is VALID [2022-04-15 09:17:52,247 INFO L290 TraceCheckUtils]: 13: Hoare triple {2948#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {2948#(< ~counter~0 20)} is VALID [2022-04-15 09:17:52,247 INFO L290 TraceCheckUtils]: 12: Hoare triple {3003#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2948#(< ~counter~0 20)} is VALID [2022-04-15 09:17:52,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {3003#(< ~counter~0 19)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {3003#(< ~counter~0 19)} is VALID [2022-04-15 09:17:52,248 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2777#true} {3003#(< ~counter~0 19)} #80#return; {3003#(< ~counter~0 19)} is VALID [2022-04-15 09:17:52,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {2777#true} assume true; {2777#true} is VALID [2022-04-15 09:17:52,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {2777#true} assume !(0 == ~cond); {2777#true} is VALID [2022-04-15 09:17:52,248 INFO L290 TraceCheckUtils]: 7: Hoare triple {2777#true} ~cond := #in~cond; {2777#true} is VALID [2022-04-15 09:17:52,249 INFO L272 TraceCheckUtils]: 6: Hoare triple {3003#(< ~counter~0 19)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2777#true} is VALID [2022-04-15 09:17:52,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {3003#(< ~counter~0 19)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {3003#(< ~counter~0 19)} is VALID [2022-04-15 09:17:52,249 INFO L272 TraceCheckUtils]: 4: Hoare triple {3003#(< ~counter~0 19)} call #t~ret8 := main(); {3003#(< ~counter~0 19)} is VALID [2022-04-15 09:17:52,250 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3003#(< ~counter~0 19)} {2777#true} #96#return; {3003#(< ~counter~0 19)} is VALID [2022-04-15 09:17:52,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {3003#(< ~counter~0 19)} assume true; {3003#(< ~counter~0 19)} is VALID [2022-04-15 09:17:52,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {2777#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3003#(< ~counter~0 19)} is VALID [2022-04-15 09:17:52,250 INFO L272 TraceCheckUtils]: 0: Hoare triple {2777#true} call ULTIMATE.init(); {2777#true} is VALID [2022-04-15 09:17:52,251 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 09:17:52,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:17:52,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486568851] [2022-04-15 09:17:52,251 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:17:52,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205644375] [2022-04-15 09:17:52,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205644375] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:17:52,251 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:17:52,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-15 09:17:52,252 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:17:52,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2013413753] [2022-04-15 09:17:52,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2013413753] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:17:52,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:17:52,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 09:17:52,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311448542] [2022-04-15 09:17:52,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:17:52,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 43 [2022-04-15 09:17:52,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:17:52,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 09:17:52,275 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:17:52,275 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 09:17:52,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:17:52,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 09:17:52,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-15 09:17:52,276 INFO L87 Difference]: Start difference. First operand 69 states and 82 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 09:17:52,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:17:52,413 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2022-04-15 09:17:52,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 09:17:52,413 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 43 [2022-04-15 09:17:52,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:17:52,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 09:17:52,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2022-04-15 09:17:52,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 09:17:52,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2022-04-15 09:17:52,416 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 76 transitions. [2022-04-15 09:17:52,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:17:52,473 INFO L225 Difference]: With dead ends: 96 [2022-04-15 09:17:52,473 INFO L226 Difference]: Without dead ends: 71 [2022-04-15 09:17:52,474 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-15 09:17:52,474 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 6 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 117 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-15 09:17:52,474 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 117 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 09:17:52,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-15 09:17:52,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-04-15 09:17:52,532 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:17:52,532 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 71 states, 45 states have (on average 1.2) internal successors, (54), 47 states have internal predecessors, (54), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 09:17:52,532 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 71 states, 45 states have (on average 1.2) internal successors, (54), 47 states have internal predecessors, (54), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 09:17:52,532 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 71 states, 45 states have (on average 1.2) internal successors, (54), 47 states have internal predecessors, (54), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 09:17:52,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:17:52,534 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2022-04-15 09:17:52,534 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2022-04-15 09:17:52,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:17:52,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:17:52,535 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 45 states have (on average 1.2) internal successors, (54), 47 states have internal predecessors, (54), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 71 states. [2022-04-15 09:17:52,535 INFO L87 Difference]: Start difference. First operand has 71 states, 45 states have (on average 1.2) internal successors, (54), 47 states have internal predecessors, (54), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Second operand 71 states. [2022-04-15 09:17:52,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:17:52,537 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2022-04-15 09:17:52,537 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2022-04-15 09:17:52,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:17:52,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:17:52,537 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:17:52,537 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:17:52,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 45 states have (on average 1.2) internal successors, (54), 47 states have internal predecessors, (54), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 09:17:52,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions. [2022-04-15 09:17:52,539 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 84 transitions. Word has length 43 [2022-04-15 09:17:52,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:17:52,540 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 84 transitions. [2022-04-15 09:17:52,540 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2022-04-15 09:17:52,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 84 transitions. [2022-04-15 09:17:52,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:17:52,614 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2022-04-15 09:17:52,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-15 09:17:52,614 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:17:52,614 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:17:52,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-15 09:17:52,830 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:17:52,830 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:17:52,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:17:52,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1861890039, now seen corresponding path program 1 times [2022-04-15 09:17:52,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:17:52,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [690551347] [2022-04-15 09:18:00,998 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:18:00,998 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:18:00,998 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:18:00,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1861890039, now seen corresponding path program 2 times [2022-04-15 09:18:00,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:18:00,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036515961] [2022-04-15 09:18:00,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:18:00,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:18:01,006 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:18:01,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1043297450] [2022-04-15 09:18:01,006 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:18:01,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:18:01,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:18:01,011 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:18:01,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 09:18:01,048 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:18:01,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:18:01,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 09:18:01,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:18:01,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:18:01,674 INFO L272 TraceCheckUtils]: 0: Hoare triple {3520#true} call ULTIMATE.init(); {3520#true} is VALID [2022-04-15 09:18:01,674 INFO L290 TraceCheckUtils]: 1: Hoare triple {3520#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3520#true} is VALID [2022-04-15 09:18:01,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {3520#true} assume true; {3520#true} is VALID [2022-04-15 09:18:01,674 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3520#true} {3520#true} #96#return; {3520#true} is VALID [2022-04-15 09:18:01,674 INFO L272 TraceCheckUtils]: 4: Hoare triple {3520#true} call #t~ret8 := main(); {3520#true} is VALID [2022-04-15 09:18:01,674 INFO L290 TraceCheckUtils]: 5: Hoare triple {3520#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {3520#true} is VALID [2022-04-15 09:18:01,674 INFO L272 TraceCheckUtils]: 6: Hoare triple {3520#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {3520#true} is VALID [2022-04-15 09:18:01,675 INFO L290 TraceCheckUtils]: 7: Hoare triple {3520#true} ~cond := #in~cond; {3546#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 09:18:01,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {3546#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3550#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 09:18:01,676 INFO L290 TraceCheckUtils]: 9: Hoare triple {3550#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3550#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 09:18:01,676 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3550#(not (= |assume_abort_if_not_#in~cond| 0))} {3520#true} #80#return; {3557#(<= 1 (mod main_~B~0 4294967296))} is VALID [2022-04-15 09:18:01,677 INFO L290 TraceCheckUtils]: 11: Hoare triple {3557#(<= 1 (mod main_~B~0 4294967296))} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {3561#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-15 09:18:01,677 INFO L290 TraceCheckUtils]: 12: Hoare triple {3561#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3561#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-15 09:18:01,677 INFO L290 TraceCheckUtils]: 13: Hoare triple {3561#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {3561#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-15 09:18:01,677 INFO L272 TraceCheckUtils]: 14: Hoare triple {3561#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3520#true} is VALID [2022-04-15 09:18:01,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {3520#true} ~cond := #in~cond; {3520#true} is VALID [2022-04-15 09:18:01,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {3520#true} assume !(0 == ~cond); {3520#true} is VALID [2022-04-15 09:18:01,678 INFO L290 TraceCheckUtils]: 17: Hoare triple {3520#true} assume true; {3520#true} is VALID [2022-04-15 09:18:01,679 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3520#true} {3561#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #82#return; {3561#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-15 09:18:01,679 INFO L272 TraceCheckUtils]: 19: Hoare triple {3561#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {3520#true} is VALID [2022-04-15 09:18:01,679 INFO L290 TraceCheckUtils]: 20: Hoare triple {3520#true} ~cond := #in~cond; {3520#true} is VALID [2022-04-15 09:18:01,679 INFO L290 TraceCheckUtils]: 21: Hoare triple {3520#true} assume !(0 == ~cond); {3520#true} is VALID [2022-04-15 09:18:01,679 INFO L290 TraceCheckUtils]: 22: Hoare triple {3520#true} assume true; {3520#true} is VALID [2022-04-15 09:18:01,680 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3520#true} {3561#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #84#return; {3561#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-15 09:18:01,680 INFO L272 TraceCheckUtils]: 24: Hoare triple {3561#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {3520#true} is VALID [2022-04-15 09:18:01,680 INFO L290 TraceCheckUtils]: 25: Hoare triple {3520#true} ~cond := #in~cond; {3520#true} is VALID [2022-04-15 09:18:01,680 INFO L290 TraceCheckUtils]: 26: Hoare triple {3520#true} assume !(0 == ~cond); {3520#true} is VALID [2022-04-15 09:18:01,680 INFO L290 TraceCheckUtils]: 27: Hoare triple {3520#true} assume true; {3520#true} is VALID [2022-04-15 09:18:01,681 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3520#true} {3561#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #86#return; {3561#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-15 09:18:01,681 INFO L290 TraceCheckUtils]: 29: Hoare triple {3561#(and (= main_~d~0 (mod main_~B~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3616#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 09:18:01,682 INFO L290 TraceCheckUtils]: 30: Hoare triple {3616#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3616#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 09:18:01,682 INFO L290 TraceCheckUtils]: 31: Hoare triple {3616#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} assume !!(#t~post6 < 20);havoc #t~post6; {3616#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 09:18:01,682 INFO L272 TraceCheckUtils]: 32: Hoare triple {3616#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3520#true} is VALID [2022-04-15 09:18:01,683 INFO L290 TraceCheckUtils]: 33: Hoare triple {3520#true} ~cond := #in~cond; {3520#true} is VALID [2022-04-15 09:18:01,683 INFO L290 TraceCheckUtils]: 34: Hoare triple {3520#true} assume !(0 == ~cond); {3520#true} is VALID [2022-04-15 09:18:01,683 INFO L290 TraceCheckUtils]: 35: Hoare triple {3520#true} assume true; {3520#true} is VALID [2022-04-15 09:18:01,683 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3520#true} {3616#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #82#return; {3616#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 09:18:01,686 INFO L272 TraceCheckUtils]: 37: Hoare triple {3616#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {3520#true} is VALID [2022-04-15 09:18:01,686 INFO L290 TraceCheckUtils]: 38: Hoare triple {3520#true} ~cond := #in~cond; {3520#true} is VALID [2022-04-15 09:18:01,686 INFO L290 TraceCheckUtils]: 39: Hoare triple {3520#true} assume !(0 == ~cond); {3520#true} is VALID [2022-04-15 09:18:01,686 INFO L290 TraceCheckUtils]: 40: Hoare triple {3520#true} assume true; {3520#true} is VALID [2022-04-15 09:18:01,689 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3520#true} {3616#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} #84#return; {3616#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 09:18:01,689 INFO L272 TraceCheckUtils]: 42: Hoare triple {3616#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {3656#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 09:18:01,690 INFO L290 TraceCheckUtils]: 43: Hoare triple {3656#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3660#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:18:01,690 INFO L290 TraceCheckUtils]: 44: Hoare triple {3660#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3521#false} is VALID [2022-04-15 09:18:01,690 INFO L290 TraceCheckUtils]: 45: Hoare triple {3521#false} assume !false; {3521#false} is VALID [2022-04-15 09:18:01,690 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-15 09:18:01,691 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:18:01,940 INFO L290 TraceCheckUtils]: 45: Hoare triple {3521#false} assume !false; {3521#false} is VALID [2022-04-15 09:18:01,941 INFO L290 TraceCheckUtils]: 44: Hoare triple {3660#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3521#false} is VALID [2022-04-15 09:18:01,941 INFO L290 TraceCheckUtils]: 43: Hoare triple {3656#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3660#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:18:01,942 INFO L272 TraceCheckUtils]: 42: Hoare triple {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {3656#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 09:18:01,942 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3520#true} {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #84#return; {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 09:18:01,942 INFO L290 TraceCheckUtils]: 40: Hoare triple {3520#true} assume true; {3520#true} is VALID [2022-04-15 09:18:01,943 INFO L290 TraceCheckUtils]: 39: Hoare triple {3520#true} assume !(0 == ~cond); {3520#true} is VALID [2022-04-15 09:18:01,943 INFO L290 TraceCheckUtils]: 38: Hoare triple {3520#true} ~cond := #in~cond; {3520#true} is VALID [2022-04-15 09:18:01,943 INFO L272 TraceCheckUtils]: 37: Hoare triple {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {3520#true} is VALID [2022-04-15 09:18:01,943 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {3520#true} {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #82#return; {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 09:18:01,943 INFO L290 TraceCheckUtils]: 35: Hoare triple {3520#true} assume true; {3520#true} is VALID [2022-04-15 09:18:01,944 INFO L290 TraceCheckUtils]: 34: Hoare triple {3520#true} assume !(0 == ~cond); {3520#true} is VALID [2022-04-15 09:18:01,944 INFO L290 TraceCheckUtils]: 33: Hoare triple {3520#true} ~cond := #in~cond; {3520#true} is VALID [2022-04-15 09:18:01,944 INFO L272 TraceCheckUtils]: 32: Hoare triple {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3520#true} is VALID [2022-04-15 09:18:01,944 INFO L290 TraceCheckUtils]: 31: Hoare triple {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} assume !!(#t~post6 < 20);havoc #t~post6; {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 09:18:01,944 INFO L290 TraceCheckUtils]: 30: Hoare triple {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 09:18:01,954 INFO L290 TraceCheckUtils]: 29: Hoare triple {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 09:18:01,955 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3520#true} {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #86#return; {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 09:18:01,955 INFO L290 TraceCheckUtils]: 27: Hoare triple {3520#true} assume true; {3520#true} is VALID [2022-04-15 09:18:01,955 INFO L290 TraceCheckUtils]: 26: Hoare triple {3520#true} assume !(0 == ~cond); {3520#true} is VALID [2022-04-15 09:18:01,955 INFO L290 TraceCheckUtils]: 25: Hoare triple {3520#true} ~cond := #in~cond; {3520#true} is VALID [2022-04-15 09:18:01,955 INFO L272 TraceCheckUtils]: 24: Hoare triple {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {3520#true} is VALID [2022-04-15 09:18:01,956 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3520#true} {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #84#return; {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 09:18:01,956 INFO L290 TraceCheckUtils]: 22: Hoare triple {3520#true} assume true; {3520#true} is VALID [2022-04-15 09:18:01,956 INFO L290 TraceCheckUtils]: 21: Hoare triple {3520#true} assume !(0 == ~cond); {3520#true} is VALID [2022-04-15 09:18:01,956 INFO L290 TraceCheckUtils]: 20: Hoare triple {3520#true} ~cond := #in~cond; {3520#true} is VALID [2022-04-15 09:18:01,956 INFO L272 TraceCheckUtils]: 19: Hoare triple {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {3520#true} is VALID [2022-04-15 09:18:01,959 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3520#true} {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #82#return; {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 09:18:01,960 INFO L290 TraceCheckUtils]: 17: Hoare triple {3520#true} assume true; {3520#true} is VALID [2022-04-15 09:18:01,960 INFO L290 TraceCheckUtils]: 16: Hoare triple {3520#true} assume !(0 == ~cond); {3520#true} is VALID [2022-04-15 09:18:01,960 INFO L290 TraceCheckUtils]: 15: Hoare triple {3520#true} ~cond := #in~cond; {3520#true} is VALID [2022-04-15 09:18:01,960 INFO L272 TraceCheckUtils]: 14: Hoare triple {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3520#true} is VALID [2022-04-15 09:18:01,960 INFO L290 TraceCheckUtils]: 13: Hoare triple {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} assume !!(#t~post6 < 20);havoc #t~post6; {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 09:18:01,960 INFO L290 TraceCheckUtils]: 12: Hoare triple {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 09:18:01,961 INFO L290 TraceCheckUtils]: 11: Hoare triple {3520#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {3676#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 09:18:01,961 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3520#true} {3520#true} #80#return; {3520#true} is VALID [2022-04-15 09:18:01,961 INFO L290 TraceCheckUtils]: 9: Hoare triple {3520#true} assume true; {3520#true} is VALID [2022-04-15 09:18:01,961 INFO L290 TraceCheckUtils]: 8: Hoare triple {3520#true} assume !(0 == ~cond); {3520#true} is VALID [2022-04-15 09:18:01,961 INFO L290 TraceCheckUtils]: 7: Hoare triple {3520#true} ~cond := #in~cond; {3520#true} is VALID [2022-04-15 09:18:01,962 INFO L272 TraceCheckUtils]: 6: Hoare triple {3520#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {3520#true} is VALID [2022-04-15 09:18:01,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {3520#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {3520#true} is VALID [2022-04-15 09:18:01,962 INFO L272 TraceCheckUtils]: 4: Hoare triple {3520#true} call #t~ret8 := main(); {3520#true} is VALID [2022-04-15 09:18:01,962 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3520#true} {3520#true} #96#return; {3520#true} is VALID [2022-04-15 09:18:01,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {3520#true} assume true; {3520#true} is VALID [2022-04-15 09:18:01,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {3520#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3520#true} is VALID [2022-04-15 09:18:01,962 INFO L272 TraceCheckUtils]: 0: Hoare triple {3520#true} call ULTIMATE.init(); {3520#true} is VALID [2022-04-15 09:18:01,962 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-15 09:18:01,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:18:01,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036515961] [2022-04-15 09:18:01,963 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:18:01,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043297450] [2022-04-15 09:18:01,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043297450] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 09:18:01,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 09:18:01,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2022-04-15 09:18:01,963 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:18:01,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [690551347] [2022-04-15 09:18:01,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [690551347] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:18:01,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:18:01,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 09:18:01,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965830292] [2022-04-15 09:18:01,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:18:01,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 46 [2022-04-15 09:18:01,964 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:18:01,964 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 09:18:01,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:18:01,984 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 09:18:01,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:18:01,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 09:18:01,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-15 09:18:01,985 INFO L87 Difference]: Start difference. First operand 71 states and 84 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 09:18:02,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:18:02,243 INFO L93 Difference]: Finished difference Result 84 states and 101 transitions. [2022-04-15 09:18:02,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 09:18:02,244 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 46 [2022-04-15 09:18:02,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:18:02,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 09:18:02,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-15 09:18:02,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 09:18:02,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-15 09:18:02,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2022-04-15 09:18:02,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:18:02,301 INFO L225 Difference]: With dead ends: 84 [2022-04-15 09:18:02,301 INFO L226 Difference]: Without dead ends: 82 [2022-04-15 09:18:02,301 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 81 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-04-15 09:18:02,302 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 11 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 09:18:02,303 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 125 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 09:18:02,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-15 09:18:02,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2022-04-15 09:18:02,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:18:02,346 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 79 states, 50 states have (on average 1.2) internal successors, (60), 53 states have internal predecessors, (60), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 09:18:02,347 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 79 states, 50 states have (on average 1.2) internal successors, (60), 53 states have internal predecessors, (60), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 09:18:02,347 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 79 states, 50 states have (on average 1.2) internal successors, (60), 53 states have internal predecessors, (60), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 09:18:02,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:18:02,358 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2022-04-15 09:18:02,358 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-04-15 09:18:02,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:18:02,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:18:02,359 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 50 states have (on average 1.2) internal successors, (60), 53 states have internal predecessors, (60), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand 82 states. [2022-04-15 09:18:02,359 INFO L87 Difference]: Start difference. First operand has 79 states, 50 states have (on average 1.2) internal successors, (60), 53 states have internal predecessors, (60), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) Second operand 82 states. [2022-04-15 09:18:02,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:18:02,361 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2022-04-15 09:18:02,361 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 99 transitions. [2022-04-15 09:18:02,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:18:02,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:18:02,362 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:18:02,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:18:02,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 50 states have (on average 1.2) internal successors, (60), 53 states have internal predecessors, (60), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 09:18:02,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 94 transitions. [2022-04-15 09:18:02,363 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 94 transitions. Word has length 46 [2022-04-15 09:18:02,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:18:02,364 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 94 transitions. [2022-04-15 09:18:02,364 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 09:18:02,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 94 transitions. [2022-04-15 09:18:02,467 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:18:02,467 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2022-04-15 09:18:02,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 09:18:02,468 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:18:02,468 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:18:02,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 09:18:02,674 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:18:02,675 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:18:02,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:18:02,675 INFO L85 PathProgramCache]: Analyzing trace with hash 967982746, now seen corresponding path program 1 times [2022-04-15 09:18:02,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:18:02,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1280978527] [2022-04-15 09:18:10,780 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:18:10,780 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:18:10,780 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:18:10,780 INFO L85 PathProgramCache]: Analyzing trace with hash 967982746, now seen corresponding path program 2 times [2022-04-15 09:18:10,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:18:10,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004419541] [2022-04-15 09:18:10,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:18:10,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:18:10,789 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:18:10,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [763800276] [2022-04-15 09:18:10,789 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:18:10,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:18:10,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:18:10,790 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:18:10,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 09:18:10,825 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:18:10,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:18:10,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 09:18:10,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:18:10,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:18:11,073 INFO L272 TraceCheckUtils]: 0: Hoare triple {4297#true} call ULTIMATE.init(); {4297#true} is VALID [2022-04-15 09:18:11,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {4297#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4305#(<= ~counter~0 0)} is VALID [2022-04-15 09:18:11,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {4305#(<= ~counter~0 0)} assume true; {4305#(<= ~counter~0 0)} is VALID [2022-04-15 09:18:11,078 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4305#(<= ~counter~0 0)} {4297#true} #96#return; {4305#(<= ~counter~0 0)} is VALID [2022-04-15 09:18:11,079 INFO L272 TraceCheckUtils]: 4: Hoare triple {4305#(<= ~counter~0 0)} call #t~ret8 := main(); {4305#(<= ~counter~0 0)} is VALID [2022-04-15 09:18:11,079 INFO L290 TraceCheckUtils]: 5: Hoare triple {4305#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {4305#(<= ~counter~0 0)} is VALID [2022-04-15 09:18:11,080 INFO L272 TraceCheckUtils]: 6: Hoare triple {4305#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {4305#(<= ~counter~0 0)} is VALID [2022-04-15 09:18:11,080 INFO L290 TraceCheckUtils]: 7: Hoare triple {4305#(<= ~counter~0 0)} ~cond := #in~cond; {4305#(<= ~counter~0 0)} is VALID [2022-04-15 09:18:11,080 INFO L290 TraceCheckUtils]: 8: Hoare triple {4305#(<= ~counter~0 0)} assume !(0 == ~cond); {4305#(<= ~counter~0 0)} is VALID [2022-04-15 09:18:11,080 INFO L290 TraceCheckUtils]: 9: Hoare triple {4305#(<= ~counter~0 0)} assume true; {4305#(<= ~counter~0 0)} is VALID [2022-04-15 09:18:11,081 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4305#(<= ~counter~0 0)} {4305#(<= ~counter~0 0)} #80#return; {4305#(<= ~counter~0 0)} is VALID [2022-04-15 09:18:11,081 INFO L290 TraceCheckUtils]: 11: Hoare triple {4305#(<= ~counter~0 0)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {4305#(<= ~counter~0 0)} is VALID [2022-04-15 09:18:11,082 INFO L290 TraceCheckUtils]: 12: Hoare triple {4305#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4339#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:11,082 INFO L290 TraceCheckUtils]: 13: Hoare triple {4339#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {4339#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:11,082 INFO L272 TraceCheckUtils]: 14: Hoare triple {4339#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4339#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:11,083 INFO L290 TraceCheckUtils]: 15: Hoare triple {4339#(<= ~counter~0 1)} ~cond := #in~cond; {4339#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:11,083 INFO L290 TraceCheckUtils]: 16: Hoare triple {4339#(<= ~counter~0 1)} assume !(0 == ~cond); {4339#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:11,083 INFO L290 TraceCheckUtils]: 17: Hoare triple {4339#(<= ~counter~0 1)} assume true; {4339#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:11,084 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4339#(<= ~counter~0 1)} {4339#(<= ~counter~0 1)} #82#return; {4339#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:11,084 INFO L272 TraceCheckUtils]: 19: Hoare triple {4339#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {4339#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:11,084 INFO L290 TraceCheckUtils]: 20: Hoare triple {4339#(<= ~counter~0 1)} ~cond := #in~cond; {4339#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:11,085 INFO L290 TraceCheckUtils]: 21: Hoare triple {4339#(<= ~counter~0 1)} assume !(0 == ~cond); {4339#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:11,085 INFO L290 TraceCheckUtils]: 22: Hoare triple {4339#(<= ~counter~0 1)} assume true; {4339#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:11,086 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4339#(<= ~counter~0 1)} {4339#(<= ~counter~0 1)} #84#return; {4339#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:11,086 INFO L272 TraceCheckUtils]: 24: Hoare triple {4339#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {4339#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:11,087 INFO L290 TraceCheckUtils]: 25: Hoare triple {4339#(<= ~counter~0 1)} ~cond := #in~cond; {4339#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:11,087 INFO L290 TraceCheckUtils]: 26: Hoare triple {4339#(<= ~counter~0 1)} assume !(0 == ~cond); {4339#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:11,087 INFO L290 TraceCheckUtils]: 27: Hoare triple {4339#(<= ~counter~0 1)} assume true; {4339#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:11,088 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4339#(<= ~counter~0 1)} {4339#(<= ~counter~0 1)} #86#return; {4339#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:11,088 INFO L290 TraceCheckUtils]: 29: Hoare triple {4339#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4339#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:11,089 INFO L290 TraceCheckUtils]: 30: Hoare triple {4339#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4394#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:11,089 INFO L290 TraceCheckUtils]: 31: Hoare triple {4394#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {4394#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:11,089 INFO L272 TraceCheckUtils]: 32: Hoare triple {4394#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4394#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:11,090 INFO L290 TraceCheckUtils]: 33: Hoare triple {4394#(<= ~counter~0 2)} ~cond := #in~cond; {4394#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:11,090 INFO L290 TraceCheckUtils]: 34: Hoare triple {4394#(<= ~counter~0 2)} assume !(0 == ~cond); {4394#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:11,091 INFO L290 TraceCheckUtils]: 35: Hoare triple {4394#(<= ~counter~0 2)} assume true; {4394#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:11,091 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4394#(<= ~counter~0 2)} {4394#(<= ~counter~0 2)} #82#return; {4394#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:11,092 INFO L272 TraceCheckUtils]: 37: Hoare triple {4394#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {4394#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:11,092 INFO L290 TraceCheckUtils]: 38: Hoare triple {4394#(<= ~counter~0 2)} ~cond := #in~cond; {4394#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:11,092 INFO L290 TraceCheckUtils]: 39: Hoare triple {4394#(<= ~counter~0 2)} assume !(0 == ~cond); {4394#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:11,093 INFO L290 TraceCheckUtils]: 40: Hoare triple {4394#(<= ~counter~0 2)} assume true; {4394#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:11,093 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4394#(<= ~counter~0 2)} {4394#(<= ~counter~0 2)} #84#return; {4394#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:11,094 INFO L272 TraceCheckUtils]: 42: Hoare triple {4394#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {4394#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:11,094 INFO L290 TraceCheckUtils]: 43: Hoare triple {4394#(<= ~counter~0 2)} ~cond := #in~cond; {4394#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:11,094 INFO L290 TraceCheckUtils]: 44: Hoare triple {4394#(<= ~counter~0 2)} assume !(0 == ~cond); {4394#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:11,095 INFO L290 TraceCheckUtils]: 45: Hoare triple {4394#(<= ~counter~0 2)} assume true; {4394#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:11,095 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {4394#(<= ~counter~0 2)} {4394#(<= ~counter~0 2)} #86#return; {4394#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:11,096 INFO L290 TraceCheckUtils]: 47: Hoare triple {4394#(<= ~counter~0 2)} assume !(~r~0 >= ~d~0); {4394#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:11,096 INFO L290 TraceCheckUtils]: 48: Hoare triple {4394#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4449#(<= |main_#t~post7| 2)} is VALID [2022-04-15 09:18:11,096 INFO L290 TraceCheckUtils]: 49: Hoare triple {4449#(<= |main_#t~post7| 2)} assume !(#t~post7 < 20);havoc #t~post7; {4298#false} is VALID [2022-04-15 09:18:11,097 INFO L272 TraceCheckUtils]: 50: Hoare triple {4298#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {4298#false} is VALID [2022-04-15 09:18:11,097 INFO L290 TraceCheckUtils]: 51: Hoare triple {4298#false} ~cond := #in~cond; {4298#false} is VALID [2022-04-15 09:18:11,097 INFO L290 TraceCheckUtils]: 52: Hoare triple {4298#false} assume !(0 == ~cond); {4298#false} is VALID [2022-04-15 09:18:11,097 INFO L290 TraceCheckUtils]: 53: Hoare triple {4298#false} assume true; {4298#false} is VALID [2022-04-15 09:18:11,097 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {4298#false} {4298#false} #92#return; {4298#false} is VALID [2022-04-15 09:18:11,097 INFO L272 TraceCheckUtils]: 55: Hoare triple {4298#false} call __VERIFIER_assert((if ~B~0 % 4294967296 == ~d~0 then 1 else 0)); {4298#false} is VALID [2022-04-15 09:18:11,097 INFO L290 TraceCheckUtils]: 56: Hoare triple {4298#false} ~cond := #in~cond; {4298#false} is VALID [2022-04-15 09:18:11,097 INFO L290 TraceCheckUtils]: 57: Hoare triple {4298#false} assume 0 == ~cond; {4298#false} is VALID [2022-04-15 09:18:11,097 INFO L290 TraceCheckUtils]: 58: Hoare triple {4298#false} assume !false; {4298#false} is VALID [2022-04-15 09:18:11,098 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 36 proven. 42 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-15 09:18:11,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:18:11,336 INFO L290 TraceCheckUtils]: 58: Hoare triple {4298#false} assume !false; {4298#false} is VALID [2022-04-15 09:18:11,336 INFO L290 TraceCheckUtils]: 57: Hoare triple {4298#false} assume 0 == ~cond; {4298#false} is VALID [2022-04-15 09:18:11,336 INFO L290 TraceCheckUtils]: 56: Hoare triple {4298#false} ~cond := #in~cond; {4298#false} is VALID [2022-04-15 09:18:11,336 INFO L272 TraceCheckUtils]: 55: Hoare triple {4298#false} call __VERIFIER_assert((if ~B~0 % 4294967296 == ~d~0 then 1 else 0)); {4298#false} is VALID [2022-04-15 09:18:11,336 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {4297#true} {4298#false} #92#return; {4298#false} is VALID [2022-04-15 09:18:11,337 INFO L290 TraceCheckUtils]: 53: Hoare triple {4297#true} assume true; {4297#true} is VALID [2022-04-15 09:18:11,337 INFO L290 TraceCheckUtils]: 52: Hoare triple {4297#true} assume !(0 == ~cond); {4297#true} is VALID [2022-04-15 09:18:11,337 INFO L290 TraceCheckUtils]: 51: Hoare triple {4297#true} ~cond := #in~cond; {4297#true} is VALID [2022-04-15 09:18:11,337 INFO L272 TraceCheckUtils]: 50: Hoare triple {4298#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {4297#true} is VALID [2022-04-15 09:18:11,337 INFO L290 TraceCheckUtils]: 49: Hoare triple {4507#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {4298#false} is VALID [2022-04-15 09:18:11,338 INFO L290 TraceCheckUtils]: 48: Hoare triple {4511#(< ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4507#(< |main_#t~post7| 20)} is VALID [2022-04-15 09:18:11,338 INFO L290 TraceCheckUtils]: 47: Hoare triple {4511#(< ~counter~0 20)} assume !(~r~0 >= ~d~0); {4511#(< ~counter~0 20)} is VALID [2022-04-15 09:18:11,338 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {4297#true} {4511#(< ~counter~0 20)} #86#return; {4511#(< ~counter~0 20)} is VALID [2022-04-15 09:18:11,338 INFO L290 TraceCheckUtils]: 45: Hoare triple {4297#true} assume true; {4297#true} is VALID [2022-04-15 09:18:11,339 INFO L290 TraceCheckUtils]: 44: Hoare triple {4297#true} assume !(0 == ~cond); {4297#true} is VALID [2022-04-15 09:18:11,339 INFO L290 TraceCheckUtils]: 43: Hoare triple {4297#true} ~cond := #in~cond; {4297#true} is VALID [2022-04-15 09:18:11,339 INFO L272 TraceCheckUtils]: 42: Hoare triple {4511#(< ~counter~0 20)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {4297#true} is VALID [2022-04-15 09:18:11,339 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4297#true} {4511#(< ~counter~0 20)} #84#return; {4511#(< ~counter~0 20)} is VALID [2022-04-15 09:18:11,339 INFO L290 TraceCheckUtils]: 40: Hoare triple {4297#true} assume true; {4297#true} is VALID [2022-04-15 09:18:11,339 INFO L290 TraceCheckUtils]: 39: Hoare triple {4297#true} assume !(0 == ~cond); {4297#true} is VALID [2022-04-15 09:18:11,340 INFO L290 TraceCheckUtils]: 38: Hoare triple {4297#true} ~cond := #in~cond; {4297#true} is VALID [2022-04-15 09:18:11,340 INFO L272 TraceCheckUtils]: 37: Hoare triple {4511#(< ~counter~0 20)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {4297#true} is VALID [2022-04-15 09:18:11,340 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {4297#true} {4511#(< ~counter~0 20)} #82#return; {4511#(< ~counter~0 20)} is VALID [2022-04-15 09:18:11,340 INFO L290 TraceCheckUtils]: 35: Hoare triple {4297#true} assume true; {4297#true} is VALID [2022-04-15 09:18:11,340 INFO L290 TraceCheckUtils]: 34: Hoare triple {4297#true} assume !(0 == ~cond); {4297#true} is VALID [2022-04-15 09:18:11,340 INFO L290 TraceCheckUtils]: 33: Hoare triple {4297#true} ~cond := #in~cond; {4297#true} is VALID [2022-04-15 09:18:11,340 INFO L272 TraceCheckUtils]: 32: Hoare triple {4511#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4297#true} is VALID [2022-04-15 09:18:11,341 INFO L290 TraceCheckUtils]: 31: Hoare triple {4511#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {4511#(< ~counter~0 20)} is VALID [2022-04-15 09:18:11,341 INFO L290 TraceCheckUtils]: 30: Hoare triple {4566#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4511#(< ~counter~0 20)} is VALID [2022-04-15 09:18:11,342 INFO L290 TraceCheckUtils]: 29: Hoare triple {4566#(< ~counter~0 19)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4566#(< ~counter~0 19)} is VALID [2022-04-15 09:18:11,342 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4297#true} {4566#(< ~counter~0 19)} #86#return; {4566#(< ~counter~0 19)} is VALID [2022-04-15 09:18:11,342 INFO L290 TraceCheckUtils]: 27: Hoare triple {4297#true} assume true; {4297#true} is VALID [2022-04-15 09:18:11,342 INFO L290 TraceCheckUtils]: 26: Hoare triple {4297#true} assume !(0 == ~cond); {4297#true} is VALID [2022-04-15 09:18:11,342 INFO L290 TraceCheckUtils]: 25: Hoare triple {4297#true} ~cond := #in~cond; {4297#true} is VALID [2022-04-15 09:18:11,342 INFO L272 TraceCheckUtils]: 24: Hoare triple {4566#(< ~counter~0 19)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {4297#true} is VALID [2022-04-15 09:18:11,343 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4297#true} {4566#(< ~counter~0 19)} #84#return; {4566#(< ~counter~0 19)} is VALID [2022-04-15 09:18:11,343 INFO L290 TraceCheckUtils]: 22: Hoare triple {4297#true} assume true; {4297#true} is VALID [2022-04-15 09:18:11,343 INFO L290 TraceCheckUtils]: 21: Hoare triple {4297#true} assume !(0 == ~cond); {4297#true} is VALID [2022-04-15 09:18:11,343 INFO L290 TraceCheckUtils]: 20: Hoare triple {4297#true} ~cond := #in~cond; {4297#true} is VALID [2022-04-15 09:18:11,343 INFO L272 TraceCheckUtils]: 19: Hoare triple {4566#(< ~counter~0 19)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {4297#true} is VALID [2022-04-15 09:18:11,344 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4297#true} {4566#(< ~counter~0 19)} #82#return; {4566#(< ~counter~0 19)} is VALID [2022-04-15 09:18:11,344 INFO L290 TraceCheckUtils]: 17: Hoare triple {4297#true} assume true; {4297#true} is VALID [2022-04-15 09:18:11,344 INFO L290 TraceCheckUtils]: 16: Hoare triple {4297#true} assume !(0 == ~cond); {4297#true} is VALID [2022-04-15 09:18:11,344 INFO L290 TraceCheckUtils]: 15: Hoare triple {4297#true} ~cond := #in~cond; {4297#true} is VALID [2022-04-15 09:18:11,344 INFO L272 TraceCheckUtils]: 14: Hoare triple {4566#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4297#true} is VALID [2022-04-15 09:18:11,344 INFO L290 TraceCheckUtils]: 13: Hoare triple {4566#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {4566#(< ~counter~0 19)} is VALID [2022-04-15 09:18:11,345 INFO L290 TraceCheckUtils]: 12: Hoare triple {4621#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4566#(< ~counter~0 19)} is VALID [2022-04-15 09:18:11,345 INFO L290 TraceCheckUtils]: 11: Hoare triple {4621#(< ~counter~0 18)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {4621#(< ~counter~0 18)} is VALID [2022-04-15 09:18:11,346 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4297#true} {4621#(< ~counter~0 18)} #80#return; {4621#(< ~counter~0 18)} is VALID [2022-04-15 09:18:11,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {4297#true} assume true; {4297#true} is VALID [2022-04-15 09:18:11,346 INFO L290 TraceCheckUtils]: 8: Hoare triple {4297#true} assume !(0 == ~cond); {4297#true} is VALID [2022-04-15 09:18:11,346 INFO L290 TraceCheckUtils]: 7: Hoare triple {4297#true} ~cond := #in~cond; {4297#true} is VALID [2022-04-15 09:18:11,346 INFO L272 TraceCheckUtils]: 6: Hoare triple {4621#(< ~counter~0 18)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {4297#true} is VALID [2022-04-15 09:18:11,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {4621#(< ~counter~0 18)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {4621#(< ~counter~0 18)} is VALID [2022-04-15 09:18:11,354 INFO L272 TraceCheckUtils]: 4: Hoare triple {4621#(< ~counter~0 18)} call #t~ret8 := main(); {4621#(< ~counter~0 18)} is VALID [2022-04-15 09:18:11,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4621#(< ~counter~0 18)} {4297#true} #96#return; {4621#(< ~counter~0 18)} is VALID [2022-04-15 09:18:11,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {4621#(< ~counter~0 18)} assume true; {4621#(< ~counter~0 18)} is VALID [2022-04-15 09:18:11,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {4297#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4621#(< ~counter~0 18)} is VALID [2022-04-15 09:18:11,355 INFO L272 TraceCheckUtils]: 0: Hoare triple {4297#true} call ULTIMATE.init(); {4297#true} is VALID [2022-04-15 09:18:11,356 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-15 09:18:11,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:18:11,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004419541] [2022-04-15 09:18:11,356 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:18:11,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [763800276] [2022-04-15 09:18:11,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [763800276] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:18:11,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:18:11,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-15 09:18:11,356 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:18:11,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1280978527] [2022-04-15 09:18:11,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1280978527] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:18:11,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:18:11,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 09:18:11,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583093822] [2022-04-15 09:18:11,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:18:11,357 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) Word has length 59 [2022-04-15 09:18:11,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:18:11,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-15 09:18:11,388 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:18:11,388 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 09:18:11,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:18:11,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 09:18:11,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-15 09:18:11,388 INFO L87 Difference]: Start difference. First operand 79 states and 94 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-15 09:18:11,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:18:11,557 INFO L93 Difference]: Finished difference Result 110 states and 126 transitions. [2022-04-15 09:18:11,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 09:18:11,557 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) Word has length 59 [2022-04-15 09:18:11,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:18:11,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-15 09:18:11,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2022-04-15 09:18:11,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-15 09:18:11,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 79 transitions. [2022-04-15 09:18:11,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 79 transitions. [2022-04-15 09:18:11,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:18:11,611 INFO L225 Difference]: With dead ends: 110 [2022-04-15 09:18:11,611 INFO L226 Difference]: Without dead ends: 98 [2022-04-15 09:18:11,612 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-15 09:18:11,612 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 14 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 09:18:11,612 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 129 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 09:18:11,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-15 09:18:11,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2022-04-15 09:18:11,666 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:18:11,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 97 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 65 states have internal predecessors, (73), 21 states have call successors, (21), 14 states have call predecessors, (21), 13 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 09:18:11,668 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 97 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 65 states have internal predecessors, (73), 21 states have call successors, (21), 14 states have call predecessors, (21), 13 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 09:18:11,668 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 97 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 65 states have internal predecessors, (73), 21 states have call successors, (21), 14 states have call predecessors, (21), 13 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 09:18:11,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:18:11,670 INFO L93 Difference]: Finished difference Result 98 states and 114 transitions. [2022-04-15 09:18:11,670 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 114 transitions. [2022-04-15 09:18:11,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:18:11,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:18:11,670 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 65 states have internal predecessors, (73), 21 states have call successors, (21), 14 states have call predecessors, (21), 13 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) Second operand 98 states. [2022-04-15 09:18:11,670 INFO L87 Difference]: Start difference. First operand has 97 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 65 states have internal predecessors, (73), 21 states have call successors, (21), 14 states have call predecessors, (21), 13 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) Second operand 98 states. [2022-04-15 09:18:11,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:18:11,673 INFO L93 Difference]: Finished difference Result 98 states and 114 transitions. [2022-04-15 09:18:11,673 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 114 transitions. [2022-04-15 09:18:11,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:18:11,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:18:11,674 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:18:11,674 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:18:11,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 62 states have (on average 1.1774193548387097) internal successors, (73), 65 states have internal predecessors, (73), 21 states have call successors, (21), 14 states have call predecessors, (21), 13 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 09:18:11,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 113 transitions. [2022-04-15 09:18:11,676 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 113 transitions. Word has length 59 [2022-04-15 09:18:11,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:18:11,676 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 113 transitions. [2022-04-15 09:18:11,676 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-15 09:18:11,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 113 transitions. [2022-04-15 09:18:11,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:18:11,791 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 113 transitions. [2022-04-15 09:18:11,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-15 09:18:11,792 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:18:11,792 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:18:11,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-15 09:18:11,992 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:18:11,992 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:18:11,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:18:11,993 INFO L85 PathProgramCache]: Analyzing trace with hash 940283669, now seen corresponding path program 3 times [2022-04-15 09:18:11,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:18:11,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [886666478] [2022-04-15 09:18:22,073 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:18:22,073 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:18:22,073 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:18:22,073 INFO L85 PathProgramCache]: Analyzing trace with hash 940283669, now seen corresponding path program 4 times [2022-04-15 09:18:22,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:18:22,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380288309] [2022-04-15 09:18:22,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:18:22,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:18:22,081 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:18:22,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1539106420] [2022-04-15 09:18:22,082 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 09:18:22,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:18:22,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:18:22,083 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:18:22,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 09:18:22,150 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 09:18:22,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:18:22,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 09:18:22,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:18:22,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:18:22,419 INFO L272 TraceCheckUtils]: 0: Hoare triple {5270#true} call ULTIMATE.init(); {5270#true} is VALID [2022-04-15 09:18:22,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {5270#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5278#(<= ~counter~0 0)} is VALID [2022-04-15 09:18:22,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {5278#(<= ~counter~0 0)} assume true; {5278#(<= ~counter~0 0)} is VALID [2022-04-15 09:18:22,421 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5278#(<= ~counter~0 0)} {5270#true} #96#return; {5278#(<= ~counter~0 0)} is VALID [2022-04-15 09:18:22,422 INFO L272 TraceCheckUtils]: 4: Hoare triple {5278#(<= ~counter~0 0)} call #t~ret8 := main(); {5278#(<= ~counter~0 0)} is VALID [2022-04-15 09:18:22,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {5278#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {5278#(<= ~counter~0 0)} is VALID [2022-04-15 09:18:22,423 INFO L272 TraceCheckUtils]: 6: Hoare triple {5278#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {5278#(<= ~counter~0 0)} is VALID [2022-04-15 09:18:22,423 INFO L290 TraceCheckUtils]: 7: Hoare triple {5278#(<= ~counter~0 0)} ~cond := #in~cond; {5278#(<= ~counter~0 0)} is VALID [2022-04-15 09:18:22,424 INFO L290 TraceCheckUtils]: 8: Hoare triple {5278#(<= ~counter~0 0)} assume !(0 == ~cond); {5278#(<= ~counter~0 0)} is VALID [2022-04-15 09:18:22,425 INFO L290 TraceCheckUtils]: 9: Hoare triple {5278#(<= ~counter~0 0)} assume true; {5278#(<= ~counter~0 0)} is VALID [2022-04-15 09:18:22,426 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5278#(<= ~counter~0 0)} {5278#(<= ~counter~0 0)} #80#return; {5278#(<= ~counter~0 0)} is VALID [2022-04-15 09:18:22,426 INFO L290 TraceCheckUtils]: 11: Hoare triple {5278#(<= ~counter~0 0)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {5278#(<= ~counter~0 0)} is VALID [2022-04-15 09:18:22,426 INFO L290 TraceCheckUtils]: 12: Hoare triple {5278#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5312#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:22,427 INFO L290 TraceCheckUtils]: 13: Hoare triple {5312#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {5312#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:22,431 INFO L272 TraceCheckUtils]: 14: Hoare triple {5312#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5312#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:22,432 INFO L290 TraceCheckUtils]: 15: Hoare triple {5312#(<= ~counter~0 1)} ~cond := #in~cond; {5312#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:22,432 INFO L290 TraceCheckUtils]: 16: Hoare triple {5312#(<= ~counter~0 1)} assume !(0 == ~cond); {5312#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:22,432 INFO L290 TraceCheckUtils]: 17: Hoare triple {5312#(<= ~counter~0 1)} assume true; {5312#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:22,433 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5312#(<= ~counter~0 1)} {5312#(<= ~counter~0 1)} #82#return; {5312#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:22,433 INFO L272 TraceCheckUtils]: 19: Hoare triple {5312#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {5312#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:22,433 INFO L290 TraceCheckUtils]: 20: Hoare triple {5312#(<= ~counter~0 1)} ~cond := #in~cond; {5312#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:22,434 INFO L290 TraceCheckUtils]: 21: Hoare triple {5312#(<= ~counter~0 1)} assume !(0 == ~cond); {5312#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:22,434 INFO L290 TraceCheckUtils]: 22: Hoare triple {5312#(<= ~counter~0 1)} assume true; {5312#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:22,434 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5312#(<= ~counter~0 1)} {5312#(<= ~counter~0 1)} #84#return; {5312#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:22,435 INFO L272 TraceCheckUtils]: 24: Hoare triple {5312#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {5312#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:22,435 INFO L290 TraceCheckUtils]: 25: Hoare triple {5312#(<= ~counter~0 1)} ~cond := #in~cond; {5312#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:22,435 INFO L290 TraceCheckUtils]: 26: Hoare triple {5312#(<= ~counter~0 1)} assume !(0 == ~cond); {5312#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:22,436 INFO L290 TraceCheckUtils]: 27: Hoare triple {5312#(<= ~counter~0 1)} assume true; {5312#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:22,436 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5312#(<= ~counter~0 1)} {5312#(<= ~counter~0 1)} #86#return; {5312#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:22,437 INFO L290 TraceCheckUtils]: 29: Hoare triple {5312#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {5312#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:22,437 INFO L290 TraceCheckUtils]: 30: Hoare triple {5312#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5367#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:22,437 INFO L290 TraceCheckUtils]: 31: Hoare triple {5367#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {5367#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:22,438 INFO L272 TraceCheckUtils]: 32: Hoare triple {5367#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5367#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:22,438 INFO L290 TraceCheckUtils]: 33: Hoare triple {5367#(<= ~counter~0 2)} ~cond := #in~cond; {5367#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:22,438 INFO L290 TraceCheckUtils]: 34: Hoare triple {5367#(<= ~counter~0 2)} assume !(0 == ~cond); {5367#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:22,439 INFO L290 TraceCheckUtils]: 35: Hoare triple {5367#(<= ~counter~0 2)} assume true; {5367#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:22,439 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5367#(<= ~counter~0 2)} {5367#(<= ~counter~0 2)} #82#return; {5367#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:22,439 INFO L272 TraceCheckUtils]: 37: Hoare triple {5367#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {5367#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:22,440 INFO L290 TraceCheckUtils]: 38: Hoare triple {5367#(<= ~counter~0 2)} ~cond := #in~cond; {5367#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:22,440 INFO L290 TraceCheckUtils]: 39: Hoare triple {5367#(<= ~counter~0 2)} assume !(0 == ~cond); {5367#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:22,440 INFO L290 TraceCheckUtils]: 40: Hoare triple {5367#(<= ~counter~0 2)} assume true; {5367#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:22,441 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5367#(<= ~counter~0 2)} {5367#(<= ~counter~0 2)} #84#return; {5367#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:22,441 INFO L272 TraceCheckUtils]: 42: Hoare triple {5367#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {5367#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:22,441 INFO L290 TraceCheckUtils]: 43: Hoare triple {5367#(<= ~counter~0 2)} ~cond := #in~cond; {5367#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:22,442 INFO L290 TraceCheckUtils]: 44: Hoare triple {5367#(<= ~counter~0 2)} assume !(0 == ~cond); {5367#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:22,442 INFO L290 TraceCheckUtils]: 45: Hoare triple {5367#(<= ~counter~0 2)} assume true; {5367#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:22,442 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {5367#(<= ~counter~0 2)} {5367#(<= ~counter~0 2)} #86#return; {5367#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:22,443 INFO L290 TraceCheckUtils]: 47: Hoare triple {5367#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {5367#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:22,443 INFO L290 TraceCheckUtils]: 48: Hoare triple {5367#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5422#(<= |main_#t~post6| 2)} is VALID [2022-04-15 09:18:22,443 INFO L290 TraceCheckUtils]: 49: Hoare triple {5422#(<= |main_#t~post6| 2)} assume !(#t~post6 < 20);havoc #t~post6; {5271#false} is VALID [2022-04-15 09:18:22,444 INFO L290 TraceCheckUtils]: 50: Hoare triple {5271#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5271#false} is VALID [2022-04-15 09:18:22,444 INFO L290 TraceCheckUtils]: 51: Hoare triple {5271#false} assume !(#t~post7 < 20);havoc #t~post7; {5271#false} is VALID [2022-04-15 09:18:22,444 INFO L272 TraceCheckUtils]: 52: Hoare triple {5271#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {5271#false} is VALID [2022-04-15 09:18:22,444 INFO L290 TraceCheckUtils]: 53: Hoare triple {5271#false} ~cond := #in~cond; {5271#false} is VALID [2022-04-15 09:18:22,444 INFO L290 TraceCheckUtils]: 54: Hoare triple {5271#false} assume !(0 == ~cond); {5271#false} is VALID [2022-04-15 09:18:22,444 INFO L290 TraceCheckUtils]: 55: Hoare triple {5271#false} assume true; {5271#false} is VALID [2022-04-15 09:18:22,444 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {5271#false} {5271#false} #92#return; {5271#false} is VALID [2022-04-15 09:18:22,444 INFO L272 TraceCheckUtils]: 57: Hoare triple {5271#false} call __VERIFIER_assert((if ~B~0 % 4294967296 == ~d~0 then 1 else 0)); {5271#false} is VALID [2022-04-15 09:18:22,444 INFO L290 TraceCheckUtils]: 58: Hoare triple {5271#false} ~cond := #in~cond; {5271#false} is VALID [2022-04-15 09:18:22,444 INFO L290 TraceCheckUtils]: 59: Hoare triple {5271#false} assume 0 == ~cond; {5271#false} is VALID [2022-04-15 09:18:22,445 INFO L290 TraceCheckUtils]: 60: Hoare triple {5271#false} assume !false; {5271#false} is VALID [2022-04-15 09:18:22,445 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 36 proven. 46 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-15 09:18:22,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:18:22,659 INFO L290 TraceCheckUtils]: 60: Hoare triple {5271#false} assume !false; {5271#false} is VALID [2022-04-15 09:18:22,660 INFO L290 TraceCheckUtils]: 59: Hoare triple {5271#false} assume 0 == ~cond; {5271#false} is VALID [2022-04-15 09:18:22,660 INFO L290 TraceCheckUtils]: 58: Hoare triple {5271#false} ~cond := #in~cond; {5271#false} is VALID [2022-04-15 09:18:22,660 INFO L272 TraceCheckUtils]: 57: Hoare triple {5271#false} call __VERIFIER_assert((if ~B~0 % 4294967296 == ~d~0 then 1 else 0)); {5271#false} is VALID [2022-04-15 09:18:22,660 INFO L284 TraceCheckUtils]: 56: Hoare quadruple {5270#true} {5271#false} #92#return; {5271#false} is VALID [2022-04-15 09:18:22,660 INFO L290 TraceCheckUtils]: 55: Hoare triple {5270#true} assume true; {5270#true} is VALID [2022-04-15 09:18:22,660 INFO L290 TraceCheckUtils]: 54: Hoare triple {5270#true} assume !(0 == ~cond); {5270#true} is VALID [2022-04-15 09:18:22,660 INFO L290 TraceCheckUtils]: 53: Hoare triple {5270#true} ~cond := #in~cond; {5270#true} is VALID [2022-04-15 09:18:22,660 INFO L272 TraceCheckUtils]: 52: Hoare triple {5271#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {5270#true} is VALID [2022-04-15 09:18:22,660 INFO L290 TraceCheckUtils]: 51: Hoare triple {5271#false} assume !(#t~post7 < 20);havoc #t~post7; {5271#false} is VALID [2022-04-15 09:18:22,660 INFO L290 TraceCheckUtils]: 50: Hoare triple {5271#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5271#false} is VALID [2022-04-15 09:18:22,661 INFO L290 TraceCheckUtils]: 49: Hoare triple {5492#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {5271#false} is VALID [2022-04-15 09:18:22,661 INFO L290 TraceCheckUtils]: 48: Hoare triple {5496#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5492#(< |main_#t~post6| 20)} is VALID [2022-04-15 09:18:22,661 INFO L290 TraceCheckUtils]: 47: Hoare triple {5496#(< ~counter~0 20)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {5496#(< ~counter~0 20)} is VALID [2022-04-15 09:18:22,662 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {5270#true} {5496#(< ~counter~0 20)} #86#return; {5496#(< ~counter~0 20)} is VALID [2022-04-15 09:18:22,662 INFO L290 TraceCheckUtils]: 45: Hoare triple {5270#true} assume true; {5270#true} is VALID [2022-04-15 09:18:22,662 INFO L290 TraceCheckUtils]: 44: Hoare triple {5270#true} assume !(0 == ~cond); {5270#true} is VALID [2022-04-15 09:18:22,662 INFO L290 TraceCheckUtils]: 43: Hoare triple {5270#true} ~cond := #in~cond; {5270#true} is VALID [2022-04-15 09:18:22,662 INFO L272 TraceCheckUtils]: 42: Hoare triple {5496#(< ~counter~0 20)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {5270#true} is VALID [2022-04-15 09:18:22,663 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5270#true} {5496#(< ~counter~0 20)} #84#return; {5496#(< ~counter~0 20)} is VALID [2022-04-15 09:18:22,663 INFO L290 TraceCheckUtils]: 40: Hoare triple {5270#true} assume true; {5270#true} is VALID [2022-04-15 09:18:22,663 INFO L290 TraceCheckUtils]: 39: Hoare triple {5270#true} assume !(0 == ~cond); {5270#true} is VALID [2022-04-15 09:18:22,663 INFO L290 TraceCheckUtils]: 38: Hoare triple {5270#true} ~cond := #in~cond; {5270#true} is VALID [2022-04-15 09:18:22,663 INFO L272 TraceCheckUtils]: 37: Hoare triple {5496#(< ~counter~0 20)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {5270#true} is VALID [2022-04-15 09:18:22,664 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {5270#true} {5496#(< ~counter~0 20)} #82#return; {5496#(< ~counter~0 20)} is VALID [2022-04-15 09:18:22,664 INFO L290 TraceCheckUtils]: 35: Hoare triple {5270#true} assume true; {5270#true} is VALID [2022-04-15 09:18:22,664 INFO L290 TraceCheckUtils]: 34: Hoare triple {5270#true} assume !(0 == ~cond); {5270#true} is VALID [2022-04-15 09:18:22,664 INFO L290 TraceCheckUtils]: 33: Hoare triple {5270#true} ~cond := #in~cond; {5270#true} is VALID [2022-04-15 09:18:22,664 INFO L272 TraceCheckUtils]: 32: Hoare triple {5496#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5270#true} is VALID [2022-04-15 09:18:22,664 INFO L290 TraceCheckUtils]: 31: Hoare triple {5496#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {5496#(< ~counter~0 20)} is VALID [2022-04-15 09:18:22,665 INFO L290 TraceCheckUtils]: 30: Hoare triple {5551#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5496#(< ~counter~0 20)} is VALID [2022-04-15 09:18:22,665 INFO L290 TraceCheckUtils]: 29: Hoare triple {5551#(< ~counter~0 19)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {5551#(< ~counter~0 19)} is VALID [2022-04-15 09:18:22,666 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5270#true} {5551#(< ~counter~0 19)} #86#return; {5551#(< ~counter~0 19)} is VALID [2022-04-15 09:18:22,666 INFO L290 TraceCheckUtils]: 27: Hoare triple {5270#true} assume true; {5270#true} is VALID [2022-04-15 09:18:22,666 INFO L290 TraceCheckUtils]: 26: Hoare triple {5270#true} assume !(0 == ~cond); {5270#true} is VALID [2022-04-15 09:18:22,666 INFO L290 TraceCheckUtils]: 25: Hoare triple {5270#true} ~cond := #in~cond; {5270#true} is VALID [2022-04-15 09:18:22,666 INFO L272 TraceCheckUtils]: 24: Hoare triple {5551#(< ~counter~0 19)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {5270#true} is VALID [2022-04-15 09:18:22,667 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5270#true} {5551#(< ~counter~0 19)} #84#return; {5551#(< ~counter~0 19)} is VALID [2022-04-15 09:18:22,667 INFO L290 TraceCheckUtils]: 22: Hoare triple {5270#true} assume true; {5270#true} is VALID [2022-04-15 09:18:22,667 INFO L290 TraceCheckUtils]: 21: Hoare triple {5270#true} assume !(0 == ~cond); {5270#true} is VALID [2022-04-15 09:18:22,667 INFO L290 TraceCheckUtils]: 20: Hoare triple {5270#true} ~cond := #in~cond; {5270#true} is VALID [2022-04-15 09:18:22,667 INFO L272 TraceCheckUtils]: 19: Hoare triple {5551#(< ~counter~0 19)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {5270#true} is VALID [2022-04-15 09:18:22,667 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5270#true} {5551#(< ~counter~0 19)} #82#return; {5551#(< ~counter~0 19)} is VALID [2022-04-15 09:18:22,668 INFO L290 TraceCheckUtils]: 17: Hoare triple {5270#true} assume true; {5270#true} is VALID [2022-04-15 09:18:22,668 INFO L290 TraceCheckUtils]: 16: Hoare triple {5270#true} assume !(0 == ~cond); {5270#true} is VALID [2022-04-15 09:18:22,668 INFO L290 TraceCheckUtils]: 15: Hoare triple {5270#true} ~cond := #in~cond; {5270#true} is VALID [2022-04-15 09:18:22,668 INFO L272 TraceCheckUtils]: 14: Hoare triple {5551#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5270#true} is VALID [2022-04-15 09:18:22,668 INFO L290 TraceCheckUtils]: 13: Hoare triple {5551#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {5551#(< ~counter~0 19)} is VALID [2022-04-15 09:18:22,669 INFO L290 TraceCheckUtils]: 12: Hoare triple {5606#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5551#(< ~counter~0 19)} is VALID [2022-04-15 09:18:22,669 INFO L290 TraceCheckUtils]: 11: Hoare triple {5606#(< ~counter~0 18)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {5606#(< ~counter~0 18)} is VALID [2022-04-15 09:18:22,669 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5270#true} {5606#(< ~counter~0 18)} #80#return; {5606#(< ~counter~0 18)} is VALID [2022-04-15 09:18:22,669 INFO L290 TraceCheckUtils]: 9: Hoare triple {5270#true} assume true; {5270#true} is VALID [2022-04-15 09:18:22,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {5270#true} assume !(0 == ~cond); {5270#true} is VALID [2022-04-15 09:18:22,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {5270#true} ~cond := #in~cond; {5270#true} is VALID [2022-04-15 09:18:22,670 INFO L272 TraceCheckUtils]: 6: Hoare triple {5606#(< ~counter~0 18)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {5270#true} is VALID [2022-04-15 09:18:22,670 INFO L290 TraceCheckUtils]: 5: Hoare triple {5606#(< ~counter~0 18)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {5606#(< ~counter~0 18)} is VALID [2022-04-15 09:18:22,670 INFO L272 TraceCheckUtils]: 4: Hoare triple {5606#(< ~counter~0 18)} call #t~ret8 := main(); {5606#(< ~counter~0 18)} is VALID [2022-04-15 09:18:22,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5606#(< ~counter~0 18)} {5270#true} #96#return; {5606#(< ~counter~0 18)} is VALID [2022-04-15 09:18:22,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {5606#(< ~counter~0 18)} assume true; {5606#(< ~counter~0 18)} is VALID [2022-04-15 09:18:22,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {5270#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5606#(< ~counter~0 18)} is VALID [2022-04-15 09:18:22,671 INFO L272 TraceCheckUtils]: 0: Hoare triple {5270#true} call ULTIMATE.init(); {5270#true} is VALID [2022-04-15 09:18:22,672 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-15 09:18:22,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:18:22,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380288309] [2022-04-15 09:18:22,672 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:18:22,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539106420] [2022-04-15 09:18:22,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539106420] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:18:22,672 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:18:22,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-15 09:18:22,673 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:18:22,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [886666478] [2022-04-15 09:18:22,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [886666478] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:18:22,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:18:22,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 09:18:22,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908527689] [2022-04-15 09:18:22,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:18:22,673 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) Word has length 61 [2022-04-15 09:18:22,674 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:18:22,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-15 09:18:22,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:18:22,705 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 09:18:22,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:18:22,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 09:18:22,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-15 09:18:22,706 INFO L87 Difference]: Start difference. First operand 97 states and 113 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-15 09:18:22,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:18:22,876 INFO L93 Difference]: Finished difference Result 132 states and 161 transitions. [2022-04-15 09:18:22,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 09:18:22,876 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) Word has length 61 [2022-04-15 09:18:22,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:18:22,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-15 09:18:22,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2022-04-15 09:18:22,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-15 09:18:22,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 90 transitions. [2022-04-15 09:18:22,879 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 90 transitions. [2022-04-15 09:18:22,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:18:22,939 INFO L225 Difference]: With dead ends: 132 [2022-04-15 09:18:22,939 INFO L226 Difference]: Without dead ends: 99 [2022-04-15 09:18:22,940 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-15 09:18:22,940 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 7 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 09:18:22,940 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 146 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 09:18:22,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-04-15 09:18:22,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-04-15 09:18:22,998 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:18:22,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 99 states, 64 states have (on average 1.171875) internal successors, (75), 67 states have internal predecessors, (75), 21 states have call successors, (21), 14 states have call predecessors, (21), 13 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 09:18:22,998 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 99 states, 64 states have (on average 1.171875) internal successors, (75), 67 states have internal predecessors, (75), 21 states have call successors, (21), 14 states have call predecessors, (21), 13 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 09:18:22,998 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 99 states, 64 states have (on average 1.171875) internal successors, (75), 67 states have internal predecessors, (75), 21 states have call successors, (21), 14 states have call predecessors, (21), 13 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 09:18:23,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:18:23,000 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2022-04-15 09:18:23,000 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2022-04-15 09:18:23,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:18:23,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:18:23,001 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 64 states have (on average 1.171875) internal successors, (75), 67 states have internal predecessors, (75), 21 states have call successors, (21), 14 states have call predecessors, (21), 13 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) Second operand 99 states. [2022-04-15 09:18:23,001 INFO L87 Difference]: Start difference. First operand has 99 states, 64 states have (on average 1.171875) internal successors, (75), 67 states have internal predecessors, (75), 21 states have call successors, (21), 14 states have call predecessors, (21), 13 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) Second operand 99 states. [2022-04-15 09:18:23,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:18:23,003 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2022-04-15 09:18:23,003 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2022-04-15 09:18:23,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:18:23,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:18:23,003 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:18:23,003 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:18:23,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 64 states have (on average 1.171875) internal successors, (75), 67 states have internal predecessors, (75), 21 states have call successors, (21), 14 states have call predecessors, (21), 13 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 09:18:23,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 115 transitions. [2022-04-15 09:18:23,005 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 115 transitions. Word has length 61 [2022-04-15 09:18:23,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:18:23,005 INFO L478 AbstractCegarLoop]: Abstraction has 99 states and 115 transitions. [2022-04-15 09:18:23,005 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 5 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2022-04-15 09:18:23,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 99 states and 115 transitions. [2022-04-15 09:18:23,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:18:23,112 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 115 transitions. [2022-04-15 09:18:23,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-15 09:18:23,113 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:18:23,113 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:18:23,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-15 09:18:23,313 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-15 09:18:23,314 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:18:23,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:18:23,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1140868055, now seen corresponding path program 1 times [2022-04-15 09:18:23,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:18:23,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [958201969] [2022-04-15 09:18:33,307 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:18:33,308 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:18:33,308 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:18:33,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1140868055, now seen corresponding path program 2 times [2022-04-15 09:18:33,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:18:33,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488792622] [2022-04-15 09:18:33,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:18:33,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:18:33,321 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:18:33,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1452243466] [2022-04-15 09:18:33,321 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:18:33,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:18:33,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:18:33,334 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:18:33,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-15 09:18:33,378 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:18:33,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:18:33,379 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 09:18:33,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:18:33,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:18:33,718 INFO L272 TraceCheckUtils]: 0: Hoare triple {6309#true} call ULTIMATE.init(); {6309#true} is VALID [2022-04-15 09:18:33,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {6309#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6317#(<= ~counter~0 0)} is VALID [2022-04-15 09:18:33,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {6317#(<= ~counter~0 0)} assume true; {6317#(<= ~counter~0 0)} is VALID [2022-04-15 09:18:33,720 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6317#(<= ~counter~0 0)} {6309#true} #96#return; {6317#(<= ~counter~0 0)} is VALID [2022-04-15 09:18:33,720 INFO L272 TraceCheckUtils]: 4: Hoare triple {6317#(<= ~counter~0 0)} call #t~ret8 := main(); {6317#(<= ~counter~0 0)} is VALID [2022-04-15 09:18:33,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {6317#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {6317#(<= ~counter~0 0)} is VALID [2022-04-15 09:18:33,721 INFO L272 TraceCheckUtils]: 6: Hoare triple {6317#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {6317#(<= ~counter~0 0)} is VALID [2022-04-15 09:18:33,721 INFO L290 TraceCheckUtils]: 7: Hoare triple {6317#(<= ~counter~0 0)} ~cond := #in~cond; {6317#(<= ~counter~0 0)} is VALID [2022-04-15 09:18:33,722 INFO L290 TraceCheckUtils]: 8: Hoare triple {6317#(<= ~counter~0 0)} assume !(0 == ~cond); {6317#(<= ~counter~0 0)} is VALID [2022-04-15 09:18:33,722 INFO L290 TraceCheckUtils]: 9: Hoare triple {6317#(<= ~counter~0 0)} assume true; {6317#(<= ~counter~0 0)} is VALID [2022-04-15 09:18:33,723 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6317#(<= ~counter~0 0)} {6317#(<= ~counter~0 0)} #80#return; {6317#(<= ~counter~0 0)} is VALID [2022-04-15 09:18:33,723 INFO L290 TraceCheckUtils]: 11: Hoare triple {6317#(<= ~counter~0 0)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {6317#(<= ~counter~0 0)} is VALID [2022-04-15 09:18:33,724 INFO L290 TraceCheckUtils]: 12: Hoare triple {6317#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6351#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:33,724 INFO L290 TraceCheckUtils]: 13: Hoare triple {6351#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {6351#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:33,725 INFO L272 TraceCheckUtils]: 14: Hoare triple {6351#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6351#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:33,725 INFO L290 TraceCheckUtils]: 15: Hoare triple {6351#(<= ~counter~0 1)} ~cond := #in~cond; {6351#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:33,726 INFO L290 TraceCheckUtils]: 16: Hoare triple {6351#(<= ~counter~0 1)} assume !(0 == ~cond); {6351#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:33,726 INFO L290 TraceCheckUtils]: 17: Hoare triple {6351#(<= ~counter~0 1)} assume true; {6351#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:33,727 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6351#(<= ~counter~0 1)} {6351#(<= ~counter~0 1)} #82#return; {6351#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:33,727 INFO L272 TraceCheckUtils]: 19: Hoare triple {6351#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {6351#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:33,728 INFO L290 TraceCheckUtils]: 20: Hoare triple {6351#(<= ~counter~0 1)} ~cond := #in~cond; {6351#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:33,728 INFO L290 TraceCheckUtils]: 21: Hoare triple {6351#(<= ~counter~0 1)} assume !(0 == ~cond); {6351#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:33,728 INFO L290 TraceCheckUtils]: 22: Hoare triple {6351#(<= ~counter~0 1)} assume true; {6351#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:33,729 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6351#(<= ~counter~0 1)} {6351#(<= ~counter~0 1)} #84#return; {6351#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:33,730 INFO L272 TraceCheckUtils]: 24: Hoare triple {6351#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {6351#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:33,730 INFO L290 TraceCheckUtils]: 25: Hoare triple {6351#(<= ~counter~0 1)} ~cond := #in~cond; {6351#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:33,730 INFO L290 TraceCheckUtils]: 26: Hoare triple {6351#(<= ~counter~0 1)} assume !(0 == ~cond); {6351#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:33,731 INFO L290 TraceCheckUtils]: 27: Hoare triple {6351#(<= ~counter~0 1)} assume true; {6351#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:33,731 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6351#(<= ~counter~0 1)} {6351#(<= ~counter~0 1)} #86#return; {6351#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:33,732 INFO L290 TraceCheckUtils]: 29: Hoare triple {6351#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {6351#(<= ~counter~0 1)} is VALID [2022-04-15 09:18:33,732 INFO L290 TraceCheckUtils]: 30: Hoare triple {6351#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6406#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:33,733 INFO L290 TraceCheckUtils]: 31: Hoare triple {6406#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {6406#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:33,733 INFO L272 TraceCheckUtils]: 32: Hoare triple {6406#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6406#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:33,734 INFO L290 TraceCheckUtils]: 33: Hoare triple {6406#(<= ~counter~0 2)} ~cond := #in~cond; {6406#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:33,734 INFO L290 TraceCheckUtils]: 34: Hoare triple {6406#(<= ~counter~0 2)} assume !(0 == ~cond); {6406#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:33,734 INFO L290 TraceCheckUtils]: 35: Hoare triple {6406#(<= ~counter~0 2)} assume true; {6406#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:33,735 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6406#(<= ~counter~0 2)} {6406#(<= ~counter~0 2)} #82#return; {6406#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:33,735 INFO L272 TraceCheckUtils]: 37: Hoare triple {6406#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {6406#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:33,736 INFO L290 TraceCheckUtils]: 38: Hoare triple {6406#(<= ~counter~0 2)} ~cond := #in~cond; {6406#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:33,736 INFO L290 TraceCheckUtils]: 39: Hoare triple {6406#(<= ~counter~0 2)} assume !(0 == ~cond); {6406#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:33,736 INFO L290 TraceCheckUtils]: 40: Hoare triple {6406#(<= ~counter~0 2)} assume true; {6406#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:33,737 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6406#(<= ~counter~0 2)} {6406#(<= ~counter~0 2)} #84#return; {6406#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:33,738 INFO L272 TraceCheckUtils]: 42: Hoare triple {6406#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {6406#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:33,738 INFO L290 TraceCheckUtils]: 43: Hoare triple {6406#(<= ~counter~0 2)} ~cond := #in~cond; {6406#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:33,738 INFO L290 TraceCheckUtils]: 44: Hoare triple {6406#(<= ~counter~0 2)} assume !(0 == ~cond); {6406#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:33,739 INFO L290 TraceCheckUtils]: 45: Hoare triple {6406#(<= ~counter~0 2)} assume true; {6406#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:33,739 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {6406#(<= ~counter~0 2)} {6406#(<= ~counter~0 2)} #86#return; {6406#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:33,740 INFO L290 TraceCheckUtils]: 47: Hoare triple {6406#(<= ~counter~0 2)} assume !(~r~0 >= ~d~0); {6406#(<= ~counter~0 2)} is VALID [2022-04-15 09:18:33,740 INFO L290 TraceCheckUtils]: 48: Hoare triple {6406#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6461#(<= ~counter~0 3)} is VALID [2022-04-15 09:18:33,740 INFO L290 TraceCheckUtils]: 49: Hoare triple {6461#(<= ~counter~0 3)} assume !!(#t~post7 < 20);havoc #t~post7; {6461#(<= ~counter~0 3)} is VALID [2022-04-15 09:18:33,741 INFO L272 TraceCheckUtils]: 50: Hoare triple {6461#(<= ~counter~0 3)} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {6461#(<= ~counter~0 3)} is VALID [2022-04-15 09:18:33,741 INFO L290 TraceCheckUtils]: 51: Hoare triple {6461#(<= ~counter~0 3)} ~cond := #in~cond; {6461#(<= ~counter~0 3)} is VALID [2022-04-15 09:18:33,742 INFO L290 TraceCheckUtils]: 52: Hoare triple {6461#(<= ~counter~0 3)} assume !(0 == ~cond); {6461#(<= ~counter~0 3)} is VALID [2022-04-15 09:18:33,742 INFO L290 TraceCheckUtils]: 53: Hoare triple {6461#(<= ~counter~0 3)} assume true; {6461#(<= ~counter~0 3)} is VALID [2022-04-15 09:18:33,742 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {6461#(<= ~counter~0 3)} {6461#(<= ~counter~0 3)} #88#return; {6461#(<= ~counter~0 3)} is VALID [2022-04-15 09:18:33,743 INFO L272 TraceCheckUtils]: 55: Hoare triple {6461#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {6461#(<= ~counter~0 3)} is VALID [2022-04-15 09:18:33,743 INFO L290 TraceCheckUtils]: 56: Hoare triple {6461#(<= ~counter~0 3)} ~cond := #in~cond; {6461#(<= ~counter~0 3)} is VALID [2022-04-15 09:18:33,744 INFO L290 TraceCheckUtils]: 57: Hoare triple {6461#(<= ~counter~0 3)} assume !(0 == ~cond); {6461#(<= ~counter~0 3)} is VALID [2022-04-15 09:18:33,744 INFO L290 TraceCheckUtils]: 58: Hoare triple {6461#(<= ~counter~0 3)} assume true; {6461#(<= ~counter~0 3)} is VALID [2022-04-15 09:18:33,744 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6461#(<= ~counter~0 3)} {6461#(<= ~counter~0 3)} #90#return; {6461#(<= ~counter~0 3)} is VALID [2022-04-15 09:18:33,745 INFO L290 TraceCheckUtils]: 60: Hoare triple {6461#(<= ~counter~0 3)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {6461#(<= ~counter~0 3)} is VALID [2022-04-15 09:18:33,745 INFO L290 TraceCheckUtils]: 61: Hoare triple {6461#(<= ~counter~0 3)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {6461#(<= ~counter~0 3)} is VALID [2022-04-15 09:18:33,745 INFO L290 TraceCheckUtils]: 62: Hoare triple {6461#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6504#(<= |main_#t~post7| 3)} is VALID [2022-04-15 09:18:33,746 INFO L290 TraceCheckUtils]: 63: Hoare triple {6504#(<= |main_#t~post7| 3)} assume !(#t~post7 < 20);havoc #t~post7; {6310#false} is VALID [2022-04-15 09:18:33,746 INFO L272 TraceCheckUtils]: 64: Hoare triple {6310#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {6310#false} is VALID [2022-04-15 09:18:33,746 INFO L290 TraceCheckUtils]: 65: Hoare triple {6310#false} ~cond := #in~cond; {6310#false} is VALID [2022-04-15 09:18:33,746 INFO L290 TraceCheckUtils]: 66: Hoare triple {6310#false} assume 0 == ~cond; {6310#false} is VALID [2022-04-15 09:18:33,746 INFO L290 TraceCheckUtils]: 67: Hoare triple {6310#false} assume !false; {6310#false} is VALID [2022-04-15 09:18:33,747 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 16 proven. 92 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 09:18:33,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:18:34,026 INFO L290 TraceCheckUtils]: 67: Hoare triple {6310#false} assume !false; {6310#false} is VALID [2022-04-15 09:18:34,026 INFO L290 TraceCheckUtils]: 66: Hoare triple {6310#false} assume 0 == ~cond; {6310#false} is VALID [2022-04-15 09:18:34,026 INFO L290 TraceCheckUtils]: 65: Hoare triple {6310#false} ~cond := #in~cond; {6310#false} is VALID [2022-04-15 09:18:34,026 INFO L272 TraceCheckUtils]: 64: Hoare triple {6310#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {6310#false} is VALID [2022-04-15 09:18:34,027 INFO L290 TraceCheckUtils]: 63: Hoare triple {6532#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {6310#false} is VALID [2022-04-15 09:18:34,027 INFO L290 TraceCheckUtils]: 62: Hoare triple {6536#(< ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6532#(< |main_#t~post7| 20)} is VALID [2022-04-15 09:18:34,027 INFO L290 TraceCheckUtils]: 61: Hoare triple {6536#(< ~counter~0 20)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {6536#(< ~counter~0 20)} is VALID [2022-04-15 09:18:34,028 INFO L290 TraceCheckUtils]: 60: Hoare triple {6536#(< ~counter~0 20)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {6536#(< ~counter~0 20)} is VALID [2022-04-15 09:18:34,028 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6309#true} {6536#(< ~counter~0 20)} #90#return; {6536#(< ~counter~0 20)} is VALID [2022-04-15 09:18:34,028 INFO L290 TraceCheckUtils]: 58: Hoare triple {6309#true} assume true; {6309#true} is VALID [2022-04-15 09:18:34,028 INFO L290 TraceCheckUtils]: 57: Hoare triple {6309#true} assume !(0 == ~cond); {6309#true} is VALID [2022-04-15 09:18:34,028 INFO L290 TraceCheckUtils]: 56: Hoare triple {6309#true} ~cond := #in~cond; {6309#true} is VALID [2022-04-15 09:18:34,028 INFO L272 TraceCheckUtils]: 55: Hoare triple {6536#(< ~counter~0 20)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {6309#true} is VALID [2022-04-15 09:18:34,029 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {6309#true} {6536#(< ~counter~0 20)} #88#return; {6536#(< ~counter~0 20)} is VALID [2022-04-15 09:18:34,029 INFO L290 TraceCheckUtils]: 53: Hoare triple {6309#true} assume true; {6309#true} is VALID [2022-04-15 09:18:34,029 INFO L290 TraceCheckUtils]: 52: Hoare triple {6309#true} assume !(0 == ~cond); {6309#true} is VALID [2022-04-15 09:18:34,029 INFO L290 TraceCheckUtils]: 51: Hoare triple {6309#true} ~cond := #in~cond; {6309#true} is VALID [2022-04-15 09:18:34,029 INFO L272 TraceCheckUtils]: 50: Hoare triple {6536#(< ~counter~0 20)} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {6309#true} is VALID [2022-04-15 09:18:34,030 INFO L290 TraceCheckUtils]: 49: Hoare triple {6536#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {6536#(< ~counter~0 20)} is VALID [2022-04-15 09:18:34,030 INFO L290 TraceCheckUtils]: 48: Hoare triple {6579#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6536#(< ~counter~0 20)} is VALID [2022-04-15 09:18:34,030 INFO L290 TraceCheckUtils]: 47: Hoare triple {6579#(< ~counter~0 19)} assume !(~r~0 >= ~d~0); {6579#(< ~counter~0 19)} is VALID [2022-04-15 09:18:34,031 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {6309#true} {6579#(< ~counter~0 19)} #86#return; {6579#(< ~counter~0 19)} is VALID [2022-04-15 09:18:34,031 INFO L290 TraceCheckUtils]: 45: Hoare triple {6309#true} assume true; {6309#true} is VALID [2022-04-15 09:18:34,031 INFO L290 TraceCheckUtils]: 44: Hoare triple {6309#true} assume !(0 == ~cond); {6309#true} is VALID [2022-04-15 09:18:34,031 INFO L290 TraceCheckUtils]: 43: Hoare triple {6309#true} ~cond := #in~cond; {6309#true} is VALID [2022-04-15 09:18:34,031 INFO L272 TraceCheckUtils]: 42: Hoare triple {6579#(< ~counter~0 19)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {6309#true} is VALID [2022-04-15 09:18:34,041 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6309#true} {6579#(< ~counter~0 19)} #84#return; {6579#(< ~counter~0 19)} is VALID [2022-04-15 09:18:34,041 INFO L290 TraceCheckUtils]: 40: Hoare triple {6309#true} assume true; {6309#true} is VALID [2022-04-15 09:18:34,041 INFO L290 TraceCheckUtils]: 39: Hoare triple {6309#true} assume !(0 == ~cond); {6309#true} is VALID [2022-04-15 09:18:34,041 INFO L290 TraceCheckUtils]: 38: Hoare triple {6309#true} ~cond := #in~cond; {6309#true} is VALID [2022-04-15 09:18:34,041 INFO L272 TraceCheckUtils]: 37: Hoare triple {6579#(< ~counter~0 19)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {6309#true} is VALID [2022-04-15 09:18:34,042 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6309#true} {6579#(< ~counter~0 19)} #82#return; {6579#(< ~counter~0 19)} is VALID [2022-04-15 09:18:34,042 INFO L290 TraceCheckUtils]: 35: Hoare triple {6309#true} assume true; {6309#true} is VALID [2022-04-15 09:18:34,042 INFO L290 TraceCheckUtils]: 34: Hoare triple {6309#true} assume !(0 == ~cond); {6309#true} is VALID [2022-04-15 09:18:34,042 INFO L290 TraceCheckUtils]: 33: Hoare triple {6309#true} ~cond := #in~cond; {6309#true} is VALID [2022-04-15 09:18:34,042 INFO L272 TraceCheckUtils]: 32: Hoare triple {6579#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6309#true} is VALID [2022-04-15 09:18:34,043 INFO L290 TraceCheckUtils]: 31: Hoare triple {6579#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {6579#(< ~counter~0 19)} is VALID [2022-04-15 09:18:34,043 INFO L290 TraceCheckUtils]: 30: Hoare triple {6634#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6579#(< ~counter~0 19)} is VALID [2022-04-15 09:18:34,043 INFO L290 TraceCheckUtils]: 29: Hoare triple {6634#(< ~counter~0 18)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {6634#(< ~counter~0 18)} is VALID [2022-04-15 09:18:34,044 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6309#true} {6634#(< ~counter~0 18)} #86#return; {6634#(< ~counter~0 18)} is VALID [2022-04-15 09:18:34,044 INFO L290 TraceCheckUtils]: 27: Hoare triple {6309#true} assume true; {6309#true} is VALID [2022-04-15 09:18:34,044 INFO L290 TraceCheckUtils]: 26: Hoare triple {6309#true} assume !(0 == ~cond); {6309#true} is VALID [2022-04-15 09:18:34,044 INFO L290 TraceCheckUtils]: 25: Hoare triple {6309#true} ~cond := #in~cond; {6309#true} is VALID [2022-04-15 09:18:34,044 INFO L272 TraceCheckUtils]: 24: Hoare triple {6634#(< ~counter~0 18)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {6309#true} is VALID [2022-04-15 09:18:34,045 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6309#true} {6634#(< ~counter~0 18)} #84#return; {6634#(< ~counter~0 18)} is VALID [2022-04-15 09:18:34,045 INFO L290 TraceCheckUtils]: 22: Hoare triple {6309#true} assume true; {6309#true} is VALID [2022-04-15 09:18:34,045 INFO L290 TraceCheckUtils]: 21: Hoare triple {6309#true} assume !(0 == ~cond); {6309#true} is VALID [2022-04-15 09:18:34,045 INFO L290 TraceCheckUtils]: 20: Hoare triple {6309#true} ~cond := #in~cond; {6309#true} is VALID [2022-04-15 09:18:34,045 INFO L272 TraceCheckUtils]: 19: Hoare triple {6634#(< ~counter~0 18)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {6309#true} is VALID [2022-04-15 09:18:34,045 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6309#true} {6634#(< ~counter~0 18)} #82#return; {6634#(< ~counter~0 18)} is VALID [2022-04-15 09:18:34,045 INFO L290 TraceCheckUtils]: 17: Hoare triple {6309#true} assume true; {6309#true} is VALID [2022-04-15 09:18:34,046 INFO L290 TraceCheckUtils]: 16: Hoare triple {6309#true} assume !(0 == ~cond); {6309#true} is VALID [2022-04-15 09:18:34,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {6309#true} ~cond := #in~cond; {6309#true} is VALID [2022-04-15 09:18:34,046 INFO L272 TraceCheckUtils]: 14: Hoare triple {6634#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6309#true} is VALID [2022-04-15 09:18:34,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {6634#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {6634#(< ~counter~0 18)} is VALID [2022-04-15 09:18:34,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {6689#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6634#(< ~counter~0 18)} is VALID [2022-04-15 09:18:34,047 INFO L290 TraceCheckUtils]: 11: Hoare triple {6689#(< ~counter~0 17)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {6689#(< ~counter~0 17)} is VALID [2022-04-15 09:18:34,047 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6309#true} {6689#(< ~counter~0 17)} #80#return; {6689#(< ~counter~0 17)} is VALID [2022-04-15 09:18:34,047 INFO L290 TraceCheckUtils]: 9: Hoare triple {6309#true} assume true; {6309#true} is VALID [2022-04-15 09:18:34,047 INFO L290 TraceCheckUtils]: 8: Hoare triple {6309#true} assume !(0 == ~cond); {6309#true} is VALID [2022-04-15 09:18:34,048 INFO L290 TraceCheckUtils]: 7: Hoare triple {6309#true} ~cond := #in~cond; {6309#true} is VALID [2022-04-15 09:18:34,048 INFO L272 TraceCheckUtils]: 6: Hoare triple {6689#(< ~counter~0 17)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {6309#true} is VALID [2022-04-15 09:18:34,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {6689#(< ~counter~0 17)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {6689#(< ~counter~0 17)} is VALID [2022-04-15 09:18:34,048 INFO L272 TraceCheckUtils]: 4: Hoare triple {6689#(< ~counter~0 17)} call #t~ret8 := main(); {6689#(< ~counter~0 17)} is VALID [2022-04-15 09:18:34,049 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6689#(< ~counter~0 17)} {6309#true} #96#return; {6689#(< ~counter~0 17)} is VALID [2022-04-15 09:18:34,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {6689#(< ~counter~0 17)} assume true; {6689#(< ~counter~0 17)} is VALID [2022-04-15 09:18:34,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {6309#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6689#(< ~counter~0 17)} is VALID [2022-04-15 09:18:34,049 INFO L272 TraceCheckUtils]: 0: Hoare triple {6309#true} call ULTIMATE.init(); {6309#true} is VALID [2022-04-15 09:18:34,050 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-15 09:18:34,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:18:34,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488792622] [2022-04-15 09:18:34,050 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:18:34,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452243466] [2022-04-15 09:18:34,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452243466] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:18:34,050 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:18:34,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-15 09:18:34,051 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:18:34,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [958201969] [2022-04-15 09:18:34,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [958201969] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:18:34,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:18:34,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 09:18:34,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154251044] [2022-04-15 09:18:34,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:18:34,051 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 6 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 68 [2022-04-15 09:18:34,052 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:18:34,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 6 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-15 09:18:34,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:18:34,086 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 09:18:34,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:18:34,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 09:18:34,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-15 09:18:34,087 INFO L87 Difference]: Start difference. First operand 99 states and 115 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 6 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-15 09:18:34,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:18:34,383 INFO L93 Difference]: Finished difference Result 151 states and 174 transitions. [2022-04-15 09:18:34,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 09:18:34,383 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 6 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) Word has length 68 [2022-04-15 09:18:34,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:18:34,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 6 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-15 09:18:34,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2022-04-15 09:18:34,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 6 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-15 09:18:34,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 107 transitions. [2022-04-15 09:18:34,386 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 107 transitions. [2022-04-15 09:18:34,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:18:34,461 INFO L225 Difference]: With dead ends: 151 [2022-04-15 09:18:34,461 INFO L226 Difference]: Without dead ends: 136 [2022-04-15 09:18:34,461 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2022-04-15 09:18:34,461 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 41 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 09:18:34,462 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 174 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 09:18:34,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-04-15 09:18:34,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 133. [2022-04-15 09:18:34,546 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:18:34,546 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand has 133 states, 87 states have (on average 1.160919540229885) internal successors, (101), 90 states have internal predecessors, (101), 28 states have call successors, (28), 19 states have call predecessors, (28), 17 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-15 09:18:34,546 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand has 133 states, 87 states have (on average 1.160919540229885) internal successors, (101), 90 states have internal predecessors, (101), 28 states have call successors, (28), 19 states have call predecessors, (28), 17 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-15 09:18:34,546 INFO L87 Difference]: Start difference. First operand 136 states. Second operand has 133 states, 87 states have (on average 1.160919540229885) internal successors, (101), 90 states have internal predecessors, (101), 28 states have call successors, (28), 19 states have call predecessors, (28), 17 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-15 09:18:34,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:18:34,549 INFO L93 Difference]: Finished difference Result 136 states and 156 transitions. [2022-04-15 09:18:34,549 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 156 transitions. [2022-04-15 09:18:34,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:18:34,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:18:34,549 INFO L74 IsIncluded]: Start isIncluded. First operand has 133 states, 87 states have (on average 1.160919540229885) internal successors, (101), 90 states have internal predecessors, (101), 28 states have call successors, (28), 19 states have call predecessors, (28), 17 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) Second operand 136 states. [2022-04-15 09:18:34,550 INFO L87 Difference]: Start difference. First operand has 133 states, 87 states have (on average 1.160919540229885) internal successors, (101), 90 states have internal predecessors, (101), 28 states have call successors, (28), 19 states have call predecessors, (28), 17 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) Second operand 136 states. [2022-04-15 09:18:34,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:18:34,552 INFO L93 Difference]: Finished difference Result 136 states and 156 transitions. [2022-04-15 09:18:34,552 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 156 transitions. [2022-04-15 09:18:34,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:18:34,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:18:34,552 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:18:34,552 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:18:34,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 87 states have (on average 1.160919540229885) internal successors, (101), 90 states have internal predecessors, (101), 28 states have call successors, (28), 19 states have call predecessors, (28), 17 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-15 09:18:34,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 154 transitions. [2022-04-15 09:18:34,554 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 154 transitions. Word has length 68 [2022-04-15 09:18:34,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:18:34,555 INFO L478 AbstractCegarLoop]: Abstraction has 133 states and 154 transitions. [2022-04-15 09:18:34,555 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 6 states have internal predecessors, (31), 6 states have call successors, (12), 6 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-15 09:18:34,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 133 states and 154 transitions. [2022-04-15 09:18:34,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:18:34,698 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 154 transitions. [2022-04-15 09:18:34,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-15 09:18:34,698 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:18:34,698 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:18:34,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-15 09:18:34,914 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:18:34,915 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:18:34,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:18:34,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1142595933, now seen corresponding path program 1 times [2022-04-15 09:18:34,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:18:34,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1151308788] [2022-04-15 09:18:41,851 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:18:41,851 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:18:41,851 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:18:41,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1142595933, now seen corresponding path program 2 times [2022-04-15 09:18:41,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:18:41,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165712202] [2022-04-15 09:18:41,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:18:41,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:18:41,864 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:18:41,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [401950042] [2022-04-15 09:18:41,864 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:18:41,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:18:41,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:18:41,872 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:18:41,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-15 09:18:41,922 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:18:41,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:18:41,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 09:18:41,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:18:41,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:18:45,784 INFO L272 TraceCheckUtils]: 0: Hoare triple {7570#true} call ULTIMATE.init(); {7570#true} is VALID [2022-04-15 09:18:45,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {7570#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7570#true} is VALID [2022-04-15 09:18:45,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {7570#true} assume true; {7570#true} is VALID [2022-04-15 09:18:45,784 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7570#true} {7570#true} #96#return; {7570#true} is VALID [2022-04-15 09:18:45,784 INFO L272 TraceCheckUtils]: 4: Hoare triple {7570#true} call #t~ret8 := main(); {7570#true} is VALID [2022-04-15 09:18:45,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {7570#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {7570#true} is VALID [2022-04-15 09:18:45,785 INFO L272 TraceCheckUtils]: 6: Hoare triple {7570#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {7570#true} is VALID [2022-04-15 09:18:45,785 INFO L290 TraceCheckUtils]: 7: Hoare triple {7570#true} ~cond := #in~cond; {7570#true} is VALID [2022-04-15 09:18:45,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {7570#true} assume !(0 == ~cond); {7570#true} is VALID [2022-04-15 09:18:45,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {7570#true} assume true; {7570#true} is VALID [2022-04-15 09:18:45,785 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7570#true} {7570#true} #80#return; {7570#true} is VALID [2022-04-15 09:18:45,786 INFO L290 TraceCheckUtils]: 11: Hoare triple {7570#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {7608#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 09:18:45,786 INFO L290 TraceCheckUtils]: 12: Hoare triple {7608#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7608#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 09:18:45,786 INFO L290 TraceCheckUtils]: 13: Hoare triple {7608#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {7608#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 09:18:45,786 INFO L272 TraceCheckUtils]: 14: Hoare triple {7608#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {7570#true} is VALID [2022-04-15 09:18:45,787 INFO L290 TraceCheckUtils]: 15: Hoare triple {7570#true} ~cond := #in~cond; {7570#true} is VALID [2022-04-15 09:18:45,787 INFO L290 TraceCheckUtils]: 16: Hoare triple {7570#true} assume !(0 == ~cond); {7570#true} is VALID [2022-04-15 09:18:45,787 INFO L290 TraceCheckUtils]: 17: Hoare triple {7570#true} assume true; {7570#true} is VALID [2022-04-15 09:18:45,787 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7570#true} {7608#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} #82#return; {7608#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 09:18:45,787 INFO L272 TraceCheckUtils]: 19: Hoare triple {7608#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {7570#true} is VALID [2022-04-15 09:18:45,788 INFO L290 TraceCheckUtils]: 20: Hoare triple {7570#true} ~cond := #in~cond; {7570#true} is VALID [2022-04-15 09:18:45,788 INFO L290 TraceCheckUtils]: 21: Hoare triple {7570#true} assume !(0 == ~cond); {7570#true} is VALID [2022-04-15 09:18:45,788 INFO L290 TraceCheckUtils]: 22: Hoare triple {7570#true} assume true; {7570#true} is VALID [2022-04-15 09:18:45,788 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7570#true} {7608#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} #84#return; {7608#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 09:18:45,788 INFO L272 TraceCheckUtils]: 24: Hoare triple {7608#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {7570#true} is VALID [2022-04-15 09:18:45,789 INFO L290 TraceCheckUtils]: 25: Hoare triple {7570#true} ~cond := #in~cond; {7570#true} is VALID [2022-04-15 09:18:45,789 INFO L290 TraceCheckUtils]: 26: Hoare triple {7570#true} assume !(0 == ~cond); {7570#true} is VALID [2022-04-15 09:18:45,789 INFO L290 TraceCheckUtils]: 27: Hoare triple {7570#true} assume true; {7570#true} is VALID [2022-04-15 09:18:45,789 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7570#true} {7608#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} #86#return; {7608#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 09:18:45,790 INFO L290 TraceCheckUtils]: 29: Hoare triple {7608#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {7663#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-15 09:18:45,791 INFO L290 TraceCheckUtils]: 30: Hoare triple {7663#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7663#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-15 09:18:45,791 INFO L290 TraceCheckUtils]: 31: Hoare triple {7663#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} assume !!(#t~post6 < 20);havoc #t~post6; {7663#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-15 09:18:45,791 INFO L272 TraceCheckUtils]: 32: Hoare triple {7663#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {7570#true} is VALID [2022-04-15 09:18:45,791 INFO L290 TraceCheckUtils]: 33: Hoare triple {7570#true} ~cond := #in~cond; {7570#true} is VALID [2022-04-15 09:18:45,791 INFO L290 TraceCheckUtils]: 34: Hoare triple {7570#true} assume !(0 == ~cond); {7570#true} is VALID [2022-04-15 09:18:45,791 INFO L290 TraceCheckUtils]: 35: Hoare triple {7570#true} assume true; {7570#true} is VALID [2022-04-15 09:18:45,792 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7570#true} {7663#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} #82#return; {7663#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-15 09:18:45,792 INFO L272 TraceCheckUtils]: 37: Hoare triple {7663#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {7570#true} is VALID [2022-04-15 09:18:45,792 INFO L290 TraceCheckUtils]: 38: Hoare triple {7570#true} ~cond := #in~cond; {7570#true} is VALID [2022-04-15 09:18:45,792 INFO L290 TraceCheckUtils]: 39: Hoare triple {7570#true} assume !(0 == ~cond); {7570#true} is VALID [2022-04-15 09:18:45,792 INFO L290 TraceCheckUtils]: 40: Hoare triple {7570#true} assume true; {7570#true} is VALID [2022-04-15 09:18:45,793 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7570#true} {7663#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} #84#return; {7663#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-15 09:18:45,793 INFO L272 TraceCheckUtils]: 42: Hoare triple {7663#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {7570#true} is VALID [2022-04-15 09:18:45,793 INFO L290 TraceCheckUtils]: 43: Hoare triple {7570#true} ~cond := #in~cond; {7570#true} is VALID [2022-04-15 09:18:45,793 INFO L290 TraceCheckUtils]: 44: Hoare triple {7570#true} assume !(0 == ~cond); {7570#true} is VALID [2022-04-15 09:18:45,793 INFO L290 TraceCheckUtils]: 45: Hoare triple {7570#true} assume true; {7570#true} is VALID [2022-04-15 09:18:45,794 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {7570#true} {7663#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} #86#return; {7663#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-15 09:18:45,794 INFO L290 TraceCheckUtils]: 47: Hoare triple {7663#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} assume !(~r~0 >= ~d~0); {7718#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-15 09:18:45,795 INFO L290 TraceCheckUtils]: 48: Hoare triple {7718#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7718#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-15 09:18:45,795 INFO L290 TraceCheckUtils]: 49: Hoare triple {7718#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} assume !!(#t~post7 < 20);havoc #t~post7; {7718#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-15 09:18:45,796 INFO L272 TraceCheckUtils]: 50: Hoare triple {7718#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {7570#true} is VALID [2022-04-15 09:18:45,796 INFO L290 TraceCheckUtils]: 51: Hoare triple {7570#true} ~cond := #in~cond; {7570#true} is VALID [2022-04-15 09:18:45,796 INFO L290 TraceCheckUtils]: 52: Hoare triple {7570#true} assume !(0 == ~cond); {7570#true} is VALID [2022-04-15 09:18:45,796 INFO L290 TraceCheckUtils]: 53: Hoare triple {7570#true} assume true; {7570#true} is VALID [2022-04-15 09:18:45,796 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {7570#true} {7718#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} #88#return; {7718#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-15 09:18:45,797 INFO L272 TraceCheckUtils]: 55: Hoare triple {7718#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {7570#true} is VALID [2022-04-15 09:18:45,797 INFO L290 TraceCheckUtils]: 56: Hoare triple {7570#true} ~cond := #in~cond; {7570#true} is VALID [2022-04-15 09:18:45,797 INFO L290 TraceCheckUtils]: 57: Hoare triple {7570#true} assume !(0 == ~cond); {7570#true} is VALID [2022-04-15 09:18:45,797 INFO L290 TraceCheckUtils]: 58: Hoare triple {7570#true} assume true; {7570#true} is VALID [2022-04-15 09:18:45,797 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7570#true} {7718#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} #90#return; {7718#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-15 09:18:45,798 INFO L290 TraceCheckUtils]: 60: Hoare triple {7718#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (<= (mod main_~B~0 4294967296) main_~r~0))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {7758#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (not (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0)) (<= (mod main_~B~0 4294967296) main_~r~0) (= main_~p~0 1))} is VALID [2022-04-15 09:18:45,799 INFO L290 TraceCheckUtils]: 61: Hoare triple {7758#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (not (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0)) (<= (mod main_~B~0 4294967296) main_~r~0) (= main_~p~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {7762#(and (not (<= (* 2 (mod main_~B~0 4294967296)) (mod main_~A~0 4294967296))) (<= (mod main_~B~0 4294967296) (mod main_~A~0 4294967296)) (= (+ (* (- 1) (div (* 2 (mod main_~B~0 4294967296)) 2)) (mod main_~A~0 4294967296)) main_~r~0) (= main_~q~0 1))} is VALID [2022-04-15 09:18:45,800 INFO L290 TraceCheckUtils]: 62: Hoare triple {7762#(and (not (<= (* 2 (mod main_~B~0 4294967296)) (mod main_~A~0 4294967296))) (<= (mod main_~B~0 4294967296) (mod main_~A~0 4294967296)) (= (+ (* (- 1) (div (* 2 (mod main_~B~0 4294967296)) 2)) (mod main_~A~0 4294967296)) main_~r~0) (= main_~q~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7762#(and (not (<= (* 2 (mod main_~B~0 4294967296)) (mod main_~A~0 4294967296))) (<= (mod main_~B~0 4294967296) (mod main_~A~0 4294967296)) (= (+ (* (- 1) (div (* 2 (mod main_~B~0 4294967296)) 2)) (mod main_~A~0 4294967296)) main_~r~0) (= main_~q~0 1))} is VALID [2022-04-15 09:18:45,800 INFO L290 TraceCheckUtils]: 63: Hoare triple {7762#(and (not (<= (* 2 (mod main_~B~0 4294967296)) (mod main_~A~0 4294967296))) (<= (mod main_~B~0 4294967296) (mod main_~A~0 4294967296)) (= (+ (* (- 1) (div (* 2 (mod main_~B~0 4294967296)) 2)) (mod main_~A~0 4294967296)) main_~r~0) (= main_~q~0 1))} assume !!(#t~post7 < 20);havoc #t~post7; {7762#(and (not (<= (* 2 (mod main_~B~0 4294967296)) (mod main_~A~0 4294967296))) (<= (mod main_~B~0 4294967296) (mod main_~A~0 4294967296)) (= (+ (* (- 1) (div (* 2 (mod main_~B~0 4294967296)) 2)) (mod main_~A~0 4294967296)) main_~r~0) (= main_~q~0 1))} is VALID [2022-04-15 09:18:45,801 INFO L272 TraceCheckUtils]: 64: Hoare triple {7762#(and (not (<= (* 2 (mod main_~B~0 4294967296)) (mod main_~A~0 4294967296))) (<= (mod main_~B~0 4294967296) (mod main_~A~0 4294967296)) (= (+ (* (- 1) (div (* 2 (mod main_~B~0 4294967296)) 2)) (mod main_~A~0 4294967296)) main_~r~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {7772#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 09:18:45,801 INFO L290 TraceCheckUtils]: 65: Hoare triple {7772#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7776#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:18:45,802 INFO L290 TraceCheckUtils]: 66: Hoare triple {7776#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7571#false} is VALID [2022-04-15 09:18:45,802 INFO L290 TraceCheckUtils]: 67: Hoare triple {7571#false} assume !false; {7571#false} is VALID [2022-04-15 09:18:45,802 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-15 09:18:45,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:18:53,323 INFO L290 TraceCheckUtils]: 67: Hoare triple {7571#false} assume !false; {7571#false} is VALID [2022-04-15 09:18:53,324 INFO L290 TraceCheckUtils]: 66: Hoare triple {7776#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7571#false} is VALID [2022-04-15 09:18:53,324 INFO L290 TraceCheckUtils]: 65: Hoare triple {7772#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7776#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:18:53,325 INFO L272 TraceCheckUtils]: 64: Hoare triple {7792#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {7772#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 09:18:53,325 INFO L290 TraceCheckUtils]: 63: Hoare triple {7792#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} assume !!(#t~post7 < 20);havoc #t~post7; {7792#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-15 09:18:53,325 INFO L290 TraceCheckUtils]: 62: Hoare triple {7792#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7792#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-15 09:18:53,327 INFO L290 TraceCheckUtils]: 61: Hoare triple {7802#(= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) (* (+ main_~q~0 main_~p~0) (mod main_~B~0 4294967296)) main_~r~0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {7792#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-15 09:18:53,336 INFO L290 TraceCheckUtils]: 60: Hoare triple {7806#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {7802#(= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) (* (+ main_~q~0 main_~p~0) (mod main_~B~0 4294967296)) main_~r~0))} is VALID [2022-04-15 09:18:53,337 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7570#true} {7806#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} #90#return; {7806#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-15 09:18:53,337 INFO L290 TraceCheckUtils]: 58: Hoare triple {7570#true} assume true; {7570#true} is VALID [2022-04-15 09:18:53,337 INFO L290 TraceCheckUtils]: 57: Hoare triple {7570#true} assume !(0 == ~cond); {7570#true} is VALID [2022-04-15 09:18:53,337 INFO L290 TraceCheckUtils]: 56: Hoare triple {7570#true} ~cond := #in~cond; {7570#true} is VALID [2022-04-15 09:18:53,337 INFO L272 TraceCheckUtils]: 55: Hoare triple {7806#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {7570#true} is VALID [2022-04-15 09:18:53,338 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {7570#true} {7806#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} #88#return; {7806#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-15 09:18:53,338 INFO L290 TraceCheckUtils]: 53: Hoare triple {7570#true} assume true; {7570#true} is VALID [2022-04-15 09:18:53,338 INFO L290 TraceCheckUtils]: 52: Hoare triple {7570#true} assume !(0 == ~cond); {7570#true} is VALID [2022-04-15 09:18:53,338 INFO L290 TraceCheckUtils]: 51: Hoare triple {7570#true} ~cond := #in~cond; {7570#true} is VALID [2022-04-15 09:18:53,338 INFO L272 TraceCheckUtils]: 50: Hoare triple {7806#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {7570#true} is VALID [2022-04-15 09:18:53,339 INFO L290 TraceCheckUtils]: 49: Hoare triple {7806#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} assume !!(#t~post7 < 20);havoc #t~post7; {7806#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-15 09:18:53,340 INFO L290 TraceCheckUtils]: 48: Hoare triple {7806#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7806#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-15 09:18:53,341 INFO L290 TraceCheckUtils]: 47: Hoare triple {7846#(or (and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (<= main_~d~0 main_~r~0))} assume !(~r~0 >= ~d~0); {7806#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-15 09:18:53,342 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {7570#true} {7846#(or (and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (<= main_~d~0 main_~r~0))} #86#return; {7846#(or (and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 09:18:53,342 INFO L290 TraceCheckUtils]: 45: Hoare triple {7570#true} assume true; {7570#true} is VALID [2022-04-15 09:18:53,342 INFO L290 TraceCheckUtils]: 44: Hoare triple {7570#true} assume !(0 == ~cond); {7570#true} is VALID [2022-04-15 09:18:53,342 INFO L290 TraceCheckUtils]: 43: Hoare triple {7570#true} ~cond := #in~cond; {7570#true} is VALID [2022-04-15 09:18:53,342 INFO L272 TraceCheckUtils]: 42: Hoare triple {7846#(or (and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {7570#true} is VALID [2022-04-15 09:18:53,343 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7570#true} {7846#(or (and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (<= main_~d~0 main_~r~0))} #84#return; {7846#(or (and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 09:18:53,343 INFO L290 TraceCheckUtils]: 40: Hoare triple {7570#true} assume true; {7570#true} is VALID [2022-04-15 09:18:53,343 INFO L290 TraceCheckUtils]: 39: Hoare triple {7570#true} assume !(0 == ~cond); {7570#true} is VALID [2022-04-15 09:18:53,343 INFO L290 TraceCheckUtils]: 38: Hoare triple {7570#true} ~cond := #in~cond; {7570#true} is VALID [2022-04-15 09:18:53,343 INFO L272 TraceCheckUtils]: 37: Hoare triple {7846#(or (and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {7570#true} is VALID [2022-04-15 09:18:53,344 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7570#true} {7846#(or (and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (<= main_~d~0 main_~r~0))} #82#return; {7846#(or (and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 09:18:53,344 INFO L290 TraceCheckUtils]: 35: Hoare triple {7570#true} assume true; {7570#true} is VALID [2022-04-15 09:18:53,344 INFO L290 TraceCheckUtils]: 34: Hoare triple {7570#true} assume !(0 == ~cond); {7570#true} is VALID [2022-04-15 09:18:53,344 INFO L290 TraceCheckUtils]: 33: Hoare triple {7570#true} ~cond := #in~cond; {7570#true} is VALID [2022-04-15 09:18:53,344 INFO L272 TraceCheckUtils]: 32: Hoare triple {7846#(or (and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {7570#true} is VALID [2022-04-15 09:18:53,345 INFO L290 TraceCheckUtils]: 31: Hoare triple {7846#(or (and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (<= main_~d~0 main_~r~0))} assume !!(#t~post6 < 20);havoc #t~post6; {7846#(or (and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 09:18:53,346 INFO L290 TraceCheckUtils]: 30: Hoare triple {7846#(or (and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (<= main_~d~0 main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7846#(or (and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 09:18:53,349 INFO L290 TraceCheckUtils]: 29: Hoare triple {7901#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {7846#(or (and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 09:18:53,350 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7570#true} {7901#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} #86#return; {7901#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} is VALID [2022-04-15 09:18:53,350 INFO L290 TraceCheckUtils]: 27: Hoare triple {7570#true} assume true; {7570#true} is VALID [2022-04-15 09:18:53,350 INFO L290 TraceCheckUtils]: 26: Hoare triple {7570#true} assume !(0 == ~cond); {7570#true} is VALID [2022-04-15 09:18:53,350 INFO L290 TraceCheckUtils]: 25: Hoare triple {7570#true} ~cond := #in~cond; {7570#true} is VALID [2022-04-15 09:18:53,350 INFO L272 TraceCheckUtils]: 24: Hoare triple {7901#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {7570#true} is VALID [2022-04-15 09:18:53,351 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7570#true} {7901#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} #84#return; {7901#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} is VALID [2022-04-15 09:18:53,351 INFO L290 TraceCheckUtils]: 22: Hoare triple {7570#true} assume true; {7570#true} is VALID [2022-04-15 09:18:53,351 INFO L290 TraceCheckUtils]: 21: Hoare triple {7570#true} assume !(0 == ~cond); {7570#true} is VALID [2022-04-15 09:18:53,351 INFO L290 TraceCheckUtils]: 20: Hoare triple {7570#true} ~cond := #in~cond; {7570#true} is VALID [2022-04-15 09:18:53,351 INFO L272 TraceCheckUtils]: 19: Hoare triple {7901#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {7570#true} is VALID [2022-04-15 09:18:53,352 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7570#true} {7901#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} #82#return; {7901#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} is VALID [2022-04-15 09:18:53,352 INFO L290 TraceCheckUtils]: 17: Hoare triple {7570#true} assume true; {7570#true} is VALID [2022-04-15 09:18:53,352 INFO L290 TraceCheckUtils]: 16: Hoare triple {7570#true} assume !(0 == ~cond); {7570#true} is VALID [2022-04-15 09:18:53,352 INFO L290 TraceCheckUtils]: 15: Hoare triple {7570#true} ~cond := #in~cond; {7570#true} is VALID [2022-04-15 09:18:53,352 INFO L272 TraceCheckUtils]: 14: Hoare triple {7901#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {7570#true} is VALID [2022-04-15 09:18:53,353 INFO L290 TraceCheckUtils]: 13: Hoare triple {7901#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} assume !!(#t~post6 < 20);havoc #t~post6; {7901#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} is VALID [2022-04-15 09:18:53,353 INFO L290 TraceCheckUtils]: 12: Hoare triple {7901#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7901#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} is VALID [2022-04-15 09:18:53,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {7570#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {7901#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} is VALID [2022-04-15 09:18:53,354 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7570#true} {7570#true} #80#return; {7570#true} is VALID [2022-04-15 09:18:53,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {7570#true} assume true; {7570#true} is VALID [2022-04-15 09:18:53,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {7570#true} assume !(0 == ~cond); {7570#true} is VALID [2022-04-15 09:18:53,355 INFO L290 TraceCheckUtils]: 7: Hoare triple {7570#true} ~cond := #in~cond; {7570#true} is VALID [2022-04-15 09:18:53,355 INFO L272 TraceCheckUtils]: 6: Hoare triple {7570#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {7570#true} is VALID [2022-04-15 09:18:53,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {7570#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {7570#true} is VALID [2022-04-15 09:18:53,355 INFO L272 TraceCheckUtils]: 4: Hoare triple {7570#true} call #t~ret8 := main(); {7570#true} is VALID [2022-04-15 09:18:53,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7570#true} {7570#true} #96#return; {7570#true} is VALID [2022-04-15 09:18:53,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {7570#true} assume true; {7570#true} is VALID [2022-04-15 09:18:53,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {7570#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7570#true} is VALID [2022-04-15 09:18:53,355 INFO L272 TraceCheckUtils]: 0: Hoare triple {7570#true} call ULTIMATE.init(); {7570#true} is VALID [2022-04-15 09:18:53,356 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-15 09:18:53,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:18:53,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165712202] [2022-04-15 09:18:53,356 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:18:53,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401950042] [2022-04-15 09:18:53,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401950042] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:18:53,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:18:53,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-15 09:18:53,357 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:18:53,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1151308788] [2022-04-15 09:18:53,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1151308788] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:18:53,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:18:53,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 09:18:53,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337079745] [2022-04-15 09:18:53,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:18:53,358 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 68 [2022-04-15 09:18:53,358 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:18:53,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-15 09:18:53,400 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:18:53,400 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 09:18:53,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:18:53,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 09:18:53,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-04-15 09:18:53,401 INFO L87 Difference]: Start difference. First operand 133 states and 154 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-15 09:18:54,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:18:54,311 INFO L93 Difference]: Finished difference Result 178 states and 213 transitions. [2022-04-15 09:18:54,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 09:18:54,311 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 68 [2022-04-15 09:18:54,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:18:54,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-15 09:18:54,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2022-04-15 09:18:54,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-15 09:18:54,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 108 transitions. [2022-04-15 09:18:54,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 108 transitions. [2022-04-15 09:18:54,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:18:54,418 INFO L225 Difference]: With dead ends: 178 [2022-04-15 09:18:54,418 INFO L226 Difference]: Without dead ends: 143 [2022-04-15 09:18:54,419 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-04-15 09:18:54,422 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 12 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 09:18:54,422 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 207 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 09:18:54,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-04-15 09:18:54,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2022-04-15 09:18:54,523 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:18:54,524 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand has 141 states, 93 states have (on average 1.1612903225806452) internal successors, (108), 96 states have internal predecessors, (108), 28 states have call successors, (28), 20 states have call predecessors, (28), 19 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 09:18:54,524 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand has 141 states, 93 states have (on average 1.1612903225806452) internal successors, (108), 96 states have internal predecessors, (108), 28 states have call successors, (28), 20 states have call predecessors, (28), 19 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 09:18:54,524 INFO L87 Difference]: Start difference. First operand 143 states. Second operand has 141 states, 93 states have (on average 1.1612903225806452) internal successors, (108), 96 states have internal predecessors, (108), 28 states have call successors, (28), 20 states have call predecessors, (28), 19 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 09:18:54,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:18:54,528 INFO L93 Difference]: Finished difference Result 143 states and 165 transitions. [2022-04-15 09:18:54,528 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 165 transitions. [2022-04-15 09:18:54,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:18:54,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:18:54,529 INFO L74 IsIncluded]: Start isIncluded. First operand has 141 states, 93 states have (on average 1.1612903225806452) internal successors, (108), 96 states have internal predecessors, (108), 28 states have call successors, (28), 20 states have call predecessors, (28), 19 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) Second operand 143 states. [2022-04-15 09:18:54,530 INFO L87 Difference]: Start difference. First operand has 141 states, 93 states have (on average 1.1612903225806452) internal successors, (108), 96 states have internal predecessors, (108), 28 states have call successors, (28), 20 states have call predecessors, (28), 19 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) Second operand 143 states. [2022-04-15 09:18:54,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:18:54,532 INFO L93 Difference]: Finished difference Result 143 states and 165 transitions. [2022-04-15 09:18:54,532 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 165 transitions. [2022-04-15 09:18:54,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:18:54,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:18:54,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:18:54,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:18:54,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 93 states have (on average 1.1612903225806452) internal successors, (108), 96 states have internal predecessors, (108), 28 states have call successors, (28), 20 states have call predecessors, (28), 19 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 09:18:54,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 162 transitions. [2022-04-15 09:18:54,537 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 162 transitions. Word has length 68 [2022-04-15 09:18:54,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:18:54,538 INFO L478 AbstractCegarLoop]: Abstraction has 141 states and 162 transitions. [2022-04-15 09:18:54,538 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 5 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-04-15 09:18:54,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 141 states and 162 transitions. [2022-04-15 09:18:54,738 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:18:54,738 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 162 transitions. [2022-04-15 09:18:54,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-15 09:18:54,739 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:18:54,739 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:18:54,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-15 09:18:54,947 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-15 09:18:54,947 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:18:54,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:18:54,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1390565976, now seen corresponding path program 3 times [2022-04-15 09:18:54,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:18:54,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [466705122] [2022-04-15 09:19:02,778 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:19:02,778 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:19:02,778 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:19:02,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1390565976, now seen corresponding path program 4 times [2022-04-15 09:19:02,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:19:02,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400445115] [2022-04-15 09:19:02,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:19:02,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:19:02,798 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:19:02,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [681750094] [2022-04-15 09:19:02,798 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 09:19:02,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:19:02,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:19:02,800 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:19:02,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-15 09:19:02,861 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 09:19:02,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:19:02,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 09:19:02,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:19:02,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:19:14,179 INFO L272 TraceCheckUtils]: 0: Hoare triple {8917#true} call ULTIMATE.init(); {8917#true} is VALID [2022-04-15 09:19:14,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {8917#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8917#true} is VALID [2022-04-15 09:19:14,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {8917#true} assume true; {8917#true} is VALID [2022-04-15 09:19:14,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8917#true} {8917#true} #96#return; {8917#true} is VALID [2022-04-15 09:19:14,179 INFO L272 TraceCheckUtils]: 4: Hoare triple {8917#true} call #t~ret8 := main(); {8917#true} is VALID [2022-04-15 09:19:14,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {8917#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {8917#true} is VALID [2022-04-15 09:19:14,180 INFO L272 TraceCheckUtils]: 6: Hoare triple {8917#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {8917#true} is VALID [2022-04-15 09:19:14,180 INFO L290 TraceCheckUtils]: 7: Hoare triple {8917#true} ~cond := #in~cond; {8917#true} is VALID [2022-04-15 09:19:14,180 INFO L290 TraceCheckUtils]: 8: Hoare triple {8917#true} assume !(0 == ~cond); {8917#true} is VALID [2022-04-15 09:19:14,180 INFO L290 TraceCheckUtils]: 9: Hoare triple {8917#true} assume true; {8917#true} is VALID [2022-04-15 09:19:14,180 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8917#true} {8917#true} #80#return; {8917#true} is VALID [2022-04-15 09:19:14,181 INFO L290 TraceCheckUtils]: 11: Hoare triple {8917#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {8955#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 09:19:14,181 INFO L290 TraceCheckUtils]: 12: Hoare triple {8955#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8955#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 09:19:14,181 INFO L290 TraceCheckUtils]: 13: Hoare triple {8955#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {8955#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 09:19:14,182 INFO L272 TraceCheckUtils]: 14: Hoare triple {8955#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {8917#true} is VALID [2022-04-15 09:19:14,182 INFO L290 TraceCheckUtils]: 15: Hoare triple {8917#true} ~cond := #in~cond; {8917#true} is VALID [2022-04-15 09:19:14,182 INFO L290 TraceCheckUtils]: 16: Hoare triple {8917#true} assume !(0 == ~cond); {8917#true} is VALID [2022-04-15 09:19:14,182 INFO L290 TraceCheckUtils]: 17: Hoare triple {8917#true} assume true; {8917#true} is VALID [2022-04-15 09:19:14,182 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8917#true} {8955#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} #82#return; {8955#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 09:19:14,183 INFO L272 TraceCheckUtils]: 19: Hoare triple {8955#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {8917#true} is VALID [2022-04-15 09:19:14,183 INFO L290 TraceCheckUtils]: 20: Hoare triple {8917#true} ~cond := #in~cond; {8917#true} is VALID [2022-04-15 09:19:14,183 INFO L290 TraceCheckUtils]: 21: Hoare triple {8917#true} assume !(0 == ~cond); {8917#true} is VALID [2022-04-15 09:19:14,183 INFO L290 TraceCheckUtils]: 22: Hoare triple {8917#true} assume true; {8917#true} is VALID [2022-04-15 09:19:14,184 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8917#true} {8955#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} #84#return; {8955#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 09:19:14,184 INFO L272 TraceCheckUtils]: 24: Hoare triple {8955#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {8917#true} is VALID [2022-04-15 09:19:14,184 INFO L290 TraceCheckUtils]: 25: Hoare triple {8917#true} ~cond := #in~cond; {8917#true} is VALID [2022-04-15 09:19:14,184 INFO L290 TraceCheckUtils]: 26: Hoare triple {8917#true} assume !(0 == ~cond); {8917#true} is VALID [2022-04-15 09:19:14,184 INFO L290 TraceCheckUtils]: 27: Hoare triple {8917#true} assume true; {8917#true} is VALID [2022-04-15 09:19:14,185 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {8917#true} {8955#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} #86#return; {8955#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 09:19:14,186 INFO L290 TraceCheckUtils]: 29: Hoare triple {8955#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {9010#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~p~0 2) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-15 09:19:14,186 INFO L290 TraceCheckUtils]: 30: Hoare triple {9010#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~p~0 2) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9010#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~p~0 2) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-15 09:19:14,187 INFO L290 TraceCheckUtils]: 31: Hoare triple {9010#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~p~0 2) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} assume !!(#t~post6 < 20);havoc #t~post6; {9010#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~p~0 2) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-15 09:19:14,187 INFO L272 TraceCheckUtils]: 32: Hoare triple {9010#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~p~0 2) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {8917#true} is VALID [2022-04-15 09:19:14,187 INFO L290 TraceCheckUtils]: 33: Hoare triple {8917#true} ~cond := #in~cond; {8917#true} is VALID [2022-04-15 09:19:14,187 INFO L290 TraceCheckUtils]: 34: Hoare triple {8917#true} assume !(0 == ~cond); {8917#true} is VALID [2022-04-15 09:19:14,187 INFO L290 TraceCheckUtils]: 35: Hoare triple {8917#true} assume true; {8917#true} is VALID [2022-04-15 09:19:14,188 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8917#true} {9010#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~p~0 2) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} #82#return; {9010#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~p~0 2) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-15 09:19:14,188 INFO L272 TraceCheckUtils]: 37: Hoare triple {9010#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~p~0 2) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {8917#true} is VALID [2022-04-15 09:19:14,188 INFO L290 TraceCheckUtils]: 38: Hoare triple {8917#true} ~cond := #in~cond; {8917#true} is VALID [2022-04-15 09:19:14,188 INFO L290 TraceCheckUtils]: 39: Hoare triple {8917#true} assume !(0 == ~cond); {8917#true} is VALID [2022-04-15 09:19:14,188 INFO L290 TraceCheckUtils]: 40: Hoare triple {8917#true} assume true; {8917#true} is VALID [2022-04-15 09:19:14,189 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8917#true} {9010#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~p~0 2) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} #84#return; {9010#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~p~0 2) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-15 09:19:14,189 INFO L272 TraceCheckUtils]: 42: Hoare triple {9010#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~p~0 2) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {8917#true} is VALID [2022-04-15 09:19:14,189 INFO L290 TraceCheckUtils]: 43: Hoare triple {8917#true} ~cond := #in~cond; {8917#true} is VALID [2022-04-15 09:19:14,189 INFO L290 TraceCheckUtils]: 44: Hoare triple {8917#true} assume !(0 == ~cond); {8917#true} is VALID [2022-04-15 09:19:14,189 INFO L290 TraceCheckUtils]: 45: Hoare triple {8917#true} assume true; {8917#true} is VALID [2022-04-15 09:19:14,190 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {8917#true} {9010#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~p~0 2) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} #86#return; {9010#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~p~0 2) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-15 09:19:14,190 INFO L290 TraceCheckUtils]: 47: Hoare triple {9010#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~p~0 2) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} assume !(~r~0 >= ~d~0); {9065#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~p~0 2) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-15 09:19:14,191 INFO L290 TraceCheckUtils]: 48: Hoare triple {9065#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~p~0 2) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9065#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~p~0 2) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-15 09:19:14,191 INFO L290 TraceCheckUtils]: 49: Hoare triple {9065#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~p~0 2) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} assume !!(#t~post7 < 20);havoc #t~post7; {9065#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~p~0 2) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-15 09:19:14,191 INFO L272 TraceCheckUtils]: 50: Hoare triple {9065#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~p~0 2) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {8917#true} is VALID [2022-04-15 09:19:14,191 INFO L290 TraceCheckUtils]: 51: Hoare triple {8917#true} ~cond := #in~cond; {8917#true} is VALID [2022-04-15 09:19:14,191 INFO L290 TraceCheckUtils]: 52: Hoare triple {8917#true} assume !(0 == ~cond); {8917#true} is VALID [2022-04-15 09:19:14,192 INFO L290 TraceCheckUtils]: 53: Hoare triple {8917#true} assume true; {8917#true} is VALID [2022-04-15 09:19:14,192 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {8917#true} {9065#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~p~0 2) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} #88#return; {9065#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~p~0 2) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-15 09:19:14,192 INFO L272 TraceCheckUtils]: 55: Hoare triple {9065#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~p~0 2) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {8917#true} is VALID [2022-04-15 09:19:14,192 INFO L290 TraceCheckUtils]: 56: Hoare triple {8917#true} ~cond := #in~cond; {8917#true} is VALID [2022-04-15 09:19:14,192 INFO L290 TraceCheckUtils]: 57: Hoare triple {8917#true} assume !(0 == ~cond); {8917#true} is VALID [2022-04-15 09:19:14,192 INFO L290 TraceCheckUtils]: 58: Hoare triple {8917#true} assume true; {8917#true} is VALID [2022-04-15 09:19:14,193 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8917#true} {9065#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~p~0 2) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} #90#return; {9065#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~p~0 2) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-15 09:19:14,195 INFO L290 TraceCheckUtils]: 60: Hoare triple {9065#(and (= (mod main_~A~0 4294967296) main_~r~0) (<= (div (- main_~d~0) (- 2)) (mod main_~B~0 4294967296)) (= main_~p~0 2) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (<= (div (- main_~d~0) (- 2)) main_~r~0))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {9105#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~d~0 (+ main_~r~0 1)) (< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ (mod main_~B~0 4294967296) 1)) (< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~r~0 1)) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 09:19:14,196 INFO L290 TraceCheckUtils]: 61: Hoare triple {9105#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~d~0 (+ main_~r~0 1)) (< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ (mod main_~B~0 4294967296) 1)) (< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~r~0 1)) (<= main_~d~0 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {9109#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (< (div (+ (- 1) (* (- 1) (mod main_~A~0 4294967296))) (- 2)) (+ (mod main_~A~0 4294967296) 1)) (= (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296)) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (< (div (+ (- 1) (* (- 1) (mod main_~A~0 4294967296))) (- 2)) (+ (mod main_~B~0 4294967296) 1)) (< main_~d~0 (+ (mod main_~A~0 4294967296) 1)) (= main_~p~0 1))} is VALID [2022-04-15 09:19:14,196 INFO L290 TraceCheckUtils]: 62: Hoare triple {9109#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (< (div (+ (- 1) (* (- 1) (mod main_~A~0 4294967296))) (- 2)) (+ (mod main_~A~0 4294967296) 1)) (= (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296)) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (< (div (+ (- 1) (* (- 1) (mod main_~A~0 4294967296))) (- 2)) (+ (mod main_~B~0 4294967296) 1)) (< main_~d~0 (+ (mod main_~A~0 4294967296) 1)) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9109#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (< (div (+ (- 1) (* (- 1) (mod main_~A~0 4294967296))) (- 2)) (+ (mod main_~A~0 4294967296) 1)) (= (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296)) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (< (div (+ (- 1) (* (- 1) (mod main_~A~0 4294967296))) (- 2)) (+ (mod main_~B~0 4294967296) 1)) (< main_~d~0 (+ (mod main_~A~0 4294967296) 1)) (= main_~p~0 1))} is VALID [2022-04-15 09:19:14,197 INFO L290 TraceCheckUtils]: 63: Hoare triple {9109#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (< (div (+ (- 1) (* (- 1) (mod main_~A~0 4294967296))) (- 2)) (+ (mod main_~A~0 4294967296) 1)) (= (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296)) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (< (div (+ (- 1) (* (- 1) (mod main_~A~0 4294967296))) (- 2)) (+ (mod main_~B~0 4294967296) 1)) (< main_~d~0 (+ (mod main_~A~0 4294967296) 1)) (= main_~p~0 1))} assume !!(#t~post7 < 20);havoc #t~post7; {9109#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (< (div (+ (- 1) (* (- 1) (mod main_~A~0 4294967296))) (- 2)) (+ (mod main_~A~0 4294967296) 1)) (= (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296)) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (< (div (+ (- 1) (* (- 1) (mod main_~A~0 4294967296))) (- 2)) (+ (mod main_~B~0 4294967296) 1)) (< main_~d~0 (+ (mod main_~A~0 4294967296) 1)) (= main_~p~0 1))} is VALID [2022-04-15 09:19:14,197 INFO L272 TraceCheckUtils]: 64: Hoare triple {9109#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (< (div (+ (- 1) (* (- 1) (mod main_~A~0 4294967296))) (- 2)) (+ (mod main_~A~0 4294967296) 1)) (= (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296)) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (< (div (+ (- 1) (* (- 1) (mod main_~A~0 4294967296))) (- 2)) (+ (mod main_~B~0 4294967296) 1)) (< main_~d~0 (+ (mod main_~A~0 4294967296) 1)) (= main_~p~0 1))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {8917#true} is VALID [2022-04-15 09:19:14,197 INFO L290 TraceCheckUtils]: 65: Hoare triple {8917#true} ~cond := #in~cond; {9122#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:19:14,198 INFO L290 TraceCheckUtils]: 66: Hoare triple {9122#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9126#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:19:14,198 INFO L290 TraceCheckUtils]: 67: Hoare triple {9126#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9126#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:19:14,215 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {9126#(not (= |__VERIFIER_assert_#in~cond| 0))} {9109#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (< (div (+ (- 1) (* (- 1) (mod main_~A~0 4294967296))) (- 2)) (+ (mod main_~A~0 4294967296) 1)) (= (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296)) main_~r~0) (<= main_~d~0 (mod main_~B~0 4294967296)) (< (div (+ (- 1) (* (- 1) (mod main_~A~0 4294967296))) (- 2)) (+ (mod main_~B~0 4294967296) 1)) (< main_~d~0 (+ (mod main_~A~0 4294967296) 1)) (= main_~p~0 1))} #88#return; {9133#(and (exists ((aux_div_aux_mod_aux_mod_main_~A~0_26_37_114 Int) (aux_div_aux_mod_aux_mod_aux_mod_main_~A~0_26_37_114_160 Int) (aux_mod_aux_mod_aux_mod_aux_mod_main_~A~0_26_37_114_160 Int) (aux_div_aux_mod_main_~A~0_26_37 Int)) (and (<= (+ aux_mod_aux_mod_aux_mod_aux_mod_main_~A~0_26_37_114_160 1) (* aux_div_aux_mod_aux_mod_aux_mod_main_~A~0_26_37_114_160 2)) (< main_~d~0 (+ (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_main_~A~0_26_37_114_160 4294967295) 4294967295 (* aux_div_aux_mod_aux_mod_aux_mod_main_~A~0_26_37_114_160 2)) 4294967296) 1)) (< (+ (* aux_div_aux_mod_main_~A~0_26_37 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_main_~A~0_26_37_114_160 2)) (+ aux_mod_aux_mod_aux_mod_aux_mod_main_~A~0_26_37_114_160 4294967297)) (<= (+ (* aux_div_aux_mod_main_~A~0_26_37 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_main_~A~0_26_37_114_160 2)) (+ aux_mod_aux_mod_aux_mod_aux_mod_main_~A~0_26_37_114_160 (* 2 aux_div_aux_mod_aux_mod_main_~A~0_26_37_114))) (<= 0 aux_mod_aux_mod_aux_mod_aux_mod_main_~A~0_26_37_114_160) (< aux_mod_aux_mod_aux_mod_aux_mod_main_~A~0_26_37_114_160 2) (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))) (< aux_div_aux_mod_aux_mod_aux_mod_main_~A~0_26_37_114_160 (+ (mod main_~B~0 4294967296) 1)) (< (+ aux_mod_aux_mod_aux_mod_aux_mod_main_~A~0_26_37_114_160 (* 2 aux_div_aux_mod_aux_mod_main_~A~0_26_37_114)) (+ 2 (* aux_div_aux_mod_main_~A~0_26_37 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_main_~A~0_26_37_114_160 2))) (<= (+ aux_mod_aux_mod_aux_mod_aux_mod_main_~A~0_26_37_114_160 1) (+ (* aux_div_aux_mod_main_~A~0_26_37 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_main_~A~0_26_37_114_160 2))))) (= main_~p~0 1))} is VALID [2022-04-15 09:19:14,216 INFO L272 TraceCheckUtils]: 69: Hoare triple {9133#(and (exists ((aux_div_aux_mod_aux_mod_main_~A~0_26_37_114 Int) (aux_div_aux_mod_aux_mod_aux_mod_main_~A~0_26_37_114_160 Int) (aux_mod_aux_mod_aux_mod_aux_mod_main_~A~0_26_37_114_160 Int) (aux_div_aux_mod_main_~A~0_26_37 Int)) (and (<= (+ aux_mod_aux_mod_aux_mod_aux_mod_main_~A~0_26_37_114_160 1) (* aux_div_aux_mod_aux_mod_aux_mod_main_~A~0_26_37_114_160 2)) (< main_~d~0 (+ (mod (+ (* aux_mod_aux_mod_aux_mod_aux_mod_main_~A~0_26_37_114_160 4294967295) 4294967295 (* aux_div_aux_mod_aux_mod_aux_mod_main_~A~0_26_37_114_160 2)) 4294967296) 1)) (< (+ (* aux_div_aux_mod_main_~A~0_26_37 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_main_~A~0_26_37_114_160 2)) (+ aux_mod_aux_mod_aux_mod_aux_mod_main_~A~0_26_37_114_160 4294967297)) (<= (+ (* aux_div_aux_mod_main_~A~0_26_37 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_main_~A~0_26_37_114_160 2)) (+ aux_mod_aux_mod_aux_mod_aux_mod_main_~A~0_26_37_114_160 (* 2 aux_div_aux_mod_aux_mod_main_~A~0_26_37_114))) (<= 0 aux_mod_aux_mod_aux_mod_aux_mod_main_~A~0_26_37_114_160) (< aux_mod_aux_mod_aux_mod_aux_mod_main_~A~0_26_37_114_160 2) (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))) (< aux_div_aux_mod_aux_mod_aux_mod_main_~A~0_26_37_114_160 (+ (mod main_~B~0 4294967296) 1)) (< (+ aux_mod_aux_mod_aux_mod_aux_mod_main_~A~0_26_37_114_160 (* 2 aux_div_aux_mod_aux_mod_main_~A~0_26_37_114)) (+ 2 (* aux_div_aux_mod_main_~A~0_26_37 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_main_~A~0_26_37_114_160 2))) (<= (+ aux_mod_aux_mod_aux_mod_aux_mod_main_~A~0_26_37_114_160 1) (+ (* aux_div_aux_mod_main_~A~0_26_37 4294967296) (* aux_div_aux_mod_aux_mod_aux_mod_main_~A~0_26_37_114_160 2))))) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {9137#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 09:19:14,216 INFO L290 TraceCheckUtils]: 70: Hoare triple {9137#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9141#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:19:14,217 INFO L290 TraceCheckUtils]: 71: Hoare triple {9141#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8918#false} is VALID [2022-04-15 09:19:14,217 INFO L290 TraceCheckUtils]: 72: Hoare triple {8918#false} assume !false; {8918#false} is VALID [2022-04-15 09:19:14,217 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 41 proven. 11 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-15 09:19:14,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:19:51,063 INFO L290 TraceCheckUtils]: 72: Hoare triple {8918#false} assume !false; {8918#false} is VALID [2022-04-15 09:19:51,064 INFO L290 TraceCheckUtils]: 71: Hoare triple {9141#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8918#false} is VALID [2022-04-15 09:19:51,064 INFO L290 TraceCheckUtils]: 70: Hoare triple {9137#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9141#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:19:51,065 INFO L272 TraceCheckUtils]: 69: Hoare triple {9157#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {9137#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 09:19:51,066 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {9126#(not (= |__VERIFIER_assert_#in~cond| 0))} {9161#(or (not (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))) (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))))} #88#return; {9157#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 09:19:51,066 INFO L290 TraceCheckUtils]: 67: Hoare triple {9126#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9126#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:19:51,066 INFO L290 TraceCheckUtils]: 66: Hoare triple {9171#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {9126#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:19:51,067 INFO L290 TraceCheckUtils]: 65: Hoare triple {8917#true} ~cond := #in~cond; {9171#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 09:19:51,067 INFO L272 TraceCheckUtils]: 64: Hoare triple {9161#(or (not (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))) (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {8917#true} is VALID [2022-04-15 09:19:51,067 INFO L290 TraceCheckUtils]: 63: Hoare triple {9161#(or (not (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))) (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))))} assume !!(#t~post7 < 20);havoc #t~post7; {9161#(or (not (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))) (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))))} is VALID [2022-04-15 09:19:51,068 INFO L290 TraceCheckUtils]: 62: Hoare triple {9161#(or (not (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))) (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9161#(or (not (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))) (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))))} is VALID [2022-04-15 09:19:51,070 INFO L290 TraceCheckUtils]: 61: Hoare triple {9184#(or (not (= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) (* (+ main_~q~0 main_~p~0) (mod main_~B~0 4294967296)) main_~r~0))) (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {9161#(or (not (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))) (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))))} is VALID [2022-04-15 09:19:51,078 INFO L290 TraceCheckUtils]: 60: Hoare triple {9188#(and (or (and (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1)))) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {9184#(or (not (= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) (* (+ main_~q~0 main_~p~0) (mod main_~B~0 4294967296)) main_~r~0))) (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296))))} is VALID [2022-04-15 09:19:51,079 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8917#true} {9188#(and (or (and (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1)))) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))))} #90#return; {9188#(and (or (and (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1)))) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))))} is VALID [2022-04-15 09:19:51,079 INFO L290 TraceCheckUtils]: 58: Hoare triple {8917#true} assume true; {8917#true} is VALID [2022-04-15 09:19:51,079 INFO L290 TraceCheckUtils]: 57: Hoare triple {8917#true} assume !(0 == ~cond); {8917#true} is VALID [2022-04-15 09:19:51,079 INFO L290 TraceCheckUtils]: 56: Hoare triple {8917#true} ~cond := #in~cond; {8917#true} is VALID [2022-04-15 09:19:51,079 INFO L272 TraceCheckUtils]: 55: Hoare triple {9188#(and (or (and (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1)))) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {8917#true} is VALID [2022-04-15 09:19:51,080 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {8917#true} {9188#(and (or (and (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1)))) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))))} #88#return; {9188#(and (or (and (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1)))) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))))} is VALID [2022-04-15 09:19:51,080 INFO L290 TraceCheckUtils]: 53: Hoare triple {8917#true} assume true; {8917#true} is VALID [2022-04-15 09:19:51,080 INFO L290 TraceCheckUtils]: 52: Hoare triple {8917#true} assume !(0 == ~cond); {8917#true} is VALID [2022-04-15 09:19:51,080 INFO L290 TraceCheckUtils]: 51: Hoare triple {8917#true} ~cond := #in~cond; {8917#true} is VALID [2022-04-15 09:19:51,080 INFO L272 TraceCheckUtils]: 50: Hoare triple {9188#(and (or (and (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1)))) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {8917#true} is VALID [2022-04-15 09:19:51,081 INFO L290 TraceCheckUtils]: 49: Hoare triple {9188#(and (or (and (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1)))) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))))} assume !!(#t~post7 < 20);havoc #t~post7; {9188#(and (or (and (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1)))) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))))} is VALID [2022-04-15 09:19:51,082 INFO L290 TraceCheckUtils]: 48: Hoare triple {9188#(and (or (and (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1)))) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9188#(and (or (and (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1)))) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))))} is VALID [2022-04-15 09:19:51,083 INFO L290 TraceCheckUtils]: 47: Hoare triple {9228#(or (and (or (and (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1)))) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)))) (<= main_~d~0 main_~r~0))} assume !(~r~0 >= ~d~0); {9188#(and (or (and (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1)))) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))))} is VALID [2022-04-15 09:19:51,084 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {8917#true} {9228#(or (and (or (and (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1)))) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)))) (<= main_~d~0 main_~r~0))} #86#return; {9228#(or (and (or (and (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1)))) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 09:19:51,084 INFO L290 TraceCheckUtils]: 45: Hoare triple {8917#true} assume true; {8917#true} is VALID [2022-04-15 09:19:51,084 INFO L290 TraceCheckUtils]: 44: Hoare triple {8917#true} assume !(0 == ~cond); {8917#true} is VALID [2022-04-15 09:19:51,084 INFO L290 TraceCheckUtils]: 43: Hoare triple {8917#true} ~cond := #in~cond; {8917#true} is VALID [2022-04-15 09:19:51,084 INFO L272 TraceCheckUtils]: 42: Hoare triple {9228#(or (and (or (and (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1)))) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)))) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {8917#true} is VALID [2022-04-15 09:19:51,085 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8917#true} {9228#(or (and (or (and (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1)))) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)))) (<= main_~d~0 main_~r~0))} #84#return; {9228#(or (and (or (and (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1)))) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 09:19:51,085 INFO L290 TraceCheckUtils]: 40: Hoare triple {8917#true} assume true; {8917#true} is VALID [2022-04-15 09:19:51,085 INFO L290 TraceCheckUtils]: 39: Hoare triple {8917#true} assume !(0 == ~cond); {8917#true} is VALID [2022-04-15 09:19:51,085 INFO L290 TraceCheckUtils]: 38: Hoare triple {8917#true} ~cond := #in~cond; {8917#true} is VALID [2022-04-15 09:19:51,085 INFO L272 TraceCheckUtils]: 37: Hoare triple {9228#(or (and (or (and (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1)))) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)))) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {8917#true} is VALID [2022-04-15 09:19:51,086 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {8917#true} {9228#(or (and (or (and (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1)))) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)))) (<= main_~d~0 main_~r~0))} #82#return; {9228#(or (and (or (and (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1)))) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 09:19:51,086 INFO L290 TraceCheckUtils]: 35: Hoare triple {8917#true} assume true; {8917#true} is VALID [2022-04-15 09:19:51,086 INFO L290 TraceCheckUtils]: 34: Hoare triple {8917#true} assume !(0 == ~cond); {8917#true} is VALID [2022-04-15 09:19:51,086 INFO L290 TraceCheckUtils]: 33: Hoare triple {8917#true} ~cond := #in~cond; {8917#true} is VALID [2022-04-15 09:19:51,086 INFO L272 TraceCheckUtils]: 32: Hoare triple {9228#(or (and (or (and (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1)))) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)))) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {8917#true} is VALID [2022-04-15 09:19:51,087 INFO L290 TraceCheckUtils]: 31: Hoare triple {9228#(or (and (or (and (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1)))) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)))) (<= main_~d~0 main_~r~0))} assume !!(#t~post6 < 20);havoc #t~post6; {9228#(or (and (or (and (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1)))) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 09:19:51,088 INFO L290 TraceCheckUtils]: 30: Hoare triple {9228#(or (and (or (and (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1)))) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)))) (<= main_~d~0 main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9228#(or (and (or (and (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1)))) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 09:19:51,090 INFO L290 TraceCheckUtils]: 29: Hoare triple {9283#(or (< (+ (mod main_~A~0 4294967296) main_~d~0) (+ main_~r~0 (* main_~p~0 (mod main_~B~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296)))) (not (<= main_~d~0 main_~r~0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* main_~d~0 2) main_~r~0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {9228#(or (and (or (and (or (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (mod main_~B~0 4294967296) (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))) (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2) 1)))) (not (<= (+ (* (mod main_~B~0 4294967296) (div main_~p~0 2)) main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (+ (mod main_~A~0 4294967296) (div main_~d~0 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 09:19:51,091 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {8917#true} {9283#(or (< (+ (mod main_~A~0 4294967296) main_~d~0) (+ main_~r~0 (* main_~p~0 (mod main_~B~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296)))) (not (<= main_~d~0 main_~r~0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* main_~d~0 2) main_~r~0))} #86#return; {9283#(or (< (+ (mod main_~A~0 4294967296) main_~d~0) (+ main_~r~0 (* main_~p~0 (mod main_~B~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296)))) (not (<= main_~d~0 main_~r~0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* main_~d~0 2) main_~r~0))} is VALID [2022-04-15 09:19:51,091 INFO L290 TraceCheckUtils]: 27: Hoare triple {8917#true} assume true; {8917#true} is VALID [2022-04-15 09:19:51,091 INFO L290 TraceCheckUtils]: 26: Hoare triple {8917#true} assume !(0 == ~cond); {8917#true} is VALID [2022-04-15 09:19:51,091 INFO L290 TraceCheckUtils]: 25: Hoare triple {8917#true} ~cond := #in~cond; {8917#true} is VALID [2022-04-15 09:19:51,091 INFO L272 TraceCheckUtils]: 24: Hoare triple {9283#(or (< (+ (mod main_~A~0 4294967296) main_~d~0) (+ main_~r~0 (* main_~p~0 (mod main_~B~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296)))) (not (<= main_~d~0 main_~r~0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* main_~d~0 2) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {8917#true} is VALID [2022-04-15 09:19:51,092 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8917#true} {9283#(or (< (+ (mod main_~A~0 4294967296) main_~d~0) (+ main_~r~0 (* main_~p~0 (mod main_~B~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296)))) (not (<= main_~d~0 main_~r~0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* main_~d~0 2) main_~r~0))} #84#return; {9283#(or (< (+ (mod main_~A~0 4294967296) main_~d~0) (+ main_~r~0 (* main_~p~0 (mod main_~B~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296)))) (not (<= main_~d~0 main_~r~0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* main_~d~0 2) main_~r~0))} is VALID [2022-04-15 09:19:51,092 INFO L290 TraceCheckUtils]: 22: Hoare triple {8917#true} assume true; {8917#true} is VALID [2022-04-15 09:19:51,092 INFO L290 TraceCheckUtils]: 21: Hoare triple {8917#true} assume !(0 == ~cond); {8917#true} is VALID [2022-04-15 09:19:51,092 INFO L290 TraceCheckUtils]: 20: Hoare triple {8917#true} ~cond := #in~cond; {8917#true} is VALID [2022-04-15 09:19:51,092 INFO L272 TraceCheckUtils]: 19: Hoare triple {9283#(or (< (+ (mod main_~A~0 4294967296) main_~d~0) (+ main_~r~0 (* main_~p~0 (mod main_~B~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296)))) (not (<= main_~d~0 main_~r~0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* main_~d~0 2) main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {8917#true} is VALID [2022-04-15 09:19:51,093 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8917#true} {9283#(or (< (+ (mod main_~A~0 4294967296) main_~d~0) (+ main_~r~0 (* main_~p~0 (mod main_~B~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296)))) (not (<= main_~d~0 main_~r~0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* main_~d~0 2) main_~r~0))} #82#return; {9283#(or (< (+ (mod main_~A~0 4294967296) main_~d~0) (+ main_~r~0 (* main_~p~0 (mod main_~B~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296)))) (not (<= main_~d~0 main_~r~0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* main_~d~0 2) main_~r~0))} is VALID [2022-04-15 09:19:51,093 INFO L290 TraceCheckUtils]: 17: Hoare triple {8917#true} assume true; {8917#true} is VALID [2022-04-15 09:19:51,093 INFO L290 TraceCheckUtils]: 16: Hoare triple {8917#true} assume !(0 == ~cond); {8917#true} is VALID [2022-04-15 09:19:51,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {8917#true} ~cond := #in~cond; {8917#true} is VALID [2022-04-15 09:19:51,093 INFO L272 TraceCheckUtils]: 14: Hoare triple {9283#(or (< (+ (mod main_~A~0 4294967296) main_~d~0) (+ main_~r~0 (* main_~p~0 (mod main_~B~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296)))) (not (<= main_~d~0 main_~r~0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* main_~d~0 2) main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {8917#true} is VALID [2022-04-15 09:19:51,094 INFO L290 TraceCheckUtils]: 13: Hoare triple {9283#(or (< (+ (mod main_~A~0 4294967296) main_~d~0) (+ main_~r~0 (* main_~p~0 (mod main_~B~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296)))) (not (<= main_~d~0 main_~r~0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* main_~d~0 2) main_~r~0))} assume !!(#t~post6 < 20);havoc #t~post6; {9283#(or (< (+ (mod main_~A~0 4294967296) main_~d~0) (+ main_~r~0 (* main_~p~0 (mod main_~B~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296)))) (not (<= main_~d~0 main_~r~0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* main_~d~0 2) main_~r~0))} is VALID [2022-04-15 09:19:51,094 INFO L290 TraceCheckUtils]: 12: Hoare triple {9283#(or (< (+ (mod main_~A~0 4294967296) main_~d~0) (+ main_~r~0 (* main_~p~0 (mod main_~B~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296)))) (not (<= main_~d~0 main_~r~0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* main_~d~0 2) main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9283#(or (< (+ (mod main_~A~0 4294967296) main_~d~0) (+ main_~r~0 (* main_~p~0 (mod main_~B~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296)))) (not (<= main_~d~0 main_~r~0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* main_~d~0 2) main_~r~0))} is VALID [2022-04-15 09:19:51,095 INFO L290 TraceCheckUtils]: 11: Hoare triple {8917#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {9283#(or (< (+ (mod main_~A~0 4294967296) main_~d~0) (+ main_~r~0 (* main_~p~0 (mod main_~B~0 4294967296)) (* main_~q~0 (mod main_~B~0 4294967296)))) (not (<= main_~d~0 main_~r~0)) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (* main_~d~0 2) main_~r~0))} is VALID [2022-04-15 09:19:51,095 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8917#true} {8917#true} #80#return; {8917#true} is VALID [2022-04-15 09:19:51,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {8917#true} assume true; {8917#true} is VALID [2022-04-15 09:19:51,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {8917#true} assume !(0 == ~cond); {8917#true} is VALID [2022-04-15 09:19:51,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {8917#true} ~cond := #in~cond; {8917#true} is VALID [2022-04-15 09:19:51,095 INFO L272 TraceCheckUtils]: 6: Hoare triple {8917#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {8917#true} is VALID [2022-04-15 09:19:51,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {8917#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {8917#true} is VALID [2022-04-15 09:19:51,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {8917#true} call #t~ret8 := main(); {8917#true} is VALID [2022-04-15 09:19:51,096 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8917#true} {8917#true} #96#return; {8917#true} is VALID [2022-04-15 09:19:51,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {8917#true} assume true; {8917#true} is VALID [2022-04-15 09:19:51,096 INFO L290 TraceCheckUtils]: 1: Hoare triple {8917#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8917#true} is VALID [2022-04-15 09:19:51,096 INFO L272 TraceCheckUtils]: 0: Hoare triple {8917#true} call ULTIMATE.init(); {8917#true} is VALID [2022-04-15 09:19:51,096 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 41 proven. 11 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-04-15 09:19:51,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:19:51,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400445115] [2022-04-15 09:19:51,097 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:19:51,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681750094] [2022-04-15 09:19:51,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681750094] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:19:51,097 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:19:51,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 19 [2022-04-15 09:19:51,097 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:19:51,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [466705122] [2022-04-15 09:19:51,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [466705122] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:19:51,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:19:51,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 09:19:51,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532869431] [2022-04-15 09:19:51,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:19:51,098 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 73 [2022-04-15 09:19:51,098 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:19:51,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-15 09:19:51,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:19:51,155 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 09:19:51,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:19:51,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 09:19:51,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2022-04-15 09:19:51,156 INFO L87 Difference]: Start difference. First operand 141 states and 162 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-15 09:19:52,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:19:52,845 INFO L93 Difference]: Finished difference Result 149 states and 171 transitions. [2022-04-15 09:19:52,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 09:19:52,846 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 73 [2022-04-15 09:19:52,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:19:52,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-15 09:19:52,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 80 transitions. [2022-04-15 09:19:52,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-15 09:19:52,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 80 transitions. [2022-04-15 09:19:52,849 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 80 transitions. [2022-04-15 09:19:53,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:19:53,133 INFO L225 Difference]: With dead ends: 149 [2022-04-15 09:19:53,133 INFO L226 Difference]: Without dead ends: 147 [2022-04-15 09:19:53,134 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 127 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2022-04-15 09:19:53,134 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 15 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-15 09:19:53,134 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 232 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 299 Invalid, 0 Unknown, 50 Unchecked, 0.8s Time] [2022-04-15 09:19:53,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-04-15 09:19:53,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2022-04-15 09:19:53,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:19:53,263 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand has 147 states, 96 states have (on average 1.15625) internal successors, (111), 100 states have internal predecessors, (111), 30 states have call successors, (30), 21 states have call predecessors, (30), 20 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-15 09:19:53,263 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand has 147 states, 96 states have (on average 1.15625) internal successors, (111), 100 states have internal predecessors, (111), 30 states have call successors, (30), 21 states have call predecessors, (30), 20 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-15 09:19:53,264 INFO L87 Difference]: Start difference. First operand 147 states. Second operand has 147 states, 96 states have (on average 1.15625) internal successors, (111), 100 states have internal predecessors, (111), 30 states have call successors, (30), 21 states have call predecessors, (30), 20 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-15 09:19:53,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:19:53,266 INFO L93 Difference]: Finished difference Result 147 states and 169 transitions. [2022-04-15 09:19:53,266 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 169 transitions. [2022-04-15 09:19:53,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:19:53,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:19:53,267 INFO L74 IsIncluded]: Start isIncluded. First operand has 147 states, 96 states have (on average 1.15625) internal successors, (111), 100 states have internal predecessors, (111), 30 states have call successors, (30), 21 states have call predecessors, (30), 20 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) Second operand 147 states. [2022-04-15 09:19:53,267 INFO L87 Difference]: Start difference. First operand has 147 states, 96 states have (on average 1.15625) internal successors, (111), 100 states have internal predecessors, (111), 30 states have call successors, (30), 21 states have call predecessors, (30), 20 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) Second operand 147 states. [2022-04-15 09:19:53,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:19:53,269 INFO L93 Difference]: Finished difference Result 147 states and 169 transitions. [2022-04-15 09:19:53,269 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 169 transitions. [2022-04-15 09:19:53,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:19:53,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:19:53,270 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:19:53,270 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:19:53,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 96 states have (on average 1.15625) internal successors, (111), 100 states have internal predecessors, (111), 30 states have call successors, (30), 21 states have call predecessors, (30), 20 states have return successors, (28), 25 states have call predecessors, (28), 28 states have call successors, (28) [2022-04-15 09:19:53,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 169 transitions. [2022-04-15 09:19:53,272 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 169 transitions. Word has length 73 [2022-04-15 09:19:53,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:19:53,273 INFO L478 AbstractCegarLoop]: Abstraction has 147 states and 169 transitions. [2022-04-15 09:19:53,273 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 10 states have internal predecessors, (28), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-15 09:19:53,273 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 147 states and 169 transitions. [2022-04-15 09:19:53,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:19:53,428 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 169 transitions. [2022-04-15 09:19:53,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-15 09:19:53,438 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:19:53,438 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:19:53,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-15 09:19:53,654 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-15 09:19:53,656 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:19:53,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:19:53,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1792978632, now seen corresponding path program 1 times [2022-04-15 09:19:53,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:19:53,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1184818436] [2022-04-15 09:19:57,982 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:19:57,982 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:19:57,982 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:19:57,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1792978632, now seen corresponding path program 2 times [2022-04-15 09:19:57,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:19:57,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110062028] [2022-04-15 09:19:57,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:19:57,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:19:57,994 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:19:57,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1745191779] [2022-04-15 09:19:57,995 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:19:57,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:19:57,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:19:57,996 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:19:58,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-15 09:19:58,108 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:19:58,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:19:58,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 09:19:58,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:19:58,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:20:31,666 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 09:20:36,825 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 09:21:00,920 INFO L272 TraceCheckUtils]: 0: Hoare triple {10265#true} call ULTIMATE.init(); {10265#true} is VALID [2022-04-15 09:21:00,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {10265#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10265#true} is VALID [2022-04-15 09:21:00,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {10265#true} assume true; {10265#true} is VALID [2022-04-15 09:21:00,921 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10265#true} {10265#true} #96#return; {10265#true} is VALID [2022-04-15 09:21:00,921 INFO L272 TraceCheckUtils]: 4: Hoare triple {10265#true} call #t~ret8 := main(); {10265#true} is VALID [2022-04-15 09:21:00,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {10265#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {10265#true} is VALID [2022-04-15 09:21:00,921 INFO L272 TraceCheckUtils]: 6: Hoare triple {10265#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {10265#true} is VALID [2022-04-15 09:21:00,921 INFO L290 TraceCheckUtils]: 7: Hoare triple {10265#true} ~cond := #in~cond; {10265#true} is VALID [2022-04-15 09:21:00,921 INFO L290 TraceCheckUtils]: 8: Hoare triple {10265#true} assume !(0 == ~cond); {10265#true} is VALID [2022-04-15 09:21:00,921 INFO L290 TraceCheckUtils]: 9: Hoare triple {10265#true} assume true; {10265#true} is VALID [2022-04-15 09:21:00,921 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10265#true} {10265#true} #80#return; {10265#true} is VALID [2022-04-15 09:21:00,922 INFO L290 TraceCheckUtils]: 11: Hoare triple {10265#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} is VALID [2022-04-15 09:21:00,922 INFO L290 TraceCheckUtils]: 12: Hoare triple {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} is VALID [2022-04-15 09:21:00,923 INFO L290 TraceCheckUtils]: 13: Hoare triple {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} assume !!(#t~post6 < 20);havoc #t~post6; {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} is VALID [2022-04-15 09:21:00,923 INFO L272 TraceCheckUtils]: 14: Hoare triple {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10265#true} is VALID [2022-04-15 09:21:00,923 INFO L290 TraceCheckUtils]: 15: Hoare triple {10265#true} ~cond := #in~cond; {10265#true} is VALID [2022-04-15 09:21:00,923 INFO L290 TraceCheckUtils]: 16: Hoare triple {10265#true} assume !(0 == ~cond); {10265#true} is VALID [2022-04-15 09:21:00,923 INFO L290 TraceCheckUtils]: 17: Hoare triple {10265#true} assume true; {10265#true} is VALID [2022-04-15 09:21:00,924 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10265#true} {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} #82#return; {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} is VALID [2022-04-15 09:21:00,924 INFO L272 TraceCheckUtils]: 19: Hoare triple {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {10265#true} is VALID [2022-04-15 09:21:00,924 INFO L290 TraceCheckUtils]: 20: Hoare triple {10265#true} ~cond := #in~cond; {10265#true} is VALID [2022-04-15 09:21:00,924 INFO L290 TraceCheckUtils]: 21: Hoare triple {10265#true} assume !(0 == ~cond); {10265#true} is VALID [2022-04-15 09:21:00,924 INFO L290 TraceCheckUtils]: 22: Hoare triple {10265#true} assume true; {10265#true} is VALID [2022-04-15 09:21:00,924 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10265#true} {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} #84#return; {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} is VALID [2022-04-15 09:21:00,925 INFO L272 TraceCheckUtils]: 24: Hoare triple {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {10265#true} is VALID [2022-04-15 09:21:00,925 INFO L290 TraceCheckUtils]: 25: Hoare triple {10265#true} ~cond := #in~cond; {10265#true} is VALID [2022-04-15 09:21:00,925 INFO L290 TraceCheckUtils]: 26: Hoare triple {10265#true} assume !(0 == ~cond); {10265#true} is VALID [2022-04-15 09:21:00,925 INFO L290 TraceCheckUtils]: 27: Hoare triple {10265#true} assume true; {10265#true} is VALID [2022-04-15 09:21:00,925 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {10265#true} {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} #86#return; {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} is VALID [2022-04-15 09:21:00,926 INFO L290 TraceCheckUtils]: 29: Hoare triple {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} is VALID [2022-04-15 09:21:00,926 INFO L290 TraceCheckUtils]: 30: Hoare triple {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} is VALID [2022-04-15 09:21:00,927 INFO L290 TraceCheckUtils]: 31: Hoare triple {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} assume !!(#t~post6 < 20);havoc #t~post6; {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} is VALID [2022-04-15 09:21:00,927 INFO L272 TraceCheckUtils]: 32: Hoare triple {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10265#true} is VALID [2022-04-15 09:21:00,927 INFO L290 TraceCheckUtils]: 33: Hoare triple {10265#true} ~cond := #in~cond; {10265#true} is VALID [2022-04-15 09:21:00,927 INFO L290 TraceCheckUtils]: 34: Hoare triple {10265#true} assume !(0 == ~cond); {10265#true} is VALID [2022-04-15 09:21:00,927 INFO L290 TraceCheckUtils]: 35: Hoare triple {10265#true} assume true; {10265#true} is VALID [2022-04-15 09:21:00,927 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10265#true} {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} #82#return; {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} is VALID [2022-04-15 09:21:00,927 INFO L272 TraceCheckUtils]: 37: Hoare triple {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {10265#true} is VALID [2022-04-15 09:21:00,928 INFO L290 TraceCheckUtils]: 38: Hoare triple {10265#true} ~cond := #in~cond; {10265#true} is VALID [2022-04-15 09:21:00,928 INFO L290 TraceCheckUtils]: 39: Hoare triple {10265#true} assume !(0 == ~cond); {10265#true} is VALID [2022-04-15 09:21:00,928 INFO L290 TraceCheckUtils]: 40: Hoare triple {10265#true} assume true; {10265#true} is VALID [2022-04-15 09:21:00,928 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {10265#true} {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} #84#return; {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} is VALID [2022-04-15 09:21:00,928 INFO L272 TraceCheckUtils]: 42: Hoare triple {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {10265#true} is VALID [2022-04-15 09:21:00,928 INFO L290 TraceCheckUtils]: 43: Hoare triple {10265#true} ~cond := #in~cond; {10265#true} is VALID [2022-04-15 09:21:00,928 INFO L290 TraceCheckUtils]: 44: Hoare triple {10265#true} assume !(0 == ~cond); {10265#true} is VALID [2022-04-15 09:21:00,929 INFO L290 TraceCheckUtils]: 45: Hoare triple {10265#true} assume true; {10265#true} is VALID [2022-04-15 09:21:00,929 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {10265#true} {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} #86#return; {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} is VALID [2022-04-15 09:21:00,929 INFO L290 TraceCheckUtils]: 47: Hoare triple {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} assume !(~r~0 >= ~d~0); {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} is VALID [2022-04-15 09:21:00,930 INFO L290 TraceCheckUtils]: 48: Hoare triple {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} is VALID [2022-04-15 09:21:00,930 INFO L290 TraceCheckUtils]: 49: Hoare triple {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} assume !!(#t~post7 < 20);havoc #t~post7; {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} is VALID [2022-04-15 09:21:00,930 INFO L272 TraceCheckUtils]: 50: Hoare triple {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {10265#true} is VALID [2022-04-15 09:21:00,930 INFO L290 TraceCheckUtils]: 51: Hoare triple {10265#true} ~cond := #in~cond; {10265#true} is VALID [2022-04-15 09:21:00,931 INFO L290 TraceCheckUtils]: 52: Hoare triple {10265#true} assume !(0 == ~cond); {10265#true} is VALID [2022-04-15 09:21:00,931 INFO L290 TraceCheckUtils]: 53: Hoare triple {10265#true} assume true; {10265#true} is VALID [2022-04-15 09:21:00,931 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10265#true} {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} #88#return; {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} is VALID [2022-04-15 09:21:00,931 INFO L272 TraceCheckUtils]: 55: Hoare triple {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {10265#true} is VALID [2022-04-15 09:21:00,931 INFO L290 TraceCheckUtils]: 56: Hoare triple {10265#true} ~cond := #in~cond; {10265#true} is VALID [2022-04-15 09:21:00,931 INFO L290 TraceCheckUtils]: 57: Hoare triple {10265#true} assume !(0 == ~cond); {10265#true} is VALID [2022-04-15 09:21:00,932 INFO L290 TraceCheckUtils]: 58: Hoare triple {10265#true} assume true; {10265#true} is VALID [2022-04-15 09:21:00,932 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10265#true} {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} #90#return; {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} is VALID [2022-04-15 09:21:00,933 INFO L290 TraceCheckUtils]: 60: Hoare triple {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} is VALID [2022-04-15 09:21:00,934 INFO L290 TraceCheckUtils]: 61: Hoare triple {10303#(and (= main_~q~0 0) (<= (mod main_~A~0 4294967296) main_~r~0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {10454#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (<= (mod main_~A~0 4294967296) (+ main_~d~0 main_~r~0)))} is VALID [2022-04-15 09:21:00,935 INFO L290 TraceCheckUtils]: 62: Hoare triple {10454#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (<= (mod main_~A~0 4294967296) (+ main_~d~0 main_~r~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10454#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (<= (mod main_~A~0 4294967296) (+ main_~d~0 main_~r~0)))} is VALID [2022-04-15 09:21:00,935 INFO L290 TraceCheckUtils]: 63: Hoare triple {10454#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (<= (mod main_~A~0 4294967296) (+ main_~d~0 main_~r~0)))} assume !!(#t~post7 < 20);havoc #t~post7; {10454#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (<= (mod main_~A~0 4294967296) (+ main_~d~0 main_~r~0)))} is VALID [2022-04-15 09:21:00,935 INFO L272 TraceCheckUtils]: 64: Hoare triple {10454#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (<= (mod main_~A~0 4294967296) (+ main_~d~0 main_~r~0)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {10265#true} is VALID [2022-04-15 09:21:00,935 INFO L290 TraceCheckUtils]: 65: Hoare triple {10265#true} ~cond := #in~cond; {10467#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:21:00,936 INFO L290 TraceCheckUtils]: 66: Hoare triple {10467#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {10471#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:21:00,936 INFO L290 TraceCheckUtils]: 67: Hoare triple {10471#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10471#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:21:00,937 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10471#(not (= |__VERIFIER_assert_#in~cond| 0))} {10454#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (<= (mod main_~A~0 4294967296) (+ main_~d~0 main_~r~0)))} #88#return; {10478#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (mod main_~A~0 4294967296) (+ main_~d~0 main_~r~0)))} is VALID [2022-04-15 09:21:00,937 INFO L272 TraceCheckUtils]: 69: Hoare triple {10478#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (mod main_~A~0 4294967296) (+ main_~d~0 main_~r~0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {10265#true} is VALID [2022-04-15 09:21:00,937 INFO L290 TraceCheckUtils]: 70: Hoare triple {10265#true} ~cond := #in~cond; {10467#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:21:00,938 INFO L290 TraceCheckUtils]: 71: Hoare triple {10467#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {10471#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:21:00,938 INFO L290 TraceCheckUtils]: 72: Hoare triple {10471#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10471#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:21:02,941 WARN L284 TraceCheckUtils]: 73: Hoare quadruple {10471#(not (= |__VERIFIER_assert_#in~cond| 0))} {10478#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (<= (mod main_~A~0 4294967296) (+ main_~d~0 main_~r~0)))} #90#return; {10494#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (or (and (= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 0) (= main_~q~0 0) (exists ((aux_div_aux_mod_main_~B~0_26_37 Int) (aux_mod_aux_mod_main_~B~0_26_37 Int)) (and (< (+ (* 4294967296 aux_div_aux_mod_main_~B~0_26_37) aux_mod_aux_mod_main_~B~0_26_37) 4294967296) (<= 0 aux_mod_aux_mod_main_~B~0_26_37) (<= 0 (+ (* 4294967296 aux_div_aux_mod_main_~B~0_26_37) aux_mod_aux_mod_main_~B~0_26_37)) (< aux_mod_aux_mod_main_~B~0_26_37 4294967296) (= (* main_~p~0 (+ (* 4294967296 aux_div_aux_mod_main_~B~0_26_37) aux_mod_aux_mod_main_~B~0_26_37)) main_~d~0)))) (and (<= 0 (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0)) (= (mod (div (+ main_~d~0 (* (- 1) (* (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) main_~p~0))) 4294967296) main_~p~0) 0) (<= 0 (+ (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) (* 4294967296 (div (div (+ (* (- 1) (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) main_~p~0) main_~d~0) 4294967296) main_~p~0)))) (< (+ (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) (* 4294967296 (div (div (+ (* (- 1) (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) main_~p~0) main_~d~0) 4294967296) main_~p~0))) 4294967296) (not (= main_~q~0 0)) (< (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) 4294967296) (= (mod (+ (* (- 1) (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) main_~p~0) main_~d~0) 4294967296) 0))) (<= (mod main_~A~0 4294967296) (+ main_~d~0 main_~r~0)))} is UNKNOWN [2022-04-15 09:21:02,942 INFO L290 TraceCheckUtils]: 74: Hoare triple {10494#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (or (and (= (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 0) (= main_~q~0 0) (exists ((aux_div_aux_mod_main_~B~0_26_37 Int) (aux_mod_aux_mod_main_~B~0_26_37 Int)) (and (< (+ (* 4294967296 aux_div_aux_mod_main_~B~0_26_37) aux_mod_aux_mod_main_~B~0_26_37) 4294967296) (<= 0 aux_mod_aux_mod_main_~B~0_26_37) (<= 0 (+ (* 4294967296 aux_div_aux_mod_main_~B~0_26_37) aux_mod_aux_mod_main_~B~0_26_37)) (< aux_mod_aux_mod_main_~B~0_26_37 4294967296) (= (* main_~p~0 (+ (* 4294967296 aux_div_aux_mod_main_~B~0_26_37) aux_mod_aux_mod_main_~B~0_26_37)) main_~d~0)))) (and (<= 0 (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0)) (= (mod (div (+ main_~d~0 (* (- 1) (* (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) main_~p~0))) 4294967296) main_~p~0) 0) (<= 0 (+ (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) (* 4294967296 (div (div (+ (* (- 1) (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) main_~p~0) main_~d~0) 4294967296) main_~p~0)))) (< (+ (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) (* 4294967296 (div (div (+ (* (- 1) (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) main_~p~0) main_~d~0) 4294967296) main_~p~0))) 4294967296) (not (= main_~q~0 0)) (< (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) 4294967296) (= (mod (+ (* (- 1) (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) main_~p~0) main_~d~0) 4294967296) 0))) (<= (mod main_~A~0 4294967296) (+ main_~d~0 main_~r~0)))} assume !(1 != ~p~0); {10498#(and (< (+ (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) (* 4294967296 (div (div (+ main_~d~0 (* (- 1) (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) main_~q~0)) 4294967296) main_~q~0))) 4294967296) (= (mod (+ main_~d~0 (* (- 1) (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) main_~q~0)) 4294967296) 0) (<= 0 (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0)) (= main_~q~0 1) (< (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) 4294967296) (<= 0 (+ (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) (* 4294967296 (div (div (+ main_~d~0 (* (- 1) (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) main_~q~0)) 4294967296) main_~q~0)))))} is VALID [2022-04-15 09:21:02,972 INFO L272 TraceCheckUtils]: 75: Hoare triple {10498#(and (< (+ (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) (* 4294967296 (div (div (+ main_~d~0 (* (- 1) (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) main_~q~0)) 4294967296) main_~q~0))) 4294967296) (= (mod (+ main_~d~0 (* (- 1) (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) main_~q~0)) 4294967296) 0) (<= 0 (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0)) (= main_~q~0 1) (< (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) 4294967296) (<= 0 (+ (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) (* 4294967296 (div (div (+ main_~d~0 (* (- 1) (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) main_~q~0) main_~q~0)) 4294967296) main_~q~0)))))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {10502#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 09:21:02,973 INFO L290 TraceCheckUtils]: 76: Hoare triple {10502#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10506#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:21:02,973 INFO L290 TraceCheckUtils]: 77: Hoare triple {10506#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10266#false} is VALID [2022-04-15 09:21:02,973 INFO L290 TraceCheckUtils]: 78: Hoare triple {10266#false} assume !false; {10266#false} is VALID [2022-04-15 09:21:02,973 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 66 proven. 7 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2022-04-15 09:21:02,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:21:52,709 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 09:21:58,549 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 09:22:15,884 INFO L290 TraceCheckUtils]: 78: Hoare triple {10266#false} assume !false; {10266#false} is VALID [2022-04-15 09:22:15,885 INFO L290 TraceCheckUtils]: 77: Hoare triple {10506#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10266#false} is VALID [2022-04-15 09:22:15,885 INFO L290 TraceCheckUtils]: 76: Hoare triple {10502#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10506#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:22:15,886 INFO L272 TraceCheckUtils]: 75: Hoare triple {10522#(= (mod main_~A~0 4294967296) (+ (* main_~d~0 main_~q~0) main_~r~0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {10502#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 09:22:15,886 INFO L290 TraceCheckUtils]: 74: Hoare triple {10526#(or (= (mod main_~A~0 4294967296) (+ (* main_~d~0 main_~q~0) main_~r~0)) (not (= main_~p~0 1)))} assume !(1 != ~p~0); {10522#(= (mod main_~A~0 4294967296) (+ (* main_~d~0 main_~q~0) main_~r~0))} is VALID [2022-04-15 09:22:15,887 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {10471#(not (= |__VERIFIER_assert_#in~cond| 0))} {10530#(or (= (mod main_~A~0 4294967296) (+ (* main_~d~0 main_~q~0) main_~r~0)) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (not (= main_~p~0 1)))} #90#return; {10526#(or (= (mod main_~A~0 4294967296) (+ (* main_~d~0 main_~q~0) main_~r~0)) (not (= main_~p~0 1)))} is VALID [2022-04-15 09:22:15,887 INFO L290 TraceCheckUtils]: 72: Hoare triple {10471#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10471#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:22:15,887 INFO L290 TraceCheckUtils]: 71: Hoare triple {10540#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {10471#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:22:15,888 INFO L290 TraceCheckUtils]: 70: Hoare triple {10265#true} ~cond := #in~cond; {10540#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 09:22:15,888 INFO L272 TraceCheckUtils]: 69: Hoare triple {10530#(or (= (mod main_~A~0 4294967296) (+ (* main_~d~0 main_~q~0) main_~r~0)) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (not (= main_~p~0 1)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {10265#true} is VALID [2022-04-15 09:22:15,890 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10471#(not (= |__VERIFIER_assert_#in~cond| 0))} {10265#true} #88#return; {10530#(or (= (mod main_~A~0 4294967296) (+ (* main_~d~0 main_~q~0) main_~r~0)) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))) (not (= main_~p~0 1)))} is VALID [2022-04-15 09:22:15,891 INFO L290 TraceCheckUtils]: 67: Hoare triple {10471#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10471#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:22:15,891 INFO L290 TraceCheckUtils]: 66: Hoare triple {10540#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {10471#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:22:15,891 INFO L290 TraceCheckUtils]: 65: Hoare triple {10265#true} ~cond := #in~cond; {10540#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 09:22:15,891 INFO L272 TraceCheckUtils]: 64: Hoare triple {10265#true} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {10265#true} is VALID [2022-04-15 09:22:15,891 INFO L290 TraceCheckUtils]: 63: Hoare triple {10265#true} assume !!(#t~post7 < 20);havoc #t~post7; {10265#true} is VALID [2022-04-15 09:22:15,892 INFO L290 TraceCheckUtils]: 62: Hoare triple {10265#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10265#true} is VALID [2022-04-15 09:22:15,892 INFO L290 TraceCheckUtils]: 61: Hoare triple {10265#true} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {10265#true} is VALID [2022-04-15 09:22:15,892 INFO L290 TraceCheckUtils]: 60: Hoare triple {10265#true} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {10265#true} is VALID [2022-04-15 09:22:15,892 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10265#true} {10265#true} #90#return; {10265#true} is VALID [2022-04-15 09:22:15,892 INFO L290 TraceCheckUtils]: 58: Hoare triple {10265#true} assume true; {10265#true} is VALID [2022-04-15 09:22:15,892 INFO L290 TraceCheckUtils]: 57: Hoare triple {10265#true} assume !(0 == ~cond); {10265#true} is VALID [2022-04-15 09:22:15,892 INFO L290 TraceCheckUtils]: 56: Hoare triple {10265#true} ~cond := #in~cond; {10265#true} is VALID [2022-04-15 09:22:15,892 INFO L272 TraceCheckUtils]: 55: Hoare triple {10265#true} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {10265#true} is VALID [2022-04-15 09:22:15,892 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {10265#true} {10265#true} #88#return; {10265#true} is VALID [2022-04-15 09:22:15,892 INFO L290 TraceCheckUtils]: 53: Hoare triple {10265#true} assume true; {10265#true} is VALID [2022-04-15 09:22:15,892 INFO L290 TraceCheckUtils]: 52: Hoare triple {10265#true} assume !(0 == ~cond); {10265#true} is VALID [2022-04-15 09:22:15,893 INFO L290 TraceCheckUtils]: 51: Hoare triple {10265#true} ~cond := #in~cond; {10265#true} is VALID [2022-04-15 09:22:15,893 INFO L272 TraceCheckUtils]: 50: Hoare triple {10265#true} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {10265#true} is VALID [2022-04-15 09:22:15,893 INFO L290 TraceCheckUtils]: 49: Hoare triple {10265#true} assume !!(#t~post7 < 20);havoc #t~post7; {10265#true} is VALID [2022-04-15 09:22:15,893 INFO L290 TraceCheckUtils]: 48: Hoare triple {10265#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10265#true} is VALID [2022-04-15 09:22:15,893 INFO L290 TraceCheckUtils]: 47: Hoare triple {10265#true} assume !(~r~0 >= ~d~0); {10265#true} is VALID [2022-04-15 09:22:15,893 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {10265#true} {10265#true} #86#return; {10265#true} is VALID [2022-04-15 09:22:15,893 INFO L290 TraceCheckUtils]: 45: Hoare triple {10265#true} assume true; {10265#true} is VALID [2022-04-15 09:22:15,893 INFO L290 TraceCheckUtils]: 44: Hoare triple {10265#true} assume !(0 == ~cond); {10265#true} is VALID [2022-04-15 09:22:15,893 INFO L290 TraceCheckUtils]: 43: Hoare triple {10265#true} ~cond := #in~cond; {10265#true} is VALID [2022-04-15 09:22:15,893 INFO L272 TraceCheckUtils]: 42: Hoare triple {10265#true} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {10265#true} is VALID [2022-04-15 09:22:15,894 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {10265#true} {10265#true} #84#return; {10265#true} is VALID [2022-04-15 09:22:15,894 INFO L290 TraceCheckUtils]: 40: Hoare triple {10265#true} assume true; {10265#true} is VALID [2022-04-15 09:22:15,894 INFO L290 TraceCheckUtils]: 39: Hoare triple {10265#true} assume !(0 == ~cond); {10265#true} is VALID [2022-04-15 09:22:15,894 INFO L290 TraceCheckUtils]: 38: Hoare triple {10265#true} ~cond := #in~cond; {10265#true} is VALID [2022-04-15 09:22:15,894 INFO L272 TraceCheckUtils]: 37: Hoare triple {10265#true} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {10265#true} is VALID [2022-04-15 09:22:15,894 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10265#true} {10265#true} #82#return; {10265#true} is VALID [2022-04-15 09:22:15,894 INFO L290 TraceCheckUtils]: 35: Hoare triple {10265#true} assume true; {10265#true} is VALID [2022-04-15 09:22:15,894 INFO L290 TraceCheckUtils]: 34: Hoare triple {10265#true} assume !(0 == ~cond); {10265#true} is VALID [2022-04-15 09:22:15,894 INFO L290 TraceCheckUtils]: 33: Hoare triple {10265#true} ~cond := #in~cond; {10265#true} is VALID [2022-04-15 09:22:15,894 INFO L272 TraceCheckUtils]: 32: Hoare triple {10265#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10265#true} is VALID [2022-04-15 09:22:15,894 INFO L290 TraceCheckUtils]: 31: Hoare triple {10265#true} assume !!(#t~post6 < 20);havoc #t~post6; {10265#true} is VALID [2022-04-15 09:22:15,895 INFO L290 TraceCheckUtils]: 30: Hoare triple {10265#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10265#true} is VALID [2022-04-15 09:22:15,895 INFO L290 TraceCheckUtils]: 29: Hoare triple {10265#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {10265#true} is VALID [2022-04-15 09:22:15,895 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {10265#true} {10265#true} #86#return; {10265#true} is VALID [2022-04-15 09:22:15,895 INFO L290 TraceCheckUtils]: 27: Hoare triple {10265#true} assume true; {10265#true} is VALID [2022-04-15 09:22:15,910 INFO L290 TraceCheckUtils]: 26: Hoare triple {10265#true} assume !(0 == ~cond); {10265#true} is VALID [2022-04-15 09:22:15,910 INFO L290 TraceCheckUtils]: 25: Hoare triple {10265#true} ~cond := #in~cond; {10265#true} is VALID [2022-04-15 09:22:15,910 INFO L272 TraceCheckUtils]: 24: Hoare triple {10265#true} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {10265#true} is VALID [2022-04-15 09:22:15,910 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10265#true} {10265#true} #84#return; {10265#true} is VALID [2022-04-15 09:22:15,910 INFO L290 TraceCheckUtils]: 22: Hoare triple {10265#true} assume true; {10265#true} is VALID [2022-04-15 09:22:15,910 INFO L290 TraceCheckUtils]: 21: Hoare triple {10265#true} assume !(0 == ~cond); {10265#true} is VALID [2022-04-15 09:22:15,910 INFO L290 TraceCheckUtils]: 20: Hoare triple {10265#true} ~cond := #in~cond; {10265#true} is VALID [2022-04-15 09:22:15,911 INFO L272 TraceCheckUtils]: 19: Hoare triple {10265#true} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {10265#true} is VALID [2022-04-15 09:22:15,911 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10265#true} {10265#true} #82#return; {10265#true} is VALID [2022-04-15 09:22:15,911 INFO L290 TraceCheckUtils]: 17: Hoare triple {10265#true} assume true; {10265#true} is VALID [2022-04-15 09:22:15,911 INFO L290 TraceCheckUtils]: 16: Hoare triple {10265#true} assume !(0 == ~cond); {10265#true} is VALID [2022-04-15 09:22:15,911 INFO L290 TraceCheckUtils]: 15: Hoare triple {10265#true} ~cond := #in~cond; {10265#true} is VALID [2022-04-15 09:22:15,911 INFO L272 TraceCheckUtils]: 14: Hoare triple {10265#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10265#true} is VALID [2022-04-15 09:22:15,911 INFO L290 TraceCheckUtils]: 13: Hoare triple {10265#true} assume !!(#t~post6 < 20);havoc #t~post6; {10265#true} is VALID [2022-04-15 09:22:15,911 INFO L290 TraceCheckUtils]: 12: Hoare triple {10265#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10265#true} is VALID [2022-04-15 09:22:15,911 INFO L290 TraceCheckUtils]: 11: Hoare triple {10265#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {10265#true} is VALID [2022-04-15 09:22:15,911 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10265#true} {10265#true} #80#return; {10265#true} is VALID [2022-04-15 09:22:15,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {10265#true} assume true; {10265#true} is VALID [2022-04-15 09:22:15,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {10265#true} assume !(0 == ~cond); {10265#true} is VALID [2022-04-15 09:22:15,912 INFO L290 TraceCheckUtils]: 7: Hoare triple {10265#true} ~cond := #in~cond; {10265#true} is VALID [2022-04-15 09:22:15,912 INFO L272 TraceCheckUtils]: 6: Hoare triple {10265#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {10265#true} is VALID [2022-04-15 09:22:15,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {10265#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {10265#true} is VALID [2022-04-15 09:22:15,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {10265#true} call #t~ret8 := main(); {10265#true} is VALID [2022-04-15 09:22:15,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10265#true} {10265#true} #96#return; {10265#true} is VALID [2022-04-15 09:22:15,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {10265#true} assume true; {10265#true} is VALID [2022-04-15 09:22:15,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {10265#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10265#true} is VALID [2022-04-15 09:22:15,912 INFO L272 TraceCheckUtils]: 0: Hoare triple {10265#true} call ULTIMATE.init(); {10265#true} is VALID [2022-04-15 09:22:15,913 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 68 proven. 2 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2022-04-15 09:22:15,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:22:15,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110062028] [2022-04-15 09:22:15,913 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:22:15,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745191779] [2022-04-15 09:22:15,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745191779] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:22:15,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:22:15,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 15 [2022-04-15 09:22:15,914 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:22:15,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1184818436] [2022-04-15 09:22:15,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1184818436] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:22:15,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:22:15,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 09:22:15,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920441737] [2022-04-15 09:22:15,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:22:15,914 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 79 [2022-04-15 09:22:15,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:22:15,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-15 09:22:17,963 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 46 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 09:22:17,963 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 09:22:17,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:22:17,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 09:22:17,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-04-15 09:22:17,964 INFO L87 Difference]: Start difference. First operand 147 states and 169 transitions. Second operand has 11 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-15 09:22:27,362 WARN L232 SmtUtils]: Spent 6.08s on a formula simplification. DAG size of input: 59 DAG size of output: 56 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-15 09:22:27,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:22:27,864 INFO L93 Difference]: Finished difference Result 164 states and 192 transitions. [2022-04-15 09:22:27,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 09:22:27,864 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 79 [2022-04-15 09:22:27,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:22:27,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-15 09:22:27,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 76 transitions. [2022-04-15 09:22:27,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-15 09:22:27,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 76 transitions. [2022-04-15 09:22:27,867 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 76 transitions. [2022-04-15 09:22:29,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 75 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 09:22:29,946 INFO L225 Difference]: With dead ends: 164 [2022-04-15 09:22:29,946 INFO L226 Difference]: Without dead ends: 162 [2022-04-15 09:22:29,947 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 143 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2022-04-15 09:22:29,947 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 17 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 09:22:29,947 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 203 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 207 Invalid, 0 Unknown, 40 Unchecked, 0.7s Time] [2022-04-15 09:22:29,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-04-15 09:22:30,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 158. [2022-04-15 09:22:30,092 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:22:30,095 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand has 158 states, 103 states have (on average 1.174757281553398) internal successors, (121), 107 states have internal predecessors, (121), 33 states have call successors, (33), 22 states have call predecessors, (33), 21 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-15 09:22:30,095 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand has 158 states, 103 states have (on average 1.174757281553398) internal successors, (121), 107 states have internal predecessors, (121), 33 states have call successors, (33), 22 states have call predecessors, (33), 21 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-15 09:22:30,107 INFO L87 Difference]: Start difference. First operand 162 states. Second operand has 158 states, 103 states have (on average 1.174757281553398) internal successors, (121), 107 states have internal predecessors, (121), 33 states have call successors, (33), 22 states have call predecessors, (33), 21 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-15 09:22:30,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:22:30,115 INFO L93 Difference]: Finished difference Result 162 states and 190 transitions. [2022-04-15 09:22:30,115 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 190 transitions. [2022-04-15 09:22:30,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:22:30,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:22:30,116 INFO L74 IsIncluded]: Start isIncluded. First operand has 158 states, 103 states have (on average 1.174757281553398) internal successors, (121), 107 states have internal predecessors, (121), 33 states have call successors, (33), 22 states have call predecessors, (33), 21 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) Second operand 162 states. [2022-04-15 09:22:30,116 INFO L87 Difference]: Start difference. First operand has 158 states, 103 states have (on average 1.174757281553398) internal successors, (121), 107 states have internal predecessors, (121), 33 states have call successors, (33), 22 states have call predecessors, (33), 21 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) Second operand 162 states. [2022-04-15 09:22:30,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:22:30,132 INFO L93 Difference]: Finished difference Result 162 states and 190 transitions. [2022-04-15 09:22:30,132 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 190 transitions. [2022-04-15 09:22:30,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:22:30,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:22:30,133 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:22:30,133 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:22:30,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 103 states have (on average 1.174757281553398) internal successors, (121), 107 states have internal predecessors, (121), 33 states have call successors, (33), 22 states have call predecessors, (33), 21 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-15 09:22:30,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 185 transitions. [2022-04-15 09:22:30,136 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 185 transitions. Word has length 79 [2022-04-15 09:22:30,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:22:30,136 INFO L478 AbstractCegarLoop]: Abstraction has 158 states and 185 transitions. [2022-04-15 09:22:30,136 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-15 09:22:30,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 158 states and 185 transitions. [2022-04-15 09:22:32,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 185 edges. 184 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 09:22:32,391 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 185 transitions. [2022-04-15 09:22:32,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-15 09:22:32,392 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:22:32,392 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:22:32,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-15 09:22:32,592 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-15 09:22:32,593 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:22:32,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:22:32,593 INFO L85 PathProgramCache]: Analyzing trace with hash 816704307, now seen corresponding path program 5 times [2022-04-15 09:22:32,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:22:32,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1709475407] [2022-04-15 09:22:39,884 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:22:39,885 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:22:39,885 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:22:39,885 INFO L85 PathProgramCache]: Analyzing trace with hash 816704307, now seen corresponding path program 6 times [2022-04-15 09:22:39,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:22:39,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333391317] [2022-04-15 09:22:39,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:22:39,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:22:39,892 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:22:39,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1270245246] [2022-04-15 09:22:39,893 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 09:22:39,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:22:39,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:22:39,894 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:22:39,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-15 09:22:39,981 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-15 09:22:39,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:22:39,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 09:22:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:22:39,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:22:40,315 INFO L272 TraceCheckUtils]: 0: Hoare triple {11727#true} call ULTIMATE.init(); {11727#true} is VALID [2022-04-15 09:22:40,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {11727#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11735#(<= ~counter~0 0)} is VALID [2022-04-15 09:22:40,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {11735#(<= ~counter~0 0)} assume true; {11735#(<= ~counter~0 0)} is VALID [2022-04-15 09:22:40,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11735#(<= ~counter~0 0)} {11727#true} #96#return; {11735#(<= ~counter~0 0)} is VALID [2022-04-15 09:22:40,317 INFO L272 TraceCheckUtils]: 4: Hoare triple {11735#(<= ~counter~0 0)} call #t~ret8 := main(); {11735#(<= ~counter~0 0)} is VALID [2022-04-15 09:22:40,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {11735#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {11735#(<= ~counter~0 0)} is VALID [2022-04-15 09:22:40,317 INFO L272 TraceCheckUtils]: 6: Hoare triple {11735#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {11735#(<= ~counter~0 0)} is VALID [2022-04-15 09:22:40,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {11735#(<= ~counter~0 0)} ~cond := #in~cond; {11735#(<= ~counter~0 0)} is VALID [2022-04-15 09:22:40,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {11735#(<= ~counter~0 0)} assume !(0 == ~cond); {11735#(<= ~counter~0 0)} is VALID [2022-04-15 09:22:40,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {11735#(<= ~counter~0 0)} assume true; {11735#(<= ~counter~0 0)} is VALID [2022-04-15 09:22:40,319 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11735#(<= ~counter~0 0)} {11735#(<= ~counter~0 0)} #80#return; {11735#(<= ~counter~0 0)} is VALID [2022-04-15 09:22:40,319 INFO L290 TraceCheckUtils]: 11: Hoare triple {11735#(<= ~counter~0 0)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {11735#(<= ~counter~0 0)} is VALID [2022-04-15 09:22:40,320 INFO L290 TraceCheckUtils]: 12: Hoare triple {11735#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11769#(<= ~counter~0 1)} is VALID [2022-04-15 09:22:40,320 INFO L290 TraceCheckUtils]: 13: Hoare triple {11769#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {11769#(<= ~counter~0 1)} is VALID [2022-04-15 09:22:40,320 INFO L272 TraceCheckUtils]: 14: Hoare triple {11769#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {11769#(<= ~counter~0 1)} is VALID [2022-04-15 09:22:40,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {11769#(<= ~counter~0 1)} ~cond := #in~cond; {11769#(<= ~counter~0 1)} is VALID [2022-04-15 09:22:40,321 INFO L290 TraceCheckUtils]: 16: Hoare triple {11769#(<= ~counter~0 1)} assume !(0 == ~cond); {11769#(<= ~counter~0 1)} is VALID [2022-04-15 09:22:40,321 INFO L290 TraceCheckUtils]: 17: Hoare triple {11769#(<= ~counter~0 1)} assume true; {11769#(<= ~counter~0 1)} is VALID [2022-04-15 09:22:40,322 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {11769#(<= ~counter~0 1)} {11769#(<= ~counter~0 1)} #82#return; {11769#(<= ~counter~0 1)} is VALID [2022-04-15 09:22:40,322 INFO L272 TraceCheckUtils]: 19: Hoare triple {11769#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {11769#(<= ~counter~0 1)} is VALID [2022-04-15 09:22:40,322 INFO L290 TraceCheckUtils]: 20: Hoare triple {11769#(<= ~counter~0 1)} ~cond := #in~cond; {11769#(<= ~counter~0 1)} is VALID [2022-04-15 09:22:40,323 INFO L290 TraceCheckUtils]: 21: Hoare triple {11769#(<= ~counter~0 1)} assume !(0 == ~cond); {11769#(<= ~counter~0 1)} is VALID [2022-04-15 09:22:40,323 INFO L290 TraceCheckUtils]: 22: Hoare triple {11769#(<= ~counter~0 1)} assume true; {11769#(<= ~counter~0 1)} is VALID [2022-04-15 09:22:40,324 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11769#(<= ~counter~0 1)} {11769#(<= ~counter~0 1)} #84#return; {11769#(<= ~counter~0 1)} is VALID [2022-04-15 09:22:40,324 INFO L272 TraceCheckUtils]: 24: Hoare triple {11769#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {11769#(<= ~counter~0 1)} is VALID [2022-04-15 09:22:40,324 INFO L290 TraceCheckUtils]: 25: Hoare triple {11769#(<= ~counter~0 1)} ~cond := #in~cond; {11769#(<= ~counter~0 1)} is VALID [2022-04-15 09:22:40,325 INFO L290 TraceCheckUtils]: 26: Hoare triple {11769#(<= ~counter~0 1)} assume !(0 == ~cond); {11769#(<= ~counter~0 1)} is VALID [2022-04-15 09:22:40,325 INFO L290 TraceCheckUtils]: 27: Hoare triple {11769#(<= ~counter~0 1)} assume true; {11769#(<= ~counter~0 1)} is VALID [2022-04-15 09:22:40,325 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {11769#(<= ~counter~0 1)} {11769#(<= ~counter~0 1)} #86#return; {11769#(<= ~counter~0 1)} is VALID [2022-04-15 09:22:40,326 INFO L290 TraceCheckUtils]: 29: Hoare triple {11769#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {11769#(<= ~counter~0 1)} is VALID [2022-04-15 09:22:40,326 INFO L290 TraceCheckUtils]: 30: Hoare triple {11769#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11824#(<= ~counter~0 2)} is VALID [2022-04-15 09:22:40,327 INFO L290 TraceCheckUtils]: 31: Hoare triple {11824#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {11824#(<= ~counter~0 2)} is VALID [2022-04-15 09:22:40,327 INFO L272 TraceCheckUtils]: 32: Hoare triple {11824#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {11824#(<= ~counter~0 2)} is VALID [2022-04-15 09:22:40,327 INFO L290 TraceCheckUtils]: 33: Hoare triple {11824#(<= ~counter~0 2)} ~cond := #in~cond; {11824#(<= ~counter~0 2)} is VALID [2022-04-15 09:22:40,328 INFO L290 TraceCheckUtils]: 34: Hoare triple {11824#(<= ~counter~0 2)} assume !(0 == ~cond); {11824#(<= ~counter~0 2)} is VALID [2022-04-15 09:22:40,328 INFO L290 TraceCheckUtils]: 35: Hoare triple {11824#(<= ~counter~0 2)} assume true; {11824#(<= ~counter~0 2)} is VALID [2022-04-15 09:22:40,328 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {11824#(<= ~counter~0 2)} {11824#(<= ~counter~0 2)} #82#return; {11824#(<= ~counter~0 2)} is VALID [2022-04-15 09:22:40,329 INFO L272 TraceCheckUtils]: 37: Hoare triple {11824#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {11824#(<= ~counter~0 2)} is VALID [2022-04-15 09:22:40,329 INFO L290 TraceCheckUtils]: 38: Hoare triple {11824#(<= ~counter~0 2)} ~cond := #in~cond; {11824#(<= ~counter~0 2)} is VALID [2022-04-15 09:22:40,330 INFO L290 TraceCheckUtils]: 39: Hoare triple {11824#(<= ~counter~0 2)} assume !(0 == ~cond); {11824#(<= ~counter~0 2)} is VALID [2022-04-15 09:22:40,330 INFO L290 TraceCheckUtils]: 40: Hoare triple {11824#(<= ~counter~0 2)} assume true; {11824#(<= ~counter~0 2)} is VALID [2022-04-15 09:22:40,330 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {11824#(<= ~counter~0 2)} {11824#(<= ~counter~0 2)} #84#return; {11824#(<= ~counter~0 2)} is VALID [2022-04-15 09:22:40,331 INFO L272 TraceCheckUtils]: 42: Hoare triple {11824#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {11824#(<= ~counter~0 2)} is VALID [2022-04-15 09:22:40,331 INFO L290 TraceCheckUtils]: 43: Hoare triple {11824#(<= ~counter~0 2)} ~cond := #in~cond; {11824#(<= ~counter~0 2)} is VALID [2022-04-15 09:22:40,331 INFO L290 TraceCheckUtils]: 44: Hoare triple {11824#(<= ~counter~0 2)} assume !(0 == ~cond); {11824#(<= ~counter~0 2)} is VALID [2022-04-15 09:22:40,332 INFO L290 TraceCheckUtils]: 45: Hoare triple {11824#(<= ~counter~0 2)} assume true; {11824#(<= ~counter~0 2)} is VALID [2022-04-15 09:22:40,332 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {11824#(<= ~counter~0 2)} {11824#(<= ~counter~0 2)} #86#return; {11824#(<= ~counter~0 2)} is VALID [2022-04-15 09:22:40,332 INFO L290 TraceCheckUtils]: 47: Hoare triple {11824#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {11824#(<= ~counter~0 2)} is VALID [2022-04-15 09:22:40,333 INFO L290 TraceCheckUtils]: 48: Hoare triple {11824#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11879#(<= ~counter~0 3)} is VALID [2022-04-15 09:22:40,333 INFO L290 TraceCheckUtils]: 49: Hoare triple {11879#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {11879#(<= ~counter~0 3)} is VALID [2022-04-15 09:22:40,334 INFO L272 TraceCheckUtils]: 50: Hoare triple {11879#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {11879#(<= ~counter~0 3)} is VALID [2022-04-15 09:22:40,334 INFO L290 TraceCheckUtils]: 51: Hoare triple {11879#(<= ~counter~0 3)} ~cond := #in~cond; {11879#(<= ~counter~0 3)} is VALID [2022-04-15 09:22:40,334 INFO L290 TraceCheckUtils]: 52: Hoare triple {11879#(<= ~counter~0 3)} assume !(0 == ~cond); {11879#(<= ~counter~0 3)} is VALID [2022-04-15 09:22:40,335 INFO L290 TraceCheckUtils]: 53: Hoare triple {11879#(<= ~counter~0 3)} assume true; {11879#(<= ~counter~0 3)} is VALID [2022-04-15 09:22:40,335 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {11879#(<= ~counter~0 3)} {11879#(<= ~counter~0 3)} #82#return; {11879#(<= ~counter~0 3)} is VALID [2022-04-15 09:22:40,335 INFO L272 TraceCheckUtils]: 55: Hoare triple {11879#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {11879#(<= ~counter~0 3)} is VALID [2022-04-15 09:22:40,336 INFO L290 TraceCheckUtils]: 56: Hoare triple {11879#(<= ~counter~0 3)} ~cond := #in~cond; {11879#(<= ~counter~0 3)} is VALID [2022-04-15 09:22:40,336 INFO L290 TraceCheckUtils]: 57: Hoare triple {11879#(<= ~counter~0 3)} assume !(0 == ~cond); {11879#(<= ~counter~0 3)} is VALID [2022-04-15 09:22:40,336 INFO L290 TraceCheckUtils]: 58: Hoare triple {11879#(<= ~counter~0 3)} assume true; {11879#(<= ~counter~0 3)} is VALID [2022-04-15 09:22:40,337 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {11879#(<= ~counter~0 3)} {11879#(<= ~counter~0 3)} #84#return; {11879#(<= ~counter~0 3)} is VALID [2022-04-15 09:22:40,337 INFO L272 TraceCheckUtils]: 60: Hoare triple {11879#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {11879#(<= ~counter~0 3)} is VALID [2022-04-15 09:22:40,338 INFO L290 TraceCheckUtils]: 61: Hoare triple {11879#(<= ~counter~0 3)} ~cond := #in~cond; {11879#(<= ~counter~0 3)} is VALID [2022-04-15 09:22:40,338 INFO L290 TraceCheckUtils]: 62: Hoare triple {11879#(<= ~counter~0 3)} assume !(0 == ~cond); {11879#(<= ~counter~0 3)} is VALID [2022-04-15 09:22:40,338 INFO L290 TraceCheckUtils]: 63: Hoare triple {11879#(<= ~counter~0 3)} assume true; {11879#(<= ~counter~0 3)} is VALID [2022-04-15 09:22:40,339 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {11879#(<= ~counter~0 3)} {11879#(<= ~counter~0 3)} #86#return; {11879#(<= ~counter~0 3)} is VALID [2022-04-15 09:22:40,339 INFO L290 TraceCheckUtils]: 65: Hoare triple {11879#(<= ~counter~0 3)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {11879#(<= ~counter~0 3)} is VALID [2022-04-15 09:22:40,339 INFO L290 TraceCheckUtils]: 66: Hoare triple {11879#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11934#(<= |main_#t~post6| 3)} is VALID [2022-04-15 09:22:40,340 INFO L290 TraceCheckUtils]: 67: Hoare triple {11934#(<= |main_#t~post6| 3)} assume !(#t~post6 < 20);havoc #t~post6; {11728#false} is VALID [2022-04-15 09:22:40,340 INFO L290 TraceCheckUtils]: 68: Hoare triple {11728#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11728#false} is VALID [2022-04-15 09:22:40,340 INFO L290 TraceCheckUtils]: 69: Hoare triple {11728#false} assume !(#t~post7 < 20);havoc #t~post7; {11728#false} is VALID [2022-04-15 09:22:40,340 INFO L272 TraceCheckUtils]: 70: Hoare triple {11728#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {11728#false} is VALID [2022-04-15 09:22:40,340 INFO L290 TraceCheckUtils]: 71: Hoare triple {11728#false} ~cond := #in~cond; {11728#false} is VALID [2022-04-15 09:22:40,340 INFO L290 TraceCheckUtils]: 72: Hoare triple {11728#false} assume !(0 == ~cond); {11728#false} is VALID [2022-04-15 09:22:40,340 INFO L290 TraceCheckUtils]: 73: Hoare triple {11728#false} assume true; {11728#false} is VALID [2022-04-15 09:22:40,340 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {11728#false} {11728#false} #92#return; {11728#false} is VALID [2022-04-15 09:22:40,341 INFO L272 TraceCheckUtils]: 75: Hoare triple {11728#false} call __VERIFIER_assert((if ~B~0 % 4294967296 == ~d~0 then 1 else 0)); {11728#false} is VALID [2022-04-15 09:22:40,341 INFO L290 TraceCheckUtils]: 76: Hoare triple {11728#false} ~cond := #in~cond; {11728#false} is VALID [2022-04-15 09:22:40,341 INFO L290 TraceCheckUtils]: 77: Hoare triple {11728#false} assume 0 == ~cond; {11728#false} is VALID [2022-04-15 09:22:40,341 INFO L290 TraceCheckUtils]: 78: Hoare triple {11728#false} assume !false; {11728#false} is VALID [2022-04-15 09:22:40,341 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 54 proven. 132 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-15 09:22:40,341 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:22:40,628 INFO L290 TraceCheckUtils]: 78: Hoare triple {11728#false} assume !false; {11728#false} is VALID [2022-04-15 09:22:40,628 INFO L290 TraceCheckUtils]: 77: Hoare triple {11728#false} assume 0 == ~cond; {11728#false} is VALID [2022-04-15 09:22:40,628 INFO L290 TraceCheckUtils]: 76: Hoare triple {11728#false} ~cond := #in~cond; {11728#false} is VALID [2022-04-15 09:22:40,628 INFO L272 TraceCheckUtils]: 75: Hoare triple {11728#false} call __VERIFIER_assert((if ~B~0 % 4294967296 == ~d~0 then 1 else 0)); {11728#false} is VALID [2022-04-15 09:22:40,629 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {11727#true} {11728#false} #92#return; {11728#false} is VALID [2022-04-15 09:22:40,629 INFO L290 TraceCheckUtils]: 73: Hoare triple {11727#true} assume true; {11727#true} is VALID [2022-04-15 09:22:40,629 INFO L290 TraceCheckUtils]: 72: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID [2022-04-15 09:22:40,629 INFO L290 TraceCheckUtils]: 71: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID [2022-04-15 09:22:40,629 INFO L272 TraceCheckUtils]: 70: Hoare triple {11728#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {11727#true} is VALID [2022-04-15 09:22:40,629 INFO L290 TraceCheckUtils]: 69: Hoare triple {11728#false} assume !(#t~post7 < 20);havoc #t~post7; {11728#false} is VALID [2022-04-15 09:22:40,629 INFO L290 TraceCheckUtils]: 68: Hoare triple {11728#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11728#false} is VALID [2022-04-15 09:22:40,629 INFO L290 TraceCheckUtils]: 67: Hoare triple {12004#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {11728#false} is VALID [2022-04-15 09:22:40,630 INFO L290 TraceCheckUtils]: 66: Hoare triple {12008#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12004#(< |main_#t~post6| 20)} is VALID [2022-04-15 09:22:40,630 INFO L290 TraceCheckUtils]: 65: Hoare triple {12008#(< ~counter~0 20)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12008#(< ~counter~0 20)} is VALID [2022-04-15 09:22:40,631 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {11727#true} {12008#(< ~counter~0 20)} #86#return; {12008#(< ~counter~0 20)} is VALID [2022-04-15 09:22:40,631 INFO L290 TraceCheckUtils]: 63: Hoare triple {11727#true} assume true; {11727#true} is VALID [2022-04-15 09:22:40,631 INFO L290 TraceCheckUtils]: 62: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID [2022-04-15 09:22:40,631 INFO L290 TraceCheckUtils]: 61: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID [2022-04-15 09:22:40,631 INFO L272 TraceCheckUtils]: 60: Hoare triple {12008#(< ~counter~0 20)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {11727#true} is VALID [2022-04-15 09:22:40,631 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {11727#true} {12008#(< ~counter~0 20)} #84#return; {12008#(< ~counter~0 20)} is VALID [2022-04-15 09:22:40,632 INFO L290 TraceCheckUtils]: 58: Hoare triple {11727#true} assume true; {11727#true} is VALID [2022-04-15 09:22:40,632 INFO L290 TraceCheckUtils]: 57: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID [2022-04-15 09:22:40,632 INFO L290 TraceCheckUtils]: 56: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID [2022-04-15 09:22:40,632 INFO L272 TraceCheckUtils]: 55: Hoare triple {12008#(< ~counter~0 20)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {11727#true} is VALID [2022-04-15 09:22:40,632 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {11727#true} {12008#(< ~counter~0 20)} #82#return; {12008#(< ~counter~0 20)} is VALID [2022-04-15 09:22:40,632 INFO L290 TraceCheckUtils]: 53: Hoare triple {11727#true} assume true; {11727#true} is VALID [2022-04-15 09:22:40,632 INFO L290 TraceCheckUtils]: 52: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID [2022-04-15 09:22:40,633 INFO L290 TraceCheckUtils]: 51: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID [2022-04-15 09:22:40,633 INFO L272 TraceCheckUtils]: 50: Hoare triple {12008#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {11727#true} is VALID [2022-04-15 09:22:40,633 INFO L290 TraceCheckUtils]: 49: Hoare triple {12008#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {12008#(< ~counter~0 20)} is VALID [2022-04-15 09:22:40,634 INFO L290 TraceCheckUtils]: 48: Hoare triple {12063#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12008#(< ~counter~0 20)} is VALID [2022-04-15 09:22:40,634 INFO L290 TraceCheckUtils]: 47: Hoare triple {12063#(< ~counter~0 19)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12063#(< ~counter~0 19)} is VALID [2022-04-15 09:22:40,634 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {11727#true} {12063#(< ~counter~0 19)} #86#return; {12063#(< ~counter~0 19)} is VALID [2022-04-15 09:22:40,634 INFO L290 TraceCheckUtils]: 45: Hoare triple {11727#true} assume true; {11727#true} is VALID [2022-04-15 09:22:40,635 INFO L290 TraceCheckUtils]: 44: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID [2022-04-15 09:22:40,635 INFO L290 TraceCheckUtils]: 43: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID [2022-04-15 09:22:40,635 INFO L272 TraceCheckUtils]: 42: Hoare triple {12063#(< ~counter~0 19)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {11727#true} is VALID [2022-04-15 09:22:40,635 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {11727#true} {12063#(< ~counter~0 19)} #84#return; {12063#(< ~counter~0 19)} is VALID [2022-04-15 09:22:40,635 INFO L290 TraceCheckUtils]: 40: Hoare triple {11727#true} assume true; {11727#true} is VALID [2022-04-15 09:22:40,635 INFO L290 TraceCheckUtils]: 39: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID [2022-04-15 09:22:40,635 INFO L290 TraceCheckUtils]: 38: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID [2022-04-15 09:22:40,636 INFO L272 TraceCheckUtils]: 37: Hoare triple {12063#(< ~counter~0 19)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {11727#true} is VALID [2022-04-15 09:22:40,636 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {11727#true} {12063#(< ~counter~0 19)} #82#return; {12063#(< ~counter~0 19)} is VALID [2022-04-15 09:22:40,636 INFO L290 TraceCheckUtils]: 35: Hoare triple {11727#true} assume true; {11727#true} is VALID [2022-04-15 09:22:40,636 INFO L290 TraceCheckUtils]: 34: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID [2022-04-15 09:22:40,636 INFO L290 TraceCheckUtils]: 33: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID [2022-04-15 09:22:40,636 INFO L272 TraceCheckUtils]: 32: Hoare triple {12063#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {11727#true} is VALID [2022-04-15 09:22:40,637 INFO L290 TraceCheckUtils]: 31: Hoare triple {12063#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {12063#(< ~counter~0 19)} is VALID [2022-04-15 09:22:40,637 INFO L290 TraceCheckUtils]: 30: Hoare triple {12118#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12063#(< ~counter~0 19)} is VALID [2022-04-15 09:22:40,637 INFO L290 TraceCheckUtils]: 29: Hoare triple {12118#(< ~counter~0 18)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12118#(< ~counter~0 18)} is VALID [2022-04-15 09:22:40,638 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {11727#true} {12118#(< ~counter~0 18)} #86#return; {12118#(< ~counter~0 18)} is VALID [2022-04-15 09:22:40,638 INFO L290 TraceCheckUtils]: 27: Hoare triple {11727#true} assume true; {11727#true} is VALID [2022-04-15 09:22:40,638 INFO L290 TraceCheckUtils]: 26: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID [2022-04-15 09:22:40,638 INFO L290 TraceCheckUtils]: 25: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID [2022-04-15 09:22:40,638 INFO L272 TraceCheckUtils]: 24: Hoare triple {12118#(< ~counter~0 18)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {11727#true} is VALID [2022-04-15 09:22:40,639 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11727#true} {12118#(< ~counter~0 18)} #84#return; {12118#(< ~counter~0 18)} is VALID [2022-04-15 09:22:40,639 INFO L290 TraceCheckUtils]: 22: Hoare triple {11727#true} assume true; {11727#true} is VALID [2022-04-15 09:22:40,639 INFO L290 TraceCheckUtils]: 21: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID [2022-04-15 09:22:40,639 INFO L290 TraceCheckUtils]: 20: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID [2022-04-15 09:22:40,639 INFO L272 TraceCheckUtils]: 19: Hoare triple {12118#(< ~counter~0 18)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {11727#true} is VALID [2022-04-15 09:22:40,640 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {11727#true} {12118#(< ~counter~0 18)} #82#return; {12118#(< ~counter~0 18)} is VALID [2022-04-15 09:22:40,640 INFO L290 TraceCheckUtils]: 17: Hoare triple {11727#true} assume true; {11727#true} is VALID [2022-04-15 09:22:40,640 INFO L290 TraceCheckUtils]: 16: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID [2022-04-15 09:22:40,640 INFO L290 TraceCheckUtils]: 15: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID [2022-04-15 09:22:40,640 INFO L272 TraceCheckUtils]: 14: Hoare triple {12118#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {11727#true} is VALID [2022-04-15 09:22:40,640 INFO L290 TraceCheckUtils]: 13: Hoare triple {12118#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {12118#(< ~counter~0 18)} is VALID [2022-04-15 09:22:40,641 INFO L290 TraceCheckUtils]: 12: Hoare triple {12173#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12118#(< ~counter~0 18)} is VALID [2022-04-15 09:22:40,641 INFO L290 TraceCheckUtils]: 11: Hoare triple {12173#(< ~counter~0 17)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {12173#(< ~counter~0 17)} is VALID [2022-04-15 09:22:40,641 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11727#true} {12173#(< ~counter~0 17)} #80#return; {12173#(< ~counter~0 17)} is VALID [2022-04-15 09:22:40,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {11727#true} assume true; {11727#true} is VALID [2022-04-15 09:22:40,642 INFO L290 TraceCheckUtils]: 8: Hoare triple {11727#true} assume !(0 == ~cond); {11727#true} is VALID [2022-04-15 09:22:40,642 INFO L290 TraceCheckUtils]: 7: Hoare triple {11727#true} ~cond := #in~cond; {11727#true} is VALID [2022-04-15 09:22:40,642 INFO L272 TraceCheckUtils]: 6: Hoare triple {12173#(< ~counter~0 17)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {11727#true} is VALID [2022-04-15 09:22:40,642 INFO L290 TraceCheckUtils]: 5: Hoare triple {12173#(< ~counter~0 17)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {12173#(< ~counter~0 17)} is VALID [2022-04-15 09:22:40,642 INFO L272 TraceCheckUtils]: 4: Hoare triple {12173#(< ~counter~0 17)} call #t~ret8 := main(); {12173#(< ~counter~0 17)} is VALID [2022-04-15 09:22:40,643 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12173#(< ~counter~0 17)} {11727#true} #96#return; {12173#(< ~counter~0 17)} is VALID [2022-04-15 09:22:40,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {12173#(< ~counter~0 17)} assume true; {12173#(< ~counter~0 17)} is VALID [2022-04-15 09:22:40,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {11727#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {12173#(< ~counter~0 17)} is VALID [2022-04-15 09:22:40,644 INFO L272 TraceCheckUtils]: 0: Hoare triple {11727#true} call ULTIMATE.init(); {11727#true} is VALID [2022-04-15 09:22:40,644 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 20 proven. 24 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-15 09:22:40,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:22:40,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333391317] [2022-04-15 09:22:40,644 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:22:40,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270245246] [2022-04-15 09:22:40,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270245246] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:22:40,644 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:22:40,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-15 09:22:40,645 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:22:40,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1709475407] [2022-04-15 09:22:40,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1709475407] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:22:40,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:22:40,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 09:22:40,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980787683] [2022-04-15 09:22:40,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:22:40,646 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) Word has length 79 [2022-04-15 09:22:40,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:22:40,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2022-04-15 09:22:40,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:22:40,706 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 09:22:40,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:22:40,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 09:22:40,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-15 09:22:40,707 INFO L87 Difference]: Start difference. First operand 158 states and 185 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2022-04-15 09:22:41,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:22:41,183 INFO L93 Difference]: Finished difference Result 203 states and 247 transitions. [2022-04-15 09:22:41,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 09:22:41,184 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) Word has length 79 [2022-04-15 09:22:41,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:22:41,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2022-04-15 09:22:41,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2022-04-15 09:22:41,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2022-04-15 09:22:41,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 111 transitions. [2022-04-15 09:22:41,186 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 111 transitions. [2022-04-15 09:22:41,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:22:41,270 INFO L225 Difference]: With dead ends: 203 [2022-04-15 09:22:41,270 INFO L226 Difference]: Without dead ends: 160 [2022-04-15 09:22:41,270 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2022-04-15 09:22:41,271 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 15 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 09:22:41,271 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 196 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 09:22:41,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-04-15 09:22:41,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2022-04-15 09:22:41,440 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:22:41,455 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand has 160 states, 105 states have (on average 1.1714285714285715) internal successors, (123), 109 states have internal predecessors, (123), 33 states have call successors, (33), 22 states have call predecessors, (33), 21 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-15 09:22:41,456 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand has 160 states, 105 states have (on average 1.1714285714285715) internal successors, (123), 109 states have internal predecessors, (123), 33 states have call successors, (33), 22 states have call predecessors, (33), 21 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-15 09:22:41,457 INFO L87 Difference]: Start difference. First operand 160 states. Second operand has 160 states, 105 states have (on average 1.1714285714285715) internal successors, (123), 109 states have internal predecessors, (123), 33 states have call successors, (33), 22 states have call predecessors, (33), 21 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-15 09:22:41,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:22:41,460 INFO L93 Difference]: Finished difference Result 160 states and 187 transitions. [2022-04-15 09:22:41,460 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 187 transitions. [2022-04-15 09:22:41,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:22:41,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:22:41,460 INFO L74 IsIncluded]: Start isIncluded. First operand has 160 states, 105 states have (on average 1.1714285714285715) internal successors, (123), 109 states have internal predecessors, (123), 33 states have call successors, (33), 22 states have call predecessors, (33), 21 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) Second operand 160 states. [2022-04-15 09:22:41,460 INFO L87 Difference]: Start difference. First operand has 160 states, 105 states have (on average 1.1714285714285715) internal successors, (123), 109 states have internal predecessors, (123), 33 states have call successors, (33), 22 states have call predecessors, (33), 21 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) Second operand 160 states. [2022-04-15 09:22:41,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:22:41,463 INFO L93 Difference]: Finished difference Result 160 states and 187 transitions. [2022-04-15 09:22:41,463 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 187 transitions. [2022-04-15 09:22:41,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:22:41,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:22:41,463 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:22:41,463 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:22:41,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 105 states have (on average 1.1714285714285715) internal successors, (123), 109 states have internal predecessors, (123), 33 states have call successors, (33), 22 states have call predecessors, (33), 21 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-15 09:22:41,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 187 transitions. [2022-04-15 09:22:41,466 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 187 transitions. Word has length 79 [2022-04-15 09:22:41,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:22:41,466 INFO L478 AbstractCegarLoop]: Abstraction has 160 states and 187 transitions. [2022-04-15 09:22:41,466 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 6 states have call successors, (14), 6 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2022-04-15 09:22:41,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 160 states and 187 transitions. [2022-04-15 09:22:43,740 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 186 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 09:22:43,741 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 187 transitions. [2022-04-15 09:22:43,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-15 09:22:43,742 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:22:43,743 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:22:43,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-15 09:22:43,958 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-15 09:22:43,958 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:22:43,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:22:43,959 INFO L85 PathProgramCache]: Analyzing trace with hash 435352067, now seen corresponding path program 3 times [2022-04-15 09:22:43,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:22:43,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [64413644] [2022-04-15 09:22:50,297 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:22:50,297 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:22:50,298 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:22:50,298 INFO L85 PathProgramCache]: Analyzing trace with hash 435352067, now seen corresponding path program 4 times [2022-04-15 09:22:50,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:22:50,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374686105] [2022-04-15 09:22:50,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:22:50,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:22:50,306 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:22:50,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1292600554] [2022-04-15 09:22:50,307 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 09:22:50,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:22:50,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:22:50,308 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:22:50,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-15 09:22:50,355 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 09:22:50,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:22:50,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 09:22:50,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:22:50,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:22:50,628 INFO L272 TraceCheckUtils]: 0: Hoare triple {13264#true} call ULTIMATE.init(); {13264#true} is VALID [2022-04-15 09:22:50,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {13264#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13272#(<= ~counter~0 0)} is VALID [2022-04-15 09:22:50,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {13272#(<= ~counter~0 0)} assume true; {13272#(<= ~counter~0 0)} is VALID [2022-04-15 09:22:50,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13272#(<= ~counter~0 0)} {13264#true} #96#return; {13272#(<= ~counter~0 0)} is VALID [2022-04-15 09:22:50,629 INFO L272 TraceCheckUtils]: 4: Hoare triple {13272#(<= ~counter~0 0)} call #t~ret8 := main(); {13272#(<= ~counter~0 0)} is VALID [2022-04-15 09:22:50,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {13272#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {13272#(<= ~counter~0 0)} is VALID [2022-04-15 09:22:50,630 INFO L272 TraceCheckUtils]: 6: Hoare triple {13272#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {13272#(<= ~counter~0 0)} is VALID [2022-04-15 09:22:50,630 INFO L290 TraceCheckUtils]: 7: Hoare triple {13272#(<= ~counter~0 0)} ~cond := #in~cond; {13272#(<= ~counter~0 0)} is VALID [2022-04-15 09:22:50,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {13272#(<= ~counter~0 0)} assume !(0 == ~cond); {13272#(<= ~counter~0 0)} is VALID [2022-04-15 09:22:50,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {13272#(<= ~counter~0 0)} assume true; {13272#(<= ~counter~0 0)} is VALID [2022-04-15 09:22:50,631 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13272#(<= ~counter~0 0)} {13272#(<= ~counter~0 0)} #80#return; {13272#(<= ~counter~0 0)} is VALID [2022-04-15 09:22:50,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {13272#(<= ~counter~0 0)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {13272#(<= ~counter~0 0)} is VALID [2022-04-15 09:22:50,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {13272#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13306#(<= ~counter~0 1)} is VALID [2022-04-15 09:22:50,632 INFO L290 TraceCheckUtils]: 13: Hoare triple {13306#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {13306#(<= ~counter~0 1)} is VALID [2022-04-15 09:22:50,632 INFO L272 TraceCheckUtils]: 14: Hoare triple {13306#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {13306#(<= ~counter~0 1)} is VALID [2022-04-15 09:22:50,632 INFO L290 TraceCheckUtils]: 15: Hoare triple {13306#(<= ~counter~0 1)} ~cond := #in~cond; {13306#(<= ~counter~0 1)} is VALID [2022-04-15 09:22:50,633 INFO L290 TraceCheckUtils]: 16: Hoare triple {13306#(<= ~counter~0 1)} assume !(0 == ~cond); {13306#(<= ~counter~0 1)} is VALID [2022-04-15 09:22:50,633 INFO L290 TraceCheckUtils]: 17: Hoare triple {13306#(<= ~counter~0 1)} assume true; {13306#(<= ~counter~0 1)} is VALID [2022-04-15 09:22:50,633 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {13306#(<= ~counter~0 1)} {13306#(<= ~counter~0 1)} #82#return; {13306#(<= ~counter~0 1)} is VALID [2022-04-15 09:22:50,634 INFO L272 TraceCheckUtils]: 19: Hoare triple {13306#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {13306#(<= ~counter~0 1)} is VALID [2022-04-15 09:22:50,634 INFO L290 TraceCheckUtils]: 20: Hoare triple {13306#(<= ~counter~0 1)} ~cond := #in~cond; {13306#(<= ~counter~0 1)} is VALID [2022-04-15 09:22:50,634 INFO L290 TraceCheckUtils]: 21: Hoare triple {13306#(<= ~counter~0 1)} assume !(0 == ~cond); {13306#(<= ~counter~0 1)} is VALID [2022-04-15 09:22:50,634 INFO L290 TraceCheckUtils]: 22: Hoare triple {13306#(<= ~counter~0 1)} assume true; {13306#(<= ~counter~0 1)} is VALID [2022-04-15 09:22:50,635 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13306#(<= ~counter~0 1)} {13306#(<= ~counter~0 1)} #84#return; {13306#(<= ~counter~0 1)} is VALID [2022-04-15 09:22:50,635 INFO L272 TraceCheckUtils]: 24: Hoare triple {13306#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {13306#(<= ~counter~0 1)} is VALID [2022-04-15 09:22:50,635 INFO L290 TraceCheckUtils]: 25: Hoare triple {13306#(<= ~counter~0 1)} ~cond := #in~cond; {13306#(<= ~counter~0 1)} is VALID [2022-04-15 09:22:50,636 INFO L290 TraceCheckUtils]: 26: Hoare triple {13306#(<= ~counter~0 1)} assume !(0 == ~cond); {13306#(<= ~counter~0 1)} is VALID [2022-04-15 09:22:50,636 INFO L290 TraceCheckUtils]: 27: Hoare triple {13306#(<= ~counter~0 1)} assume true; {13306#(<= ~counter~0 1)} is VALID [2022-04-15 09:22:50,636 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {13306#(<= ~counter~0 1)} {13306#(<= ~counter~0 1)} #86#return; {13306#(<= ~counter~0 1)} is VALID [2022-04-15 09:22:50,637 INFO L290 TraceCheckUtils]: 29: Hoare triple {13306#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {13306#(<= ~counter~0 1)} is VALID [2022-04-15 09:22:50,637 INFO L290 TraceCheckUtils]: 30: Hoare triple {13306#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13361#(<= ~counter~0 2)} is VALID [2022-04-15 09:22:50,637 INFO L290 TraceCheckUtils]: 31: Hoare triple {13361#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {13361#(<= ~counter~0 2)} is VALID [2022-04-15 09:22:50,638 INFO L272 TraceCheckUtils]: 32: Hoare triple {13361#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {13361#(<= ~counter~0 2)} is VALID [2022-04-15 09:22:50,638 INFO L290 TraceCheckUtils]: 33: Hoare triple {13361#(<= ~counter~0 2)} ~cond := #in~cond; {13361#(<= ~counter~0 2)} is VALID [2022-04-15 09:22:50,638 INFO L290 TraceCheckUtils]: 34: Hoare triple {13361#(<= ~counter~0 2)} assume !(0 == ~cond); {13361#(<= ~counter~0 2)} is VALID [2022-04-15 09:22:50,638 INFO L290 TraceCheckUtils]: 35: Hoare triple {13361#(<= ~counter~0 2)} assume true; {13361#(<= ~counter~0 2)} is VALID [2022-04-15 09:22:50,639 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {13361#(<= ~counter~0 2)} {13361#(<= ~counter~0 2)} #82#return; {13361#(<= ~counter~0 2)} is VALID [2022-04-15 09:22:50,639 INFO L272 TraceCheckUtils]: 37: Hoare triple {13361#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {13361#(<= ~counter~0 2)} is VALID [2022-04-15 09:22:50,642 INFO L290 TraceCheckUtils]: 38: Hoare triple {13361#(<= ~counter~0 2)} ~cond := #in~cond; {13361#(<= ~counter~0 2)} is VALID [2022-04-15 09:22:50,642 INFO L290 TraceCheckUtils]: 39: Hoare triple {13361#(<= ~counter~0 2)} assume !(0 == ~cond); {13361#(<= ~counter~0 2)} is VALID [2022-04-15 09:22:50,642 INFO L290 TraceCheckUtils]: 40: Hoare triple {13361#(<= ~counter~0 2)} assume true; {13361#(<= ~counter~0 2)} is VALID [2022-04-15 09:22:50,643 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {13361#(<= ~counter~0 2)} {13361#(<= ~counter~0 2)} #84#return; {13361#(<= ~counter~0 2)} is VALID [2022-04-15 09:22:50,643 INFO L272 TraceCheckUtils]: 42: Hoare triple {13361#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {13361#(<= ~counter~0 2)} is VALID [2022-04-15 09:22:50,643 INFO L290 TraceCheckUtils]: 43: Hoare triple {13361#(<= ~counter~0 2)} ~cond := #in~cond; {13361#(<= ~counter~0 2)} is VALID [2022-04-15 09:22:50,643 INFO L290 TraceCheckUtils]: 44: Hoare triple {13361#(<= ~counter~0 2)} assume !(0 == ~cond); {13361#(<= ~counter~0 2)} is VALID [2022-04-15 09:22:50,644 INFO L290 TraceCheckUtils]: 45: Hoare triple {13361#(<= ~counter~0 2)} assume true; {13361#(<= ~counter~0 2)} is VALID [2022-04-15 09:22:50,644 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {13361#(<= ~counter~0 2)} {13361#(<= ~counter~0 2)} #86#return; {13361#(<= ~counter~0 2)} is VALID [2022-04-15 09:22:50,644 INFO L290 TraceCheckUtils]: 47: Hoare triple {13361#(<= ~counter~0 2)} assume !(~r~0 >= ~d~0); {13361#(<= ~counter~0 2)} is VALID [2022-04-15 09:22:50,645 INFO L290 TraceCheckUtils]: 48: Hoare triple {13361#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13416#(<= ~counter~0 3)} is VALID [2022-04-15 09:22:50,645 INFO L290 TraceCheckUtils]: 49: Hoare triple {13416#(<= ~counter~0 3)} assume !!(#t~post7 < 20);havoc #t~post7; {13416#(<= ~counter~0 3)} is VALID [2022-04-15 09:22:50,646 INFO L272 TraceCheckUtils]: 50: Hoare triple {13416#(<= ~counter~0 3)} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {13416#(<= ~counter~0 3)} is VALID [2022-04-15 09:22:50,646 INFO L290 TraceCheckUtils]: 51: Hoare triple {13416#(<= ~counter~0 3)} ~cond := #in~cond; {13416#(<= ~counter~0 3)} is VALID [2022-04-15 09:22:50,646 INFO L290 TraceCheckUtils]: 52: Hoare triple {13416#(<= ~counter~0 3)} assume !(0 == ~cond); {13416#(<= ~counter~0 3)} is VALID [2022-04-15 09:22:50,646 INFO L290 TraceCheckUtils]: 53: Hoare triple {13416#(<= ~counter~0 3)} assume true; {13416#(<= ~counter~0 3)} is VALID [2022-04-15 09:22:50,647 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {13416#(<= ~counter~0 3)} {13416#(<= ~counter~0 3)} #88#return; {13416#(<= ~counter~0 3)} is VALID [2022-04-15 09:22:50,647 INFO L272 TraceCheckUtils]: 55: Hoare triple {13416#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {13416#(<= ~counter~0 3)} is VALID [2022-04-15 09:22:50,648 INFO L290 TraceCheckUtils]: 56: Hoare triple {13416#(<= ~counter~0 3)} ~cond := #in~cond; {13416#(<= ~counter~0 3)} is VALID [2022-04-15 09:22:50,648 INFO L290 TraceCheckUtils]: 57: Hoare triple {13416#(<= ~counter~0 3)} assume !(0 == ~cond); {13416#(<= ~counter~0 3)} is VALID [2022-04-15 09:22:50,648 INFO L290 TraceCheckUtils]: 58: Hoare triple {13416#(<= ~counter~0 3)} assume true; {13416#(<= ~counter~0 3)} is VALID [2022-04-15 09:22:50,649 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {13416#(<= ~counter~0 3)} {13416#(<= ~counter~0 3)} #90#return; {13416#(<= ~counter~0 3)} is VALID [2022-04-15 09:22:50,649 INFO L290 TraceCheckUtils]: 60: Hoare triple {13416#(<= ~counter~0 3)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {13416#(<= ~counter~0 3)} is VALID [2022-04-15 09:22:50,649 INFO L290 TraceCheckUtils]: 61: Hoare triple {13416#(<= ~counter~0 3)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {13416#(<= ~counter~0 3)} is VALID [2022-04-15 09:22:50,650 INFO L290 TraceCheckUtils]: 62: Hoare triple {13416#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13459#(<= ~counter~0 4)} is VALID [2022-04-15 09:22:50,650 INFO L290 TraceCheckUtils]: 63: Hoare triple {13459#(<= ~counter~0 4)} assume !!(#t~post7 < 20);havoc #t~post7; {13459#(<= ~counter~0 4)} is VALID [2022-04-15 09:22:50,650 INFO L272 TraceCheckUtils]: 64: Hoare triple {13459#(<= ~counter~0 4)} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {13459#(<= ~counter~0 4)} is VALID [2022-04-15 09:22:50,651 INFO L290 TraceCheckUtils]: 65: Hoare triple {13459#(<= ~counter~0 4)} ~cond := #in~cond; {13459#(<= ~counter~0 4)} is VALID [2022-04-15 09:22:50,651 INFO L290 TraceCheckUtils]: 66: Hoare triple {13459#(<= ~counter~0 4)} assume !(0 == ~cond); {13459#(<= ~counter~0 4)} is VALID [2022-04-15 09:22:50,651 INFO L290 TraceCheckUtils]: 67: Hoare triple {13459#(<= ~counter~0 4)} assume true; {13459#(<= ~counter~0 4)} is VALID [2022-04-15 09:22:50,651 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {13459#(<= ~counter~0 4)} {13459#(<= ~counter~0 4)} #88#return; {13459#(<= ~counter~0 4)} is VALID [2022-04-15 09:22:50,663 INFO L272 TraceCheckUtils]: 69: Hoare triple {13459#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {13459#(<= ~counter~0 4)} is VALID [2022-04-15 09:22:50,663 INFO L290 TraceCheckUtils]: 70: Hoare triple {13459#(<= ~counter~0 4)} ~cond := #in~cond; {13459#(<= ~counter~0 4)} is VALID [2022-04-15 09:22:50,663 INFO L290 TraceCheckUtils]: 71: Hoare triple {13459#(<= ~counter~0 4)} assume !(0 == ~cond); {13459#(<= ~counter~0 4)} is VALID [2022-04-15 09:22:50,664 INFO L290 TraceCheckUtils]: 72: Hoare triple {13459#(<= ~counter~0 4)} assume true; {13459#(<= ~counter~0 4)} is VALID [2022-04-15 09:22:50,664 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {13459#(<= ~counter~0 4)} {13459#(<= ~counter~0 4)} #90#return; {13459#(<= ~counter~0 4)} is VALID [2022-04-15 09:22:50,664 INFO L290 TraceCheckUtils]: 74: Hoare triple {13459#(<= ~counter~0 4)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {13459#(<= ~counter~0 4)} is VALID [2022-04-15 09:22:50,665 INFO L290 TraceCheckUtils]: 75: Hoare triple {13459#(<= ~counter~0 4)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {13459#(<= ~counter~0 4)} is VALID [2022-04-15 09:22:50,665 INFO L290 TraceCheckUtils]: 76: Hoare triple {13459#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13502#(<= |main_#t~post7| 4)} is VALID [2022-04-15 09:22:50,665 INFO L290 TraceCheckUtils]: 77: Hoare triple {13502#(<= |main_#t~post7| 4)} assume !(#t~post7 < 20);havoc #t~post7; {13265#false} is VALID [2022-04-15 09:22:50,665 INFO L272 TraceCheckUtils]: 78: Hoare triple {13265#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {13265#false} is VALID [2022-04-15 09:22:50,665 INFO L290 TraceCheckUtils]: 79: Hoare triple {13265#false} ~cond := #in~cond; {13265#false} is VALID [2022-04-15 09:22:50,666 INFO L290 TraceCheckUtils]: 80: Hoare triple {13265#false} assume 0 == ~cond; {13265#false} is VALID [2022-04-15 09:22:50,666 INFO L290 TraceCheckUtils]: 81: Hoare triple {13265#false} assume !false; {13265#false} is VALID [2022-04-15 09:22:50,666 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 20 proven. 164 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-04-15 09:22:50,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:22:50,948 INFO L290 TraceCheckUtils]: 81: Hoare triple {13265#false} assume !false; {13265#false} is VALID [2022-04-15 09:22:50,948 INFO L290 TraceCheckUtils]: 80: Hoare triple {13265#false} assume 0 == ~cond; {13265#false} is VALID [2022-04-15 09:22:50,948 INFO L290 TraceCheckUtils]: 79: Hoare triple {13265#false} ~cond := #in~cond; {13265#false} is VALID [2022-04-15 09:22:50,949 INFO L272 TraceCheckUtils]: 78: Hoare triple {13265#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {13265#false} is VALID [2022-04-15 09:22:50,949 INFO L290 TraceCheckUtils]: 77: Hoare triple {13530#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {13265#false} is VALID [2022-04-15 09:22:50,949 INFO L290 TraceCheckUtils]: 76: Hoare triple {13534#(< ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13530#(< |main_#t~post7| 20)} is VALID [2022-04-15 09:22:50,949 INFO L290 TraceCheckUtils]: 75: Hoare triple {13534#(< ~counter~0 20)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {13534#(< ~counter~0 20)} is VALID [2022-04-15 09:22:50,950 INFO L290 TraceCheckUtils]: 74: Hoare triple {13534#(< ~counter~0 20)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {13534#(< ~counter~0 20)} is VALID [2022-04-15 09:22:50,950 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {13264#true} {13534#(< ~counter~0 20)} #90#return; {13534#(< ~counter~0 20)} is VALID [2022-04-15 09:22:50,950 INFO L290 TraceCheckUtils]: 72: Hoare triple {13264#true} assume true; {13264#true} is VALID [2022-04-15 09:22:50,950 INFO L290 TraceCheckUtils]: 71: Hoare triple {13264#true} assume !(0 == ~cond); {13264#true} is VALID [2022-04-15 09:22:50,950 INFO L290 TraceCheckUtils]: 70: Hoare triple {13264#true} ~cond := #in~cond; {13264#true} is VALID [2022-04-15 09:22:50,951 INFO L272 TraceCheckUtils]: 69: Hoare triple {13534#(< ~counter~0 20)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {13264#true} is VALID [2022-04-15 09:22:50,951 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {13264#true} {13534#(< ~counter~0 20)} #88#return; {13534#(< ~counter~0 20)} is VALID [2022-04-15 09:22:50,951 INFO L290 TraceCheckUtils]: 67: Hoare triple {13264#true} assume true; {13264#true} is VALID [2022-04-15 09:22:50,951 INFO L290 TraceCheckUtils]: 66: Hoare triple {13264#true} assume !(0 == ~cond); {13264#true} is VALID [2022-04-15 09:22:50,951 INFO L290 TraceCheckUtils]: 65: Hoare triple {13264#true} ~cond := #in~cond; {13264#true} is VALID [2022-04-15 09:22:50,951 INFO L272 TraceCheckUtils]: 64: Hoare triple {13534#(< ~counter~0 20)} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {13264#true} is VALID [2022-04-15 09:22:50,952 INFO L290 TraceCheckUtils]: 63: Hoare triple {13534#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {13534#(< ~counter~0 20)} is VALID [2022-04-15 09:22:50,952 INFO L290 TraceCheckUtils]: 62: Hoare triple {13577#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13534#(< ~counter~0 20)} is VALID [2022-04-15 09:22:50,952 INFO L290 TraceCheckUtils]: 61: Hoare triple {13577#(< ~counter~0 19)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {13577#(< ~counter~0 19)} is VALID [2022-04-15 09:22:50,953 INFO L290 TraceCheckUtils]: 60: Hoare triple {13577#(< ~counter~0 19)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {13577#(< ~counter~0 19)} is VALID [2022-04-15 09:22:50,953 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {13264#true} {13577#(< ~counter~0 19)} #90#return; {13577#(< ~counter~0 19)} is VALID [2022-04-15 09:22:50,953 INFO L290 TraceCheckUtils]: 58: Hoare triple {13264#true} assume true; {13264#true} is VALID [2022-04-15 09:22:50,953 INFO L290 TraceCheckUtils]: 57: Hoare triple {13264#true} assume !(0 == ~cond); {13264#true} is VALID [2022-04-15 09:22:50,953 INFO L290 TraceCheckUtils]: 56: Hoare triple {13264#true} ~cond := #in~cond; {13264#true} is VALID [2022-04-15 09:22:50,953 INFO L272 TraceCheckUtils]: 55: Hoare triple {13577#(< ~counter~0 19)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {13264#true} is VALID [2022-04-15 09:22:50,954 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {13264#true} {13577#(< ~counter~0 19)} #88#return; {13577#(< ~counter~0 19)} is VALID [2022-04-15 09:22:50,954 INFO L290 TraceCheckUtils]: 53: Hoare triple {13264#true} assume true; {13264#true} is VALID [2022-04-15 09:22:50,954 INFO L290 TraceCheckUtils]: 52: Hoare triple {13264#true} assume !(0 == ~cond); {13264#true} is VALID [2022-04-15 09:22:50,954 INFO L290 TraceCheckUtils]: 51: Hoare triple {13264#true} ~cond := #in~cond; {13264#true} is VALID [2022-04-15 09:22:50,954 INFO L272 TraceCheckUtils]: 50: Hoare triple {13577#(< ~counter~0 19)} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {13264#true} is VALID [2022-04-15 09:22:50,955 INFO L290 TraceCheckUtils]: 49: Hoare triple {13577#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {13577#(< ~counter~0 19)} is VALID [2022-04-15 09:22:50,955 INFO L290 TraceCheckUtils]: 48: Hoare triple {13620#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13577#(< ~counter~0 19)} is VALID [2022-04-15 09:22:50,955 INFO L290 TraceCheckUtils]: 47: Hoare triple {13620#(< ~counter~0 18)} assume !(~r~0 >= ~d~0); {13620#(< ~counter~0 18)} is VALID [2022-04-15 09:22:50,956 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {13264#true} {13620#(< ~counter~0 18)} #86#return; {13620#(< ~counter~0 18)} is VALID [2022-04-15 09:22:50,956 INFO L290 TraceCheckUtils]: 45: Hoare triple {13264#true} assume true; {13264#true} is VALID [2022-04-15 09:22:50,956 INFO L290 TraceCheckUtils]: 44: Hoare triple {13264#true} assume !(0 == ~cond); {13264#true} is VALID [2022-04-15 09:22:50,956 INFO L290 TraceCheckUtils]: 43: Hoare triple {13264#true} ~cond := #in~cond; {13264#true} is VALID [2022-04-15 09:22:50,956 INFO L272 TraceCheckUtils]: 42: Hoare triple {13620#(< ~counter~0 18)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {13264#true} is VALID [2022-04-15 09:22:50,956 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {13264#true} {13620#(< ~counter~0 18)} #84#return; {13620#(< ~counter~0 18)} is VALID [2022-04-15 09:22:50,956 INFO L290 TraceCheckUtils]: 40: Hoare triple {13264#true} assume true; {13264#true} is VALID [2022-04-15 09:22:50,957 INFO L290 TraceCheckUtils]: 39: Hoare triple {13264#true} assume !(0 == ~cond); {13264#true} is VALID [2022-04-15 09:22:50,957 INFO L290 TraceCheckUtils]: 38: Hoare triple {13264#true} ~cond := #in~cond; {13264#true} is VALID [2022-04-15 09:22:50,957 INFO L272 TraceCheckUtils]: 37: Hoare triple {13620#(< ~counter~0 18)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {13264#true} is VALID [2022-04-15 09:22:50,957 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {13264#true} {13620#(< ~counter~0 18)} #82#return; {13620#(< ~counter~0 18)} is VALID [2022-04-15 09:22:50,957 INFO L290 TraceCheckUtils]: 35: Hoare triple {13264#true} assume true; {13264#true} is VALID [2022-04-15 09:22:50,957 INFO L290 TraceCheckUtils]: 34: Hoare triple {13264#true} assume !(0 == ~cond); {13264#true} is VALID [2022-04-15 09:22:50,957 INFO L290 TraceCheckUtils]: 33: Hoare triple {13264#true} ~cond := #in~cond; {13264#true} is VALID [2022-04-15 09:22:50,958 INFO L272 TraceCheckUtils]: 32: Hoare triple {13620#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {13264#true} is VALID [2022-04-15 09:22:50,958 INFO L290 TraceCheckUtils]: 31: Hoare triple {13620#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {13620#(< ~counter~0 18)} is VALID [2022-04-15 09:22:50,958 INFO L290 TraceCheckUtils]: 30: Hoare triple {13675#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13620#(< ~counter~0 18)} is VALID [2022-04-15 09:22:50,958 INFO L290 TraceCheckUtils]: 29: Hoare triple {13675#(< ~counter~0 17)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {13675#(< ~counter~0 17)} is VALID [2022-04-15 09:22:50,959 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {13264#true} {13675#(< ~counter~0 17)} #86#return; {13675#(< ~counter~0 17)} is VALID [2022-04-15 09:22:50,959 INFO L290 TraceCheckUtils]: 27: Hoare triple {13264#true} assume true; {13264#true} is VALID [2022-04-15 09:22:50,959 INFO L290 TraceCheckUtils]: 26: Hoare triple {13264#true} assume !(0 == ~cond); {13264#true} is VALID [2022-04-15 09:22:50,959 INFO L290 TraceCheckUtils]: 25: Hoare triple {13264#true} ~cond := #in~cond; {13264#true} is VALID [2022-04-15 09:22:50,959 INFO L272 TraceCheckUtils]: 24: Hoare triple {13675#(< ~counter~0 17)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {13264#true} is VALID [2022-04-15 09:22:50,960 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13264#true} {13675#(< ~counter~0 17)} #84#return; {13675#(< ~counter~0 17)} is VALID [2022-04-15 09:22:50,960 INFO L290 TraceCheckUtils]: 22: Hoare triple {13264#true} assume true; {13264#true} is VALID [2022-04-15 09:22:50,960 INFO L290 TraceCheckUtils]: 21: Hoare triple {13264#true} assume !(0 == ~cond); {13264#true} is VALID [2022-04-15 09:22:50,960 INFO L290 TraceCheckUtils]: 20: Hoare triple {13264#true} ~cond := #in~cond; {13264#true} is VALID [2022-04-15 09:22:50,960 INFO L272 TraceCheckUtils]: 19: Hoare triple {13675#(< ~counter~0 17)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {13264#true} is VALID [2022-04-15 09:22:50,960 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {13264#true} {13675#(< ~counter~0 17)} #82#return; {13675#(< ~counter~0 17)} is VALID [2022-04-15 09:22:50,961 INFO L290 TraceCheckUtils]: 17: Hoare triple {13264#true} assume true; {13264#true} is VALID [2022-04-15 09:22:50,961 INFO L290 TraceCheckUtils]: 16: Hoare triple {13264#true} assume !(0 == ~cond); {13264#true} is VALID [2022-04-15 09:22:50,961 INFO L290 TraceCheckUtils]: 15: Hoare triple {13264#true} ~cond := #in~cond; {13264#true} is VALID [2022-04-15 09:22:50,961 INFO L272 TraceCheckUtils]: 14: Hoare triple {13675#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {13264#true} is VALID [2022-04-15 09:22:50,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {13675#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {13675#(< ~counter~0 17)} is VALID [2022-04-15 09:22:50,962 INFO L290 TraceCheckUtils]: 12: Hoare triple {13730#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13675#(< ~counter~0 17)} is VALID [2022-04-15 09:22:50,962 INFO L290 TraceCheckUtils]: 11: Hoare triple {13730#(< ~counter~0 16)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {13730#(< ~counter~0 16)} is VALID [2022-04-15 09:22:50,962 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13264#true} {13730#(< ~counter~0 16)} #80#return; {13730#(< ~counter~0 16)} is VALID [2022-04-15 09:22:50,962 INFO L290 TraceCheckUtils]: 9: Hoare triple {13264#true} assume true; {13264#true} is VALID [2022-04-15 09:22:50,962 INFO L290 TraceCheckUtils]: 8: Hoare triple {13264#true} assume !(0 == ~cond); {13264#true} is VALID [2022-04-15 09:22:50,962 INFO L290 TraceCheckUtils]: 7: Hoare triple {13264#true} ~cond := #in~cond; {13264#true} is VALID [2022-04-15 09:22:50,963 INFO L272 TraceCheckUtils]: 6: Hoare triple {13730#(< ~counter~0 16)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {13264#true} is VALID [2022-04-15 09:22:50,963 INFO L290 TraceCheckUtils]: 5: Hoare triple {13730#(< ~counter~0 16)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {13730#(< ~counter~0 16)} is VALID [2022-04-15 09:22:50,963 INFO L272 TraceCheckUtils]: 4: Hoare triple {13730#(< ~counter~0 16)} call #t~ret8 := main(); {13730#(< ~counter~0 16)} is VALID [2022-04-15 09:22:50,963 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13730#(< ~counter~0 16)} {13264#true} #96#return; {13730#(< ~counter~0 16)} is VALID [2022-04-15 09:22:50,964 INFO L290 TraceCheckUtils]: 2: Hoare triple {13730#(< ~counter~0 16)} assume true; {13730#(< ~counter~0 16)} is VALID [2022-04-15 09:22:50,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {13264#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13730#(< ~counter~0 16)} is VALID [2022-04-15 09:22:50,964 INFO L272 TraceCheckUtils]: 0: Hoare triple {13264#true} call ULTIMATE.init(); {13264#true} is VALID [2022-04-15 09:22:50,964 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 20 proven. 16 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-15 09:22:50,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:22:50,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374686105] [2022-04-15 09:22:50,965 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:22:50,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292600554] [2022-04-15 09:22:50,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292600554] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:22:50,965 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:22:50,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-15 09:22:50,965 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:22:50,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [64413644] [2022-04-15 09:22:50,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [64413644] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:22:50,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:22:50,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 09:22:50,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86546398] [2022-04-15 09:22:50,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:22:50,966 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) Word has length 82 [2022-04-15 09:22:50,966 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:22:50,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2022-04-15 09:22:51,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:22:51,007 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 09:22:51,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:22:51,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 09:22:51,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-15 09:22:51,009 INFO L87 Difference]: Start difference. First operand 160 states and 187 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2022-04-15 09:22:51,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:22:51,674 INFO L93 Difference]: Finished difference Result 226 states and 262 transitions. [2022-04-15 09:22:51,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 09:22:51,674 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) Word has length 82 [2022-04-15 09:22:51,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:22:51,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2022-04-15 09:22:51,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2022-04-15 09:22:51,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2022-04-15 09:22:51,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 128 transitions. [2022-04-15 09:22:51,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 128 transitions. [2022-04-15 09:22:51,809 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:22:51,812 INFO L225 Difference]: With dead ends: 226 [2022-04-15 09:22:51,812 INFO L226 Difference]: Without dead ends: 211 [2022-04-15 09:22:51,813 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2022-04-15 09:22:51,813 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 36 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 09:22:51,813 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 235 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 09:22:51,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-04-15 09:22:52,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 208. [2022-04-15 09:22:52,043 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:22:52,043 INFO L82 GeneralOperation]: Start isEquivalent. First operand 211 states. Second operand has 208 states, 139 states have (on average 1.158273381294964) internal successors, (161), 144 states have internal predecessors, (161), 41 states have call successors, (41), 29 states have call predecessors, (41), 27 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-15 09:22:52,044 INFO L74 IsIncluded]: Start isIncluded. First operand 211 states. Second operand has 208 states, 139 states have (on average 1.158273381294964) internal successors, (161), 144 states have internal predecessors, (161), 41 states have call successors, (41), 29 states have call predecessors, (41), 27 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-15 09:22:52,044 INFO L87 Difference]: Start difference. First operand 211 states. Second operand has 208 states, 139 states have (on average 1.158273381294964) internal successors, (161), 144 states have internal predecessors, (161), 41 states have call successors, (41), 29 states have call predecessors, (41), 27 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-15 09:22:52,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:22:52,048 INFO L93 Difference]: Finished difference Result 211 states and 242 transitions. [2022-04-15 09:22:52,048 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 242 transitions. [2022-04-15 09:22:52,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:22:52,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:22:52,049 INFO L74 IsIncluded]: Start isIncluded. First operand has 208 states, 139 states have (on average 1.158273381294964) internal successors, (161), 144 states have internal predecessors, (161), 41 states have call successors, (41), 29 states have call predecessors, (41), 27 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) Second operand 211 states. [2022-04-15 09:22:52,049 INFO L87 Difference]: Start difference. First operand has 208 states, 139 states have (on average 1.158273381294964) internal successors, (161), 144 states have internal predecessors, (161), 41 states have call successors, (41), 29 states have call predecessors, (41), 27 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) Second operand 211 states. [2022-04-15 09:22:52,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:22:52,053 INFO L93 Difference]: Finished difference Result 211 states and 242 transitions. [2022-04-15 09:22:52,053 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 242 transitions. [2022-04-15 09:22:52,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:22:52,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:22:52,054 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:22:52,054 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:22:52,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 139 states have (on average 1.158273381294964) internal successors, (161), 144 states have internal predecessors, (161), 41 states have call successors, (41), 29 states have call predecessors, (41), 27 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) [2022-04-15 09:22:52,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 240 transitions. [2022-04-15 09:22:52,057 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 240 transitions. Word has length 82 [2022-04-15 09:22:52,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:22:52,058 INFO L478 AbstractCegarLoop]: Abstraction has 208 states and 240 transitions. [2022-04-15 09:22:52,058 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 7 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2022-04-15 09:22:52,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 208 states and 240 transitions. [2022-04-15 09:22:54,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 240 edges. 239 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 09:22:54,387 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 240 transitions. [2022-04-15 09:22:54,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-15 09:22:54,388 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:22:54,388 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:22:54,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-15 09:22:54,588 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:22:54,588 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:22:54,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:22:54,589 INFO L85 PathProgramCache]: Analyzing trace with hash 437079945, now seen corresponding path program 5 times [2022-04-15 09:22:54,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:22:54,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2024571300] [2022-04-15 09:23:01,878 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:23:01,878 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:23:01,878 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:23:01,878 INFO L85 PathProgramCache]: Analyzing trace with hash 437079945, now seen corresponding path program 6 times [2022-04-15 09:23:01,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:23:01,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169812211] [2022-04-15 09:23:01,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:23:01,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:23:01,891 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:23:01,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [435934654] [2022-04-15 09:23:01,891 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 09:23:01,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:23:01,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:23:01,892 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:23:01,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-15 09:23:01,948 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 09:23:01,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:23:01,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 09:23:01,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:23:01,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:23:02,086 INFO L272 TraceCheckUtils]: 0: Hoare triple {15063#true} call ULTIMATE.init(); {15063#true} is VALID [2022-04-15 09:23:02,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {15063#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {15063#true} is VALID [2022-04-15 09:23:02,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {15063#true} assume true; {15063#true} is VALID [2022-04-15 09:23:02,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15063#true} {15063#true} #96#return; {15063#true} is VALID [2022-04-15 09:23:02,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {15063#true} call #t~ret8 := main(); {15063#true} is VALID [2022-04-15 09:23:02,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {15063#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {15063#true} is VALID [2022-04-15 09:23:02,087 INFO L272 TraceCheckUtils]: 6: Hoare triple {15063#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {15063#true} is VALID [2022-04-15 09:23:02,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {15063#true} ~cond := #in~cond; {15063#true} is VALID [2022-04-15 09:23:02,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {15063#true} assume !(0 == ~cond); {15063#true} is VALID [2022-04-15 09:23:02,087 INFO L290 TraceCheckUtils]: 9: Hoare triple {15063#true} assume true; {15063#true} is VALID [2022-04-15 09:23:02,087 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15063#true} {15063#true} #80#return; {15063#true} is VALID [2022-04-15 09:23:02,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {15063#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {15101#(= main_~p~0 1)} is VALID [2022-04-15 09:23:02,088 INFO L290 TraceCheckUtils]: 12: Hoare triple {15101#(= main_~p~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15101#(= main_~p~0 1)} is VALID [2022-04-15 09:23:02,088 INFO L290 TraceCheckUtils]: 13: Hoare triple {15101#(= main_~p~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {15101#(= main_~p~0 1)} is VALID [2022-04-15 09:23:02,088 INFO L272 TraceCheckUtils]: 14: Hoare triple {15101#(= main_~p~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {15063#true} is VALID [2022-04-15 09:23:02,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {15063#true} ~cond := #in~cond; {15063#true} is VALID [2022-04-15 09:23:02,088 INFO L290 TraceCheckUtils]: 16: Hoare triple {15063#true} assume !(0 == ~cond); {15063#true} is VALID [2022-04-15 09:23:02,088 INFO L290 TraceCheckUtils]: 17: Hoare triple {15063#true} assume true; {15063#true} is VALID [2022-04-15 09:23:02,089 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {15063#true} {15101#(= main_~p~0 1)} #82#return; {15101#(= main_~p~0 1)} is VALID [2022-04-15 09:23:02,089 INFO L272 TraceCheckUtils]: 19: Hoare triple {15101#(= main_~p~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {15063#true} is VALID [2022-04-15 09:23:02,089 INFO L290 TraceCheckUtils]: 20: Hoare triple {15063#true} ~cond := #in~cond; {15063#true} is VALID [2022-04-15 09:23:02,089 INFO L290 TraceCheckUtils]: 21: Hoare triple {15063#true} assume !(0 == ~cond); {15063#true} is VALID [2022-04-15 09:23:02,089 INFO L290 TraceCheckUtils]: 22: Hoare triple {15063#true} assume true; {15063#true} is VALID [2022-04-15 09:23:02,090 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {15063#true} {15101#(= main_~p~0 1)} #84#return; {15101#(= main_~p~0 1)} is VALID [2022-04-15 09:23:02,090 INFO L272 TraceCheckUtils]: 24: Hoare triple {15101#(= main_~p~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {15063#true} is VALID [2022-04-15 09:23:02,098 INFO L290 TraceCheckUtils]: 25: Hoare triple {15063#true} ~cond := #in~cond; {15063#true} is VALID [2022-04-15 09:23:02,099 INFO L290 TraceCheckUtils]: 26: Hoare triple {15063#true} assume !(0 == ~cond); {15063#true} is VALID [2022-04-15 09:23:02,099 INFO L290 TraceCheckUtils]: 27: Hoare triple {15063#true} assume true; {15063#true} is VALID [2022-04-15 09:23:02,099 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {15063#true} {15101#(= main_~p~0 1)} #86#return; {15101#(= main_~p~0 1)} is VALID [2022-04-15 09:23:02,100 INFO L290 TraceCheckUtils]: 29: Hoare triple {15101#(= main_~p~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {15156#(= main_~p~0 2)} is VALID [2022-04-15 09:23:02,100 INFO L290 TraceCheckUtils]: 30: Hoare triple {15156#(= main_~p~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15156#(= main_~p~0 2)} is VALID [2022-04-15 09:23:02,101 INFO L290 TraceCheckUtils]: 31: Hoare triple {15156#(= main_~p~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {15156#(= main_~p~0 2)} is VALID [2022-04-15 09:23:02,101 INFO L272 TraceCheckUtils]: 32: Hoare triple {15156#(= main_~p~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {15063#true} is VALID [2022-04-15 09:23:02,101 INFO L290 TraceCheckUtils]: 33: Hoare triple {15063#true} ~cond := #in~cond; {15063#true} is VALID [2022-04-15 09:23:02,101 INFO L290 TraceCheckUtils]: 34: Hoare triple {15063#true} assume !(0 == ~cond); {15063#true} is VALID [2022-04-15 09:23:02,101 INFO L290 TraceCheckUtils]: 35: Hoare triple {15063#true} assume true; {15063#true} is VALID [2022-04-15 09:23:02,101 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {15063#true} {15156#(= main_~p~0 2)} #82#return; {15156#(= main_~p~0 2)} is VALID [2022-04-15 09:23:02,101 INFO L272 TraceCheckUtils]: 37: Hoare triple {15156#(= main_~p~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {15063#true} is VALID [2022-04-15 09:23:02,101 INFO L290 TraceCheckUtils]: 38: Hoare triple {15063#true} ~cond := #in~cond; {15063#true} is VALID [2022-04-15 09:23:02,102 INFO L290 TraceCheckUtils]: 39: Hoare triple {15063#true} assume !(0 == ~cond); {15063#true} is VALID [2022-04-15 09:23:02,102 INFO L290 TraceCheckUtils]: 40: Hoare triple {15063#true} assume true; {15063#true} is VALID [2022-04-15 09:23:02,102 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {15063#true} {15156#(= main_~p~0 2)} #84#return; {15156#(= main_~p~0 2)} is VALID [2022-04-15 09:23:02,102 INFO L272 TraceCheckUtils]: 42: Hoare triple {15156#(= main_~p~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {15063#true} is VALID [2022-04-15 09:23:02,102 INFO L290 TraceCheckUtils]: 43: Hoare triple {15063#true} ~cond := #in~cond; {15063#true} is VALID [2022-04-15 09:23:02,102 INFO L290 TraceCheckUtils]: 44: Hoare triple {15063#true} assume !(0 == ~cond); {15063#true} is VALID [2022-04-15 09:23:02,102 INFO L290 TraceCheckUtils]: 45: Hoare triple {15063#true} assume true; {15063#true} is VALID [2022-04-15 09:23:02,103 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {15063#true} {15156#(= main_~p~0 2)} #86#return; {15156#(= main_~p~0 2)} is VALID [2022-04-15 09:23:02,103 INFO L290 TraceCheckUtils]: 47: Hoare triple {15156#(= main_~p~0 2)} assume !(~r~0 >= ~d~0); {15156#(= main_~p~0 2)} is VALID [2022-04-15 09:23:02,104 INFO L290 TraceCheckUtils]: 48: Hoare triple {15156#(= main_~p~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15156#(= main_~p~0 2)} is VALID [2022-04-15 09:23:02,104 INFO L290 TraceCheckUtils]: 49: Hoare triple {15156#(= main_~p~0 2)} assume !!(#t~post7 < 20);havoc #t~post7; {15156#(= main_~p~0 2)} is VALID [2022-04-15 09:23:02,104 INFO L272 TraceCheckUtils]: 50: Hoare triple {15156#(= main_~p~0 2)} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {15063#true} is VALID [2022-04-15 09:23:02,104 INFO L290 TraceCheckUtils]: 51: Hoare triple {15063#true} ~cond := #in~cond; {15063#true} is VALID [2022-04-15 09:23:02,104 INFO L290 TraceCheckUtils]: 52: Hoare triple {15063#true} assume !(0 == ~cond); {15063#true} is VALID [2022-04-15 09:23:02,104 INFO L290 TraceCheckUtils]: 53: Hoare triple {15063#true} assume true; {15063#true} is VALID [2022-04-15 09:23:02,105 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {15063#true} {15156#(= main_~p~0 2)} #88#return; {15156#(= main_~p~0 2)} is VALID [2022-04-15 09:23:02,105 INFO L272 TraceCheckUtils]: 55: Hoare triple {15156#(= main_~p~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {15063#true} is VALID [2022-04-15 09:23:02,105 INFO L290 TraceCheckUtils]: 56: Hoare triple {15063#true} ~cond := #in~cond; {15063#true} is VALID [2022-04-15 09:23:02,105 INFO L290 TraceCheckUtils]: 57: Hoare triple {15063#true} assume !(0 == ~cond); {15063#true} is VALID [2022-04-15 09:23:02,105 INFO L290 TraceCheckUtils]: 58: Hoare triple {15063#true} assume true; {15063#true} is VALID [2022-04-15 09:23:02,105 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {15063#true} {15156#(= main_~p~0 2)} #90#return; {15156#(= main_~p~0 2)} is VALID [2022-04-15 09:23:02,106 INFO L290 TraceCheckUtils]: 60: Hoare triple {15156#(= main_~p~0 2)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {15101#(= main_~p~0 1)} is VALID [2022-04-15 09:23:02,106 INFO L290 TraceCheckUtils]: 61: Hoare triple {15101#(= main_~p~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {15101#(= main_~p~0 1)} is VALID [2022-04-15 09:23:02,106 INFO L290 TraceCheckUtils]: 62: Hoare triple {15101#(= main_~p~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15101#(= main_~p~0 1)} is VALID [2022-04-15 09:23:02,107 INFO L290 TraceCheckUtils]: 63: Hoare triple {15101#(= main_~p~0 1)} assume !!(#t~post7 < 20);havoc #t~post7; {15101#(= main_~p~0 1)} is VALID [2022-04-15 09:23:02,107 INFO L272 TraceCheckUtils]: 64: Hoare triple {15101#(= main_~p~0 1)} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {15063#true} is VALID [2022-04-15 09:23:02,107 INFO L290 TraceCheckUtils]: 65: Hoare triple {15063#true} ~cond := #in~cond; {15063#true} is VALID [2022-04-15 09:23:02,107 INFO L290 TraceCheckUtils]: 66: Hoare triple {15063#true} assume !(0 == ~cond); {15063#true} is VALID [2022-04-15 09:23:02,107 INFO L290 TraceCheckUtils]: 67: Hoare triple {15063#true} assume true; {15063#true} is VALID [2022-04-15 09:23:02,108 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {15063#true} {15101#(= main_~p~0 1)} #88#return; {15101#(= main_~p~0 1)} is VALID [2022-04-15 09:23:02,108 INFO L272 TraceCheckUtils]: 69: Hoare triple {15101#(= main_~p~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {15063#true} is VALID [2022-04-15 09:23:02,108 INFO L290 TraceCheckUtils]: 70: Hoare triple {15063#true} ~cond := #in~cond; {15063#true} is VALID [2022-04-15 09:23:02,108 INFO L290 TraceCheckUtils]: 71: Hoare triple {15063#true} assume !(0 == ~cond); {15063#true} is VALID [2022-04-15 09:23:02,108 INFO L290 TraceCheckUtils]: 72: Hoare triple {15063#true} assume true; {15063#true} is VALID [2022-04-15 09:23:02,108 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {15063#true} {15101#(= main_~p~0 1)} #90#return; {15101#(= main_~p~0 1)} is VALID [2022-04-15 09:23:02,109 INFO L290 TraceCheckUtils]: 74: Hoare triple {15101#(= main_~p~0 1)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {15064#false} is VALID [2022-04-15 09:23:02,109 INFO L290 TraceCheckUtils]: 75: Hoare triple {15064#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {15064#false} is VALID [2022-04-15 09:23:02,109 INFO L290 TraceCheckUtils]: 76: Hoare triple {15064#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15064#false} is VALID [2022-04-15 09:23:02,109 INFO L290 TraceCheckUtils]: 77: Hoare triple {15064#false} assume !!(#t~post7 < 20);havoc #t~post7; {15064#false} is VALID [2022-04-15 09:23:02,109 INFO L272 TraceCheckUtils]: 78: Hoare triple {15064#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {15064#false} is VALID [2022-04-15 09:23:02,109 INFO L290 TraceCheckUtils]: 79: Hoare triple {15064#false} ~cond := #in~cond; {15064#false} is VALID [2022-04-15 09:23:02,109 INFO L290 TraceCheckUtils]: 80: Hoare triple {15064#false} assume 0 == ~cond; {15064#false} is VALID [2022-04-15 09:23:02,109 INFO L290 TraceCheckUtils]: 81: Hoare triple {15064#false} assume !false; {15064#false} is VALID [2022-04-15 09:23:02,110 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-15 09:23:02,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:23:02,328 INFO L290 TraceCheckUtils]: 81: Hoare triple {15064#false} assume !false; {15064#false} is VALID [2022-04-15 09:23:02,328 INFO L290 TraceCheckUtils]: 80: Hoare triple {15064#false} assume 0 == ~cond; {15064#false} is VALID [2022-04-15 09:23:02,328 INFO L290 TraceCheckUtils]: 79: Hoare triple {15064#false} ~cond := #in~cond; {15064#false} is VALID [2022-04-15 09:23:02,328 INFO L272 TraceCheckUtils]: 78: Hoare triple {15064#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {15064#false} is VALID [2022-04-15 09:23:02,328 INFO L290 TraceCheckUtils]: 77: Hoare triple {15064#false} assume !!(#t~post7 < 20);havoc #t~post7; {15064#false} is VALID [2022-04-15 09:23:02,329 INFO L290 TraceCheckUtils]: 76: Hoare triple {15064#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15064#false} is VALID [2022-04-15 09:23:02,329 INFO L290 TraceCheckUtils]: 75: Hoare triple {15064#false} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {15064#false} is VALID [2022-04-15 09:23:02,329 INFO L290 TraceCheckUtils]: 74: Hoare triple {15101#(= main_~p~0 1)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {15064#false} is VALID [2022-04-15 09:23:02,329 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {15063#true} {15101#(= main_~p~0 1)} #90#return; {15101#(= main_~p~0 1)} is VALID [2022-04-15 09:23:02,329 INFO L290 TraceCheckUtils]: 72: Hoare triple {15063#true} assume true; {15063#true} is VALID [2022-04-15 09:23:02,330 INFO L290 TraceCheckUtils]: 71: Hoare triple {15063#true} assume !(0 == ~cond); {15063#true} is VALID [2022-04-15 09:23:02,330 INFO L290 TraceCheckUtils]: 70: Hoare triple {15063#true} ~cond := #in~cond; {15063#true} is VALID [2022-04-15 09:23:02,330 INFO L272 TraceCheckUtils]: 69: Hoare triple {15101#(= main_~p~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {15063#true} is VALID [2022-04-15 09:23:02,330 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {15063#true} {15101#(= main_~p~0 1)} #88#return; {15101#(= main_~p~0 1)} is VALID [2022-04-15 09:23:02,330 INFO L290 TraceCheckUtils]: 67: Hoare triple {15063#true} assume true; {15063#true} is VALID [2022-04-15 09:23:02,330 INFO L290 TraceCheckUtils]: 66: Hoare triple {15063#true} assume !(0 == ~cond); {15063#true} is VALID [2022-04-15 09:23:02,330 INFO L290 TraceCheckUtils]: 65: Hoare triple {15063#true} ~cond := #in~cond; {15063#true} is VALID [2022-04-15 09:23:02,331 INFO L272 TraceCheckUtils]: 64: Hoare triple {15101#(= main_~p~0 1)} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {15063#true} is VALID [2022-04-15 09:23:02,331 INFO L290 TraceCheckUtils]: 63: Hoare triple {15101#(= main_~p~0 1)} assume !!(#t~post7 < 20);havoc #t~post7; {15101#(= main_~p~0 1)} is VALID [2022-04-15 09:23:02,331 INFO L290 TraceCheckUtils]: 62: Hoare triple {15101#(= main_~p~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15101#(= main_~p~0 1)} is VALID [2022-04-15 09:23:02,331 INFO L290 TraceCheckUtils]: 61: Hoare triple {15101#(= main_~p~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {15101#(= main_~p~0 1)} is VALID [2022-04-15 09:23:02,332 INFO L290 TraceCheckUtils]: 60: Hoare triple {15376#(= (div main_~p~0 2) 1)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {15101#(= main_~p~0 1)} is VALID [2022-04-15 09:23:02,332 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {15063#true} {15376#(= (div main_~p~0 2) 1)} #90#return; {15376#(= (div main_~p~0 2) 1)} is VALID [2022-04-15 09:23:02,332 INFO L290 TraceCheckUtils]: 58: Hoare triple {15063#true} assume true; {15063#true} is VALID [2022-04-15 09:23:02,332 INFO L290 TraceCheckUtils]: 57: Hoare triple {15063#true} assume !(0 == ~cond); {15063#true} is VALID [2022-04-15 09:23:02,333 INFO L290 TraceCheckUtils]: 56: Hoare triple {15063#true} ~cond := #in~cond; {15063#true} is VALID [2022-04-15 09:23:02,333 INFO L272 TraceCheckUtils]: 55: Hoare triple {15376#(= (div main_~p~0 2) 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {15063#true} is VALID [2022-04-15 09:23:02,333 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {15063#true} {15376#(= (div main_~p~0 2) 1)} #88#return; {15376#(= (div main_~p~0 2) 1)} is VALID [2022-04-15 09:23:02,333 INFO L290 TraceCheckUtils]: 53: Hoare triple {15063#true} assume true; {15063#true} is VALID [2022-04-15 09:23:02,333 INFO L290 TraceCheckUtils]: 52: Hoare triple {15063#true} assume !(0 == ~cond); {15063#true} is VALID [2022-04-15 09:23:02,333 INFO L290 TraceCheckUtils]: 51: Hoare triple {15063#true} ~cond := #in~cond; {15063#true} is VALID [2022-04-15 09:23:02,333 INFO L272 TraceCheckUtils]: 50: Hoare triple {15376#(= (div main_~p~0 2) 1)} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {15063#true} is VALID [2022-04-15 09:23:02,334 INFO L290 TraceCheckUtils]: 49: Hoare triple {15376#(= (div main_~p~0 2) 1)} assume !!(#t~post7 < 20);havoc #t~post7; {15376#(= (div main_~p~0 2) 1)} is VALID [2022-04-15 09:23:02,334 INFO L290 TraceCheckUtils]: 48: Hoare triple {15376#(= (div main_~p~0 2) 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15376#(= (div main_~p~0 2) 1)} is VALID [2022-04-15 09:23:02,334 INFO L290 TraceCheckUtils]: 47: Hoare triple {15376#(= (div main_~p~0 2) 1)} assume !(~r~0 >= ~d~0); {15376#(= (div main_~p~0 2) 1)} is VALID [2022-04-15 09:23:02,335 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {15063#true} {15376#(= (div main_~p~0 2) 1)} #86#return; {15376#(= (div main_~p~0 2) 1)} is VALID [2022-04-15 09:23:02,335 INFO L290 TraceCheckUtils]: 45: Hoare triple {15063#true} assume true; {15063#true} is VALID [2022-04-15 09:23:02,335 INFO L290 TraceCheckUtils]: 44: Hoare triple {15063#true} assume !(0 == ~cond); {15063#true} is VALID [2022-04-15 09:23:02,335 INFO L290 TraceCheckUtils]: 43: Hoare triple {15063#true} ~cond := #in~cond; {15063#true} is VALID [2022-04-15 09:23:02,335 INFO L272 TraceCheckUtils]: 42: Hoare triple {15376#(= (div main_~p~0 2) 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {15063#true} is VALID [2022-04-15 09:23:02,335 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {15063#true} {15376#(= (div main_~p~0 2) 1)} #84#return; {15376#(= (div main_~p~0 2) 1)} is VALID [2022-04-15 09:23:02,335 INFO L290 TraceCheckUtils]: 40: Hoare triple {15063#true} assume true; {15063#true} is VALID [2022-04-15 09:23:02,336 INFO L290 TraceCheckUtils]: 39: Hoare triple {15063#true} assume !(0 == ~cond); {15063#true} is VALID [2022-04-15 09:23:02,336 INFO L290 TraceCheckUtils]: 38: Hoare triple {15063#true} ~cond := #in~cond; {15063#true} is VALID [2022-04-15 09:23:02,336 INFO L272 TraceCheckUtils]: 37: Hoare triple {15376#(= (div main_~p~0 2) 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {15063#true} is VALID [2022-04-15 09:23:02,336 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {15063#true} {15376#(= (div main_~p~0 2) 1)} #82#return; {15376#(= (div main_~p~0 2) 1)} is VALID [2022-04-15 09:23:02,336 INFO L290 TraceCheckUtils]: 35: Hoare triple {15063#true} assume true; {15063#true} is VALID [2022-04-15 09:23:02,336 INFO L290 TraceCheckUtils]: 34: Hoare triple {15063#true} assume !(0 == ~cond); {15063#true} is VALID [2022-04-15 09:23:02,336 INFO L290 TraceCheckUtils]: 33: Hoare triple {15063#true} ~cond := #in~cond; {15063#true} is VALID [2022-04-15 09:23:02,336 INFO L272 TraceCheckUtils]: 32: Hoare triple {15376#(= (div main_~p~0 2) 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {15063#true} is VALID [2022-04-15 09:23:02,337 INFO L290 TraceCheckUtils]: 31: Hoare triple {15376#(= (div main_~p~0 2) 1)} assume !!(#t~post6 < 20);havoc #t~post6; {15376#(= (div main_~p~0 2) 1)} is VALID [2022-04-15 09:23:02,337 INFO L290 TraceCheckUtils]: 30: Hoare triple {15376#(= (div main_~p~0 2) 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15376#(= (div main_~p~0 2) 1)} is VALID [2022-04-15 09:23:02,337 INFO L290 TraceCheckUtils]: 29: Hoare triple {15101#(= main_~p~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {15376#(= (div main_~p~0 2) 1)} is VALID [2022-04-15 09:23:02,338 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {15063#true} {15101#(= main_~p~0 1)} #86#return; {15101#(= main_~p~0 1)} is VALID [2022-04-15 09:23:02,338 INFO L290 TraceCheckUtils]: 27: Hoare triple {15063#true} assume true; {15063#true} is VALID [2022-04-15 09:23:02,338 INFO L290 TraceCheckUtils]: 26: Hoare triple {15063#true} assume !(0 == ~cond); {15063#true} is VALID [2022-04-15 09:23:02,338 INFO L290 TraceCheckUtils]: 25: Hoare triple {15063#true} ~cond := #in~cond; {15063#true} is VALID [2022-04-15 09:23:02,338 INFO L272 TraceCheckUtils]: 24: Hoare triple {15101#(= main_~p~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {15063#true} is VALID [2022-04-15 09:23:02,338 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {15063#true} {15101#(= main_~p~0 1)} #84#return; {15101#(= main_~p~0 1)} is VALID [2022-04-15 09:23:02,338 INFO L290 TraceCheckUtils]: 22: Hoare triple {15063#true} assume true; {15063#true} is VALID [2022-04-15 09:23:02,339 INFO L290 TraceCheckUtils]: 21: Hoare triple {15063#true} assume !(0 == ~cond); {15063#true} is VALID [2022-04-15 09:23:02,339 INFO L290 TraceCheckUtils]: 20: Hoare triple {15063#true} ~cond := #in~cond; {15063#true} is VALID [2022-04-15 09:23:02,339 INFO L272 TraceCheckUtils]: 19: Hoare triple {15101#(= main_~p~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {15063#true} is VALID [2022-04-15 09:23:02,339 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {15063#true} {15101#(= main_~p~0 1)} #82#return; {15101#(= main_~p~0 1)} is VALID [2022-04-15 09:23:02,339 INFO L290 TraceCheckUtils]: 17: Hoare triple {15063#true} assume true; {15063#true} is VALID [2022-04-15 09:23:02,339 INFO L290 TraceCheckUtils]: 16: Hoare triple {15063#true} assume !(0 == ~cond); {15063#true} is VALID [2022-04-15 09:23:02,339 INFO L290 TraceCheckUtils]: 15: Hoare triple {15063#true} ~cond := #in~cond; {15063#true} is VALID [2022-04-15 09:23:02,340 INFO L272 TraceCheckUtils]: 14: Hoare triple {15101#(= main_~p~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {15063#true} is VALID [2022-04-15 09:23:02,340 INFO L290 TraceCheckUtils]: 13: Hoare triple {15101#(= main_~p~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {15101#(= main_~p~0 1)} is VALID [2022-04-15 09:23:02,340 INFO L290 TraceCheckUtils]: 12: Hoare triple {15101#(= main_~p~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15101#(= main_~p~0 1)} is VALID [2022-04-15 09:23:02,340 INFO L290 TraceCheckUtils]: 11: Hoare triple {15063#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {15101#(= main_~p~0 1)} is VALID [2022-04-15 09:23:02,340 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15063#true} {15063#true} #80#return; {15063#true} is VALID [2022-04-15 09:23:02,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {15063#true} assume true; {15063#true} is VALID [2022-04-15 09:23:02,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {15063#true} assume !(0 == ~cond); {15063#true} is VALID [2022-04-15 09:23:02,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {15063#true} ~cond := #in~cond; {15063#true} is VALID [2022-04-15 09:23:02,341 INFO L272 TraceCheckUtils]: 6: Hoare triple {15063#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {15063#true} is VALID [2022-04-15 09:23:02,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {15063#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {15063#true} is VALID [2022-04-15 09:23:02,341 INFO L272 TraceCheckUtils]: 4: Hoare triple {15063#true} call #t~ret8 := main(); {15063#true} is VALID [2022-04-15 09:23:02,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15063#true} {15063#true} #96#return; {15063#true} is VALID [2022-04-15 09:23:02,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {15063#true} assume true; {15063#true} is VALID [2022-04-15 09:23:02,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {15063#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {15063#true} is VALID [2022-04-15 09:23:02,341 INFO L272 TraceCheckUtils]: 0: Hoare triple {15063#true} call ULTIMATE.init(); {15063#true} is VALID [2022-04-15 09:23:02,342 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 27 proven. 11 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-15 09:23:02,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:23:02,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169812211] [2022-04-15 09:23:02,342 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:23:02,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435934654] [2022-04-15 09:23:02,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435934654] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:23:02,342 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:23:02,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2022-04-15 09:23:02,342 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:23:02,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2024571300] [2022-04-15 09:23:02,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2024571300] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:23:02,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:23:02,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 09:23:02,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064910677] [2022-04-15 09:23:02,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:23:02,343 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 82 [2022-04-15 09:23:02,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:23:02,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-15 09:23:02,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:23:02,387 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 09:23:02,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:23:02,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 09:23:02,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 09:23:02,387 INFO L87 Difference]: Start difference. First operand 208 states and 240 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-15 09:23:02,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:23:02,759 INFO L93 Difference]: Finished difference Result 225 states and 264 transitions. [2022-04-15 09:23:02,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 09:23:02,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 82 [2022-04-15 09:23:02,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:23:02,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-15 09:23:02,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-15 09:23:02,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-15 09:23:02,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-15 09:23:02,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 99 transitions. [2022-04-15 09:23:02,899 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:23:02,902 INFO L225 Difference]: With dead ends: 225 [2022-04-15 09:23:02,902 INFO L226 Difference]: Without dead ends: 196 [2022-04-15 09:23:02,902 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 159 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 09:23:02,903 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 1 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 09:23:02,903 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 132 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 09:23:02,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-04-15 09:23:03,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 193. [2022-04-15 09:23:03,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:23:03,114 INFO L82 GeneralOperation]: Start isEquivalent. First operand 196 states. Second operand has 193 states, 127 states have (on average 1.1338582677165354) internal successors, (144), 132 states have internal predecessors, (144), 39 states have call successors, (39), 28 states have call predecessors, (39), 26 states have return successors, (36), 32 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-15 09:23:03,114 INFO L74 IsIncluded]: Start isIncluded. First operand 196 states. Second operand has 193 states, 127 states have (on average 1.1338582677165354) internal successors, (144), 132 states have internal predecessors, (144), 39 states have call successors, (39), 28 states have call predecessors, (39), 26 states have return successors, (36), 32 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-15 09:23:03,114 INFO L87 Difference]: Start difference. First operand 196 states. Second operand has 193 states, 127 states have (on average 1.1338582677165354) internal successors, (144), 132 states have internal predecessors, (144), 39 states have call successors, (39), 28 states have call predecessors, (39), 26 states have return successors, (36), 32 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-15 09:23:03,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:23:03,117 INFO L93 Difference]: Finished difference Result 196 states and 224 transitions. [2022-04-15 09:23:03,117 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 224 transitions. [2022-04-15 09:23:03,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:23:03,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:23:03,118 INFO L74 IsIncluded]: Start isIncluded. First operand has 193 states, 127 states have (on average 1.1338582677165354) internal successors, (144), 132 states have internal predecessors, (144), 39 states have call successors, (39), 28 states have call predecessors, (39), 26 states have return successors, (36), 32 states have call predecessors, (36), 36 states have call successors, (36) Second operand 196 states. [2022-04-15 09:23:03,118 INFO L87 Difference]: Start difference. First operand has 193 states, 127 states have (on average 1.1338582677165354) internal successors, (144), 132 states have internal predecessors, (144), 39 states have call successors, (39), 28 states have call predecessors, (39), 26 states have return successors, (36), 32 states have call predecessors, (36), 36 states have call successors, (36) Second operand 196 states. [2022-04-15 09:23:03,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:23:03,121 INFO L93 Difference]: Finished difference Result 196 states and 224 transitions. [2022-04-15 09:23:03,121 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 224 transitions. [2022-04-15 09:23:03,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:23:03,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:23:03,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:23:03,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:23:03,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 127 states have (on average 1.1338582677165354) internal successors, (144), 132 states have internal predecessors, (144), 39 states have call successors, (39), 28 states have call predecessors, (39), 26 states have return successors, (36), 32 states have call predecessors, (36), 36 states have call successors, (36) [2022-04-15 09:23:03,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 219 transitions. [2022-04-15 09:23:03,126 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 219 transitions. Word has length 82 [2022-04-15 09:23:03,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:23:03,126 INFO L478 AbstractCegarLoop]: Abstraction has 193 states and 219 transitions. [2022-04-15 09:23:03,126 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 4 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2022-04-15 09:23:03,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 193 states and 219 transitions. [2022-04-15 09:23:05,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 219 edges. 218 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 09:23:05,403 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 219 transitions. [2022-04-15 09:23:05,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-15 09:23:05,404 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:23:05,404 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:23:05,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-15 09:23:05,604 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-15 09:23:05,604 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:23:05,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:23:05,605 INFO L85 PathProgramCache]: Analyzing trace with hash 111833757, now seen corresponding path program 1 times [2022-04-15 09:23:05,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:23:05,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1869444077] [2022-04-15 09:23:14,356 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:23:14,356 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:23:14,356 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:23:14,356 INFO L85 PathProgramCache]: Analyzing trace with hash 111833757, now seen corresponding path program 2 times [2022-04-15 09:23:14,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:23:14,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623084635] [2022-04-15 09:23:14,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:23:14,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:23:14,383 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:23:14,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1829071248] [2022-04-15 09:23:14,383 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:23:14,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:23:14,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:23:14,385 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:23:14,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-15 09:23:14,438 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:23:14,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:23:14,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 09:23:14,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:23:14,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:23:15,391 INFO L272 TraceCheckUtils]: 0: Hoare triple {16787#true} call ULTIMATE.init(); {16787#true} is VALID [2022-04-15 09:23:15,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {16787#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {16787#true} is VALID [2022-04-15 09:23:15,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-15 09:23:15,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16787#true} {16787#true} #96#return; {16787#true} is VALID [2022-04-15 09:23:15,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {16787#true} call #t~ret8 := main(); {16787#true} is VALID [2022-04-15 09:23:15,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {16787#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {16787#true} is VALID [2022-04-15 09:23:15,392 INFO L272 TraceCheckUtils]: 6: Hoare triple {16787#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {16787#true} is VALID [2022-04-15 09:23:15,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {16787#true} ~cond := #in~cond; {16787#true} is VALID [2022-04-15 09:23:15,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {16787#true} assume !(0 == ~cond); {16787#true} is VALID [2022-04-15 09:23:15,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-15 09:23:15,393 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16787#true} {16787#true} #80#return; {16787#true} is VALID [2022-04-15 09:23:15,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {16787#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {16825#(= main_~d~0 (mod main_~B~0 4294967296))} is VALID [2022-04-15 09:23:15,393 INFO L290 TraceCheckUtils]: 12: Hoare triple {16825#(= main_~d~0 (mod main_~B~0 4294967296))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16825#(= main_~d~0 (mod main_~B~0 4294967296))} is VALID [2022-04-15 09:23:15,394 INFO L290 TraceCheckUtils]: 13: Hoare triple {16825#(= main_~d~0 (mod main_~B~0 4294967296))} assume !!(#t~post6 < 20);havoc #t~post6; {16825#(= main_~d~0 (mod main_~B~0 4294967296))} is VALID [2022-04-15 09:23:15,394 INFO L272 TraceCheckUtils]: 14: Hoare triple {16825#(= main_~d~0 (mod main_~B~0 4294967296))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {16787#true} is VALID [2022-04-15 09:23:15,394 INFO L290 TraceCheckUtils]: 15: Hoare triple {16787#true} ~cond := #in~cond; {16787#true} is VALID [2022-04-15 09:23:15,394 INFO L290 TraceCheckUtils]: 16: Hoare triple {16787#true} assume !(0 == ~cond); {16787#true} is VALID [2022-04-15 09:23:15,394 INFO L290 TraceCheckUtils]: 17: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-15 09:23:15,394 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {16787#true} {16825#(= main_~d~0 (mod main_~B~0 4294967296))} #82#return; {16825#(= main_~d~0 (mod main_~B~0 4294967296))} is VALID [2022-04-15 09:23:15,395 INFO L272 TraceCheckUtils]: 19: Hoare triple {16825#(= main_~d~0 (mod main_~B~0 4294967296))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {16787#true} is VALID [2022-04-15 09:23:15,395 INFO L290 TraceCheckUtils]: 20: Hoare triple {16787#true} ~cond := #in~cond; {16787#true} is VALID [2022-04-15 09:23:15,395 INFO L290 TraceCheckUtils]: 21: Hoare triple {16787#true} assume !(0 == ~cond); {16787#true} is VALID [2022-04-15 09:23:15,395 INFO L290 TraceCheckUtils]: 22: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-15 09:23:15,395 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {16787#true} {16825#(= main_~d~0 (mod main_~B~0 4294967296))} #84#return; {16825#(= main_~d~0 (mod main_~B~0 4294967296))} is VALID [2022-04-15 09:23:15,395 INFO L272 TraceCheckUtils]: 24: Hoare triple {16825#(= main_~d~0 (mod main_~B~0 4294967296))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {16787#true} is VALID [2022-04-15 09:23:15,396 INFO L290 TraceCheckUtils]: 25: Hoare triple {16787#true} ~cond := #in~cond; {16787#true} is VALID [2022-04-15 09:23:15,396 INFO L290 TraceCheckUtils]: 26: Hoare triple {16787#true} assume !(0 == ~cond); {16787#true} is VALID [2022-04-15 09:23:15,396 INFO L290 TraceCheckUtils]: 27: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-15 09:23:15,396 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {16787#true} {16825#(= main_~d~0 (mod main_~B~0 4294967296))} #86#return; {16825#(= main_~d~0 (mod main_~B~0 4294967296))} is VALID [2022-04-15 09:23:15,397 INFO L290 TraceCheckUtils]: 29: Hoare triple {16825#(= main_~d~0 (mod main_~B~0 4294967296))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {16880#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-15 09:23:15,397 INFO L290 TraceCheckUtils]: 30: Hoare triple {16880#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= (mod main_~B~0 4294967296) main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16880#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-15 09:23:15,398 INFO L290 TraceCheckUtils]: 31: Hoare triple {16880#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= (mod main_~B~0 4294967296) main_~r~0))} assume !!(#t~post6 < 20);havoc #t~post6; {16880#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-15 09:23:15,398 INFO L272 TraceCheckUtils]: 32: Hoare triple {16880#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= (mod main_~B~0 4294967296) main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {16787#true} is VALID [2022-04-15 09:23:15,398 INFO L290 TraceCheckUtils]: 33: Hoare triple {16787#true} ~cond := #in~cond; {16787#true} is VALID [2022-04-15 09:23:15,398 INFO L290 TraceCheckUtils]: 34: Hoare triple {16787#true} assume !(0 == ~cond); {16787#true} is VALID [2022-04-15 09:23:15,398 INFO L290 TraceCheckUtils]: 35: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-15 09:23:15,399 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {16787#true} {16880#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= (mod main_~B~0 4294967296) main_~r~0))} #82#return; {16880#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-15 09:23:15,399 INFO L272 TraceCheckUtils]: 37: Hoare triple {16880#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= (mod main_~B~0 4294967296) main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {16787#true} is VALID [2022-04-15 09:23:15,399 INFO L290 TraceCheckUtils]: 38: Hoare triple {16787#true} ~cond := #in~cond; {16787#true} is VALID [2022-04-15 09:23:15,399 INFO L290 TraceCheckUtils]: 39: Hoare triple {16787#true} assume !(0 == ~cond); {16787#true} is VALID [2022-04-15 09:23:15,399 INFO L290 TraceCheckUtils]: 40: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-15 09:23:15,400 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {16787#true} {16880#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= (mod main_~B~0 4294967296) main_~r~0))} #84#return; {16880#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-15 09:23:15,400 INFO L272 TraceCheckUtils]: 42: Hoare triple {16880#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= (mod main_~B~0 4294967296) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {16787#true} is VALID [2022-04-15 09:23:15,400 INFO L290 TraceCheckUtils]: 43: Hoare triple {16787#true} ~cond := #in~cond; {16787#true} is VALID [2022-04-15 09:23:15,400 INFO L290 TraceCheckUtils]: 44: Hoare triple {16787#true} assume !(0 == ~cond); {16787#true} is VALID [2022-04-15 09:23:15,400 INFO L290 TraceCheckUtils]: 45: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-15 09:23:15,400 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {16787#true} {16880#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= (mod main_~B~0 4294967296) main_~r~0))} #86#return; {16880#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-15 09:23:15,402 INFO L290 TraceCheckUtils]: 47: Hoare triple {16880#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (<= (mod main_~B~0 4294967296) main_~r~0))} assume !(~r~0 >= ~d~0); {16935#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (< (mod main_~B~0 4294967296) main_~d~0))} is VALID [2022-04-15 09:23:15,402 INFO L290 TraceCheckUtils]: 48: Hoare triple {16935#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (< (mod main_~B~0 4294967296) main_~d~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16935#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (< (mod main_~B~0 4294967296) main_~d~0))} is VALID [2022-04-15 09:23:15,403 INFO L290 TraceCheckUtils]: 49: Hoare triple {16935#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (< (mod main_~B~0 4294967296) main_~d~0))} assume !!(#t~post7 < 20);havoc #t~post7; {16935#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (< (mod main_~B~0 4294967296) main_~d~0))} is VALID [2022-04-15 09:23:15,403 INFO L272 TraceCheckUtils]: 50: Hoare triple {16935#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (< (mod main_~B~0 4294967296) main_~d~0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {16787#true} is VALID [2022-04-15 09:23:15,403 INFO L290 TraceCheckUtils]: 51: Hoare triple {16787#true} ~cond := #in~cond; {16787#true} is VALID [2022-04-15 09:23:15,403 INFO L290 TraceCheckUtils]: 52: Hoare triple {16787#true} assume !(0 == ~cond); {16787#true} is VALID [2022-04-15 09:23:15,403 INFO L290 TraceCheckUtils]: 53: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-15 09:23:15,404 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {16787#true} {16935#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (< (mod main_~B~0 4294967296) main_~d~0))} #88#return; {16935#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (< (mod main_~B~0 4294967296) main_~d~0))} is VALID [2022-04-15 09:23:15,404 INFO L272 TraceCheckUtils]: 55: Hoare triple {16935#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (< (mod main_~B~0 4294967296) main_~d~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {16787#true} is VALID [2022-04-15 09:23:15,404 INFO L290 TraceCheckUtils]: 56: Hoare triple {16787#true} ~cond := #in~cond; {16787#true} is VALID [2022-04-15 09:23:15,404 INFO L290 TraceCheckUtils]: 57: Hoare triple {16787#true} assume !(0 == ~cond); {16787#true} is VALID [2022-04-15 09:23:15,404 INFO L290 TraceCheckUtils]: 58: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-15 09:23:15,405 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {16787#true} {16935#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (< (mod main_~B~0 4294967296) main_~d~0))} #90#return; {16935#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (< (mod main_~B~0 4294967296) main_~d~0))} is VALID [2022-04-15 09:23:15,406 INFO L290 TraceCheckUtils]: 60: Hoare triple {16935#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (< (mod main_~B~0 4294967296) main_~d~0))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {16975#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 09:23:15,406 INFO L290 TraceCheckUtils]: 61: Hoare triple {16975#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {16975#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 09:23:15,407 INFO L290 TraceCheckUtils]: 62: Hoare triple {16975#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16975#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 09:23:15,407 INFO L290 TraceCheckUtils]: 63: Hoare triple {16975#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} assume !!(#t~post7 < 20);havoc #t~post7; {16975#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 09:23:15,407 INFO L272 TraceCheckUtils]: 64: Hoare triple {16975#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {16787#true} is VALID [2022-04-15 09:23:15,407 INFO L290 TraceCheckUtils]: 65: Hoare triple {16787#true} ~cond := #in~cond; {16787#true} is VALID [2022-04-15 09:23:15,407 INFO L290 TraceCheckUtils]: 66: Hoare triple {16787#true} assume !(0 == ~cond); {16787#true} is VALID [2022-04-15 09:23:15,407 INFO L290 TraceCheckUtils]: 67: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-15 09:23:15,408 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {16787#true} {16975#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} #88#return; {16975#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 09:23:15,408 INFO L272 TraceCheckUtils]: 69: Hoare triple {16975#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {16787#true} is VALID [2022-04-15 09:23:15,408 INFO L290 TraceCheckUtils]: 70: Hoare triple {16787#true} ~cond := #in~cond; {16787#true} is VALID [2022-04-15 09:23:15,408 INFO L290 TraceCheckUtils]: 71: Hoare triple {16787#true} assume !(0 == ~cond); {16787#true} is VALID [2022-04-15 09:23:15,408 INFO L290 TraceCheckUtils]: 72: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-15 09:23:15,409 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {16787#true} {16975#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} #90#return; {16975#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 09:23:15,409 INFO L290 TraceCheckUtils]: 74: Hoare triple {16975#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} assume !(1 != ~p~0); {16975#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 09:23:15,409 INFO L272 TraceCheckUtils]: 75: Hoare triple {16975#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {16787#true} is VALID [2022-04-15 09:23:15,409 INFO L290 TraceCheckUtils]: 76: Hoare triple {16787#true} ~cond := #in~cond; {16787#true} is VALID [2022-04-15 09:23:15,410 INFO L290 TraceCheckUtils]: 77: Hoare triple {16787#true} assume !(0 == ~cond); {16787#true} is VALID [2022-04-15 09:23:15,410 INFO L290 TraceCheckUtils]: 78: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-15 09:23:15,410 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {16787#true} {16975#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} #92#return; {16975#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 09:23:15,411 INFO L272 TraceCheckUtils]: 80: Hoare triple {16975#(and (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (< 0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~B~0 % 4294967296 == ~d~0 then 1 else 0)); {17036#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 09:23:15,411 INFO L290 TraceCheckUtils]: 81: Hoare triple {17036#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17040#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:23:15,411 INFO L290 TraceCheckUtils]: 82: Hoare triple {17040#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16788#false} is VALID [2022-04-15 09:23:15,411 INFO L290 TraceCheckUtils]: 83: Hoare triple {16788#false} assume !false; {16788#false} is VALID [2022-04-15 09:23:15,412 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-15 09:23:15,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:23:15,987 INFO L290 TraceCheckUtils]: 83: Hoare triple {16788#false} assume !false; {16788#false} is VALID [2022-04-15 09:23:15,988 INFO L290 TraceCheckUtils]: 82: Hoare triple {17040#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16788#false} is VALID [2022-04-15 09:23:15,988 INFO L290 TraceCheckUtils]: 81: Hoare triple {17036#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {17040#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:23:15,989 INFO L272 TraceCheckUtils]: 80: Hoare triple {16825#(= main_~d~0 (mod main_~B~0 4294967296))} call __VERIFIER_assert((if ~B~0 % 4294967296 == ~d~0 then 1 else 0)); {17036#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 09:23:15,989 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {16787#true} {16825#(= main_~d~0 (mod main_~B~0 4294967296))} #92#return; {16825#(= main_~d~0 (mod main_~B~0 4294967296))} is VALID [2022-04-15 09:23:15,989 INFO L290 TraceCheckUtils]: 78: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-15 09:23:15,989 INFO L290 TraceCheckUtils]: 77: Hoare triple {16787#true} assume !(0 == ~cond); {16787#true} is VALID [2022-04-15 09:23:15,989 INFO L290 TraceCheckUtils]: 76: Hoare triple {16787#true} ~cond := #in~cond; {16787#true} is VALID [2022-04-15 09:23:15,989 INFO L272 TraceCheckUtils]: 75: Hoare triple {16825#(= main_~d~0 (mod main_~B~0 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {16787#true} is VALID [2022-04-15 09:23:15,990 INFO L290 TraceCheckUtils]: 74: Hoare triple {16825#(= main_~d~0 (mod main_~B~0 4294967296))} assume !(1 != ~p~0); {16825#(= main_~d~0 (mod main_~B~0 4294967296))} is VALID [2022-04-15 09:23:15,990 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {16787#true} {16825#(= main_~d~0 (mod main_~B~0 4294967296))} #90#return; {16825#(= main_~d~0 (mod main_~B~0 4294967296))} is VALID [2022-04-15 09:23:15,990 INFO L290 TraceCheckUtils]: 72: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-15 09:23:15,990 INFO L290 TraceCheckUtils]: 71: Hoare triple {16787#true} assume !(0 == ~cond); {16787#true} is VALID [2022-04-15 09:23:15,991 INFO L290 TraceCheckUtils]: 70: Hoare triple {16787#true} ~cond := #in~cond; {16787#true} is VALID [2022-04-15 09:23:15,991 INFO L272 TraceCheckUtils]: 69: Hoare triple {16825#(= main_~d~0 (mod main_~B~0 4294967296))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {16787#true} is VALID [2022-04-15 09:23:15,991 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {16787#true} {16825#(= main_~d~0 (mod main_~B~0 4294967296))} #88#return; {16825#(= main_~d~0 (mod main_~B~0 4294967296))} is VALID [2022-04-15 09:23:15,991 INFO L290 TraceCheckUtils]: 67: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-15 09:23:15,991 INFO L290 TraceCheckUtils]: 66: Hoare triple {16787#true} assume !(0 == ~cond); {16787#true} is VALID [2022-04-15 09:23:15,991 INFO L290 TraceCheckUtils]: 65: Hoare triple {16787#true} ~cond := #in~cond; {16787#true} is VALID [2022-04-15 09:23:15,992 INFO L272 TraceCheckUtils]: 64: Hoare triple {16825#(= main_~d~0 (mod main_~B~0 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {16787#true} is VALID [2022-04-15 09:23:15,992 INFO L290 TraceCheckUtils]: 63: Hoare triple {16825#(= main_~d~0 (mod main_~B~0 4294967296))} assume !!(#t~post7 < 20);havoc #t~post7; {16825#(= main_~d~0 (mod main_~B~0 4294967296))} is VALID [2022-04-15 09:23:15,992 INFO L290 TraceCheckUtils]: 62: Hoare triple {16825#(= main_~d~0 (mod main_~B~0 4294967296))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16825#(= main_~d~0 (mod main_~B~0 4294967296))} is VALID [2022-04-15 09:23:15,992 INFO L290 TraceCheckUtils]: 61: Hoare triple {16825#(= main_~d~0 (mod main_~B~0 4294967296))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {16825#(= main_~d~0 (mod main_~B~0 4294967296))} is VALID [2022-04-15 09:23:16,006 INFO L290 TraceCheckUtils]: 60: Hoare triple {17116#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {16825#(= main_~d~0 (mod main_~B~0 4294967296))} is VALID [2022-04-15 09:23:16,007 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {16787#true} {17116#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0))))} #90#return; {17116#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0))))} is VALID [2022-04-15 09:23:16,007 INFO L290 TraceCheckUtils]: 58: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-15 09:23:16,007 INFO L290 TraceCheckUtils]: 57: Hoare triple {16787#true} assume !(0 == ~cond); {16787#true} is VALID [2022-04-15 09:23:16,007 INFO L290 TraceCheckUtils]: 56: Hoare triple {16787#true} ~cond := #in~cond; {16787#true} is VALID [2022-04-15 09:23:16,007 INFO L272 TraceCheckUtils]: 55: Hoare triple {17116#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {16787#true} is VALID [2022-04-15 09:23:16,008 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {16787#true} {17116#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0))))} #88#return; {17116#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0))))} is VALID [2022-04-15 09:23:16,008 INFO L290 TraceCheckUtils]: 53: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-15 09:23:16,008 INFO L290 TraceCheckUtils]: 52: Hoare triple {16787#true} assume !(0 == ~cond); {16787#true} is VALID [2022-04-15 09:23:16,008 INFO L290 TraceCheckUtils]: 51: Hoare triple {16787#true} ~cond := #in~cond; {16787#true} is VALID [2022-04-15 09:23:16,008 INFO L272 TraceCheckUtils]: 50: Hoare triple {17116#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0))))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {16787#true} is VALID [2022-04-15 09:23:16,009 INFO L290 TraceCheckUtils]: 49: Hoare triple {17116#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0))))} assume !!(#t~post7 < 20);havoc #t~post7; {17116#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0))))} is VALID [2022-04-15 09:23:16,010 INFO L290 TraceCheckUtils]: 48: Hoare triple {17116#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {17116#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0))))} is VALID [2022-04-15 09:23:16,011 INFO L290 TraceCheckUtils]: 47: Hoare triple {17156#(or (<= main_~d~0 main_~r~0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0)))))} assume !(~r~0 >= ~d~0); {17116#(and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0))))} is VALID [2022-04-15 09:23:16,011 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {16787#true} {17156#(or (<= main_~d~0 main_~r~0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0)))))} #86#return; {17156#(or (<= main_~d~0 main_~r~0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0)))))} is VALID [2022-04-15 09:23:16,011 INFO L290 TraceCheckUtils]: 45: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-15 09:23:16,011 INFO L290 TraceCheckUtils]: 44: Hoare triple {16787#true} assume !(0 == ~cond); {16787#true} is VALID [2022-04-15 09:23:16,012 INFO L290 TraceCheckUtils]: 43: Hoare triple {16787#true} ~cond := #in~cond; {16787#true} is VALID [2022-04-15 09:23:16,012 INFO L272 TraceCheckUtils]: 42: Hoare triple {17156#(or (<= main_~d~0 main_~r~0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0)))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {16787#true} is VALID [2022-04-15 09:23:16,012 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {16787#true} {17156#(or (<= main_~d~0 main_~r~0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0)))))} #84#return; {17156#(or (<= main_~d~0 main_~r~0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0)))))} is VALID [2022-04-15 09:23:16,012 INFO L290 TraceCheckUtils]: 40: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-15 09:23:16,012 INFO L290 TraceCheckUtils]: 39: Hoare triple {16787#true} assume !(0 == ~cond); {16787#true} is VALID [2022-04-15 09:23:16,012 INFO L290 TraceCheckUtils]: 38: Hoare triple {16787#true} ~cond := #in~cond; {16787#true} is VALID [2022-04-15 09:23:16,013 INFO L272 TraceCheckUtils]: 37: Hoare triple {17156#(or (<= main_~d~0 main_~r~0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0)))))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {16787#true} is VALID [2022-04-15 09:23:16,013 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {16787#true} {17156#(or (<= main_~d~0 main_~r~0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0)))))} #82#return; {17156#(or (<= main_~d~0 main_~r~0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0)))))} is VALID [2022-04-15 09:23:16,013 INFO L290 TraceCheckUtils]: 35: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-15 09:23:16,013 INFO L290 TraceCheckUtils]: 34: Hoare triple {16787#true} assume !(0 == ~cond); {16787#true} is VALID [2022-04-15 09:23:16,013 INFO L290 TraceCheckUtils]: 33: Hoare triple {16787#true} ~cond := #in~cond; {16787#true} is VALID [2022-04-15 09:23:16,013 INFO L272 TraceCheckUtils]: 32: Hoare triple {17156#(or (<= main_~d~0 main_~r~0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0)))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {16787#true} is VALID [2022-04-15 09:23:16,014 INFO L290 TraceCheckUtils]: 31: Hoare triple {17156#(or (<= main_~d~0 main_~r~0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0)))))} assume !!(#t~post6 < 20);havoc #t~post6; {17156#(or (<= main_~d~0 main_~r~0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0)))))} is VALID [2022-04-15 09:23:16,015 INFO L290 TraceCheckUtils]: 30: Hoare triple {17156#(or (<= main_~d~0 main_~r~0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0)))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17156#(or (<= main_~d~0 main_~r~0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0)))))} is VALID [2022-04-15 09:23:16,016 INFO L290 TraceCheckUtils]: 29: Hoare triple {17211#(or (= (div (* main_~d~0 2) 2) (mod main_~B~0 4294967296)) (<= main_~d~0 0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {17156#(or (<= main_~d~0 main_~r~0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (mod main_~B~0 4294967296))) (or (= (+ (div main_~d~0 2) 1) (mod main_~B~0 4294967296)) (not (< main_~d~0 0)))))} is VALID [2022-04-15 09:23:16,016 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {16787#true} {17211#(or (= (div (* main_~d~0 2) 2) (mod main_~B~0 4294967296)) (<= main_~d~0 0))} #86#return; {17211#(or (= (div (* main_~d~0 2) 2) (mod main_~B~0 4294967296)) (<= main_~d~0 0))} is VALID [2022-04-15 09:23:16,016 INFO L290 TraceCheckUtils]: 27: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-15 09:23:16,017 INFO L290 TraceCheckUtils]: 26: Hoare triple {16787#true} assume !(0 == ~cond); {16787#true} is VALID [2022-04-15 09:23:16,017 INFO L290 TraceCheckUtils]: 25: Hoare triple {16787#true} ~cond := #in~cond; {16787#true} is VALID [2022-04-15 09:23:16,017 INFO L272 TraceCheckUtils]: 24: Hoare triple {17211#(or (= (div (* main_~d~0 2) 2) (mod main_~B~0 4294967296)) (<= main_~d~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {16787#true} is VALID [2022-04-15 09:23:16,017 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {16787#true} {17211#(or (= (div (* main_~d~0 2) 2) (mod main_~B~0 4294967296)) (<= main_~d~0 0))} #84#return; {17211#(or (= (div (* main_~d~0 2) 2) (mod main_~B~0 4294967296)) (<= main_~d~0 0))} is VALID [2022-04-15 09:23:16,017 INFO L290 TraceCheckUtils]: 22: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-15 09:23:16,017 INFO L290 TraceCheckUtils]: 21: Hoare triple {16787#true} assume !(0 == ~cond); {16787#true} is VALID [2022-04-15 09:23:16,018 INFO L290 TraceCheckUtils]: 20: Hoare triple {16787#true} ~cond := #in~cond; {16787#true} is VALID [2022-04-15 09:23:16,018 INFO L272 TraceCheckUtils]: 19: Hoare triple {17211#(or (= (div (* main_~d~0 2) 2) (mod main_~B~0 4294967296)) (<= main_~d~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {16787#true} is VALID [2022-04-15 09:23:16,018 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {16787#true} {17211#(or (= (div (* main_~d~0 2) 2) (mod main_~B~0 4294967296)) (<= main_~d~0 0))} #82#return; {17211#(or (= (div (* main_~d~0 2) 2) (mod main_~B~0 4294967296)) (<= main_~d~0 0))} is VALID [2022-04-15 09:23:16,018 INFO L290 TraceCheckUtils]: 17: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-15 09:23:16,018 INFO L290 TraceCheckUtils]: 16: Hoare triple {16787#true} assume !(0 == ~cond); {16787#true} is VALID [2022-04-15 09:23:16,018 INFO L290 TraceCheckUtils]: 15: Hoare triple {16787#true} ~cond := #in~cond; {16787#true} is VALID [2022-04-15 09:23:16,018 INFO L272 TraceCheckUtils]: 14: Hoare triple {17211#(or (= (div (* main_~d~0 2) 2) (mod main_~B~0 4294967296)) (<= main_~d~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {16787#true} is VALID [2022-04-15 09:23:16,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {17211#(or (= (div (* main_~d~0 2) 2) (mod main_~B~0 4294967296)) (<= main_~d~0 0))} assume !!(#t~post6 < 20);havoc #t~post6; {17211#(or (= (div (* main_~d~0 2) 2) (mod main_~B~0 4294967296)) (<= main_~d~0 0))} is VALID [2022-04-15 09:23:16,019 INFO L290 TraceCheckUtils]: 12: Hoare triple {17211#(or (= (div (* main_~d~0 2) 2) (mod main_~B~0 4294967296)) (<= main_~d~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17211#(or (= (div (* main_~d~0 2) 2) (mod main_~B~0 4294967296)) (<= main_~d~0 0))} is VALID [2022-04-15 09:23:16,020 INFO L290 TraceCheckUtils]: 11: Hoare triple {16787#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {17211#(or (= (div (* main_~d~0 2) 2) (mod main_~B~0 4294967296)) (<= main_~d~0 0))} is VALID [2022-04-15 09:23:16,020 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16787#true} {16787#true} #80#return; {16787#true} is VALID [2022-04-15 09:23:16,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-15 09:23:16,020 INFO L290 TraceCheckUtils]: 8: Hoare triple {16787#true} assume !(0 == ~cond); {16787#true} is VALID [2022-04-15 09:23:16,020 INFO L290 TraceCheckUtils]: 7: Hoare triple {16787#true} ~cond := #in~cond; {16787#true} is VALID [2022-04-15 09:23:16,020 INFO L272 TraceCheckUtils]: 6: Hoare triple {16787#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {16787#true} is VALID [2022-04-15 09:23:16,020 INFO L290 TraceCheckUtils]: 5: Hoare triple {16787#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {16787#true} is VALID [2022-04-15 09:23:16,020 INFO L272 TraceCheckUtils]: 4: Hoare triple {16787#true} call #t~ret8 := main(); {16787#true} is VALID [2022-04-15 09:23:16,020 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16787#true} {16787#true} #96#return; {16787#true} is VALID [2022-04-15 09:23:16,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {16787#true} assume true; {16787#true} is VALID [2022-04-15 09:23:16,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {16787#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {16787#true} is VALID [2022-04-15 09:23:16,021 INFO L272 TraceCheckUtils]: 0: Hoare triple {16787#true} call ULTIMATE.init(); {16787#true} is VALID [2022-04-15 09:23:16,021 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 22 proven. 11 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-15 09:23:16,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:23:16,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623084635] [2022-04-15 09:23:16,021 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:23:16,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829071248] [2022-04-15 09:23:16,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829071248] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:23:16,022 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:23:16,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-04-15 09:23:16,022 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:23:16,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1869444077] [2022-04-15 09:23:16,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1869444077] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:23:16,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:23:16,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 09:23:16,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726627909] [2022-04-15 09:23:16,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:23:16,023 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 84 [2022-04-15 09:23:16,023 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:23:16,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-15 09:23:16,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:23:16,079 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 09:23:16,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:23:16,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 09:23:16,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-04-15 09:23:16,079 INFO L87 Difference]: Start difference. First operand 193 states and 219 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-15 09:23:16,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:23:16,820 INFO L93 Difference]: Finished difference Result 198 states and 223 transitions. [2022-04-15 09:23:16,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 09:23:16,820 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 84 [2022-04-15 09:23:16,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:23:16,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-15 09:23:16,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2022-04-15 09:23:16,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-15 09:23:16,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 82 transitions. [2022-04-15 09:23:16,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 82 transitions. [2022-04-15 09:23:16,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:23:16,900 INFO L225 Difference]: With dead ends: 198 [2022-04-15 09:23:16,901 INFO L226 Difference]: Without dead ends: 161 [2022-04-15 09:23:16,901 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 157 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-04-15 09:23:16,901 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 8 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 09:23:16,901 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 242 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 09:23:16,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-04-15 09:23:17,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2022-04-15 09:23:17,049 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:23:17,049 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand has 161 states, 105 states have (on average 1.1523809523809523) internal successors, (121), 109 states have internal predecessors, (121), 34 states have call successors, (34), 23 states have call predecessors, (34), 21 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-15 09:23:17,049 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand has 161 states, 105 states have (on average 1.1523809523809523) internal successors, (121), 109 states have internal predecessors, (121), 34 states have call successors, (34), 23 states have call predecessors, (34), 21 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-15 09:23:17,050 INFO L87 Difference]: Start difference. First operand 161 states. Second operand has 161 states, 105 states have (on average 1.1523809523809523) internal successors, (121), 109 states have internal predecessors, (121), 34 states have call successors, (34), 23 states have call predecessors, (34), 21 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-15 09:23:17,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:23:17,052 INFO L93 Difference]: Finished difference Result 161 states and 186 transitions. [2022-04-15 09:23:17,052 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 186 transitions. [2022-04-15 09:23:17,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:23:17,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:23:17,053 INFO L74 IsIncluded]: Start isIncluded. First operand has 161 states, 105 states have (on average 1.1523809523809523) internal successors, (121), 109 states have internal predecessors, (121), 34 states have call successors, (34), 23 states have call predecessors, (34), 21 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) Second operand 161 states. [2022-04-15 09:23:17,053 INFO L87 Difference]: Start difference. First operand has 161 states, 105 states have (on average 1.1523809523809523) internal successors, (121), 109 states have internal predecessors, (121), 34 states have call successors, (34), 23 states have call predecessors, (34), 21 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) Second operand 161 states. [2022-04-15 09:23:17,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:23:17,055 INFO L93 Difference]: Finished difference Result 161 states and 186 transitions. [2022-04-15 09:23:17,055 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 186 transitions. [2022-04-15 09:23:17,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:23:17,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:23:17,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:23:17,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:23:17,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 105 states have (on average 1.1523809523809523) internal successors, (121), 109 states have internal predecessors, (121), 34 states have call successors, (34), 23 states have call predecessors, (34), 21 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-15 09:23:17,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 186 transitions. [2022-04-15 09:23:17,058 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 186 transitions. Word has length 84 [2022-04-15 09:23:17,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:23:17,058 INFO L478 AbstractCegarLoop]: Abstraction has 161 states and 186 transitions. [2022-04-15 09:23:17,058 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 5 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-15 09:23:17,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 161 states and 186 transitions. [2022-04-15 09:23:19,286 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 185 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 09:23:19,286 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 186 transitions. [2022-04-15 09:23:19,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-15 09:23:19,287 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:23:19,287 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:23:19,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-15 09:23:19,487 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:23:19,488 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:23:19,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:23:19,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1068167297, now seen corresponding path program 7 times [2022-04-15 09:23:19,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:23:19,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1385233261] [2022-04-15 09:23:26,228 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:23:26,229 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:23:26,229 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:23:26,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1068167297, now seen corresponding path program 8 times [2022-04-15 09:23:26,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:23:26,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727687814] [2022-04-15 09:23:26,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:23:26,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:23:26,237 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:23:26,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1147929154] [2022-04-15 09:23:26,238 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:23:26,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:23:26,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:23:26,239 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:23:26,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-15 09:23:26,328 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:23:26,329 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:23:26,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 09:23:26,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:23:26,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:23:30,130 INFO L272 TraceCheckUtils]: 0: Hoare triple {18345#true} call ULTIMATE.init(); {18345#true} is VALID [2022-04-15 09:23:30,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {18345#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {18345#true} is VALID [2022-04-15 09:23:30,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 09:23:30,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18345#true} {18345#true} #96#return; {18345#true} is VALID [2022-04-15 09:23:30,130 INFO L272 TraceCheckUtils]: 4: Hoare triple {18345#true} call #t~ret8 := main(); {18345#true} is VALID [2022-04-15 09:23:30,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {18345#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {18345#true} is VALID [2022-04-15 09:23:30,131 INFO L272 TraceCheckUtils]: 6: Hoare triple {18345#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {18345#true} is VALID [2022-04-15 09:23:30,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-15 09:23:30,131 INFO L290 TraceCheckUtils]: 8: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-15 09:23:30,131 INFO L290 TraceCheckUtils]: 9: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 09:23:30,131 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18345#true} {18345#true} #80#return; {18345#true} is VALID [2022-04-15 09:23:30,131 INFO L290 TraceCheckUtils]: 11: Hoare triple {18345#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {18383#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 09:23:30,132 INFO L290 TraceCheckUtils]: 12: Hoare triple {18383#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18383#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 09:23:30,132 INFO L290 TraceCheckUtils]: 13: Hoare triple {18383#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {18383#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 09:23:30,132 INFO L272 TraceCheckUtils]: 14: Hoare triple {18383#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {18345#true} is VALID [2022-04-15 09:23:30,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-15 09:23:30,132 INFO L290 TraceCheckUtils]: 16: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-15 09:23:30,133 INFO L290 TraceCheckUtils]: 17: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 09:23:30,133 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {18345#true} {18383#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} #82#return; {18383#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 09:23:30,133 INFO L272 TraceCheckUtils]: 19: Hoare triple {18383#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {18345#true} is VALID [2022-04-15 09:23:30,133 INFO L290 TraceCheckUtils]: 20: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-15 09:23:30,133 INFO L290 TraceCheckUtils]: 21: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-15 09:23:30,133 INFO L290 TraceCheckUtils]: 22: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 09:23:30,134 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18345#true} {18383#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} #84#return; {18383#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 09:23:30,134 INFO L272 TraceCheckUtils]: 24: Hoare triple {18383#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {18345#true} is VALID [2022-04-15 09:23:30,134 INFO L290 TraceCheckUtils]: 25: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-15 09:23:30,134 INFO L290 TraceCheckUtils]: 26: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-15 09:23:30,134 INFO L290 TraceCheckUtils]: 27: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 09:23:30,135 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {18345#true} {18383#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} #86#return; {18383#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 09:23:30,136 INFO L290 TraceCheckUtils]: 29: Hoare triple {18383#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {18438#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0))} is VALID [2022-04-15 09:23:30,136 INFO L290 TraceCheckUtils]: 30: Hoare triple {18438#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18438#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0))} is VALID [2022-04-15 09:23:30,136 INFO L290 TraceCheckUtils]: 31: Hoare triple {18438#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0))} assume !!(#t~post6 < 20);havoc #t~post6; {18438#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0))} is VALID [2022-04-15 09:23:30,137 INFO L272 TraceCheckUtils]: 32: Hoare triple {18438#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {18345#true} is VALID [2022-04-15 09:23:30,137 INFO L290 TraceCheckUtils]: 33: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-15 09:23:30,137 INFO L290 TraceCheckUtils]: 34: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-15 09:23:30,137 INFO L290 TraceCheckUtils]: 35: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 09:23:30,137 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {18345#true} {18438#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0))} #82#return; {18438#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0))} is VALID [2022-04-15 09:23:30,137 INFO L272 TraceCheckUtils]: 37: Hoare triple {18438#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {18345#true} is VALID [2022-04-15 09:23:30,138 INFO L290 TraceCheckUtils]: 38: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-15 09:23:30,138 INFO L290 TraceCheckUtils]: 39: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-15 09:23:30,138 INFO L290 TraceCheckUtils]: 40: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 09:23:30,138 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {18345#true} {18438#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0))} #84#return; {18438#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0))} is VALID [2022-04-15 09:23:30,138 INFO L272 TraceCheckUtils]: 42: Hoare triple {18438#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {18345#true} is VALID [2022-04-15 09:23:30,138 INFO L290 TraceCheckUtils]: 43: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-15 09:23:30,138 INFO L290 TraceCheckUtils]: 44: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-15 09:23:30,139 INFO L290 TraceCheckUtils]: 45: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 09:23:30,139 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {18345#true} {18438#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0))} #86#return; {18438#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0))} is VALID [2022-04-15 09:23:30,140 INFO L290 TraceCheckUtils]: 47: Hoare triple {18438#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= main_~q~0 0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {18493#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-15 09:23:30,140 INFO L290 TraceCheckUtils]: 48: Hoare triple {18493#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~q~0 0) (= main_~p~0 4))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18493#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-15 09:23:30,141 INFO L290 TraceCheckUtils]: 49: Hoare triple {18493#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~q~0 0) (= main_~p~0 4))} assume !!(#t~post6 < 20);havoc #t~post6; {18493#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-15 09:23:30,141 INFO L272 TraceCheckUtils]: 50: Hoare triple {18493#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~q~0 0) (= main_~p~0 4))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {18345#true} is VALID [2022-04-15 09:23:30,141 INFO L290 TraceCheckUtils]: 51: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-15 09:23:30,141 INFO L290 TraceCheckUtils]: 52: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-15 09:23:30,141 INFO L290 TraceCheckUtils]: 53: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 09:23:30,141 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {18345#true} {18493#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~q~0 0) (= main_~p~0 4))} #82#return; {18493#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-15 09:23:30,141 INFO L272 TraceCheckUtils]: 55: Hoare triple {18493#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~q~0 0) (= main_~p~0 4))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {18345#true} is VALID [2022-04-15 09:23:30,142 INFO L290 TraceCheckUtils]: 56: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-15 09:23:30,142 INFO L290 TraceCheckUtils]: 57: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-15 09:23:30,142 INFO L290 TraceCheckUtils]: 58: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 09:23:30,142 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {18345#true} {18493#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~q~0 0) (= main_~p~0 4))} #84#return; {18493#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-15 09:23:30,142 INFO L272 TraceCheckUtils]: 60: Hoare triple {18493#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~q~0 0) (= main_~p~0 4))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {18345#true} is VALID [2022-04-15 09:23:30,142 INFO L290 TraceCheckUtils]: 61: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-15 09:23:30,142 INFO L290 TraceCheckUtils]: 62: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-15 09:23:30,143 INFO L290 TraceCheckUtils]: 63: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 09:23:30,143 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {18345#true} {18493#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~q~0 0) (= main_~p~0 4))} #86#return; {18493#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-15 09:23:30,143 INFO L290 TraceCheckUtils]: 65: Hoare triple {18493#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~q~0 0) (= main_~p~0 4))} assume !(~r~0 >= ~d~0); {18548#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-15 09:23:30,144 INFO L290 TraceCheckUtils]: 66: Hoare triple {18548#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (= main_~p~0 4))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18548#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-15 09:23:30,144 INFO L290 TraceCheckUtils]: 67: Hoare triple {18548#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (= main_~p~0 4))} assume !!(#t~post7 < 20);havoc #t~post7; {18548#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-15 09:23:30,144 INFO L272 TraceCheckUtils]: 68: Hoare triple {18548#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (= main_~p~0 4))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {18345#true} is VALID [2022-04-15 09:23:30,144 INFO L290 TraceCheckUtils]: 69: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-15 09:23:30,144 INFO L290 TraceCheckUtils]: 70: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-15 09:23:30,145 INFO L290 TraceCheckUtils]: 71: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 09:23:30,145 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {18345#true} {18548#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (= main_~p~0 4))} #88#return; {18548#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-15 09:23:30,145 INFO L272 TraceCheckUtils]: 73: Hoare triple {18548#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (= main_~p~0 4))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {18345#true} is VALID [2022-04-15 09:23:30,145 INFO L290 TraceCheckUtils]: 74: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-15 09:23:30,145 INFO L290 TraceCheckUtils]: 75: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-15 09:23:30,145 INFO L290 TraceCheckUtils]: 76: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 09:23:30,146 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {18345#true} {18548#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (= main_~p~0 4))} #90#return; {18548#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-15 09:23:30,147 INFO L290 TraceCheckUtils]: 78: Hoare triple {18548#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (not (<= main_~d~0 main_~r~0)) (= main_~q~0 0) (= main_~p~0 4))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {18588#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (div (* (mod main_~B~0 4294967296) 4) 2)) (= main_~p~0 2) (not (<= (* (mod main_~B~0 4294967296) 4) main_~r~0)) (= main_~q~0 0))} is VALID [2022-04-15 09:23:30,148 INFO L290 TraceCheckUtils]: 79: Hoare triple {18588#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (div (* (mod main_~B~0 4294967296) 4) 2)) (= main_~p~0 2) (not (<= (* (mod main_~B~0 4294967296) 4) main_~r~0)) (= main_~q~0 0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {18592#(and (= main_~q~0 2) (not (<= (* (mod main_~B~0 4294967296) 4) (mod main_~A~0 4294967296))) (= (+ (mod main_~A~0 4294967296) (* (- 1) (div (* (mod main_~B~0 4294967296) 4) 2))) main_~r~0) (<= (* 2 (mod main_~B~0 4294967296)) (mod main_~A~0 4294967296)))} is VALID [2022-04-15 09:23:30,148 INFO L290 TraceCheckUtils]: 80: Hoare triple {18592#(and (= main_~q~0 2) (not (<= (* (mod main_~B~0 4294967296) 4) (mod main_~A~0 4294967296))) (= (+ (mod main_~A~0 4294967296) (* (- 1) (div (* (mod main_~B~0 4294967296) 4) 2))) main_~r~0) (<= (* 2 (mod main_~B~0 4294967296)) (mod main_~A~0 4294967296)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18592#(and (= main_~q~0 2) (not (<= (* (mod main_~B~0 4294967296) 4) (mod main_~A~0 4294967296))) (= (+ (mod main_~A~0 4294967296) (* (- 1) (div (* (mod main_~B~0 4294967296) 4) 2))) main_~r~0) (<= (* 2 (mod main_~B~0 4294967296)) (mod main_~A~0 4294967296)))} is VALID [2022-04-15 09:23:30,149 INFO L290 TraceCheckUtils]: 81: Hoare triple {18592#(and (= main_~q~0 2) (not (<= (* (mod main_~B~0 4294967296) 4) (mod main_~A~0 4294967296))) (= (+ (mod main_~A~0 4294967296) (* (- 1) (div (* (mod main_~B~0 4294967296) 4) 2))) main_~r~0) (<= (* 2 (mod main_~B~0 4294967296)) (mod main_~A~0 4294967296)))} assume !!(#t~post7 < 20);havoc #t~post7; {18592#(and (= main_~q~0 2) (not (<= (* (mod main_~B~0 4294967296) 4) (mod main_~A~0 4294967296))) (= (+ (mod main_~A~0 4294967296) (* (- 1) (div (* (mod main_~B~0 4294967296) 4) 2))) main_~r~0) (<= (* 2 (mod main_~B~0 4294967296)) (mod main_~A~0 4294967296)))} is VALID [2022-04-15 09:23:30,149 INFO L272 TraceCheckUtils]: 82: Hoare triple {18592#(and (= main_~q~0 2) (not (<= (* (mod main_~B~0 4294967296) 4) (mod main_~A~0 4294967296))) (= (+ (mod main_~A~0 4294967296) (* (- 1) (div (* (mod main_~B~0 4294967296) 4) 2))) main_~r~0) (<= (* 2 (mod main_~B~0 4294967296)) (mod main_~A~0 4294967296)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {18602#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 09:23:30,150 INFO L290 TraceCheckUtils]: 83: Hoare triple {18602#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18606#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:23:30,150 INFO L290 TraceCheckUtils]: 84: Hoare triple {18606#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18346#false} is VALID [2022-04-15 09:23:30,150 INFO L290 TraceCheckUtils]: 85: Hoare triple {18346#false} assume !false; {18346#false} is VALID [2022-04-15 09:23:30,150 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 22 proven. 21 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-15 09:23:30,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:23:39,160 INFO L290 TraceCheckUtils]: 85: Hoare triple {18346#false} assume !false; {18346#false} is VALID [2022-04-15 09:23:39,160 INFO L290 TraceCheckUtils]: 84: Hoare triple {18606#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {18346#false} is VALID [2022-04-15 09:23:39,161 INFO L290 TraceCheckUtils]: 83: Hoare triple {18602#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {18606#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:23:39,162 INFO L272 TraceCheckUtils]: 82: Hoare triple {18622#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {18602#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 09:23:39,162 INFO L290 TraceCheckUtils]: 81: Hoare triple {18622#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} assume !!(#t~post7 < 20);havoc #t~post7; {18622#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-15 09:23:39,162 INFO L290 TraceCheckUtils]: 80: Hoare triple {18622#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18622#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-15 09:23:39,166 INFO L290 TraceCheckUtils]: 79: Hoare triple {18632#(= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) (* (+ main_~q~0 main_~p~0) (mod main_~B~0 4294967296)) main_~r~0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {18622#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-15 09:23:39,185 INFO L290 TraceCheckUtils]: 78: Hoare triple {18636#(and (or (and (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {18632#(= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) (* (+ main_~q~0 main_~p~0) (mod main_~B~0 4294967296)) main_~r~0))} is VALID [2022-04-15 09:23:39,186 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {18345#true} {18636#(and (or (and (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))))} #90#return; {18636#(and (or (and (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))))} is VALID [2022-04-15 09:23:39,186 INFO L290 TraceCheckUtils]: 76: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 09:23:39,186 INFO L290 TraceCheckUtils]: 75: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-15 09:23:39,186 INFO L290 TraceCheckUtils]: 74: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-15 09:23:39,186 INFO L272 TraceCheckUtils]: 73: Hoare triple {18636#(and (or (and (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {18345#true} is VALID [2022-04-15 09:23:39,187 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {18345#true} {18636#(and (or (and (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))))} #88#return; {18636#(and (or (and (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))))} is VALID [2022-04-15 09:23:39,187 INFO L290 TraceCheckUtils]: 71: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 09:23:39,187 INFO L290 TraceCheckUtils]: 70: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-15 09:23:39,188 INFO L290 TraceCheckUtils]: 69: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-15 09:23:39,188 INFO L272 TraceCheckUtils]: 68: Hoare triple {18636#(and (or (and (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {18345#true} is VALID [2022-04-15 09:23:39,189 INFO L290 TraceCheckUtils]: 67: Hoare triple {18636#(and (or (and (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))))} assume !!(#t~post7 < 20);havoc #t~post7; {18636#(and (or (and (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))))} is VALID [2022-04-15 09:23:39,191 INFO L290 TraceCheckUtils]: 66: Hoare triple {18636#(and (or (and (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18636#(and (or (and (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))))} is VALID [2022-04-15 09:23:39,193 INFO L290 TraceCheckUtils]: 65: Hoare triple {18676#(or (and (or (and (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))))) (<= main_~d~0 main_~r~0))} assume !(~r~0 >= ~d~0); {18636#(and (or (and (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))))} is VALID [2022-04-15 09:23:39,193 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {18345#true} {18676#(or (and (or (and (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))))) (<= main_~d~0 main_~r~0))} #86#return; {18676#(or (and (or (and (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 09:23:39,194 INFO L290 TraceCheckUtils]: 63: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 09:23:39,194 INFO L290 TraceCheckUtils]: 62: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-15 09:23:39,194 INFO L290 TraceCheckUtils]: 61: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-15 09:23:39,194 INFO L272 TraceCheckUtils]: 60: Hoare triple {18676#(or (and (or (and (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))))) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {18345#true} is VALID [2022-04-15 09:23:39,195 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {18345#true} {18676#(or (and (or (and (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))))) (<= main_~d~0 main_~r~0))} #84#return; {18676#(or (and (or (and (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 09:23:39,195 INFO L290 TraceCheckUtils]: 58: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 09:23:39,195 INFO L290 TraceCheckUtils]: 57: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-15 09:23:39,195 INFO L290 TraceCheckUtils]: 56: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-15 09:23:39,195 INFO L272 TraceCheckUtils]: 55: Hoare triple {18676#(or (and (or (and (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))))) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {18345#true} is VALID [2022-04-15 09:23:39,196 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {18345#true} {18676#(or (and (or (and (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))))) (<= main_~d~0 main_~r~0))} #82#return; {18676#(or (and (or (and (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 09:23:39,196 INFO L290 TraceCheckUtils]: 53: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 09:23:39,196 INFO L290 TraceCheckUtils]: 52: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-15 09:23:39,196 INFO L290 TraceCheckUtils]: 51: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-15 09:23:39,196 INFO L272 TraceCheckUtils]: 50: Hoare triple {18676#(or (and (or (and (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))))) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {18345#true} is VALID [2022-04-15 09:23:39,198 INFO L290 TraceCheckUtils]: 49: Hoare triple {18676#(or (and (or (and (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))))) (<= main_~d~0 main_~r~0))} assume !!(#t~post6 < 20);havoc #t~post6; {18676#(or (and (or (and (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 09:23:39,200 INFO L290 TraceCheckUtils]: 48: Hoare triple {18676#(or (and (or (and (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))))) (<= main_~d~0 main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18676#(or (and (or (and (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 09:23:39,205 INFO L290 TraceCheckUtils]: 47: Hoare triple {18731#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {18676#(or (and (or (and (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 09:23:39,206 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {18345#true} {18731#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} #86#return; {18731#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} is VALID [2022-04-15 09:23:39,206 INFO L290 TraceCheckUtils]: 45: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 09:23:39,207 INFO L290 TraceCheckUtils]: 44: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-15 09:23:39,207 INFO L290 TraceCheckUtils]: 43: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-15 09:23:39,207 INFO L272 TraceCheckUtils]: 42: Hoare triple {18731#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {18345#true} is VALID [2022-04-15 09:23:39,208 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {18345#true} {18731#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} #84#return; {18731#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} is VALID [2022-04-15 09:23:39,208 INFO L290 TraceCheckUtils]: 40: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 09:23:39,208 INFO L290 TraceCheckUtils]: 39: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-15 09:23:39,208 INFO L290 TraceCheckUtils]: 38: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-15 09:23:39,208 INFO L272 TraceCheckUtils]: 37: Hoare triple {18731#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {18345#true} is VALID [2022-04-15 09:23:39,209 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {18345#true} {18731#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} #82#return; {18731#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} is VALID [2022-04-15 09:23:39,209 INFO L290 TraceCheckUtils]: 35: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 09:23:39,209 INFO L290 TraceCheckUtils]: 34: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-15 09:23:39,209 INFO L290 TraceCheckUtils]: 33: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-15 09:23:39,209 INFO L272 TraceCheckUtils]: 32: Hoare triple {18731#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {18345#true} is VALID [2022-04-15 09:23:39,210 INFO L290 TraceCheckUtils]: 31: Hoare triple {18731#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} assume !!(#t~post6 < 20);havoc #t~post6; {18731#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} is VALID [2022-04-15 09:23:39,210 INFO L290 TraceCheckUtils]: 30: Hoare triple {18731#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18731#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} is VALID [2022-04-15 09:23:39,213 INFO L290 TraceCheckUtils]: 29: Hoare triple {18786#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 4) 2)) main_~r~0 (* (+ (div (* main_~p~0 4) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 4) main_~r~0) (not (<= (* main_~d~0 2) main_~r~0)))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {18731#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} is VALID [2022-04-15 09:23:39,214 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {18345#true} {18786#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 4) 2)) main_~r~0 (* (+ (div (* main_~p~0 4) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 4) main_~r~0) (not (<= (* main_~d~0 2) main_~r~0)))} #86#return; {18786#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 4) 2)) main_~r~0 (* (+ (div (* main_~p~0 4) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 4) main_~r~0) (not (<= (* main_~d~0 2) main_~r~0)))} is VALID [2022-04-15 09:23:39,214 INFO L290 TraceCheckUtils]: 27: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 09:23:39,214 INFO L290 TraceCheckUtils]: 26: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-15 09:23:39,214 INFO L290 TraceCheckUtils]: 25: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-15 09:23:39,214 INFO L272 TraceCheckUtils]: 24: Hoare triple {18786#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 4) 2)) main_~r~0 (* (+ (div (* main_~p~0 4) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 4) main_~r~0) (not (<= (* main_~d~0 2) main_~r~0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {18345#true} is VALID [2022-04-15 09:23:39,215 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {18345#true} {18786#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 4) 2)) main_~r~0 (* (+ (div (* main_~p~0 4) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 4) main_~r~0) (not (<= (* main_~d~0 2) main_~r~0)))} #84#return; {18786#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 4) 2)) main_~r~0 (* (+ (div (* main_~p~0 4) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 4) main_~r~0) (not (<= (* main_~d~0 2) main_~r~0)))} is VALID [2022-04-15 09:23:39,215 INFO L290 TraceCheckUtils]: 22: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 09:23:39,215 INFO L290 TraceCheckUtils]: 21: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-15 09:23:39,215 INFO L290 TraceCheckUtils]: 20: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-15 09:23:39,216 INFO L272 TraceCheckUtils]: 19: Hoare triple {18786#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 4) 2)) main_~r~0 (* (+ (div (* main_~p~0 4) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 4) main_~r~0) (not (<= (* main_~d~0 2) main_~r~0)))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {18345#true} is VALID [2022-04-15 09:23:39,216 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {18345#true} {18786#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 4) 2)) main_~r~0 (* (+ (div (* main_~p~0 4) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 4) main_~r~0) (not (<= (* main_~d~0 2) main_~r~0)))} #82#return; {18786#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 4) 2)) main_~r~0 (* (+ (div (* main_~p~0 4) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 4) main_~r~0) (not (<= (* main_~d~0 2) main_~r~0)))} is VALID [2022-04-15 09:23:39,216 INFO L290 TraceCheckUtils]: 17: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 09:23:39,217 INFO L290 TraceCheckUtils]: 16: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-15 09:23:39,217 INFO L290 TraceCheckUtils]: 15: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-15 09:23:39,217 INFO L272 TraceCheckUtils]: 14: Hoare triple {18786#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 4) 2)) main_~r~0 (* (+ (div (* main_~p~0 4) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 4) main_~r~0) (not (<= (* main_~d~0 2) main_~r~0)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {18345#true} is VALID [2022-04-15 09:23:39,217 INFO L290 TraceCheckUtils]: 13: Hoare triple {18786#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 4) 2)) main_~r~0 (* (+ (div (* main_~p~0 4) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 4) main_~r~0) (not (<= (* main_~d~0 2) main_~r~0)))} assume !!(#t~post6 < 20);havoc #t~post6; {18786#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 4) 2)) main_~r~0 (* (+ (div (* main_~p~0 4) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 4) main_~r~0) (not (<= (* main_~d~0 2) main_~r~0)))} is VALID [2022-04-15 09:23:39,218 INFO L290 TraceCheckUtils]: 12: Hoare triple {18786#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 4) 2)) main_~r~0 (* (+ (div (* main_~p~0 4) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 4) main_~r~0) (not (<= (* main_~d~0 2) main_~r~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18786#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 4) 2)) main_~r~0 (* (+ (div (* main_~p~0 4) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 4) main_~r~0) (not (<= (* main_~d~0 2) main_~r~0)))} is VALID [2022-04-15 09:23:39,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {18345#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {18786#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 4) 2)) main_~r~0 (* (+ (div (* main_~p~0 4) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 4) main_~r~0) (not (<= (* main_~d~0 2) main_~r~0)))} is VALID [2022-04-15 09:23:39,221 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {18345#true} {18345#true} #80#return; {18345#true} is VALID [2022-04-15 09:23:39,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 09:23:39,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {18345#true} assume !(0 == ~cond); {18345#true} is VALID [2022-04-15 09:23:39,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {18345#true} ~cond := #in~cond; {18345#true} is VALID [2022-04-15 09:23:39,222 INFO L272 TraceCheckUtils]: 6: Hoare triple {18345#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {18345#true} is VALID [2022-04-15 09:23:39,222 INFO L290 TraceCheckUtils]: 5: Hoare triple {18345#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {18345#true} is VALID [2022-04-15 09:23:39,222 INFO L272 TraceCheckUtils]: 4: Hoare triple {18345#true} call #t~ret8 := main(); {18345#true} is VALID [2022-04-15 09:23:39,222 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18345#true} {18345#true} #96#return; {18345#true} is VALID [2022-04-15 09:23:39,222 INFO L290 TraceCheckUtils]: 2: Hoare triple {18345#true} assume true; {18345#true} is VALID [2022-04-15 09:23:39,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {18345#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {18345#true} is VALID [2022-04-15 09:23:39,222 INFO L272 TraceCheckUtils]: 0: Hoare triple {18345#true} call ULTIMATE.init(); {18345#true} is VALID [2022-04-15 09:23:39,223 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 22 proven. 21 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-15 09:23:39,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:23:39,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727687814] [2022-04-15 09:23:39,223 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:23:39,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147929154] [2022-04-15 09:23:39,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147929154] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:23:39,224 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:23:39,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-04-15 09:23:39,224 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:23:39,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1385233261] [2022-04-15 09:23:39,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1385233261] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:23:39,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:23:39,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 09:23:39,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832901391] [2022-04-15 09:23:39,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:23:39,225 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 86 [2022-04-15 09:23:39,225 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:23:39,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-15 09:23:39,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:23:39,323 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 09:23:39,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:23:39,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 09:23:39,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-04-15 09:23:39,324 INFO L87 Difference]: Start difference. First operand 161 states and 186 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-15 09:23:41,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:23:41,714 INFO L93 Difference]: Finished difference Result 220 states and 267 transitions. [2022-04-15 09:23:41,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 09:23:41,714 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 86 [2022-04-15 09:23:41,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:23:41,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-15 09:23:41,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-15 09:23:41,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-15 09:23:41,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-15 09:23:41,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 117 transitions. [2022-04-15 09:23:41,887 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:23:41,889 INFO L225 Difference]: With dead ends: 220 [2022-04-15 09:23:41,889 INFO L226 Difference]: Without dead ends: 175 [2022-04-15 09:23:41,890 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2022-04-15 09:23:41,890 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 12 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-15 09:23:41,890 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 276 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-15 09:23:41,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-04-15 09:23:42,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2022-04-15 09:23:42,071 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:23:42,072 INFO L82 GeneralOperation]: Start isEquivalent. First operand 175 states. Second operand has 172 states, 112 states have (on average 1.1607142857142858) internal successors, (130), 116 states have internal predecessors, (130), 36 states have call successors, (36), 24 states have call predecessors, (36), 23 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-15 09:23:42,073 INFO L74 IsIncluded]: Start isIncluded. First operand 175 states. Second operand has 172 states, 112 states have (on average 1.1607142857142858) internal successors, (130), 116 states have internal predecessors, (130), 36 states have call successors, (36), 24 states have call predecessors, (36), 23 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-15 09:23:42,073 INFO L87 Difference]: Start difference. First operand 175 states. Second operand has 172 states, 112 states have (on average 1.1607142857142858) internal successors, (130), 116 states have internal predecessors, (130), 36 states have call successors, (36), 24 states have call predecessors, (36), 23 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-15 09:23:42,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:23:42,075 INFO L93 Difference]: Finished difference Result 175 states and 205 transitions. [2022-04-15 09:23:42,076 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 205 transitions. [2022-04-15 09:23:42,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:23:42,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:23:42,076 INFO L74 IsIncluded]: Start isIncluded. First operand has 172 states, 112 states have (on average 1.1607142857142858) internal successors, (130), 116 states have internal predecessors, (130), 36 states have call successors, (36), 24 states have call predecessors, (36), 23 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) Second operand 175 states. [2022-04-15 09:23:42,076 INFO L87 Difference]: Start difference. First operand has 172 states, 112 states have (on average 1.1607142857142858) internal successors, (130), 116 states have internal predecessors, (130), 36 states have call successors, (36), 24 states have call predecessors, (36), 23 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) Second operand 175 states. [2022-04-15 09:23:42,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:23:42,079 INFO L93 Difference]: Finished difference Result 175 states and 205 transitions. [2022-04-15 09:23:42,079 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 205 transitions. [2022-04-15 09:23:42,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:23:42,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:23:42,079 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:23:42,079 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:23:42,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 112 states have (on average 1.1607142857142858) internal successors, (130), 116 states have internal predecessors, (130), 36 states have call successors, (36), 24 states have call predecessors, (36), 23 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-15 09:23:42,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 200 transitions. [2022-04-15 09:23:42,082 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 200 transitions. Word has length 86 [2022-04-15 09:23:42,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:23:42,082 INFO L478 AbstractCegarLoop]: Abstraction has 172 states and 200 transitions. [2022-04-15 09:23:42,083 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-15 09:23:42,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 172 states and 200 transitions. [2022-04-15 09:23:44,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 200 edges. 199 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 09:23:44,456 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 200 transitions. [2022-04-15 09:23:44,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-15 09:23:44,456 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:23:44,456 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:23:44,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-15 09:23:44,657 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:23:44,657 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:23:44,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:23:44,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1271087930, now seen corresponding path program 9 times [2022-04-15 09:23:44,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:23:44,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [502240207] [2022-04-15 09:23:53,564 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:23:53,565 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:23:53,565 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:23:53,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1271087930, now seen corresponding path program 10 times [2022-04-15 09:23:53,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:23:53,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802347938] [2022-04-15 09:23:53,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:23:53,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:23:53,596 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:23:53,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [871104630] [2022-04-15 09:23:53,596 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 09:23:53,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:23:53,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:23:53,598 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:23:53,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-15 09:23:53,693 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 09:23:53,693 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:23:53,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-15 09:23:53,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:23:53,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:23:54,795 INFO L272 TraceCheckUtils]: 0: Hoare triple {20012#true} call ULTIMATE.init(); {20012#true} is VALID [2022-04-15 09:23:54,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {20012#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {20012#true} is VALID [2022-04-15 09:23:54,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-15 09:23:54,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20012#true} {20012#true} #96#return; {20012#true} is VALID [2022-04-15 09:23:54,796 INFO L272 TraceCheckUtils]: 4: Hoare triple {20012#true} call #t~ret8 := main(); {20012#true} is VALID [2022-04-15 09:23:54,796 INFO L290 TraceCheckUtils]: 5: Hoare triple {20012#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {20012#true} is VALID [2022-04-15 09:23:54,796 INFO L272 TraceCheckUtils]: 6: Hoare triple {20012#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {20012#true} is VALID [2022-04-15 09:23:54,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-15 09:23:54,796 INFO L290 TraceCheckUtils]: 8: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-15 09:23:54,796 INFO L290 TraceCheckUtils]: 9: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-15 09:23:54,796 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20012#true} {20012#true} #80#return; {20012#true} is VALID [2022-04-15 09:23:54,797 INFO L290 TraceCheckUtils]: 11: Hoare triple {20012#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {20050#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-15 09:23:54,797 INFO L290 TraceCheckUtils]: 12: Hoare triple {20050#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20050#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-15 09:23:54,797 INFO L290 TraceCheckUtils]: 13: Hoare triple {20050#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {20050#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-15 09:23:54,799 INFO L272 TraceCheckUtils]: 14: Hoare triple {20050#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {20012#true} is VALID [2022-04-15 09:23:54,800 INFO L290 TraceCheckUtils]: 15: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-15 09:23:54,800 INFO L290 TraceCheckUtils]: 16: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-15 09:23:54,800 INFO L290 TraceCheckUtils]: 17: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-15 09:23:54,800 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {20012#true} {20050#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #82#return; {20050#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-15 09:23:54,800 INFO L272 TraceCheckUtils]: 19: Hoare triple {20050#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {20012#true} is VALID [2022-04-15 09:23:54,800 INFO L290 TraceCheckUtils]: 20: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-15 09:23:54,801 INFO L290 TraceCheckUtils]: 21: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-15 09:23:54,801 INFO L290 TraceCheckUtils]: 22: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-15 09:23:54,801 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {20012#true} {20050#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #84#return; {20050#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-15 09:23:54,811 INFO L272 TraceCheckUtils]: 24: Hoare triple {20050#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {20012#true} is VALID [2022-04-15 09:23:54,811 INFO L290 TraceCheckUtils]: 25: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-15 09:23:54,811 INFO L290 TraceCheckUtils]: 26: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-15 09:23:54,811 INFO L290 TraceCheckUtils]: 27: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-15 09:23:54,812 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {20012#true} {20050#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #86#return; {20050#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-15 09:23:54,813 INFO L290 TraceCheckUtils]: 29: Hoare triple {20050#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {20105#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-15 09:23:54,814 INFO L290 TraceCheckUtils]: 30: Hoare triple {20105#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= (mod main_~B~0 4294967296) main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20105#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-15 09:23:54,814 INFO L290 TraceCheckUtils]: 31: Hoare triple {20105#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= (mod main_~B~0 4294967296) main_~r~0))} assume !!(#t~post6 < 20);havoc #t~post6; {20105#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-15 09:23:54,814 INFO L272 TraceCheckUtils]: 32: Hoare triple {20105#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= (mod main_~B~0 4294967296) main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {20012#true} is VALID [2022-04-15 09:23:54,814 INFO L290 TraceCheckUtils]: 33: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-15 09:23:54,814 INFO L290 TraceCheckUtils]: 34: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-15 09:23:54,815 INFO L290 TraceCheckUtils]: 35: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-15 09:23:54,815 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {20012#true} {20105#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= (mod main_~B~0 4294967296) main_~r~0))} #82#return; {20105#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-15 09:23:54,815 INFO L272 TraceCheckUtils]: 37: Hoare triple {20105#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= (mod main_~B~0 4294967296) main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {20012#true} is VALID [2022-04-15 09:23:54,815 INFO L290 TraceCheckUtils]: 38: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-15 09:23:54,815 INFO L290 TraceCheckUtils]: 39: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-15 09:23:54,815 INFO L290 TraceCheckUtils]: 40: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-15 09:23:54,816 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {20012#true} {20105#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= (mod main_~B~0 4294967296) main_~r~0))} #84#return; {20105#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-15 09:23:54,816 INFO L272 TraceCheckUtils]: 42: Hoare triple {20105#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= (mod main_~B~0 4294967296) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {20012#true} is VALID [2022-04-15 09:23:54,816 INFO L290 TraceCheckUtils]: 43: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-15 09:23:54,816 INFO L290 TraceCheckUtils]: 44: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-15 09:23:54,816 INFO L290 TraceCheckUtils]: 45: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-15 09:23:54,817 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {20012#true} {20105#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= (mod main_~B~0 4294967296) main_~r~0))} #86#return; {20105#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= (mod main_~B~0 4294967296) main_~r~0))} is VALID [2022-04-15 09:23:54,818 INFO L290 TraceCheckUtils]: 47: Hoare triple {20105#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= (mod main_~B~0 4294967296) main_~r~0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {20160#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~p~0 4))} is VALID [2022-04-15 09:23:54,819 INFO L290 TraceCheckUtils]: 48: Hoare triple {20160#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~p~0 4))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20160#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~p~0 4))} is VALID [2022-04-15 09:23:54,819 INFO L290 TraceCheckUtils]: 49: Hoare triple {20160#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~p~0 4))} assume !!(#t~post6 < 20);havoc #t~post6; {20160#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~p~0 4))} is VALID [2022-04-15 09:23:54,819 INFO L272 TraceCheckUtils]: 50: Hoare triple {20160#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~p~0 4))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {20012#true} is VALID [2022-04-15 09:23:54,819 INFO L290 TraceCheckUtils]: 51: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-15 09:23:54,819 INFO L290 TraceCheckUtils]: 52: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-15 09:23:54,819 INFO L290 TraceCheckUtils]: 53: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-15 09:23:54,820 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {20012#true} {20160#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~p~0 4))} #82#return; {20160#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~p~0 4))} is VALID [2022-04-15 09:23:54,820 INFO L272 TraceCheckUtils]: 55: Hoare triple {20160#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~p~0 4))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {20012#true} is VALID [2022-04-15 09:23:54,820 INFO L290 TraceCheckUtils]: 56: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-15 09:23:54,820 INFO L290 TraceCheckUtils]: 57: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-15 09:23:54,820 INFO L290 TraceCheckUtils]: 58: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-15 09:23:54,821 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {20012#true} {20160#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~p~0 4))} #84#return; {20160#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~p~0 4))} is VALID [2022-04-15 09:23:54,821 INFO L272 TraceCheckUtils]: 60: Hoare triple {20160#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~p~0 4))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {20012#true} is VALID [2022-04-15 09:23:54,821 INFO L290 TraceCheckUtils]: 61: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-15 09:23:54,821 INFO L290 TraceCheckUtils]: 62: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-15 09:23:54,821 INFO L290 TraceCheckUtils]: 63: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-15 09:23:54,822 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {20012#true} {20160#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~p~0 4))} #86#return; {20160#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~p~0 4))} is VALID [2022-04-15 09:23:54,823 INFO L290 TraceCheckUtils]: 65: Hoare triple {20160#(and (<= (* 2 (mod main_~B~0 4294967296)) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~p~0 4))} assume !(~r~0 >= ~d~0); {20215#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (< (* 2 (mod main_~B~0 4294967296)) main_~d~0) (= main_~p~0 4))} is VALID [2022-04-15 09:23:54,823 INFO L290 TraceCheckUtils]: 66: Hoare triple {20215#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (< (* 2 (mod main_~B~0 4294967296)) main_~d~0) (= main_~p~0 4))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20215#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (< (* 2 (mod main_~B~0 4294967296)) main_~d~0) (= main_~p~0 4))} is VALID [2022-04-15 09:23:54,823 INFO L290 TraceCheckUtils]: 67: Hoare triple {20215#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (< (* 2 (mod main_~B~0 4294967296)) main_~d~0) (= main_~p~0 4))} assume !!(#t~post7 < 20);havoc #t~post7; {20215#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (< (* 2 (mod main_~B~0 4294967296)) main_~d~0) (= main_~p~0 4))} is VALID [2022-04-15 09:23:54,824 INFO L272 TraceCheckUtils]: 68: Hoare triple {20215#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (< (* 2 (mod main_~B~0 4294967296)) main_~d~0) (= main_~p~0 4))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {20012#true} is VALID [2022-04-15 09:23:54,824 INFO L290 TraceCheckUtils]: 69: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-15 09:23:54,824 INFO L290 TraceCheckUtils]: 70: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-15 09:23:54,824 INFO L290 TraceCheckUtils]: 71: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-15 09:23:54,824 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {20012#true} {20215#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (< (* 2 (mod main_~B~0 4294967296)) main_~d~0) (= main_~p~0 4))} #88#return; {20215#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (< (* 2 (mod main_~B~0 4294967296)) main_~d~0) (= main_~p~0 4))} is VALID [2022-04-15 09:23:54,824 INFO L272 TraceCheckUtils]: 73: Hoare triple {20215#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (< (* 2 (mod main_~B~0 4294967296)) main_~d~0) (= main_~p~0 4))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {20012#true} is VALID [2022-04-15 09:23:54,825 INFO L290 TraceCheckUtils]: 74: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-15 09:23:54,825 INFO L290 TraceCheckUtils]: 75: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-15 09:23:54,825 INFO L290 TraceCheckUtils]: 76: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-15 09:23:54,825 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {20012#true} {20215#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (< (* 2 (mod main_~B~0 4294967296)) main_~d~0) (= main_~p~0 4))} #90#return; {20215#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (< (* 2 (mod main_~B~0 4294967296)) main_~d~0) (= main_~p~0 4))} is VALID [2022-04-15 09:23:54,826 INFO L290 TraceCheckUtils]: 78: Hoare triple {20215#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (< (* 2 (mod main_~B~0 4294967296)) main_~d~0) (= main_~p~0 4))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {20255#(and (= main_~d~0 (div (* (mod main_~B~0 4294967296) 4) 2)) (= main_~p~0 2) (< 0 (* 2 (mod main_~B~0 4294967296))))} is VALID [2022-04-15 09:23:54,827 INFO L290 TraceCheckUtils]: 79: Hoare triple {20255#(and (= main_~d~0 (div (* (mod main_~B~0 4294967296) 4) 2)) (= main_~p~0 2) (< 0 (* 2 (mod main_~B~0 4294967296))))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {20255#(and (= main_~d~0 (div (* (mod main_~B~0 4294967296) 4) 2)) (= main_~p~0 2) (< 0 (* 2 (mod main_~B~0 4294967296))))} is VALID [2022-04-15 09:23:54,827 INFO L290 TraceCheckUtils]: 80: Hoare triple {20255#(and (= main_~d~0 (div (* (mod main_~B~0 4294967296) 4) 2)) (= main_~p~0 2) (< 0 (* 2 (mod main_~B~0 4294967296))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20255#(and (= main_~d~0 (div (* (mod main_~B~0 4294967296) 4) 2)) (= main_~p~0 2) (< 0 (* 2 (mod main_~B~0 4294967296))))} is VALID [2022-04-15 09:23:54,827 INFO L290 TraceCheckUtils]: 81: Hoare triple {20255#(and (= main_~d~0 (div (* (mod main_~B~0 4294967296) 4) 2)) (= main_~p~0 2) (< 0 (* 2 (mod main_~B~0 4294967296))))} assume !!(#t~post7 < 20);havoc #t~post7; {20255#(and (= main_~d~0 (div (* (mod main_~B~0 4294967296) 4) 2)) (= main_~p~0 2) (< 0 (* 2 (mod main_~B~0 4294967296))))} is VALID [2022-04-15 09:23:54,828 INFO L272 TraceCheckUtils]: 82: Hoare triple {20255#(and (= main_~d~0 (div (* (mod main_~B~0 4294967296) 4) 2)) (= main_~p~0 2) (< 0 (* 2 (mod main_~B~0 4294967296))))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {20012#true} is VALID [2022-04-15 09:23:54,828 INFO L290 TraceCheckUtils]: 83: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-15 09:23:54,828 INFO L290 TraceCheckUtils]: 84: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-15 09:23:54,828 INFO L290 TraceCheckUtils]: 85: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-15 09:23:54,828 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {20012#true} {20255#(and (= main_~d~0 (div (* (mod main_~B~0 4294967296) 4) 2)) (= main_~p~0 2) (< 0 (* 2 (mod main_~B~0 4294967296))))} #88#return; {20255#(and (= main_~d~0 (div (* (mod main_~B~0 4294967296) 4) 2)) (= main_~p~0 2) (< 0 (* 2 (mod main_~B~0 4294967296))))} is VALID [2022-04-15 09:23:54,829 INFO L272 TraceCheckUtils]: 87: Hoare triple {20255#(and (= main_~d~0 (div (* (mod main_~B~0 4294967296) 4) 2)) (= main_~p~0 2) (< 0 (* 2 (mod main_~B~0 4294967296))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {20283#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 09:23:54,829 INFO L290 TraceCheckUtils]: 88: Hoare triple {20283#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20287#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:23:54,829 INFO L290 TraceCheckUtils]: 89: Hoare triple {20287#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20013#false} is VALID [2022-04-15 09:23:54,830 INFO L290 TraceCheckUtils]: 90: Hoare triple {20013#false} assume !false; {20013#false} is VALID [2022-04-15 09:23:54,830 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 24 proven. 22 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-15 09:23:54,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:24:02,100 INFO L290 TraceCheckUtils]: 90: Hoare triple {20013#false} assume !false; {20013#false} is VALID [2022-04-15 09:24:02,101 INFO L290 TraceCheckUtils]: 89: Hoare triple {20287#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20013#false} is VALID [2022-04-15 09:24:02,101 INFO L290 TraceCheckUtils]: 88: Hoare triple {20283#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20287#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:24:02,102 INFO L272 TraceCheckUtils]: 87: Hoare triple {20303#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {20283#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 09:24:02,102 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {20012#true} {20303#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #88#return; {20303#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 09:24:02,102 INFO L290 TraceCheckUtils]: 85: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-15 09:24:02,102 INFO L290 TraceCheckUtils]: 84: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-15 09:24:02,102 INFO L290 TraceCheckUtils]: 83: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-15 09:24:02,102 INFO L272 TraceCheckUtils]: 82: Hoare triple {20303#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {20012#true} is VALID [2022-04-15 09:24:02,103 INFO L290 TraceCheckUtils]: 81: Hoare triple {20303#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} assume !!(#t~post7 < 20);havoc #t~post7; {20303#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 09:24:02,103 INFO L290 TraceCheckUtils]: 80: Hoare triple {20303#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20303#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 09:24:02,103 INFO L290 TraceCheckUtils]: 79: Hoare triple {20303#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {20303#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 09:24:02,114 INFO L290 TraceCheckUtils]: 78: Hoare triple {20331#(and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {20303#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 09:24:02,114 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {20012#true} {20331#(and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))))))} #90#return; {20331#(and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))))))} is VALID [2022-04-15 09:24:02,115 INFO L290 TraceCheckUtils]: 76: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-15 09:24:02,115 INFO L290 TraceCheckUtils]: 75: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-15 09:24:02,115 INFO L290 TraceCheckUtils]: 74: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-15 09:24:02,115 INFO L272 TraceCheckUtils]: 73: Hoare triple {20331#(and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {20012#true} is VALID [2022-04-15 09:24:02,115 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {20012#true} {20331#(and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))))))} #88#return; {20331#(and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))))))} is VALID [2022-04-15 09:24:02,115 INFO L290 TraceCheckUtils]: 71: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-15 09:24:02,116 INFO L290 TraceCheckUtils]: 70: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-15 09:24:02,116 INFO L290 TraceCheckUtils]: 69: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-15 09:24:02,116 INFO L272 TraceCheckUtils]: 68: Hoare triple {20331#(and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))))))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {20012#true} is VALID [2022-04-15 09:24:02,117 INFO L290 TraceCheckUtils]: 67: Hoare triple {20331#(and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))))))} assume !!(#t~post7 < 20);havoc #t~post7; {20331#(and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))))))} is VALID [2022-04-15 09:24:02,118 INFO L290 TraceCheckUtils]: 66: Hoare triple {20331#(and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {20331#(and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))))))} is VALID [2022-04-15 09:24:02,119 INFO L290 TraceCheckUtils]: 65: Hoare triple {20371#(or (and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)))))) (<= main_~d~0 main_~r~0))} assume !(~r~0 >= ~d~0); {20331#(and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))))))} is VALID [2022-04-15 09:24:02,120 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {20012#true} {20371#(or (and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)))))) (<= main_~d~0 main_~r~0))} #86#return; {20371#(or (and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)))))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 09:24:02,120 INFO L290 TraceCheckUtils]: 63: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-15 09:24:02,120 INFO L290 TraceCheckUtils]: 62: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-15 09:24:02,120 INFO L290 TraceCheckUtils]: 61: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-15 09:24:02,120 INFO L272 TraceCheckUtils]: 60: Hoare triple {20371#(or (and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)))))) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {20012#true} is VALID [2022-04-15 09:24:02,120 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {20012#true} {20371#(or (and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)))))) (<= main_~d~0 main_~r~0))} #84#return; {20371#(or (and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)))))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 09:24:02,120 INFO L290 TraceCheckUtils]: 58: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-15 09:24:02,121 INFO L290 TraceCheckUtils]: 57: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-15 09:24:02,121 INFO L290 TraceCheckUtils]: 56: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-15 09:24:02,121 INFO L272 TraceCheckUtils]: 55: Hoare triple {20371#(or (and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)))))) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {20012#true} is VALID [2022-04-15 09:24:02,122 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {20012#true} {20371#(or (and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)))))) (<= main_~d~0 main_~r~0))} #82#return; {20371#(or (and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)))))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 09:24:02,122 INFO L290 TraceCheckUtils]: 53: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-15 09:24:02,122 INFO L290 TraceCheckUtils]: 52: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-15 09:24:02,122 INFO L290 TraceCheckUtils]: 51: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-15 09:24:02,122 INFO L272 TraceCheckUtils]: 50: Hoare triple {20371#(or (and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)))))) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {20012#true} is VALID [2022-04-15 09:24:02,123 INFO L290 TraceCheckUtils]: 49: Hoare triple {20371#(or (and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)))))) (<= main_~d~0 main_~r~0))} assume !!(#t~post6 < 20);havoc #t~post6; {20371#(or (and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)))))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 09:24:02,124 INFO L290 TraceCheckUtils]: 48: Hoare triple {20371#(or (and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)))))) (<= main_~d~0 main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20371#(or (and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)))))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 09:24:02,128 INFO L290 TraceCheckUtils]: 47: Hoare triple {20426#(or (not (<= main_~d~0 main_~r~0)) (<= (* main_~d~0 2) main_~r~0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {20371#(or (and (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)))) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2)))))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 09:24:02,129 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {20012#true} {20426#(or (not (<= main_~d~0 main_~r~0)) (<= (* main_~d~0 2) main_~r~0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} #86#return; {20426#(or (not (<= main_~d~0 main_~r~0)) (<= (* main_~d~0 2) main_~r~0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-15 09:24:02,129 INFO L290 TraceCheckUtils]: 45: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-15 09:24:02,129 INFO L290 TraceCheckUtils]: 44: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-15 09:24:02,129 INFO L290 TraceCheckUtils]: 43: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-15 09:24:02,129 INFO L272 TraceCheckUtils]: 42: Hoare triple {20426#(or (not (<= main_~d~0 main_~r~0)) (<= (* main_~d~0 2) main_~r~0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {20012#true} is VALID [2022-04-15 09:24:02,129 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {20012#true} {20426#(or (not (<= main_~d~0 main_~r~0)) (<= (* main_~d~0 2) main_~r~0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} #84#return; {20426#(or (not (<= main_~d~0 main_~r~0)) (<= (* main_~d~0 2) main_~r~0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-15 09:24:02,130 INFO L290 TraceCheckUtils]: 40: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-15 09:24:02,130 INFO L290 TraceCheckUtils]: 39: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-15 09:24:02,130 INFO L290 TraceCheckUtils]: 38: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-15 09:24:02,130 INFO L272 TraceCheckUtils]: 37: Hoare triple {20426#(or (not (<= main_~d~0 main_~r~0)) (<= (* main_~d~0 2) main_~r~0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {20012#true} is VALID [2022-04-15 09:24:02,130 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {20012#true} {20426#(or (not (<= main_~d~0 main_~r~0)) (<= (* main_~d~0 2) main_~r~0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} #82#return; {20426#(or (not (<= main_~d~0 main_~r~0)) (<= (* main_~d~0 2) main_~r~0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-15 09:24:02,130 INFO L290 TraceCheckUtils]: 35: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-15 09:24:02,130 INFO L290 TraceCheckUtils]: 34: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-15 09:24:02,131 INFO L290 TraceCheckUtils]: 33: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-15 09:24:02,131 INFO L272 TraceCheckUtils]: 32: Hoare triple {20426#(or (not (<= main_~d~0 main_~r~0)) (<= (* main_~d~0 2) main_~r~0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {20012#true} is VALID [2022-04-15 09:24:02,133 INFO L290 TraceCheckUtils]: 31: Hoare triple {20426#(or (not (<= main_~d~0 main_~r~0)) (<= (* main_~d~0 2) main_~r~0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} assume !!(#t~post6 < 20);havoc #t~post6; {20426#(or (not (<= main_~d~0 main_~r~0)) (<= (* main_~d~0 2) main_~r~0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-15 09:24:02,134 INFO L290 TraceCheckUtils]: 30: Hoare triple {20426#(or (not (<= main_~d~0 main_~r~0)) (<= (* main_~d~0 2) main_~r~0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20426#(or (not (<= main_~d~0 main_~r~0)) (<= (* main_~d~0 2) main_~r~0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-15 09:24:02,135 INFO L290 TraceCheckUtils]: 29: Hoare triple {20481#(or (= (* 2 (* main_~p~0 (mod main_~B~0 4294967296))) (* main_~d~0 2)) (<= (* main_~d~0 2) 0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {20426#(or (not (<= main_~d~0 main_~r~0)) (<= (* main_~d~0 2) main_~r~0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-15 09:24:02,138 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {20012#true} {20481#(or (= (* 2 (* main_~p~0 (mod main_~B~0 4294967296))) (* main_~d~0 2)) (<= (* main_~d~0 2) 0))} #86#return; {20481#(or (= (* 2 (* main_~p~0 (mod main_~B~0 4294967296))) (* main_~d~0 2)) (<= (* main_~d~0 2) 0))} is VALID [2022-04-15 09:24:02,138 INFO L290 TraceCheckUtils]: 27: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-15 09:24:02,139 INFO L290 TraceCheckUtils]: 26: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-15 09:24:02,139 INFO L290 TraceCheckUtils]: 25: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-15 09:24:02,139 INFO L272 TraceCheckUtils]: 24: Hoare triple {20481#(or (= (* 2 (* main_~p~0 (mod main_~B~0 4294967296))) (* main_~d~0 2)) (<= (* main_~d~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {20012#true} is VALID [2022-04-15 09:24:02,139 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {20012#true} {20481#(or (= (* 2 (* main_~p~0 (mod main_~B~0 4294967296))) (* main_~d~0 2)) (<= (* main_~d~0 2) 0))} #84#return; {20481#(or (= (* 2 (* main_~p~0 (mod main_~B~0 4294967296))) (* main_~d~0 2)) (<= (* main_~d~0 2) 0))} is VALID [2022-04-15 09:24:02,139 INFO L290 TraceCheckUtils]: 22: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-15 09:24:02,139 INFO L290 TraceCheckUtils]: 21: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-15 09:24:02,140 INFO L290 TraceCheckUtils]: 20: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-15 09:24:02,140 INFO L272 TraceCheckUtils]: 19: Hoare triple {20481#(or (= (* 2 (* main_~p~0 (mod main_~B~0 4294967296))) (* main_~d~0 2)) (<= (* main_~d~0 2) 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {20012#true} is VALID [2022-04-15 09:24:02,140 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {20012#true} {20481#(or (= (* 2 (* main_~p~0 (mod main_~B~0 4294967296))) (* main_~d~0 2)) (<= (* main_~d~0 2) 0))} #82#return; {20481#(or (= (* 2 (* main_~p~0 (mod main_~B~0 4294967296))) (* main_~d~0 2)) (<= (* main_~d~0 2) 0))} is VALID [2022-04-15 09:24:02,140 INFO L290 TraceCheckUtils]: 17: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-15 09:24:02,140 INFO L290 TraceCheckUtils]: 16: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-15 09:24:02,140 INFO L290 TraceCheckUtils]: 15: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-15 09:24:02,140 INFO L272 TraceCheckUtils]: 14: Hoare triple {20481#(or (= (* 2 (* main_~p~0 (mod main_~B~0 4294967296))) (* main_~d~0 2)) (<= (* main_~d~0 2) 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {20012#true} is VALID [2022-04-15 09:24:02,141 INFO L290 TraceCheckUtils]: 13: Hoare triple {20481#(or (= (* 2 (* main_~p~0 (mod main_~B~0 4294967296))) (* main_~d~0 2)) (<= (* main_~d~0 2) 0))} assume !!(#t~post6 < 20);havoc #t~post6; {20481#(or (= (* 2 (* main_~p~0 (mod main_~B~0 4294967296))) (* main_~d~0 2)) (<= (* main_~d~0 2) 0))} is VALID [2022-04-15 09:24:02,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {20481#(or (= (* 2 (* main_~p~0 (mod main_~B~0 4294967296))) (* main_~d~0 2)) (<= (* main_~d~0 2) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20481#(or (= (* 2 (* main_~p~0 (mod main_~B~0 4294967296))) (* main_~d~0 2)) (<= (* main_~d~0 2) 0))} is VALID [2022-04-15 09:24:02,142 INFO L290 TraceCheckUtils]: 11: Hoare triple {20012#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {20481#(or (= (* 2 (* main_~p~0 (mod main_~B~0 4294967296))) (* main_~d~0 2)) (<= (* main_~d~0 2) 0))} is VALID [2022-04-15 09:24:02,142 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20012#true} {20012#true} #80#return; {20012#true} is VALID [2022-04-15 09:24:02,142 INFO L290 TraceCheckUtils]: 9: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-15 09:24:02,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {20012#true} assume !(0 == ~cond); {20012#true} is VALID [2022-04-15 09:24:02,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {20012#true} ~cond := #in~cond; {20012#true} is VALID [2022-04-15 09:24:02,142 INFO L272 TraceCheckUtils]: 6: Hoare triple {20012#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {20012#true} is VALID [2022-04-15 09:24:02,142 INFO L290 TraceCheckUtils]: 5: Hoare triple {20012#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {20012#true} is VALID [2022-04-15 09:24:02,142 INFO L272 TraceCheckUtils]: 4: Hoare triple {20012#true} call #t~ret8 := main(); {20012#true} is VALID [2022-04-15 09:24:02,142 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20012#true} {20012#true} #96#return; {20012#true} is VALID [2022-04-15 09:24:02,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {20012#true} assume true; {20012#true} is VALID [2022-04-15 09:24:02,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {20012#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {20012#true} is VALID [2022-04-15 09:24:02,143 INFO L272 TraceCheckUtils]: 0: Hoare triple {20012#true} call ULTIMATE.init(); {20012#true} is VALID [2022-04-15 09:24:02,143 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 24 proven. 22 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-15 09:24:02,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:24:02,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802347938] [2022-04-15 09:24:02,143 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:24:02,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [871104630] [2022-04-15 09:24:02,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [871104630] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:24:02,144 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:24:02,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2022-04-15 09:24:02,144 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:24:02,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [502240207] [2022-04-15 09:24:02,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [502240207] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:24:02,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:24:02,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 09:24:02,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762130324] [2022-04-15 09:24:02,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:24:02,146 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 91 [2022-04-15 09:24:02,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:24:02,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-15 09:24:02,205 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:24:02,205 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 09:24:02,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:24:02,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 09:24:02,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-04-15 09:24:02,206 INFO L87 Difference]: Start difference. First operand 172 states and 200 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-15 09:24:03,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:24:03,627 INFO L93 Difference]: Finished difference Result 212 states and 254 transitions. [2022-04-15 09:24:03,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 09:24:03,628 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 91 [2022-04-15 09:24:03,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:24:03,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-15 09:24:03,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2022-04-15 09:24:03,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-15 09:24:03,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 123 transitions. [2022-04-15 09:24:03,630 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 123 transitions. [2022-04-15 09:24:03,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:24:03,777 INFO L225 Difference]: With dead ends: 212 [2022-04-15 09:24:03,777 INFO L226 Difference]: Without dead ends: 182 [2022-04-15 09:24:03,777 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2022-04-15 09:24:03,778 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 14 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 09:24:03,778 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 350 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 09:24:03,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-04-15 09:24:03,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2022-04-15 09:24:03,941 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:24:03,941 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand has 180 states, 117 states have (on average 1.1452991452991452) internal successors, (134), 123 states have internal predecessors, (134), 38 states have call successors, (38), 25 states have call predecessors, (38), 24 states have return successors, (35), 31 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-15 09:24:03,941 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand has 180 states, 117 states have (on average 1.1452991452991452) internal successors, (134), 123 states have internal predecessors, (134), 38 states have call successors, (38), 25 states have call predecessors, (38), 24 states have return successors, (35), 31 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-15 09:24:03,947 INFO L87 Difference]: Start difference. First operand 182 states. Second operand has 180 states, 117 states have (on average 1.1452991452991452) internal successors, (134), 123 states have internal predecessors, (134), 38 states have call successors, (38), 25 states have call predecessors, (38), 24 states have return successors, (35), 31 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-15 09:24:03,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:24:03,950 INFO L93 Difference]: Finished difference Result 182 states and 210 transitions. [2022-04-15 09:24:03,950 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 210 transitions. [2022-04-15 09:24:03,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:24:03,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:24:03,951 INFO L74 IsIncluded]: Start isIncluded. First operand has 180 states, 117 states have (on average 1.1452991452991452) internal successors, (134), 123 states have internal predecessors, (134), 38 states have call successors, (38), 25 states have call predecessors, (38), 24 states have return successors, (35), 31 states have call predecessors, (35), 35 states have call successors, (35) Second operand 182 states. [2022-04-15 09:24:03,951 INFO L87 Difference]: Start difference. First operand has 180 states, 117 states have (on average 1.1452991452991452) internal successors, (134), 123 states have internal predecessors, (134), 38 states have call successors, (38), 25 states have call predecessors, (38), 24 states have return successors, (35), 31 states have call predecessors, (35), 35 states have call successors, (35) Second operand 182 states. [2022-04-15 09:24:03,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:24:03,954 INFO L93 Difference]: Finished difference Result 182 states and 210 transitions. [2022-04-15 09:24:03,954 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 210 transitions. [2022-04-15 09:24:03,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:24:03,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:24:03,955 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:24:03,955 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:24:03,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 117 states have (on average 1.1452991452991452) internal successors, (134), 123 states have internal predecessors, (134), 38 states have call successors, (38), 25 states have call predecessors, (38), 24 states have return successors, (35), 31 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-15 09:24:03,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 207 transitions. [2022-04-15 09:24:03,957 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 207 transitions. Word has length 91 [2022-04-15 09:24:03,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:24:03,958 INFO L478 AbstractCegarLoop]: Abstraction has 180 states and 207 transitions. [2022-04-15 09:24:03,958 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-15 09:24:03,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 180 states and 207 transitions. [2022-04-15 09:24:06,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 207 edges. 206 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 09:24:06,261 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 207 transitions. [2022-04-15 09:24:06,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-15 09:24:06,262 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:24:06,262 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:24:06,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-15 09:24:06,462 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:24:06,462 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:24:06,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:24:06,463 INFO L85 PathProgramCache]: Analyzing trace with hash 114996177, now seen corresponding path program 7 times [2022-04-15 09:24:06,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:24:06,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1368512594] [2022-04-15 09:24:13,037 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:24:13,038 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:24:13,038 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:24:13,038 INFO L85 PathProgramCache]: Analyzing trace with hash 114996177, now seen corresponding path program 8 times [2022-04-15 09:24:13,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:24:13,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859545425] [2022-04-15 09:24:13,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:24:13,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:24:13,049 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:24:13,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1261212139] [2022-04-15 09:24:13,049 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:24:13,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:24:13,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:24:13,050 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:24:13,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-15 09:24:13,108 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:24:13,108 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:24:13,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 09:24:13,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:24:13,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:24:13,450 INFO L272 TraceCheckUtils]: 0: Hoare triple {21725#true} call ULTIMATE.init(); {21725#true} is VALID [2022-04-15 09:24:13,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {21725#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {21733#(<= ~counter~0 0)} is VALID [2022-04-15 09:24:13,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {21733#(<= ~counter~0 0)} assume true; {21733#(<= ~counter~0 0)} is VALID [2022-04-15 09:24:13,451 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21733#(<= ~counter~0 0)} {21725#true} #96#return; {21733#(<= ~counter~0 0)} is VALID [2022-04-15 09:24:13,451 INFO L272 TraceCheckUtils]: 4: Hoare triple {21733#(<= ~counter~0 0)} call #t~ret8 := main(); {21733#(<= ~counter~0 0)} is VALID [2022-04-15 09:24:13,452 INFO L290 TraceCheckUtils]: 5: Hoare triple {21733#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {21733#(<= ~counter~0 0)} is VALID [2022-04-15 09:24:13,452 INFO L272 TraceCheckUtils]: 6: Hoare triple {21733#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {21733#(<= ~counter~0 0)} is VALID [2022-04-15 09:24:13,452 INFO L290 TraceCheckUtils]: 7: Hoare triple {21733#(<= ~counter~0 0)} ~cond := #in~cond; {21733#(<= ~counter~0 0)} is VALID [2022-04-15 09:24:13,453 INFO L290 TraceCheckUtils]: 8: Hoare triple {21733#(<= ~counter~0 0)} assume !(0 == ~cond); {21733#(<= ~counter~0 0)} is VALID [2022-04-15 09:24:13,453 INFO L290 TraceCheckUtils]: 9: Hoare triple {21733#(<= ~counter~0 0)} assume true; {21733#(<= ~counter~0 0)} is VALID [2022-04-15 09:24:13,453 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21733#(<= ~counter~0 0)} {21733#(<= ~counter~0 0)} #80#return; {21733#(<= ~counter~0 0)} is VALID [2022-04-15 09:24:13,454 INFO L290 TraceCheckUtils]: 11: Hoare triple {21733#(<= ~counter~0 0)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {21733#(<= ~counter~0 0)} is VALID [2022-04-15 09:24:13,454 INFO L290 TraceCheckUtils]: 12: Hoare triple {21733#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21767#(<= ~counter~0 1)} is VALID [2022-04-15 09:24:13,455 INFO L290 TraceCheckUtils]: 13: Hoare triple {21767#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {21767#(<= ~counter~0 1)} is VALID [2022-04-15 09:24:13,455 INFO L272 TraceCheckUtils]: 14: Hoare triple {21767#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {21767#(<= ~counter~0 1)} is VALID [2022-04-15 09:24:13,455 INFO L290 TraceCheckUtils]: 15: Hoare triple {21767#(<= ~counter~0 1)} ~cond := #in~cond; {21767#(<= ~counter~0 1)} is VALID [2022-04-15 09:24:13,456 INFO L290 TraceCheckUtils]: 16: Hoare triple {21767#(<= ~counter~0 1)} assume !(0 == ~cond); {21767#(<= ~counter~0 1)} is VALID [2022-04-15 09:24:13,456 INFO L290 TraceCheckUtils]: 17: Hoare triple {21767#(<= ~counter~0 1)} assume true; {21767#(<= ~counter~0 1)} is VALID [2022-04-15 09:24:13,456 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {21767#(<= ~counter~0 1)} {21767#(<= ~counter~0 1)} #82#return; {21767#(<= ~counter~0 1)} is VALID [2022-04-15 09:24:13,457 INFO L272 TraceCheckUtils]: 19: Hoare triple {21767#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {21767#(<= ~counter~0 1)} is VALID [2022-04-15 09:24:13,457 INFO L290 TraceCheckUtils]: 20: Hoare triple {21767#(<= ~counter~0 1)} ~cond := #in~cond; {21767#(<= ~counter~0 1)} is VALID [2022-04-15 09:24:13,457 INFO L290 TraceCheckUtils]: 21: Hoare triple {21767#(<= ~counter~0 1)} assume !(0 == ~cond); {21767#(<= ~counter~0 1)} is VALID [2022-04-15 09:24:13,458 INFO L290 TraceCheckUtils]: 22: Hoare triple {21767#(<= ~counter~0 1)} assume true; {21767#(<= ~counter~0 1)} is VALID [2022-04-15 09:24:13,458 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {21767#(<= ~counter~0 1)} {21767#(<= ~counter~0 1)} #84#return; {21767#(<= ~counter~0 1)} is VALID [2022-04-15 09:24:13,458 INFO L272 TraceCheckUtils]: 24: Hoare triple {21767#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {21767#(<= ~counter~0 1)} is VALID [2022-04-15 09:24:13,459 INFO L290 TraceCheckUtils]: 25: Hoare triple {21767#(<= ~counter~0 1)} ~cond := #in~cond; {21767#(<= ~counter~0 1)} is VALID [2022-04-15 09:24:13,459 INFO L290 TraceCheckUtils]: 26: Hoare triple {21767#(<= ~counter~0 1)} assume !(0 == ~cond); {21767#(<= ~counter~0 1)} is VALID [2022-04-15 09:24:13,459 INFO L290 TraceCheckUtils]: 27: Hoare triple {21767#(<= ~counter~0 1)} assume true; {21767#(<= ~counter~0 1)} is VALID [2022-04-15 09:24:13,460 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {21767#(<= ~counter~0 1)} {21767#(<= ~counter~0 1)} #86#return; {21767#(<= ~counter~0 1)} is VALID [2022-04-15 09:24:13,460 INFO L290 TraceCheckUtils]: 29: Hoare triple {21767#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {21767#(<= ~counter~0 1)} is VALID [2022-04-15 09:24:13,461 INFO L290 TraceCheckUtils]: 30: Hoare triple {21767#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21822#(<= ~counter~0 2)} is VALID [2022-04-15 09:24:13,461 INFO L290 TraceCheckUtils]: 31: Hoare triple {21822#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {21822#(<= ~counter~0 2)} is VALID [2022-04-15 09:24:13,461 INFO L272 TraceCheckUtils]: 32: Hoare triple {21822#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {21822#(<= ~counter~0 2)} is VALID [2022-04-15 09:24:13,462 INFO L290 TraceCheckUtils]: 33: Hoare triple {21822#(<= ~counter~0 2)} ~cond := #in~cond; {21822#(<= ~counter~0 2)} is VALID [2022-04-15 09:24:13,462 INFO L290 TraceCheckUtils]: 34: Hoare triple {21822#(<= ~counter~0 2)} assume !(0 == ~cond); {21822#(<= ~counter~0 2)} is VALID [2022-04-15 09:24:13,462 INFO L290 TraceCheckUtils]: 35: Hoare triple {21822#(<= ~counter~0 2)} assume true; {21822#(<= ~counter~0 2)} is VALID [2022-04-15 09:24:13,463 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {21822#(<= ~counter~0 2)} {21822#(<= ~counter~0 2)} #82#return; {21822#(<= ~counter~0 2)} is VALID [2022-04-15 09:24:13,463 INFO L272 TraceCheckUtils]: 37: Hoare triple {21822#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {21822#(<= ~counter~0 2)} is VALID [2022-04-15 09:24:13,463 INFO L290 TraceCheckUtils]: 38: Hoare triple {21822#(<= ~counter~0 2)} ~cond := #in~cond; {21822#(<= ~counter~0 2)} is VALID [2022-04-15 09:24:13,464 INFO L290 TraceCheckUtils]: 39: Hoare triple {21822#(<= ~counter~0 2)} assume !(0 == ~cond); {21822#(<= ~counter~0 2)} is VALID [2022-04-15 09:24:13,464 INFO L290 TraceCheckUtils]: 40: Hoare triple {21822#(<= ~counter~0 2)} assume true; {21822#(<= ~counter~0 2)} is VALID [2022-04-15 09:24:13,464 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {21822#(<= ~counter~0 2)} {21822#(<= ~counter~0 2)} #84#return; {21822#(<= ~counter~0 2)} is VALID [2022-04-15 09:24:13,465 INFO L272 TraceCheckUtils]: 42: Hoare triple {21822#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {21822#(<= ~counter~0 2)} is VALID [2022-04-15 09:24:13,465 INFO L290 TraceCheckUtils]: 43: Hoare triple {21822#(<= ~counter~0 2)} ~cond := #in~cond; {21822#(<= ~counter~0 2)} is VALID [2022-04-15 09:24:13,465 INFO L290 TraceCheckUtils]: 44: Hoare triple {21822#(<= ~counter~0 2)} assume !(0 == ~cond); {21822#(<= ~counter~0 2)} is VALID [2022-04-15 09:24:13,466 INFO L290 TraceCheckUtils]: 45: Hoare triple {21822#(<= ~counter~0 2)} assume true; {21822#(<= ~counter~0 2)} is VALID [2022-04-15 09:24:13,466 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {21822#(<= ~counter~0 2)} {21822#(<= ~counter~0 2)} #86#return; {21822#(<= ~counter~0 2)} is VALID [2022-04-15 09:24:13,466 INFO L290 TraceCheckUtils]: 47: Hoare triple {21822#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {21822#(<= ~counter~0 2)} is VALID [2022-04-15 09:24:13,467 INFO L290 TraceCheckUtils]: 48: Hoare triple {21822#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21877#(<= ~counter~0 3)} is VALID [2022-04-15 09:24:13,467 INFO L290 TraceCheckUtils]: 49: Hoare triple {21877#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {21877#(<= ~counter~0 3)} is VALID [2022-04-15 09:24:13,468 INFO L272 TraceCheckUtils]: 50: Hoare triple {21877#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {21877#(<= ~counter~0 3)} is VALID [2022-04-15 09:24:13,468 INFO L290 TraceCheckUtils]: 51: Hoare triple {21877#(<= ~counter~0 3)} ~cond := #in~cond; {21877#(<= ~counter~0 3)} is VALID [2022-04-15 09:24:13,468 INFO L290 TraceCheckUtils]: 52: Hoare triple {21877#(<= ~counter~0 3)} assume !(0 == ~cond); {21877#(<= ~counter~0 3)} is VALID [2022-04-15 09:24:13,469 INFO L290 TraceCheckUtils]: 53: Hoare triple {21877#(<= ~counter~0 3)} assume true; {21877#(<= ~counter~0 3)} is VALID [2022-04-15 09:24:13,469 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {21877#(<= ~counter~0 3)} {21877#(<= ~counter~0 3)} #82#return; {21877#(<= ~counter~0 3)} is VALID [2022-04-15 09:24:13,469 INFO L272 TraceCheckUtils]: 55: Hoare triple {21877#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {21877#(<= ~counter~0 3)} is VALID [2022-04-15 09:24:13,470 INFO L290 TraceCheckUtils]: 56: Hoare triple {21877#(<= ~counter~0 3)} ~cond := #in~cond; {21877#(<= ~counter~0 3)} is VALID [2022-04-15 09:24:13,470 INFO L290 TraceCheckUtils]: 57: Hoare triple {21877#(<= ~counter~0 3)} assume !(0 == ~cond); {21877#(<= ~counter~0 3)} is VALID [2022-04-15 09:24:13,470 INFO L290 TraceCheckUtils]: 58: Hoare triple {21877#(<= ~counter~0 3)} assume true; {21877#(<= ~counter~0 3)} is VALID [2022-04-15 09:24:13,471 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {21877#(<= ~counter~0 3)} {21877#(<= ~counter~0 3)} #84#return; {21877#(<= ~counter~0 3)} is VALID [2022-04-15 09:24:13,471 INFO L272 TraceCheckUtils]: 60: Hoare triple {21877#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {21877#(<= ~counter~0 3)} is VALID [2022-04-15 09:24:13,472 INFO L290 TraceCheckUtils]: 61: Hoare triple {21877#(<= ~counter~0 3)} ~cond := #in~cond; {21877#(<= ~counter~0 3)} is VALID [2022-04-15 09:24:13,472 INFO L290 TraceCheckUtils]: 62: Hoare triple {21877#(<= ~counter~0 3)} assume !(0 == ~cond); {21877#(<= ~counter~0 3)} is VALID [2022-04-15 09:24:13,472 INFO L290 TraceCheckUtils]: 63: Hoare triple {21877#(<= ~counter~0 3)} assume true; {21877#(<= ~counter~0 3)} is VALID [2022-04-15 09:24:13,473 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {21877#(<= ~counter~0 3)} {21877#(<= ~counter~0 3)} #86#return; {21877#(<= ~counter~0 3)} is VALID [2022-04-15 09:24:13,473 INFO L290 TraceCheckUtils]: 65: Hoare triple {21877#(<= ~counter~0 3)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {21877#(<= ~counter~0 3)} is VALID [2022-04-15 09:24:13,473 INFO L290 TraceCheckUtils]: 66: Hoare triple {21877#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21932#(<= ~counter~0 4)} is VALID [2022-04-15 09:24:13,474 INFO L290 TraceCheckUtils]: 67: Hoare triple {21932#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {21932#(<= ~counter~0 4)} is VALID [2022-04-15 09:24:13,474 INFO L272 TraceCheckUtils]: 68: Hoare triple {21932#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {21932#(<= ~counter~0 4)} is VALID [2022-04-15 09:24:13,474 INFO L290 TraceCheckUtils]: 69: Hoare triple {21932#(<= ~counter~0 4)} ~cond := #in~cond; {21932#(<= ~counter~0 4)} is VALID [2022-04-15 09:24:13,475 INFO L290 TraceCheckUtils]: 70: Hoare triple {21932#(<= ~counter~0 4)} assume !(0 == ~cond); {21932#(<= ~counter~0 4)} is VALID [2022-04-15 09:24:13,475 INFO L290 TraceCheckUtils]: 71: Hoare triple {21932#(<= ~counter~0 4)} assume true; {21932#(<= ~counter~0 4)} is VALID [2022-04-15 09:24:13,475 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {21932#(<= ~counter~0 4)} {21932#(<= ~counter~0 4)} #82#return; {21932#(<= ~counter~0 4)} is VALID [2022-04-15 09:24:13,476 INFO L272 TraceCheckUtils]: 73: Hoare triple {21932#(<= ~counter~0 4)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {21932#(<= ~counter~0 4)} is VALID [2022-04-15 09:24:13,476 INFO L290 TraceCheckUtils]: 74: Hoare triple {21932#(<= ~counter~0 4)} ~cond := #in~cond; {21932#(<= ~counter~0 4)} is VALID [2022-04-15 09:24:13,476 INFO L290 TraceCheckUtils]: 75: Hoare triple {21932#(<= ~counter~0 4)} assume !(0 == ~cond); {21932#(<= ~counter~0 4)} is VALID [2022-04-15 09:24:13,477 INFO L290 TraceCheckUtils]: 76: Hoare triple {21932#(<= ~counter~0 4)} assume true; {21932#(<= ~counter~0 4)} is VALID [2022-04-15 09:24:13,477 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {21932#(<= ~counter~0 4)} {21932#(<= ~counter~0 4)} #84#return; {21932#(<= ~counter~0 4)} is VALID [2022-04-15 09:24:13,478 INFO L272 TraceCheckUtils]: 78: Hoare triple {21932#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {21932#(<= ~counter~0 4)} is VALID [2022-04-15 09:24:13,478 INFO L290 TraceCheckUtils]: 79: Hoare triple {21932#(<= ~counter~0 4)} ~cond := #in~cond; {21932#(<= ~counter~0 4)} is VALID [2022-04-15 09:24:13,478 INFO L290 TraceCheckUtils]: 80: Hoare triple {21932#(<= ~counter~0 4)} assume !(0 == ~cond); {21932#(<= ~counter~0 4)} is VALID [2022-04-15 09:24:13,479 INFO L290 TraceCheckUtils]: 81: Hoare triple {21932#(<= ~counter~0 4)} assume true; {21932#(<= ~counter~0 4)} is VALID [2022-04-15 09:24:13,479 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {21932#(<= ~counter~0 4)} {21932#(<= ~counter~0 4)} #86#return; {21932#(<= ~counter~0 4)} is VALID [2022-04-15 09:24:13,479 INFO L290 TraceCheckUtils]: 83: Hoare triple {21932#(<= ~counter~0 4)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {21932#(<= ~counter~0 4)} is VALID [2022-04-15 09:24:13,480 INFO L290 TraceCheckUtils]: 84: Hoare triple {21932#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21987#(<= |main_#t~post6| 4)} is VALID [2022-04-15 09:24:13,480 INFO L290 TraceCheckUtils]: 85: Hoare triple {21987#(<= |main_#t~post6| 4)} assume !(#t~post6 < 20);havoc #t~post6; {21726#false} is VALID [2022-04-15 09:24:13,480 INFO L290 TraceCheckUtils]: 86: Hoare triple {21726#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21726#false} is VALID [2022-04-15 09:24:13,480 INFO L290 TraceCheckUtils]: 87: Hoare triple {21726#false} assume !(#t~post7 < 20);havoc #t~post7; {21726#false} is VALID [2022-04-15 09:24:13,480 INFO L272 TraceCheckUtils]: 88: Hoare triple {21726#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {21726#false} is VALID [2022-04-15 09:24:13,480 INFO L290 TraceCheckUtils]: 89: Hoare triple {21726#false} ~cond := #in~cond; {21726#false} is VALID [2022-04-15 09:24:13,481 INFO L290 TraceCheckUtils]: 90: Hoare triple {21726#false} assume !(0 == ~cond); {21726#false} is VALID [2022-04-15 09:24:13,481 INFO L290 TraceCheckUtils]: 91: Hoare triple {21726#false} assume true; {21726#false} is VALID [2022-04-15 09:24:13,481 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {21726#false} {21726#false} #92#return; {21726#false} is VALID [2022-04-15 09:24:13,481 INFO L272 TraceCheckUtils]: 93: Hoare triple {21726#false} call __VERIFIER_assert((if ~B~0 % 4294967296 == ~d~0 then 1 else 0)); {21726#false} is VALID [2022-04-15 09:24:13,481 INFO L290 TraceCheckUtils]: 94: Hoare triple {21726#false} ~cond := #in~cond; {21726#false} is VALID [2022-04-15 09:24:13,481 INFO L290 TraceCheckUtils]: 95: Hoare triple {21726#false} assume 0 == ~cond; {21726#false} is VALID [2022-04-15 09:24:13,481 INFO L290 TraceCheckUtils]: 96: Hoare triple {21726#false} assume !false; {21726#false} is VALID [2022-04-15 09:24:13,481 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 72 proven. 260 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-04-15 09:24:13,482 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:24:13,859 INFO L290 TraceCheckUtils]: 96: Hoare triple {21726#false} assume !false; {21726#false} is VALID [2022-04-15 09:24:13,859 INFO L290 TraceCheckUtils]: 95: Hoare triple {21726#false} assume 0 == ~cond; {21726#false} is VALID [2022-04-15 09:24:13,860 INFO L290 TraceCheckUtils]: 94: Hoare triple {21726#false} ~cond := #in~cond; {21726#false} is VALID [2022-04-15 09:24:13,860 INFO L272 TraceCheckUtils]: 93: Hoare triple {21726#false} call __VERIFIER_assert((if ~B~0 % 4294967296 == ~d~0 then 1 else 0)); {21726#false} is VALID [2022-04-15 09:24:13,860 INFO L284 TraceCheckUtils]: 92: Hoare quadruple {21725#true} {21726#false} #92#return; {21726#false} is VALID [2022-04-15 09:24:13,860 INFO L290 TraceCheckUtils]: 91: Hoare triple {21725#true} assume true; {21725#true} is VALID [2022-04-15 09:24:13,860 INFO L290 TraceCheckUtils]: 90: Hoare triple {21725#true} assume !(0 == ~cond); {21725#true} is VALID [2022-04-15 09:24:13,860 INFO L290 TraceCheckUtils]: 89: Hoare triple {21725#true} ~cond := #in~cond; {21725#true} is VALID [2022-04-15 09:24:13,860 INFO L272 TraceCheckUtils]: 88: Hoare triple {21726#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {21725#true} is VALID [2022-04-15 09:24:13,860 INFO L290 TraceCheckUtils]: 87: Hoare triple {21726#false} assume !(#t~post7 < 20);havoc #t~post7; {21726#false} is VALID [2022-04-15 09:24:13,860 INFO L290 TraceCheckUtils]: 86: Hoare triple {21726#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21726#false} is VALID [2022-04-15 09:24:13,861 INFO L290 TraceCheckUtils]: 85: Hoare triple {22057#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {21726#false} is VALID [2022-04-15 09:24:13,861 INFO L290 TraceCheckUtils]: 84: Hoare triple {22061#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22057#(< |main_#t~post6| 20)} is VALID [2022-04-15 09:24:13,861 INFO L290 TraceCheckUtils]: 83: Hoare triple {22061#(< ~counter~0 20)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {22061#(< ~counter~0 20)} is VALID [2022-04-15 09:24:13,862 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {21725#true} {22061#(< ~counter~0 20)} #86#return; {22061#(< ~counter~0 20)} is VALID [2022-04-15 09:24:13,862 INFO L290 TraceCheckUtils]: 81: Hoare triple {21725#true} assume true; {21725#true} is VALID [2022-04-15 09:24:13,862 INFO L290 TraceCheckUtils]: 80: Hoare triple {21725#true} assume !(0 == ~cond); {21725#true} is VALID [2022-04-15 09:24:13,862 INFO L290 TraceCheckUtils]: 79: Hoare triple {21725#true} ~cond := #in~cond; {21725#true} is VALID [2022-04-15 09:24:13,862 INFO L272 TraceCheckUtils]: 78: Hoare triple {22061#(< ~counter~0 20)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {21725#true} is VALID [2022-04-15 09:24:13,863 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {21725#true} {22061#(< ~counter~0 20)} #84#return; {22061#(< ~counter~0 20)} is VALID [2022-04-15 09:24:13,863 INFO L290 TraceCheckUtils]: 76: Hoare triple {21725#true} assume true; {21725#true} is VALID [2022-04-15 09:24:13,863 INFO L290 TraceCheckUtils]: 75: Hoare triple {21725#true} assume !(0 == ~cond); {21725#true} is VALID [2022-04-15 09:24:13,863 INFO L290 TraceCheckUtils]: 74: Hoare triple {21725#true} ~cond := #in~cond; {21725#true} is VALID [2022-04-15 09:24:13,863 INFO L272 TraceCheckUtils]: 73: Hoare triple {22061#(< ~counter~0 20)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {21725#true} is VALID [2022-04-15 09:24:13,863 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {21725#true} {22061#(< ~counter~0 20)} #82#return; {22061#(< ~counter~0 20)} is VALID [2022-04-15 09:24:13,864 INFO L290 TraceCheckUtils]: 71: Hoare triple {21725#true} assume true; {21725#true} is VALID [2022-04-15 09:24:13,864 INFO L290 TraceCheckUtils]: 70: Hoare triple {21725#true} assume !(0 == ~cond); {21725#true} is VALID [2022-04-15 09:24:13,864 INFO L290 TraceCheckUtils]: 69: Hoare triple {21725#true} ~cond := #in~cond; {21725#true} is VALID [2022-04-15 09:24:13,864 INFO L272 TraceCheckUtils]: 68: Hoare triple {22061#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {21725#true} is VALID [2022-04-15 09:24:13,864 INFO L290 TraceCheckUtils]: 67: Hoare triple {22061#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {22061#(< ~counter~0 20)} is VALID [2022-04-15 09:24:13,865 INFO L290 TraceCheckUtils]: 66: Hoare triple {22116#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22061#(< ~counter~0 20)} is VALID [2022-04-15 09:24:13,865 INFO L290 TraceCheckUtils]: 65: Hoare triple {22116#(< ~counter~0 19)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {22116#(< ~counter~0 19)} is VALID [2022-04-15 09:24:13,866 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {21725#true} {22116#(< ~counter~0 19)} #86#return; {22116#(< ~counter~0 19)} is VALID [2022-04-15 09:24:13,866 INFO L290 TraceCheckUtils]: 63: Hoare triple {21725#true} assume true; {21725#true} is VALID [2022-04-15 09:24:13,866 INFO L290 TraceCheckUtils]: 62: Hoare triple {21725#true} assume !(0 == ~cond); {21725#true} is VALID [2022-04-15 09:24:13,866 INFO L290 TraceCheckUtils]: 61: Hoare triple {21725#true} ~cond := #in~cond; {21725#true} is VALID [2022-04-15 09:24:13,866 INFO L272 TraceCheckUtils]: 60: Hoare triple {22116#(< ~counter~0 19)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {21725#true} is VALID [2022-04-15 09:24:13,867 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {21725#true} {22116#(< ~counter~0 19)} #84#return; {22116#(< ~counter~0 19)} is VALID [2022-04-15 09:24:13,867 INFO L290 TraceCheckUtils]: 58: Hoare triple {21725#true} assume true; {21725#true} is VALID [2022-04-15 09:24:13,867 INFO L290 TraceCheckUtils]: 57: Hoare triple {21725#true} assume !(0 == ~cond); {21725#true} is VALID [2022-04-15 09:24:13,867 INFO L290 TraceCheckUtils]: 56: Hoare triple {21725#true} ~cond := #in~cond; {21725#true} is VALID [2022-04-15 09:24:13,867 INFO L272 TraceCheckUtils]: 55: Hoare triple {22116#(< ~counter~0 19)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {21725#true} is VALID [2022-04-15 09:24:13,867 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {21725#true} {22116#(< ~counter~0 19)} #82#return; {22116#(< ~counter~0 19)} is VALID [2022-04-15 09:24:13,868 INFO L290 TraceCheckUtils]: 53: Hoare triple {21725#true} assume true; {21725#true} is VALID [2022-04-15 09:24:13,868 INFO L290 TraceCheckUtils]: 52: Hoare triple {21725#true} assume !(0 == ~cond); {21725#true} is VALID [2022-04-15 09:24:13,868 INFO L290 TraceCheckUtils]: 51: Hoare triple {21725#true} ~cond := #in~cond; {21725#true} is VALID [2022-04-15 09:24:13,868 INFO L272 TraceCheckUtils]: 50: Hoare triple {22116#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {21725#true} is VALID [2022-04-15 09:24:13,868 INFO L290 TraceCheckUtils]: 49: Hoare triple {22116#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {22116#(< ~counter~0 19)} is VALID [2022-04-15 09:24:13,869 INFO L290 TraceCheckUtils]: 48: Hoare triple {22171#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22116#(< ~counter~0 19)} is VALID [2022-04-15 09:24:13,869 INFO L290 TraceCheckUtils]: 47: Hoare triple {22171#(< ~counter~0 18)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {22171#(< ~counter~0 18)} is VALID [2022-04-15 09:24:13,870 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {21725#true} {22171#(< ~counter~0 18)} #86#return; {22171#(< ~counter~0 18)} is VALID [2022-04-15 09:24:13,870 INFO L290 TraceCheckUtils]: 45: Hoare triple {21725#true} assume true; {21725#true} is VALID [2022-04-15 09:24:13,870 INFO L290 TraceCheckUtils]: 44: Hoare triple {21725#true} assume !(0 == ~cond); {21725#true} is VALID [2022-04-15 09:24:13,870 INFO L290 TraceCheckUtils]: 43: Hoare triple {21725#true} ~cond := #in~cond; {21725#true} is VALID [2022-04-15 09:24:13,870 INFO L272 TraceCheckUtils]: 42: Hoare triple {22171#(< ~counter~0 18)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {21725#true} is VALID [2022-04-15 09:24:13,870 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {21725#true} {22171#(< ~counter~0 18)} #84#return; {22171#(< ~counter~0 18)} is VALID [2022-04-15 09:24:13,871 INFO L290 TraceCheckUtils]: 40: Hoare triple {21725#true} assume true; {21725#true} is VALID [2022-04-15 09:24:13,871 INFO L290 TraceCheckUtils]: 39: Hoare triple {21725#true} assume !(0 == ~cond); {21725#true} is VALID [2022-04-15 09:24:13,871 INFO L290 TraceCheckUtils]: 38: Hoare triple {21725#true} ~cond := #in~cond; {21725#true} is VALID [2022-04-15 09:24:13,871 INFO L272 TraceCheckUtils]: 37: Hoare triple {22171#(< ~counter~0 18)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {21725#true} is VALID [2022-04-15 09:24:13,871 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {21725#true} {22171#(< ~counter~0 18)} #82#return; {22171#(< ~counter~0 18)} is VALID [2022-04-15 09:24:13,871 INFO L290 TraceCheckUtils]: 35: Hoare triple {21725#true} assume true; {21725#true} is VALID [2022-04-15 09:24:13,871 INFO L290 TraceCheckUtils]: 34: Hoare triple {21725#true} assume !(0 == ~cond); {21725#true} is VALID [2022-04-15 09:24:13,871 INFO L290 TraceCheckUtils]: 33: Hoare triple {21725#true} ~cond := #in~cond; {21725#true} is VALID [2022-04-15 09:24:13,872 INFO L272 TraceCheckUtils]: 32: Hoare triple {22171#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {21725#true} is VALID [2022-04-15 09:24:13,872 INFO L290 TraceCheckUtils]: 31: Hoare triple {22171#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {22171#(< ~counter~0 18)} is VALID [2022-04-15 09:24:13,873 INFO L290 TraceCheckUtils]: 30: Hoare triple {22226#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22171#(< ~counter~0 18)} is VALID [2022-04-15 09:24:13,873 INFO L290 TraceCheckUtils]: 29: Hoare triple {22226#(< ~counter~0 17)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {22226#(< ~counter~0 17)} is VALID [2022-04-15 09:24:13,873 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {21725#true} {22226#(< ~counter~0 17)} #86#return; {22226#(< ~counter~0 17)} is VALID [2022-04-15 09:24:13,873 INFO L290 TraceCheckUtils]: 27: Hoare triple {21725#true} assume true; {21725#true} is VALID [2022-04-15 09:24:13,874 INFO L290 TraceCheckUtils]: 26: Hoare triple {21725#true} assume !(0 == ~cond); {21725#true} is VALID [2022-04-15 09:24:13,874 INFO L290 TraceCheckUtils]: 25: Hoare triple {21725#true} ~cond := #in~cond; {21725#true} is VALID [2022-04-15 09:24:13,874 INFO L272 TraceCheckUtils]: 24: Hoare triple {22226#(< ~counter~0 17)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {21725#true} is VALID [2022-04-15 09:24:13,874 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {21725#true} {22226#(< ~counter~0 17)} #84#return; {22226#(< ~counter~0 17)} is VALID [2022-04-15 09:24:13,874 INFO L290 TraceCheckUtils]: 22: Hoare triple {21725#true} assume true; {21725#true} is VALID [2022-04-15 09:24:13,874 INFO L290 TraceCheckUtils]: 21: Hoare triple {21725#true} assume !(0 == ~cond); {21725#true} is VALID [2022-04-15 09:24:13,874 INFO L290 TraceCheckUtils]: 20: Hoare triple {21725#true} ~cond := #in~cond; {21725#true} is VALID [2022-04-15 09:24:13,875 INFO L272 TraceCheckUtils]: 19: Hoare triple {22226#(< ~counter~0 17)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {21725#true} is VALID [2022-04-15 09:24:13,875 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {21725#true} {22226#(< ~counter~0 17)} #82#return; {22226#(< ~counter~0 17)} is VALID [2022-04-15 09:24:13,875 INFO L290 TraceCheckUtils]: 17: Hoare triple {21725#true} assume true; {21725#true} is VALID [2022-04-15 09:24:13,875 INFO L290 TraceCheckUtils]: 16: Hoare triple {21725#true} assume !(0 == ~cond); {21725#true} is VALID [2022-04-15 09:24:13,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {21725#true} ~cond := #in~cond; {21725#true} is VALID [2022-04-15 09:24:13,875 INFO L272 TraceCheckUtils]: 14: Hoare triple {22226#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {21725#true} is VALID [2022-04-15 09:24:13,876 INFO L290 TraceCheckUtils]: 13: Hoare triple {22226#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {22226#(< ~counter~0 17)} is VALID [2022-04-15 09:24:13,876 INFO L290 TraceCheckUtils]: 12: Hoare triple {22281#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22226#(< ~counter~0 17)} is VALID [2022-04-15 09:24:13,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {22281#(< ~counter~0 16)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {22281#(< ~counter~0 16)} is VALID [2022-04-15 09:24:13,877 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21725#true} {22281#(< ~counter~0 16)} #80#return; {22281#(< ~counter~0 16)} is VALID [2022-04-15 09:24:13,877 INFO L290 TraceCheckUtils]: 9: Hoare triple {21725#true} assume true; {21725#true} is VALID [2022-04-15 09:24:13,877 INFO L290 TraceCheckUtils]: 8: Hoare triple {21725#true} assume !(0 == ~cond); {21725#true} is VALID [2022-04-15 09:24:13,877 INFO L290 TraceCheckUtils]: 7: Hoare triple {21725#true} ~cond := #in~cond; {21725#true} is VALID [2022-04-15 09:24:13,878 INFO L272 TraceCheckUtils]: 6: Hoare triple {22281#(< ~counter~0 16)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {21725#true} is VALID [2022-04-15 09:24:13,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {22281#(< ~counter~0 16)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {22281#(< ~counter~0 16)} is VALID [2022-04-15 09:24:13,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {22281#(< ~counter~0 16)} call #t~ret8 := main(); {22281#(< ~counter~0 16)} is VALID [2022-04-15 09:24:13,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22281#(< ~counter~0 16)} {21725#true} #96#return; {22281#(< ~counter~0 16)} is VALID [2022-04-15 09:24:13,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {22281#(< ~counter~0 16)} assume true; {22281#(< ~counter~0 16)} is VALID [2022-04-15 09:24:13,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {21725#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {22281#(< ~counter~0 16)} is VALID [2022-04-15 09:24:13,879 INFO L272 TraceCheckUtils]: 0: Hoare triple {21725#true} call ULTIMATE.init(); {21725#true} is VALID [2022-04-15 09:24:13,880 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 26 proven. 44 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-15 09:24:13,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:24:13,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859545425] [2022-04-15 09:24:13,880 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:24:13,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261212139] [2022-04-15 09:24:13,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261212139] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:24:13,880 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:24:13,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-15 09:24:13,881 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:24:13,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1368512594] [2022-04-15 09:24:13,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1368512594] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:24:13,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:24:13,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 09:24:13,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628540218] [2022-04-15 09:24:13,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:24:13,881 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (17), 7 states have call predecessors, (17), 6 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) Word has length 97 [2022-04-15 09:24:13,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:24:13,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (17), 7 states have call predecessors, (17), 6 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) [2022-04-15 09:24:13,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:24:13,950 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 09:24:13,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:24:13,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 09:24:13,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-15 09:24:13,951 INFO L87 Difference]: Start difference. First operand 180 states and 207 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (17), 7 states have call predecessors, (17), 6 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) [2022-04-15 09:24:14,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:24:14,478 INFO L93 Difference]: Finished difference Result 225 states and 269 transitions. [2022-04-15 09:24:14,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 09:24:14,478 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (17), 7 states have call predecessors, (17), 6 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) Word has length 97 [2022-04-15 09:24:14,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:24:14,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (17), 7 states have call predecessors, (17), 6 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) [2022-04-15 09:24:14,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 123 transitions. [2022-04-15 09:24:14,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (17), 7 states have call predecessors, (17), 6 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) [2022-04-15 09:24:14,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 123 transitions. [2022-04-15 09:24:14,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 123 transitions. [2022-04-15 09:24:14,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:24:14,615 INFO L225 Difference]: With dead ends: 225 [2022-04-15 09:24:14,615 INFO L226 Difference]: Without dead ends: 182 [2022-04-15 09:24:14,615 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=183, Unknown=0, NotChecked=0, Total=306 [2022-04-15 09:24:14,615 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 15 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 09:24:14,616 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 188 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 09:24:14,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-04-15 09:24:14,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2022-04-15 09:24:14,775 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:24:14,775 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand has 182 states, 119 states have (on average 1.1428571428571428) internal successors, (136), 125 states have internal predecessors, (136), 38 states have call successors, (38), 25 states have call predecessors, (38), 24 states have return successors, (35), 31 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-15 09:24:14,775 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand has 182 states, 119 states have (on average 1.1428571428571428) internal successors, (136), 125 states have internal predecessors, (136), 38 states have call successors, (38), 25 states have call predecessors, (38), 24 states have return successors, (35), 31 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-15 09:24:14,777 INFO L87 Difference]: Start difference. First operand 182 states. Second operand has 182 states, 119 states have (on average 1.1428571428571428) internal successors, (136), 125 states have internal predecessors, (136), 38 states have call successors, (38), 25 states have call predecessors, (38), 24 states have return successors, (35), 31 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-15 09:24:14,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:24:14,781 INFO L93 Difference]: Finished difference Result 182 states and 209 transitions. [2022-04-15 09:24:14,781 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 209 transitions. [2022-04-15 09:24:14,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:24:14,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:24:14,781 INFO L74 IsIncluded]: Start isIncluded. First operand has 182 states, 119 states have (on average 1.1428571428571428) internal successors, (136), 125 states have internal predecessors, (136), 38 states have call successors, (38), 25 states have call predecessors, (38), 24 states have return successors, (35), 31 states have call predecessors, (35), 35 states have call successors, (35) Second operand 182 states. [2022-04-15 09:24:14,782 INFO L87 Difference]: Start difference. First operand has 182 states, 119 states have (on average 1.1428571428571428) internal successors, (136), 125 states have internal predecessors, (136), 38 states have call successors, (38), 25 states have call predecessors, (38), 24 states have return successors, (35), 31 states have call predecessors, (35), 35 states have call successors, (35) Second operand 182 states. [2022-04-15 09:24:14,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:24:14,785 INFO L93 Difference]: Finished difference Result 182 states and 209 transitions. [2022-04-15 09:24:14,785 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 209 transitions. [2022-04-15 09:24:14,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:24:14,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:24:14,786 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:24:14,786 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:24:14,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 119 states have (on average 1.1428571428571428) internal successors, (136), 125 states have internal predecessors, (136), 38 states have call successors, (38), 25 states have call predecessors, (38), 24 states have return successors, (35), 31 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-15 09:24:14,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 209 transitions. [2022-04-15 09:24:14,790 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 209 transitions. Word has length 97 [2022-04-15 09:24:14,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:24:14,790 INFO L478 AbstractCegarLoop]: Abstraction has 182 states and 209 transitions. [2022-04-15 09:24:14,790 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (17), 7 states have call predecessors, (17), 6 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) [2022-04-15 09:24:14,790 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 182 states and 209 transitions. [2022-04-15 09:24:17,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 209 edges. 208 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 09:24:17,158 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 209 transitions. [2022-04-15 09:24:17,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-15 09:24:17,159 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:24:17,159 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:24:17,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-15 09:24:17,359 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:24:17,360 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:24:17,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:24:17,360 INFO L85 PathProgramCache]: Analyzing trace with hash -545719131, now seen corresponding path program 5 times [2022-04-15 09:24:17,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:24:17,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1017046470] [2022-04-15 09:24:25,508 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:24:25,508 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:24:25,508 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:24:25,508 INFO L85 PathProgramCache]: Analyzing trace with hash -545719131, now seen corresponding path program 6 times [2022-04-15 09:24:25,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:24:25,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071771204] [2022-04-15 09:24:25,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:24:25,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:24:25,518 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:24:25,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1078189515] [2022-04-15 09:24:25,518 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 09:24:25,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:24:25,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:24:25,519 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:24:25,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-15 09:24:25,671 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 09:24:25,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:24:25,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 09:24:25,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:24:25,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:24:26,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {23506#true} call ULTIMATE.init(); {23506#true} is VALID [2022-04-15 09:24:26,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {23506#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {23514#(<= ~counter~0 0)} is VALID [2022-04-15 09:24:26,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {23514#(<= ~counter~0 0)} assume true; {23514#(<= ~counter~0 0)} is VALID [2022-04-15 09:24:26,070 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23514#(<= ~counter~0 0)} {23506#true} #96#return; {23514#(<= ~counter~0 0)} is VALID [2022-04-15 09:24:26,070 INFO L272 TraceCheckUtils]: 4: Hoare triple {23514#(<= ~counter~0 0)} call #t~ret8 := main(); {23514#(<= ~counter~0 0)} is VALID [2022-04-15 09:24:26,070 INFO L290 TraceCheckUtils]: 5: Hoare triple {23514#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {23514#(<= ~counter~0 0)} is VALID [2022-04-15 09:24:26,071 INFO L272 TraceCheckUtils]: 6: Hoare triple {23514#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {23514#(<= ~counter~0 0)} is VALID [2022-04-15 09:24:26,071 INFO L290 TraceCheckUtils]: 7: Hoare triple {23514#(<= ~counter~0 0)} ~cond := #in~cond; {23514#(<= ~counter~0 0)} is VALID [2022-04-15 09:24:26,071 INFO L290 TraceCheckUtils]: 8: Hoare triple {23514#(<= ~counter~0 0)} assume !(0 == ~cond); {23514#(<= ~counter~0 0)} is VALID [2022-04-15 09:24:26,071 INFO L290 TraceCheckUtils]: 9: Hoare triple {23514#(<= ~counter~0 0)} assume true; {23514#(<= ~counter~0 0)} is VALID [2022-04-15 09:24:26,072 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23514#(<= ~counter~0 0)} {23514#(<= ~counter~0 0)} #80#return; {23514#(<= ~counter~0 0)} is VALID [2022-04-15 09:24:26,072 INFO L290 TraceCheckUtils]: 11: Hoare triple {23514#(<= ~counter~0 0)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {23514#(<= ~counter~0 0)} is VALID [2022-04-15 09:24:26,073 INFO L290 TraceCheckUtils]: 12: Hoare triple {23514#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23548#(<= ~counter~0 1)} is VALID [2022-04-15 09:24:26,073 INFO L290 TraceCheckUtils]: 13: Hoare triple {23548#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {23548#(<= ~counter~0 1)} is VALID [2022-04-15 09:24:26,074 INFO L272 TraceCheckUtils]: 14: Hoare triple {23548#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {23548#(<= ~counter~0 1)} is VALID [2022-04-15 09:24:26,074 INFO L290 TraceCheckUtils]: 15: Hoare triple {23548#(<= ~counter~0 1)} ~cond := #in~cond; {23548#(<= ~counter~0 1)} is VALID [2022-04-15 09:24:26,074 INFO L290 TraceCheckUtils]: 16: Hoare triple {23548#(<= ~counter~0 1)} assume !(0 == ~cond); {23548#(<= ~counter~0 1)} is VALID [2022-04-15 09:24:26,075 INFO L290 TraceCheckUtils]: 17: Hoare triple {23548#(<= ~counter~0 1)} assume true; {23548#(<= ~counter~0 1)} is VALID [2022-04-15 09:24:26,075 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {23548#(<= ~counter~0 1)} {23548#(<= ~counter~0 1)} #82#return; {23548#(<= ~counter~0 1)} is VALID [2022-04-15 09:24:26,075 INFO L272 TraceCheckUtils]: 19: Hoare triple {23548#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {23548#(<= ~counter~0 1)} is VALID [2022-04-15 09:24:26,076 INFO L290 TraceCheckUtils]: 20: Hoare triple {23548#(<= ~counter~0 1)} ~cond := #in~cond; {23548#(<= ~counter~0 1)} is VALID [2022-04-15 09:24:26,076 INFO L290 TraceCheckUtils]: 21: Hoare triple {23548#(<= ~counter~0 1)} assume !(0 == ~cond); {23548#(<= ~counter~0 1)} is VALID [2022-04-15 09:24:26,076 INFO L290 TraceCheckUtils]: 22: Hoare triple {23548#(<= ~counter~0 1)} assume true; {23548#(<= ~counter~0 1)} is VALID [2022-04-15 09:24:26,077 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {23548#(<= ~counter~0 1)} {23548#(<= ~counter~0 1)} #84#return; {23548#(<= ~counter~0 1)} is VALID [2022-04-15 09:24:26,077 INFO L272 TraceCheckUtils]: 24: Hoare triple {23548#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {23548#(<= ~counter~0 1)} is VALID [2022-04-15 09:24:26,078 INFO L290 TraceCheckUtils]: 25: Hoare triple {23548#(<= ~counter~0 1)} ~cond := #in~cond; {23548#(<= ~counter~0 1)} is VALID [2022-04-15 09:24:26,078 INFO L290 TraceCheckUtils]: 26: Hoare triple {23548#(<= ~counter~0 1)} assume !(0 == ~cond); {23548#(<= ~counter~0 1)} is VALID [2022-04-15 09:24:26,078 INFO L290 TraceCheckUtils]: 27: Hoare triple {23548#(<= ~counter~0 1)} assume true; {23548#(<= ~counter~0 1)} is VALID [2022-04-15 09:24:26,079 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {23548#(<= ~counter~0 1)} {23548#(<= ~counter~0 1)} #86#return; {23548#(<= ~counter~0 1)} is VALID [2022-04-15 09:24:26,079 INFO L290 TraceCheckUtils]: 29: Hoare triple {23548#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {23548#(<= ~counter~0 1)} is VALID [2022-04-15 09:24:26,079 INFO L290 TraceCheckUtils]: 30: Hoare triple {23548#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23603#(<= ~counter~0 2)} is VALID [2022-04-15 09:24:26,080 INFO L290 TraceCheckUtils]: 31: Hoare triple {23603#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {23603#(<= ~counter~0 2)} is VALID [2022-04-15 09:24:26,080 INFO L272 TraceCheckUtils]: 32: Hoare triple {23603#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {23603#(<= ~counter~0 2)} is VALID [2022-04-15 09:24:26,080 INFO L290 TraceCheckUtils]: 33: Hoare triple {23603#(<= ~counter~0 2)} ~cond := #in~cond; {23603#(<= ~counter~0 2)} is VALID [2022-04-15 09:24:26,081 INFO L290 TraceCheckUtils]: 34: Hoare triple {23603#(<= ~counter~0 2)} assume !(0 == ~cond); {23603#(<= ~counter~0 2)} is VALID [2022-04-15 09:24:26,081 INFO L290 TraceCheckUtils]: 35: Hoare triple {23603#(<= ~counter~0 2)} assume true; {23603#(<= ~counter~0 2)} is VALID [2022-04-15 09:24:26,081 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {23603#(<= ~counter~0 2)} {23603#(<= ~counter~0 2)} #82#return; {23603#(<= ~counter~0 2)} is VALID [2022-04-15 09:24:26,082 INFO L272 TraceCheckUtils]: 37: Hoare triple {23603#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {23603#(<= ~counter~0 2)} is VALID [2022-04-15 09:24:26,082 INFO L290 TraceCheckUtils]: 38: Hoare triple {23603#(<= ~counter~0 2)} ~cond := #in~cond; {23603#(<= ~counter~0 2)} is VALID [2022-04-15 09:24:26,082 INFO L290 TraceCheckUtils]: 39: Hoare triple {23603#(<= ~counter~0 2)} assume !(0 == ~cond); {23603#(<= ~counter~0 2)} is VALID [2022-04-15 09:24:26,083 INFO L290 TraceCheckUtils]: 40: Hoare triple {23603#(<= ~counter~0 2)} assume true; {23603#(<= ~counter~0 2)} is VALID [2022-04-15 09:24:26,083 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {23603#(<= ~counter~0 2)} {23603#(<= ~counter~0 2)} #84#return; {23603#(<= ~counter~0 2)} is VALID [2022-04-15 09:24:26,084 INFO L272 TraceCheckUtils]: 42: Hoare triple {23603#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {23603#(<= ~counter~0 2)} is VALID [2022-04-15 09:24:26,084 INFO L290 TraceCheckUtils]: 43: Hoare triple {23603#(<= ~counter~0 2)} ~cond := #in~cond; {23603#(<= ~counter~0 2)} is VALID [2022-04-15 09:24:26,084 INFO L290 TraceCheckUtils]: 44: Hoare triple {23603#(<= ~counter~0 2)} assume !(0 == ~cond); {23603#(<= ~counter~0 2)} is VALID [2022-04-15 09:24:26,085 INFO L290 TraceCheckUtils]: 45: Hoare triple {23603#(<= ~counter~0 2)} assume true; {23603#(<= ~counter~0 2)} is VALID [2022-04-15 09:24:26,085 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {23603#(<= ~counter~0 2)} {23603#(<= ~counter~0 2)} #86#return; {23603#(<= ~counter~0 2)} is VALID [2022-04-15 09:24:26,085 INFO L290 TraceCheckUtils]: 47: Hoare triple {23603#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {23603#(<= ~counter~0 2)} is VALID [2022-04-15 09:24:26,086 INFO L290 TraceCheckUtils]: 48: Hoare triple {23603#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23658#(<= ~counter~0 3)} is VALID [2022-04-15 09:24:26,086 INFO L290 TraceCheckUtils]: 49: Hoare triple {23658#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {23658#(<= ~counter~0 3)} is VALID [2022-04-15 09:24:26,087 INFO L272 TraceCheckUtils]: 50: Hoare triple {23658#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {23658#(<= ~counter~0 3)} is VALID [2022-04-15 09:24:26,087 INFO L290 TraceCheckUtils]: 51: Hoare triple {23658#(<= ~counter~0 3)} ~cond := #in~cond; {23658#(<= ~counter~0 3)} is VALID [2022-04-15 09:24:26,087 INFO L290 TraceCheckUtils]: 52: Hoare triple {23658#(<= ~counter~0 3)} assume !(0 == ~cond); {23658#(<= ~counter~0 3)} is VALID [2022-04-15 09:24:26,087 INFO L290 TraceCheckUtils]: 53: Hoare triple {23658#(<= ~counter~0 3)} assume true; {23658#(<= ~counter~0 3)} is VALID [2022-04-15 09:24:26,088 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {23658#(<= ~counter~0 3)} {23658#(<= ~counter~0 3)} #82#return; {23658#(<= ~counter~0 3)} is VALID [2022-04-15 09:24:26,088 INFO L272 TraceCheckUtils]: 55: Hoare triple {23658#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {23658#(<= ~counter~0 3)} is VALID [2022-04-15 09:24:26,089 INFO L290 TraceCheckUtils]: 56: Hoare triple {23658#(<= ~counter~0 3)} ~cond := #in~cond; {23658#(<= ~counter~0 3)} is VALID [2022-04-15 09:24:26,089 INFO L290 TraceCheckUtils]: 57: Hoare triple {23658#(<= ~counter~0 3)} assume !(0 == ~cond); {23658#(<= ~counter~0 3)} is VALID [2022-04-15 09:24:26,089 INFO L290 TraceCheckUtils]: 58: Hoare triple {23658#(<= ~counter~0 3)} assume true; {23658#(<= ~counter~0 3)} is VALID [2022-04-15 09:24:26,090 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {23658#(<= ~counter~0 3)} {23658#(<= ~counter~0 3)} #84#return; {23658#(<= ~counter~0 3)} is VALID [2022-04-15 09:24:26,090 INFO L272 TraceCheckUtils]: 60: Hoare triple {23658#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {23658#(<= ~counter~0 3)} is VALID [2022-04-15 09:24:26,090 INFO L290 TraceCheckUtils]: 61: Hoare triple {23658#(<= ~counter~0 3)} ~cond := #in~cond; {23658#(<= ~counter~0 3)} is VALID [2022-04-15 09:24:26,091 INFO L290 TraceCheckUtils]: 62: Hoare triple {23658#(<= ~counter~0 3)} assume !(0 == ~cond); {23658#(<= ~counter~0 3)} is VALID [2022-04-15 09:24:26,091 INFO L290 TraceCheckUtils]: 63: Hoare triple {23658#(<= ~counter~0 3)} assume true; {23658#(<= ~counter~0 3)} is VALID [2022-04-15 09:24:26,091 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {23658#(<= ~counter~0 3)} {23658#(<= ~counter~0 3)} #86#return; {23658#(<= ~counter~0 3)} is VALID [2022-04-15 09:24:26,092 INFO L290 TraceCheckUtils]: 65: Hoare triple {23658#(<= ~counter~0 3)} assume !(~r~0 >= ~d~0); {23658#(<= ~counter~0 3)} is VALID [2022-04-15 09:24:26,092 INFO L290 TraceCheckUtils]: 66: Hoare triple {23658#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23713#(<= ~counter~0 4)} is VALID [2022-04-15 09:24:26,093 INFO L290 TraceCheckUtils]: 67: Hoare triple {23713#(<= ~counter~0 4)} assume !!(#t~post7 < 20);havoc #t~post7; {23713#(<= ~counter~0 4)} is VALID [2022-04-15 09:24:26,093 INFO L272 TraceCheckUtils]: 68: Hoare triple {23713#(<= ~counter~0 4)} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {23713#(<= ~counter~0 4)} is VALID [2022-04-15 09:24:26,093 INFO L290 TraceCheckUtils]: 69: Hoare triple {23713#(<= ~counter~0 4)} ~cond := #in~cond; {23713#(<= ~counter~0 4)} is VALID [2022-04-15 09:24:26,094 INFO L290 TraceCheckUtils]: 70: Hoare triple {23713#(<= ~counter~0 4)} assume !(0 == ~cond); {23713#(<= ~counter~0 4)} is VALID [2022-04-15 09:24:26,094 INFO L290 TraceCheckUtils]: 71: Hoare triple {23713#(<= ~counter~0 4)} assume true; {23713#(<= ~counter~0 4)} is VALID [2022-04-15 09:24:26,094 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {23713#(<= ~counter~0 4)} {23713#(<= ~counter~0 4)} #88#return; {23713#(<= ~counter~0 4)} is VALID [2022-04-15 09:24:26,095 INFO L272 TraceCheckUtils]: 73: Hoare triple {23713#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {23713#(<= ~counter~0 4)} is VALID [2022-04-15 09:24:26,095 INFO L290 TraceCheckUtils]: 74: Hoare triple {23713#(<= ~counter~0 4)} ~cond := #in~cond; {23713#(<= ~counter~0 4)} is VALID [2022-04-15 09:24:26,096 INFO L290 TraceCheckUtils]: 75: Hoare triple {23713#(<= ~counter~0 4)} assume !(0 == ~cond); {23713#(<= ~counter~0 4)} is VALID [2022-04-15 09:24:26,096 INFO L290 TraceCheckUtils]: 76: Hoare triple {23713#(<= ~counter~0 4)} assume true; {23713#(<= ~counter~0 4)} is VALID [2022-04-15 09:24:26,096 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {23713#(<= ~counter~0 4)} {23713#(<= ~counter~0 4)} #90#return; {23713#(<= ~counter~0 4)} is VALID [2022-04-15 09:24:26,097 INFO L290 TraceCheckUtils]: 78: Hoare triple {23713#(<= ~counter~0 4)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {23713#(<= ~counter~0 4)} is VALID [2022-04-15 09:24:26,097 INFO L290 TraceCheckUtils]: 79: Hoare triple {23713#(<= ~counter~0 4)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {23713#(<= ~counter~0 4)} is VALID [2022-04-15 09:24:26,097 INFO L290 TraceCheckUtils]: 80: Hoare triple {23713#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23756#(<= ~counter~0 5)} is VALID [2022-04-15 09:24:26,098 INFO L290 TraceCheckUtils]: 81: Hoare triple {23756#(<= ~counter~0 5)} assume !!(#t~post7 < 20);havoc #t~post7; {23756#(<= ~counter~0 5)} is VALID [2022-04-15 09:24:26,098 INFO L272 TraceCheckUtils]: 82: Hoare triple {23756#(<= ~counter~0 5)} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {23756#(<= ~counter~0 5)} is VALID [2022-04-15 09:24:26,099 INFO L290 TraceCheckUtils]: 83: Hoare triple {23756#(<= ~counter~0 5)} ~cond := #in~cond; {23756#(<= ~counter~0 5)} is VALID [2022-04-15 09:24:26,099 INFO L290 TraceCheckUtils]: 84: Hoare triple {23756#(<= ~counter~0 5)} assume !(0 == ~cond); {23756#(<= ~counter~0 5)} is VALID [2022-04-15 09:24:26,099 INFO L290 TraceCheckUtils]: 85: Hoare triple {23756#(<= ~counter~0 5)} assume true; {23756#(<= ~counter~0 5)} is VALID [2022-04-15 09:24:26,100 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {23756#(<= ~counter~0 5)} {23756#(<= ~counter~0 5)} #88#return; {23756#(<= ~counter~0 5)} is VALID [2022-04-15 09:24:26,100 INFO L272 TraceCheckUtils]: 87: Hoare triple {23756#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {23756#(<= ~counter~0 5)} is VALID [2022-04-15 09:24:26,100 INFO L290 TraceCheckUtils]: 88: Hoare triple {23756#(<= ~counter~0 5)} ~cond := #in~cond; {23756#(<= ~counter~0 5)} is VALID [2022-04-15 09:24:26,101 INFO L290 TraceCheckUtils]: 89: Hoare triple {23756#(<= ~counter~0 5)} assume !(0 == ~cond); {23756#(<= ~counter~0 5)} is VALID [2022-04-15 09:24:26,101 INFO L290 TraceCheckUtils]: 90: Hoare triple {23756#(<= ~counter~0 5)} assume true; {23756#(<= ~counter~0 5)} is VALID [2022-04-15 09:24:26,101 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {23756#(<= ~counter~0 5)} {23756#(<= ~counter~0 5)} #90#return; {23756#(<= ~counter~0 5)} is VALID [2022-04-15 09:24:26,102 INFO L290 TraceCheckUtils]: 92: Hoare triple {23756#(<= ~counter~0 5)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {23756#(<= ~counter~0 5)} is VALID [2022-04-15 09:24:26,102 INFO L290 TraceCheckUtils]: 93: Hoare triple {23756#(<= ~counter~0 5)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {23756#(<= ~counter~0 5)} is VALID [2022-04-15 09:24:26,102 INFO L290 TraceCheckUtils]: 94: Hoare triple {23756#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23799#(<= |main_#t~post7| 5)} is VALID [2022-04-15 09:24:26,103 INFO L290 TraceCheckUtils]: 95: Hoare triple {23799#(<= |main_#t~post7| 5)} assume !(#t~post7 < 20);havoc #t~post7; {23507#false} is VALID [2022-04-15 09:24:26,103 INFO L272 TraceCheckUtils]: 96: Hoare triple {23507#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {23507#false} is VALID [2022-04-15 09:24:26,103 INFO L290 TraceCheckUtils]: 97: Hoare triple {23507#false} ~cond := #in~cond; {23507#false} is VALID [2022-04-15 09:24:26,103 INFO L290 TraceCheckUtils]: 98: Hoare triple {23507#false} assume 0 == ~cond; {23507#false} is VALID [2022-04-15 09:24:26,103 INFO L290 TraceCheckUtils]: 99: Hoare triple {23507#false} assume !false; {23507#false} is VALID [2022-04-15 09:24:26,104 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 26 proven. 296 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-15 09:24:26,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:24:26,489 INFO L290 TraceCheckUtils]: 99: Hoare triple {23507#false} assume !false; {23507#false} is VALID [2022-04-15 09:24:26,490 INFO L290 TraceCheckUtils]: 98: Hoare triple {23507#false} assume 0 == ~cond; {23507#false} is VALID [2022-04-15 09:24:26,490 INFO L290 TraceCheckUtils]: 97: Hoare triple {23507#false} ~cond := #in~cond; {23507#false} is VALID [2022-04-15 09:24:26,490 INFO L272 TraceCheckUtils]: 96: Hoare triple {23507#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {23507#false} is VALID [2022-04-15 09:24:26,490 INFO L290 TraceCheckUtils]: 95: Hoare triple {23827#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {23507#false} is VALID [2022-04-15 09:24:26,491 INFO L290 TraceCheckUtils]: 94: Hoare triple {23831#(< ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23827#(< |main_#t~post7| 20)} is VALID [2022-04-15 09:24:26,491 INFO L290 TraceCheckUtils]: 93: Hoare triple {23831#(< ~counter~0 20)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {23831#(< ~counter~0 20)} is VALID [2022-04-15 09:24:26,491 INFO L290 TraceCheckUtils]: 92: Hoare triple {23831#(< ~counter~0 20)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {23831#(< ~counter~0 20)} is VALID [2022-04-15 09:24:26,492 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {23506#true} {23831#(< ~counter~0 20)} #90#return; {23831#(< ~counter~0 20)} is VALID [2022-04-15 09:24:26,492 INFO L290 TraceCheckUtils]: 90: Hoare triple {23506#true} assume true; {23506#true} is VALID [2022-04-15 09:24:26,492 INFO L290 TraceCheckUtils]: 89: Hoare triple {23506#true} assume !(0 == ~cond); {23506#true} is VALID [2022-04-15 09:24:26,492 INFO L290 TraceCheckUtils]: 88: Hoare triple {23506#true} ~cond := #in~cond; {23506#true} is VALID [2022-04-15 09:24:26,492 INFO L272 TraceCheckUtils]: 87: Hoare triple {23831#(< ~counter~0 20)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {23506#true} is VALID [2022-04-15 09:24:26,493 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {23506#true} {23831#(< ~counter~0 20)} #88#return; {23831#(< ~counter~0 20)} is VALID [2022-04-15 09:24:26,493 INFO L290 TraceCheckUtils]: 85: Hoare triple {23506#true} assume true; {23506#true} is VALID [2022-04-15 09:24:26,493 INFO L290 TraceCheckUtils]: 84: Hoare triple {23506#true} assume !(0 == ~cond); {23506#true} is VALID [2022-04-15 09:24:26,493 INFO L290 TraceCheckUtils]: 83: Hoare triple {23506#true} ~cond := #in~cond; {23506#true} is VALID [2022-04-15 09:24:26,493 INFO L272 TraceCheckUtils]: 82: Hoare triple {23831#(< ~counter~0 20)} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {23506#true} is VALID [2022-04-15 09:24:26,493 INFO L290 TraceCheckUtils]: 81: Hoare triple {23831#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {23831#(< ~counter~0 20)} is VALID [2022-04-15 09:24:26,494 INFO L290 TraceCheckUtils]: 80: Hoare triple {23874#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23831#(< ~counter~0 20)} is VALID [2022-04-15 09:24:26,494 INFO L290 TraceCheckUtils]: 79: Hoare triple {23874#(< ~counter~0 19)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {23874#(< ~counter~0 19)} is VALID [2022-04-15 09:24:26,495 INFO L290 TraceCheckUtils]: 78: Hoare triple {23874#(< ~counter~0 19)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {23874#(< ~counter~0 19)} is VALID [2022-04-15 09:24:26,495 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {23506#true} {23874#(< ~counter~0 19)} #90#return; {23874#(< ~counter~0 19)} is VALID [2022-04-15 09:24:26,495 INFO L290 TraceCheckUtils]: 76: Hoare triple {23506#true} assume true; {23506#true} is VALID [2022-04-15 09:24:26,495 INFO L290 TraceCheckUtils]: 75: Hoare triple {23506#true} assume !(0 == ~cond); {23506#true} is VALID [2022-04-15 09:24:26,495 INFO L290 TraceCheckUtils]: 74: Hoare triple {23506#true} ~cond := #in~cond; {23506#true} is VALID [2022-04-15 09:24:26,496 INFO L272 TraceCheckUtils]: 73: Hoare triple {23874#(< ~counter~0 19)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {23506#true} is VALID [2022-04-15 09:24:26,496 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {23506#true} {23874#(< ~counter~0 19)} #88#return; {23874#(< ~counter~0 19)} is VALID [2022-04-15 09:24:26,496 INFO L290 TraceCheckUtils]: 71: Hoare triple {23506#true} assume true; {23506#true} is VALID [2022-04-15 09:24:26,496 INFO L290 TraceCheckUtils]: 70: Hoare triple {23506#true} assume !(0 == ~cond); {23506#true} is VALID [2022-04-15 09:24:26,496 INFO L290 TraceCheckUtils]: 69: Hoare triple {23506#true} ~cond := #in~cond; {23506#true} is VALID [2022-04-15 09:24:26,496 INFO L272 TraceCheckUtils]: 68: Hoare triple {23874#(< ~counter~0 19)} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {23506#true} is VALID [2022-04-15 09:24:26,497 INFO L290 TraceCheckUtils]: 67: Hoare triple {23874#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {23874#(< ~counter~0 19)} is VALID [2022-04-15 09:24:26,497 INFO L290 TraceCheckUtils]: 66: Hoare triple {23917#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23874#(< ~counter~0 19)} is VALID [2022-04-15 09:24:26,498 INFO L290 TraceCheckUtils]: 65: Hoare triple {23917#(< ~counter~0 18)} assume !(~r~0 >= ~d~0); {23917#(< ~counter~0 18)} is VALID [2022-04-15 09:24:26,498 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {23506#true} {23917#(< ~counter~0 18)} #86#return; {23917#(< ~counter~0 18)} is VALID [2022-04-15 09:24:26,498 INFO L290 TraceCheckUtils]: 63: Hoare triple {23506#true} assume true; {23506#true} is VALID [2022-04-15 09:24:26,498 INFO L290 TraceCheckUtils]: 62: Hoare triple {23506#true} assume !(0 == ~cond); {23506#true} is VALID [2022-04-15 09:24:26,498 INFO L290 TraceCheckUtils]: 61: Hoare triple {23506#true} ~cond := #in~cond; {23506#true} is VALID [2022-04-15 09:24:26,498 INFO L272 TraceCheckUtils]: 60: Hoare triple {23917#(< ~counter~0 18)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {23506#true} is VALID [2022-04-15 09:24:26,499 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {23506#true} {23917#(< ~counter~0 18)} #84#return; {23917#(< ~counter~0 18)} is VALID [2022-04-15 09:24:26,499 INFO L290 TraceCheckUtils]: 58: Hoare triple {23506#true} assume true; {23506#true} is VALID [2022-04-15 09:24:26,499 INFO L290 TraceCheckUtils]: 57: Hoare triple {23506#true} assume !(0 == ~cond); {23506#true} is VALID [2022-04-15 09:24:26,499 INFO L290 TraceCheckUtils]: 56: Hoare triple {23506#true} ~cond := #in~cond; {23506#true} is VALID [2022-04-15 09:24:26,499 INFO L272 TraceCheckUtils]: 55: Hoare triple {23917#(< ~counter~0 18)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {23506#true} is VALID [2022-04-15 09:24:26,500 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {23506#true} {23917#(< ~counter~0 18)} #82#return; {23917#(< ~counter~0 18)} is VALID [2022-04-15 09:24:26,500 INFO L290 TraceCheckUtils]: 53: Hoare triple {23506#true} assume true; {23506#true} is VALID [2022-04-15 09:24:26,500 INFO L290 TraceCheckUtils]: 52: Hoare triple {23506#true} assume !(0 == ~cond); {23506#true} is VALID [2022-04-15 09:24:26,500 INFO L290 TraceCheckUtils]: 51: Hoare triple {23506#true} ~cond := #in~cond; {23506#true} is VALID [2022-04-15 09:24:26,500 INFO L272 TraceCheckUtils]: 50: Hoare triple {23917#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {23506#true} is VALID [2022-04-15 09:24:26,500 INFO L290 TraceCheckUtils]: 49: Hoare triple {23917#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {23917#(< ~counter~0 18)} is VALID [2022-04-15 09:24:26,501 INFO L290 TraceCheckUtils]: 48: Hoare triple {23972#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23917#(< ~counter~0 18)} is VALID [2022-04-15 09:24:26,501 INFO L290 TraceCheckUtils]: 47: Hoare triple {23972#(< ~counter~0 17)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {23972#(< ~counter~0 17)} is VALID [2022-04-15 09:24:26,502 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {23506#true} {23972#(< ~counter~0 17)} #86#return; {23972#(< ~counter~0 17)} is VALID [2022-04-15 09:24:26,502 INFO L290 TraceCheckUtils]: 45: Hoare triple {23506#true} assume true; {23506#true} is VALID [2022-04-15 09:24:26,502 INFO L290 TraceCheckUtils]: 44: Hoare triple {23506#true} assume !(0 == ~cond); {23506#true} is VALID [2022-04-15 09:24:26,502 INFO L290 TraceCheckUtils]: 43: Hoare triple {23506#true} ~cond := #in~cond; {23506#true} is VALID [2022-04-15 09:24:26,502 INFO L272 TraceCheckUtils]: 42: Hoare triple {23972#(< ~counter~0 17)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {23506#true} is VALID [2022-04-15 09:24:26,502 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {23506#true} {23972#(< ~counter~0 17)} #84#return; {23972#(< ~counter~0 17)} is VALID [2022-04-15 09:24:26,503 INFO L290 TraceCheckUtils]: 40: Hoare triple {23506#true} assume true; {23506#true} is VALID [2022-04-15 09:24:26,503 INFO L290 TraceCheckUtils]: 39: Hoare triple {23506#true} assume !(0 == ~cond); {23506#true} is VALID [2022-04-15 09:24:26,503 INFO L290 TraceCheckUtils]: 38: Hoare triple {23506#true} ~cond := #in~cond; {23506#true} is VALID [2022-04-15 09:24:26,503 INFO L272 TraceCheckUtils]: 37: Hoare triple {23972#(< ~counter~0 17)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {23506#true} is VALID [2022-04-15 09:24:26,503 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {23506#true} {23972#(< ~counter~0 17)} #82#return; {23972#(< ~counter~0 17)} is VALID [2022-04-15 09:24:26,503 INFO L290 TraceCheckUtils]: 35: Hoare triple {23506#true} assume true; {23506#true} is VALID [2022-04-15 09:24:26,503 INFO L290 TraceCheckUtils]: 34: Hoare triple {23506#true} assume !(0 == ~cond); {23506#true} is VALID [2022-04-15 09:24:26,504 INFO L290 TraceCheckUtils]: 33: Hoare triple {23506#true} ~cond := #in~cond; {23506#true} is VALID [2022-04-15 09:24:26,504 INFO L272 TraceCheckUtils]: 32: Hoare triple {23972#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {23506#true} is VALID [2022-04-15 09:24:26,504 INFO L290 TraceCheckUtils]: 31: Hoare triple {23972#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {23972#(< ~counter~0 17)} is VALID [2022-04-15 09:24:26,504 INFO L290 TraceCheckUtils]: 30: Hoare triple {24027#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23972#(< ~counter~0 17)} is VALID [2022-04-15 09:24:26,505 INFO L290 TraceCheckUtils]: 29: Hoare triple {24027#(< ~counter~0 16)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {24027#(< ~counter~0 16)} is VALID [2022-04-15 09:24:26,505 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {23506#true} {24027#(< ~counter~0 16)} #86#return; {24027#(< ~counter~0 16)} is VALID [2022-04-15 09:24:26,505 INFO L290 TraceCheckUtils]: 27: Hoare triple {23506#true} assume true; {23506#true} is VALID [2022-04-15 09:24:26,505 INFO L290 TraceCheckUtils]: 26: Hoare triple {23506#true} assume !(0 == ~cond); {23506#true} is VALID [2022-04-15 09:24:26,505 INFO L290 TraceCheckUtils]: 25: Hoare triple {23506#true} ~cond := #in~cond; {23506#true} is VALID [2022-04-15 09:24:26,506 INFO L272 TraceCheckUtils]: 24: Hoare triple {24027#(< ~counter~0 16)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {23506#true} is VALID [2022-04-15 09:24:26,506 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {23506#true} {24027#(< ~counter~0 16)} #84#return; {24027#(< ~counter~0 16)} is VALID [2022-04-15 09:24:26,506 INFO L290 TraceCheckUtils]: 22: Hoare triple {23506#true} assume true; {23506#true} is VALID [2022-04-15 09:24:26,506 INFO L290 TraceCheckUtils]: 21: Hoare triple {23506#true} assume !(0 == ~cond); {23506#true} is VALID [2022-04-15 09:24:26,506 INFO L290 TraceCheckUtils]: 20: Hoare triple {23506#true} ~cond := #in~cond; {23506#true} is VALID [2022-04-15 09:24:26,506 INFO L272 TraceCheckUtils]: 19: Hoare triple {24027#(< ~counter~0 16)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {23506#true} is VALID [2022-04-15 09:24:26,507 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {23506#true} {24027#(< ~counter~0 16)} #82#return; {24027#(< ~counter~0 16)} is VALID [2022-04-15 09:24:26,507 INFO L290 TraceCheckUtils]: 17: Hoare triple {23506#true} assume true; {23506#true} is VALID [2022-04-15 09:24:26,507 INFO L290 TraceCheckUtils]: 16: Hoare triple {23506#true} assume !(0 == ~cond); {23506#true} is VALID [2022-04-15 09:24:26,507 INFO L290 TraceCheckUtils]: 15: Hoare triple {23506#true} ~cond := #in~cond; {23506#true} is VALID [2022-04-15 09:24:26,507 INFO L272 TraceCheckUtils]: 14: Hoare triple {24027#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {23506#true} is VALID [2022-04-15 09:24:26,507 INFO L290 TraceCheckUtils]: 13: Hoare triple {24027#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {24027#(< ~counter~0 16)} is VALID [2022-04-15 09:24:26,508 INFO L290 TraceCheckUtils]: 12: Hoare triple {24082#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24027#(< ~counter~0 16)} is VALID [2022-04-15 09:24:26,508 INFO L290 TraceCheckUtils]: 11: Hoare triple {24082#(< ~counter~0 15)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {24082#(< ~counter~0 15)} is VALID [2022-04-15 09:24:26,509 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23506#true} {24082#(< ~counter~0 15)} #80#return; {24082#(< ~counter~0 15)} is VALID [2022-04-15 09:24:26,509 INFO L290 TraceCheckUtils]: 9: Hoare triple {23506#true} assume true; {23506#true} is VALID [2022-04-15 09:24:26,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {23506#true} assume !(0 == ~cond); {23506#true} is VALID [2022-04-15 09:24:26,509 INFO L290 TraceCheckUtils]: 7: Hoare triple {23506#true} ~cond := #in~cond; {23506#true} is VALID [2022-04-15 09:24:26,509 INFO L272 TraceCheckUtils]: 6: Hoare triple {24082#(< ~counter~0 15)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {23506#true} is VALID [2022-04-15 09:24:26,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {24082#(< ~counter~0 15)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {24082#(< ~counter~0 15)} is VALID [2022-04-15 09:24:26,510 INFO L272 TraceCheckUtils]: 4: Hoare triple {24082#(< ~counter~0 15)} call #t~ret8 := main(); {24082#(< ~counter~0 15)} is VALID [2022-04-15 09:24:26,510 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24082#(< ~counter~0 15)} {23506#true} #96#return; {24082#(< ~counter~0 15)} is VALID [2022-04-15 09:24:26,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {24082#(< ~counter~0 15)} assume true; {24082#(< ~counter~0 15)} is VALID [2022-04-15 09:24:26,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {23506#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {24082#(< ~counter~0 15)} is VALID [2022-04-15 09:24:26,511 INFO L272 TraceCheckUtils]: 0: Hoare triple {23506#true} call ULTIMATE.init(); {23506#true} is VALID [2022-04-15 09:24:26,511 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 26 proven. 28 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-15 09:24:26,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:24:26,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071771204] [2022-04-15 09:24:26,512 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:24:26,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078189515] [2022-04-15 09:24:26,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078189515] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:24:26,512 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:24:26,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-15 09:24:26,512 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:24:26,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1017046470] [2022-04-15 09:24:26,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1017046470] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:24:26,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:24:26,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 09:24:26,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339985075] [2022-04-15 09:24:26,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:24:26,513 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (17), 8 states have call predecessors, (17), 6 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) Word has length 100 [2022-04-15 09:24:26,513 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:24:26,513 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (17), 8 states have call predecessors, (17), 6 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) [2022-04-15 09:24:26,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:24:26,577 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 09:24:26,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:24:26,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 09:24:26,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-15 09:24:26,578 INFO L87 Difference]: Start difference. First operand 182 states and 209 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (17), 8 states have call predecessors, (17), 6 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) [2022-04-15 09:24:27,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:24:27,289 INFO L93 Difference]: Finished difference Result 243 states and 275 transitions. [2022-04-15 09:24:27,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 09:24:27,289 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (17), 8 states have call predecessors, (17), 6 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) Word has length 100 [2022-04-15 09:24:27,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:24:27,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (17), 8 states have call predecessors, (17), 6 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) [2022-04-15 09:24:27,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 140 transitions. [2022-04-15 09:24:27,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (17), 8 states have call predecessors, (17), 6 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) [2022-04-15 09:24:27,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 140 transitions. [2022-04-15 09:24:27,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 140 transitions. [2022-04-15 09:24:27,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:24:27,406 INFO L225 Difference]: With dead ends: 243 [2022-04-15 09:24:27,406 INFO L226 Difference]: Without dead ends: 227 [2022-04-15 09:24:27,407 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=186, Unknown=0, NotChecked=0, Total=306 [2022-04-15 09:24:27,407 INFO L913 BasicCegarLoop]: 61 mSDtfsCounter, 44 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 09:24:27,407 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 228 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 09:24:27,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-04-15 09:24:27,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2022-04-15 09:24:27,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:24:27,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 227 states. Second operand has 224 states, 148 states have (on average 1.1216216216216217) internal successors, (166), 154 states have internal predecessors, (166), 45 states have call successors, (45), 32 states have call predecessors, (45), 30 states have return successors, (41), 37 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-15 09:24:27,650 INFO L74 IsIncluded]: Start isIncluded. First operand 227 states. Second operand has 224 states, 148 states have (on average 1.1216216216216217) internal successors, (166), 154 states have internal predecessors, (166), 45 states have call successors, (45), 32 states have call predecessors, (45), 30 states have return successors, (41), 37 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-15 09:24:27,650 INFO L87 Difference]: Start difference. First operand 227 states. Second operand has 224 states, 148 states have (on average 1.1216216216216217) internal successors, (166), 154 states have internal predecessors, (166), 45 states have call successors, (45), 32 states have call predecessors, (45), 30 states have return successors, (41), 37 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-15 09:24:27,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:24:27,654 INFO L93 Difference]: Finished difference Result 227 states and 254 transitions. [2022-04-15 09:24:27,654 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 254 transitions. [2022-04-15 09:24:27,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:24:27,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:24:27,655 INFO L74 IsIncluded]: Start isIncluded. First operand has 224 states, 148 states have (on average 1.1216216216216217) internal successors, (166), 154 states have internal predecessors, (166), 45 states have call successors, (45), 32 states have call predecessors, (45), 30 states have return successors, (41), 37 states have call predecessors, (41), 41 states have call successors, (41) Second operand 227 states. [2022-04-15 09:24:27,655 INFO L87 Difference]: Start difference. First operand has 224 states, 148 states have (on average 1.1216216216216217) internal successors, (166), 154 states have internal predecessors, (166), 45 states have call successors, (45), 32 states have call predecessors, (45), 30 states have return successors, (41), 37 states have call predecessors, (41), 41 states have call successors, (41) Second operand 227 states. [2022-04-15 09:24:27,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:24:27,658 INFO L93 Difference]: Finished difference Result 227 states and 254 transitions. [2022-04-15 09:24:27,658 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 254 transitions. [2022-04-15 09:24:27,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:24:27,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:24:27,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:24:27,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:24:27,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 148 states have (on average 1.1216216216216217) internal successors, (166), 154 states have internal predecessors, (166), 45 states have call successors, (45), 32 states have call predecessors, (45), 30 states have return successors, (41), 37 states have call predecessors, (41), 41 states have call successors, (41) [2022-04-15 09:24:27,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 252 transitions. [2022-04-15 09:24:27,662 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 252 transitions. Word has length 100 [2022-04-15 09:24:27,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:24:27,662 INFO L478 AbstractCegarLoop]: Abstraction has 224 states and 252 transitions. [2022-04-15 09:24:27,662 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 8 states have call successors, (17), 8 states have call predecessors, (17), 6 states have return successors, (15), 6 states have call predecessors, (15), 7 states have call successors, (15) [2022-04-15 09:24:27,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 224 states and 252 transitions. [2022-04-15 09:24:30,030 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 252 edges. 251 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 09:24:30,031 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 252 transitions. [2022-04-15 09:24:30,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-15 09:24:30,031 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:24:30,031 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:24:30,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-04-15 09:24:30,232 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-04-15 09:24:30,232 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:24:30,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:24:30,233 INFO L85 PathProgramCache]: Analyzing trace with hash -543991253, now seen corresponding path program 11 times [2022-04-15 09:24:30,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:24:30,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [882063892] [2022-04-15 09:24:35,691 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:24:35,691 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:24:35,691 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:24:35,691 INFO L85 PathProgramCache]: Analyzing trace with hash -543991253, now seen corresponding path program 12 times [2022-04-15 09:24:35,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:24:35,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330087694] [2022-04-15 09:24:35,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:24:35,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:24:35,701 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:24:35,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1683048730] [2022-04-15 09:24:35,701 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 09:24:35,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:24:35,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:24:35,703 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:24:35,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-15 09:24:35,834 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 09:24:35,834 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:24:35,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-15 09:24:35,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:24:35,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:24:37,945 INFO L272 TraceCheckUtils]: 0: Hoare triple {25513#true} call ULTIMATE.init(); {25513#true} is VALID [2022-04-15 09:24:37,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {25513#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {25513#true} is VALID [2022-04-15 09:24:37,946 INFO L290 TraceCheckUtils]: 2: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-15 09:24:37,946 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25513#true} {25513#true} #96#return; {25513#true} is VALID [2022-04-15 09:24:37,946 INFO L272 TraceCheckUtils]: 4: Hoare triple {25513#true} call #t~ret8 := main(); {25513#true} is VALID [2022-04-15 09:24:37,946 INFO L290 TraceCheckUtils]: 5: Hoare triple {25513#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {25513#true} is VALID [2022-04-15 09:24:37,946 INFO L272 TraceCheckUtils]: 6: Hoare triple {25513#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {25513#true} is VALID [2022-04-15 09:24:37,947 INFO L290 TraceCheckUtils]: 7: Hoare triple {25513#true} ~cond := #in~cond; {25539#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 09:24:37,947 INFO L290 TraceCheckUtils]: 8: Hoare triple {25539#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {25543#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 09:24:37,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {25543#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {25543#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 09:24:37,948 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {25543#(not (= |assume_abort_if_not_#in~cond| 0))} {25513#true} #80#return; {25550#(<= 1 (mod main_~B~0 4294967296))} is VALID [2022-04-15 09:24:37,948 INFO L290 TraceCheckUtils]: 11: Hoare triple {25550#(<= 1 (mod main_~B~0 4294967296))} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {25554#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 09:24:37,948 INFO L290 TraceCheckUtils]: 12: Hoare triple {25554#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25554#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 09:24:37,949 INFO L290 TraceCheckUtils]: 13: Hoare triple {25554#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {25554#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 09:24:37,949 INFO L272 TraceCheckUtils]: 14: Hoare triple {25554#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {25513#true} is VALID [2022-04-15 09:24:37,949 INFO L290 TraceCheckUtils]: 15: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-15 09:24:37,949 INFO L290 TraceCheckUtils]: 16: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-15 09:24:37,949 INFO L290 TraceCheckUtils]: 17: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-15 09:24:37,950 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {25513#true} {25554#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} #82#return; {25554#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 09:24:37,950 INFO L272 TraceCheckUtils]: 19: Hoare triple {25554#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {25513#true} is VALID [2022-04-15 09:24:37,950 INFO L290 TraceCheckUtils]: 20: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-15 09:24:37,950 INFO L290 TraceCheckUtils]: 21: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-15 09:24:37,950 INFO L290 TraceCheckUtils]: 22: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-15 09:24:37,951 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {25513#true} {25554#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} #84#return; {25554#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 09:24:37,951 INFO L272 TraceCheckUtils]: 24: Hoare triple {25554#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {25513#true} is VALID [2022-04-15 09:24:37,951 INFO L290 TraceCheckUtils]: 25: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-15 09:24:37,951 INFO L290 TraceCheckUtils]: 26: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-15 09:24:37,951 INFO L290 TraceCheckUtils]: 27: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-15 09:24:37,952 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {25513#true} {25554#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} #86#return; {25554#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 09:24:37,953 INFO L290 TraceCheckUtils]: 29: Hoare triple {25554#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {25609#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-15 09:24:37,954 INFO L290 TraceCheckUtils]: 30: Hoare triple {25609#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25609#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-15 09:24:37,954 INFO L290 TraceCheckUtils]: 31: Hoare triple {25609#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} assume !!(#t~post6 < 20);havoc #t~post6; {25609#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-15 09:24:37,954 INFO L272 TraceCheckUtils]: 32: Hoare triple {25609#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {25513#true} is VALID [2022-04-15 09:24:37,954 INFO L290 TraceCheckUtils]: 33: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-15 09:24:37,954 INFO L290 TraceCheckUtils]: 34: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-15 09:24:37,954 INFO L290 TraceCheckUtils]: 35: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-15 09:24:37,955 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {25513#true} {25609#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} #82#return; {25609#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-15 09:24:37,955 INFO L272 TraceCheckUtils]: 37: Hoare triple {25609#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {25513#true} is VALID [2022-04-15 09:24:37,955 INFO L290 TraceCheckUtils]: 38: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-15 09:24:37,955 INFO L290 TraceCheckUtils]: 39: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-15 09:24:37,955 INFO L290 TraceCheckUtils]: 40: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-15 09:24:37,956 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {25513#true} {25609#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} #84#return; {25609#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-15 09:24:37,956 INFO L272 TraceCheckUtils]: 42: Hoare triple {25609#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {25513#true} is VALID [2022-04-15 09:24:37,956 INFO L290 TraceCheckUtils]: 43: Hoare triple {25513#true} ~cond := #in~cond; {25652#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:24:37,957 INFO L290 TraceCheckUtils]: 44: Hoare triple {25652#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {25656#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:24:37,957 INFO L290 TraceCheckUtils]: 45: Hoare triple {25656#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25656#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:24:37,957 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {25656#(not (= |__VERIFIER_assert_#in~cond| 0))} {25609#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} #86#return; {25609#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-15 09:24:37,959 INFO L290 TraceCheckUtils]: 47: Hoare triple {25609#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {25666#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-15 09:24:37,959 INFO L290 TraceCheckUtils]: 48: Hoare triple {25666#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25666#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-15 09:24:37,960 INFO L290 TraceCheckUtils]: 49: Hoare triple {25666#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} assume !!(#t~post6 < 20);havoc #t~post6; {25666#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-15 09:24:37,960 INFO L272 TraceCheckUtils]: 50: Hoare triple {25666#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {25513#true} is VALID [2022-04-15 09:24:37,960 INFO L290 TraceCheckUtils]: 51: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-15 09:24:37,960 INFO L290 TraceCheckUtils]: 52: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-15 09:24:37,960 INFO L290 TraceCheckUtils]: 53: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-15 09:24:37,961 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {25513#true} {25666#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} #82#return; {25666#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-15 09:24:37,961 INFO L272 TraceCheckUtils]: 55: Hoare triple {25666#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {25513#true} is VALID [2022-04-15 09:24:37,961 INFO L290 TraceCheckUtils]: 56: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-15 09:24:37,961 INFO L290 TraceCheckUtils]: 57: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-15 09:24:37,961 INFO L290 TraceCheckUtils]: 58: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-15 09:24:37,962 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {25513#true} {25666#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} #84#return; {25666#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-15 09:24:37,962 INFO L272 TraceCheckUtils]: 60: Hoare triple {25666#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {25513#true} is VALID [2022-04-15 09:24:37,962 INFO L290 TraceCheckUtils]: 61: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-15 09:24:37,962 INFO L290 TraceCheckUtils]: 62: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-15 09:24:37,962 INFO L290 TraceCheckUtils]: 63: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-15 09:24:37,963 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {25513#true} {25666#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} #86#return; {25666#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-15 09:24:37,963 INFO L290 TraceCheckUtils]: 65: Hoare triple {25666#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} assume !(~r~0 >= ~d~0); {25666#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-15 09:24:37,963 INFO L290 TraceCheckUtils]: 66: Hoare triple {25666#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25666#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-15 09:24:37,964 INFO L290 TraceCheckUtils]: 67: Hoare triple {25666#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} assume !!(#t~post7 < 20);havoc #t~post7; {25666#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-15 09:24:37,964 INFO L272 TraceCheckUtils]: 68: Hoare triple {25666#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {25513#true} is VALID [2022-04-15 09:24:37,964 INFO L290 TraceCheckUtils]: 69: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-15 09:24:37,964 INFO L290 TraceCheckUtils]: 70: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-15 09:24:37,964 INFO L290 TraceCheckUtils]: 71: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-15 09:24:37,965 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {25513#true} {25666#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} #88#return; {25666#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-15 09:24:37,965 INFO L272 TraceCheckUtils]: 73: Hoare triple {25666#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {25513#true} is VALID [2022-04-15 09:24:37,965 INFO L290 TraceCheckUtils]: 74: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-15 09:24:37,965 INFO L290 TraceCheckUtils]: 75: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-15 09:24:37,965 INFO L290 TraceCheckUtils]: 76: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-15 09:24:37,966 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {25513#true} {25666#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} #90#return; {25666#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-15 09:24:37,967 INFO L290 TraceCheckUtils]: 78: Hoare triple {25666#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {25609#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-15 09:24:37,969 INFO L290 TraceCheckUtils]: 79: Hoare triple {25609#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {25763#(and (= main_~q~0 main_~p~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 09:24:37,970 INFO L290 TraceCheckUtils]: 80: Hoare triple {25763#(and (= main_~q~0 main_~p~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25763#(and (= main_~q~0 main_~p~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 09:24:37,970 INFO L290 TraceCheckUtils]: 81: Hoare triple {25763#(and (= main_~q~0 main_~p~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)))} assume !!(#t~post7 < 20);havoc #t~post7; {25763#(and (= main_~q~0 main_~p~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 09:24:37,970 INFO L272 TraceCheckUtils]: 82: Hoare triple {25763#(and (= main_~q~0 main_~p~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {25513#true} is VALID [2022-04-15 09:24:37,970 INFO L290 TraceCheckUtils]: 83: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-15 09:24:37,970 INFO L290 TraceCheckUtils]: 84: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-15 09:24:37,971 INFO L290 TraceCheckUtils]: 85: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-15 09:24:37,971 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {25513#true} {25763#(and (= main_~q~0 main_~p~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)))} #88#return; {25763#(and (= main_~q~0 main_~p~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 09:24:37,971 INFO L272 TraceCheckUtils]: 87: Hoare triple {25763#(and (= main_~q~0 main_~p~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {25513#true} is VALID [2022-04-15 09:24:37,971 INFO L290 TraceCheckUtils]: 88: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-15 09:24:37,971 INFO L290 TraceCheckUtils]: 89: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-15 09:24:37,971 INFO L290 TraceCheckUtils]: 90: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-15 09:24:37,972 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {25513#true} {25763#(and (= main_~q~0 main_~p~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)))} #90#return; {25763#(and (= main_~q~0 main_~p~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 09:24:37,973 INFO L290 TraceCheckUtils]: 92: Hoare triple {25763#(and (= main_~q~0 main_~p~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {25803#(and (= main_~p~0 (div main_~q~0 2)) (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (= main_~q~0 2) (<= 1 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* 2 (mod main_~B~0 4294967296)))))} is VALID [2022-04-15 09:24:37,974 INFO L290 TraceCheckUtils]: 93: Hoare triple {25803#(and (= main_~p~0 (div main_~q~0 2)) (= main_~d~0 (div (* 2 (mod main_~B~0 4294967296)) 2)) (= main_~q~0 2) (<= 1 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* 2 (mod main_~B~0 4294967296)))))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {25807#(and (= main_~r~0 (+ (* (- 1) (div (* 2 (mod main_~B~0 4294967296)) 2)) (mod main_~A~0 4294967296) (* (- 2) (mod main_~B~0 4294967296)))) (<= 1 (mod main_~B~0 4294967296)) (= (+ (- 2) main_~q~0) 1))} is VALID [2022-04-15 09:24:37,975 INFO L290 TraceCheckUtils]: 94: Hoare triple {25807#(and (= main_~r~0 (+ (* (- 1) (div (* 2 (mod main_~B~0 4294967296)) 2)) (mod main_~A~0 4294967296) (* (- 2) (mod main_~B~0 4294967296)))) (<= 1 (mod main_~B~0 4294967296)) (= (+ (- 2) main_~q~0) 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25807#(and (= main_~r~0 (+ (* (- 1) (div (* 2 (mod main_~B~0 4294967296)) 2)) (mod main_~A~0 4294967296) (* (- 2) (mod main_~B~0 4294967296)))) (<= 1 (mod main_~B~0 4294967296)) (= (+ (- 2) main_~q~0) 1))} is VALID [2022-04-15 09:24:37,975 INFO L290 TraceCheckUtils]: 95: Hoare triple {25807#(and (= main_~r~0 (+ (* (- 1) (div (* 2 (mod main_~B~0 4294967296)) 2)) (mod main_~A~0 4294967296) (* (- 2) (mod main_~B~0 4294967296)))) (<= 1 (mod main_~B~0 4294967296)) (= (+ (- 2) main_~q~0) 1))} assume !!(#t~post7 < 20);havoc #t~post7; {25807#(and (= main_~r~0 (+ (* (- 1) (div (* 2 (mod main_~B~0 4294967296)) 2)) (mod main_~A~0 4294967296) (* (- 2) (mod main_~B~0 4294967296)))) (<= 1 (mod main_~B~0 4294967296)) (= (+ (- 2) main_~q~0) 1))} is VALID [2022-04-15 09:24:37,976 INFO L272 TraceCheckUtils]: 96: Hoare triple {25807#(and (= main_~r~0 (+ (* (- 1) (div (* 2 (mod main_~B~0 4294967296)) 2)) (mod main_~A~0 4294967296) (* (- 2) (mod main_~B~0 4294967296)))) (<= 1 (mod main_~B~0 4294967296)) (= (+ (- 2) main_~q~0) 1))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {25817#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 09:24:37,976 INFO L290 TraceCheckUtils]: 97: Hoare triple {25817#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25821#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:24:37,977 INFO L290 TraceCheckUtils]: 98: Hoare triple {25821#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {25514#false} is VALID [2022-04-15 09:24:37,977 INFO L290 TraceCheckUtils]: 99: Hoare triple {25514#false} assume !false; {25514#false} is VALID [2022-04-15 09:24:37,977 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 40 proven. 52 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2022-04-15 09:24:37,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:26:16,491 WARN L232 SmtUtils]: Spent 27.29s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-15 09:27:36,069 INFO L290 TraceCheckUtils]: 99: Hoare triple {25514#false} assume !false; {25514#false} is VALID [2022-04-15 09:27:36,069 INFO L290 TraceCheckUtils]: 98: Hoare triple {25821#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {25514#false} is VALID [2022-04-15 09:27:36,069 INFO L290 TraceCheckUtils]: 97: Hoare triple {25817#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25821#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:27:36,070 INFO L272 TraceCheckUtils]: 96: Hoare triple {25837#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {25817#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 09:27:36,070 INFO L290 TraceCheckUtils]: 95: Hoare triple {25837#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} assume !!(#t~post7 < 20);havoc #t~post7; {25837#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-15 09:27:36,071 INFO L290 TraceCheckUtils]: 94: Hoare triple {25837#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25837#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-15 09:27:36,074 INFO L290 TraceCheckUtils]: 93: Hoare triple {25847#(= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) (* (+ main_~q~0 main_~p~0) (mod main_~B~0 4294967296)) main_~r~0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {25837#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-15 09:27:36,083 INFO L290 TraceCheckUtils]: 92: Hoare triple {25851#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {25847#(= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) (* (+ main_~q~0 main_~p~0) (mod main_~B~0 4294967296)) main_~r~0))} is VALID [2022-04-15 09:27:36,084 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {25513#true} {25851#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} #90#return; {25851#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-15 09:27:36,084 INFO L290 TraceCheckUtils]: 90: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-15 09:27:36,084 INFO L290 TraceCheckUtils]: 89: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-15 09:27:36,084 INFO L290 TraceCheckUtils]: 88: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-15 09:27:36,085 INFO L272 TraceCheckUtils]: 87: Hoare triple {25851#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {25513#true} is VALID [2022-04-15 09:27:36,085 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {25513#true} {25851#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} #88#return; {25851#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-15 09:27:36,085 INFO L290 TraceCheckUtils]: 85: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-15 09:27:36,085 INFO L290 TraceCheckUtils]: 84: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-15 09:27:36,085 INFO L290 TraceCheckUtils]: 83: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-15 09:27:36,086 INFO L272 TraceCheckUtils]: 82: Hoare triple {25851#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {25513#true} is VALID [2022-04-15 09:27:36,087 INFO L290 TraceCheckUtils]: 81: Hoare triple {25851#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} assume !!(#t~post7 < 20);havoc #t~post7; {25851#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-15 09:27:36,088 INFO L290 TraceCheckUtils]: 80: Hoare triple {25851#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25851#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-15 09:27:36,103 INFO L290 TraceCheckUtils]: 79: Hoare triple {25891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (not (< main_~p~0 0)) (= (+ (* (mod main_~B~0 4294967296) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod main_~p~0 2) 0)) (or (= (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (* (mod main_~B~0 4294967296) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (= (mod main_~p~0 2) 0)) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {25851#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-15 09:27:36,317 INFO L290 TraceCheckUtils]: 78: Hoare triple {25895#(and (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))) (or (and (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))))) (= (mod main_~p~0 2) 0)))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {25891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (not (< main_~p~0 0)) (= (+ (* (mod main_~B~0 4294967296) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod main_~p~0 2) 0)) (or (= (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (* (mod main_~B~0 4294967296) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (= (mod main_~p~0 2) 0)) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-15 09:27:36,318 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {25513#true} {25895#(and (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))) (or (and (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))))) (= (mod main_~p~0 2) 0)))} #90#return; {25895#(and (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))) (or (and (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-15 09:27:36,319 INFO L290 TraceCheckUtils]: 76: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-15 09:27:36,319 INFO L290 TraceCheckUtils]: 75: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-15 09:27:36,319 INFO L290 TraceCheckUtils]: 74: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-15 09:27:36,319 INFO L272 TraceCheckUtils]: 73: Hoare triple {25895#(and (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))) (or (and (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))))) (= (mod main_~p~0 2) 0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {25513#true} is VALID [2022-04-15 09:27:36,320 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {25513#true} {25895#(and (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))) (or (and (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))))) (= (mod main_~p~0 2) 0)))} #88#return; {25895#(and (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))) (or (and (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-15 09:27:36,320 INFO L290 TraceCheckUtils]: 71: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-15 09:27:36,320 INFO L290 TraceCheckUtils]: 70: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-15 09:27:36,320 INFO L290 TraceCheckUtils]: 69: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-15 09:27:36,321 INFO L272 TraceCheckUtils]: 68: Hoare triple {25895#(and (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))) (or (and (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))))) (= (mod main_~p~0 2) 0)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {25513#true} is VALID [2022-04-15 09:27:36,324 INFO L290 TraceCheckUtils]: 67: Hoare triple {25895#(and (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))) (or (and (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))))) (= (mod main_~p~0 2) 0)))} assume !!(#t~post7 < 20);havoc #t~post7; {25895#(and (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))) (or (and (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-15 09:27:36,328 INFO L290 TraceCheckUtils]: 66: Hoare triple {25895#(and (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))) (or (and (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))))) (= (mod main_~p~0 2) 0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {25895#(and (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))) (or (and (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-15 09:27:36,331 INFO L290 TraceCheckUtils]: 65: Hoare triple {25895#(and (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))) (or (and (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))))) (= (mod main_~p~0 2) 0)))} assume !(~r~0 >= ~d~0); {25895#(and (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))) (or (and (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-15 09:27:36,332 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {25513#true} {25895#(and (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))) (or (and (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))))) (= (mod main_~p~0 2) 0)))} #86#return; {25895#(and (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))) (or (and (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-15 09:27:36,332 INFO L290 TraceCheckUtils]: 63: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-15 09:27:36,332 INFO L290 TraceCheckUtils]: 62: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-15 09:27:36,332 INFO L290 TraceCheckUtils]: 61: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-15 09:27:36,332 INFO L272 TraceCheckUtils]: 60: Hoare triple {25895#(and (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))) (or (and (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))))) (= (mod main_~p~0 2) 0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {25513#true} is VALID [2022-04-15 09:27:36,333 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {25513#true} {25895#(and (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))) (or (and (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))))) (= (mod main_~p~0 2) 0)))} #84#return; {25895#(and (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))) (or (and (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-15 09:27:36,333 INFO L290 TraceCheckUtils]: 58: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-15 09:27:36,333 INFO L290 TraceCheckUtils]: 57: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-15 09:27:36,333 INFO L290 TraceCheckUtils]: 56: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-15 09:27:36,334 INFO L272 TraceCheckUtils]: 55: Hoare triple {25895#(and (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))) (or (and (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))))) (= (mod main_~p~0 2) 0)))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {25513#true} is VALID [2022-04-15 09:27:36,334 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {25513#true} {25895#(and (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))) (or (and (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))))) (= (mod main_~p~0 2) 0)))} #82#return; {25895#(and (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))) (or (and (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-15 09:27:36,335 INFO L290 TraceCheckUtils]: 53: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-15 09:27:36,335 INFO L290 TraceCheckUtils]: 52: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-15 09:27:36,335 INFO L290 TraceCheckUtils]: 51: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-15 09:27:36,335 INFO L272 TraceCheckUtils]: 50: Hoare triple {25895#(and (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))) (or (and (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))))) (= (mod main_~p~0 2) 0)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {25513#true} is VALID [2022-04-15 09:27:36,338 INFO L290 TraceCheckUtils]: 49: Hoare triple {25895#(and (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))) (or (and (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))))) (= (mod main_~p~0 2) 0)))} assume !!(#t~post6 < 20);havoc #t~post6; {25895#(and (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))) (or (and (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-15 09:27:36,342 INFO L290 TraceCheckUtils]: 48: Hoare triple {25895#(and (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))) (or (and (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))))) (= (mod main_~p~0 2) 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25895#(and (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))) (or (and (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-15 09:27:36,439 INFO L290 TraceCheckUtils]: 47: Hoare triple {25891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (not (< main_~p~0 0)) (= (+ (* (mod main_~B~0 4294967296) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod main_~p~0 2) 0)) (or (= (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (* (mod main_~B~0 4294967296) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (= (mod main_~p~0 2) 0)) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {25895#(and (or (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (and (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) (mod main_~A~0 4294967296)) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (and (or (= (mod main_~A~0 4294967296) (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (mod (div main_~p~0 2) 2) 0) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< (div main_~p~0 2) 0)))) (= (mod (div main_~d~0 2) 2) 0)) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0)))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)))))) (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))) (or (and (or (= (mod main_~A~0 4294967296) (+ (* (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2)) (mod main_~B~0 4294967296)) (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))))) (= (mod main_~p~0 2) 0)))} is VALID [2022-04-15 09:27:36,441 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {25656#(not (= |__VERIFIER_assert_#in~cond| 0))} {25992#(or (and (or (and (or (= (+ (* (mod main_~B~0 4294967296) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod main_~p~0 2) 0)) (or (= (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (not (= (mod main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (* (mod main_~B~0 4294967296) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (= (mod main_~p~0 2) 0)) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))))} #86#return; {25891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (not (< main_~p~0 0)) (= (+ (* (mod main_~B~0 4294967296) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod main_~p~0 2) 0)) (or (= (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (* (mod main_~B~0 4294967296) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (= (mod main_~p~0 2) 0)) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-15 09:27:36,442 INFO L290 TraceCheckUtils]: 45: Hoare triple {25656#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25656#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:27:36,442 INFO L290 TraceCheckUtils]: 44: Hoare triple {26002#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {25656#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:27:36,443 INFO L290 TraceCheckUtils]: 43: Hoare triple {25513#true} ~cond := #in~cond; {26002#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 09:27:36,452 INFO L272 TraceCheckUtils]: 42: Hoare triple {25992#(or (and (or (and (or (= (+ (* (mod main_~B~0 4294967296) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod main_~p~0 2) 0)) (or (= (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (not (= (mod main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (* (mod main_~B~0 4294967296) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (= (mod main_~p~0 2) 0)) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {25513#true} is VALID [2022-04-15 09:27:36,454 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {25513#true} {25992#(or (and (or (and (or (= (+ (* (mod main_~B~0 4294967296) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod main_~p~0 2) 0)) (or (= (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (not (= (mod main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (* (mod main_~B~0 4294967296) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (= (mod main_~p~0 2) 0)) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))))} #84#return; {25992#(or (and (or (and (or (= (+ (* (mod main_~B~0 4294967296) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod main_~p~0 2) 0)) (or (= (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (not (= (mod main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (* (mod main_~B~0 4294967296) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (= (mod main_~p~0 2) 0)) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))))} is VALID [2022-04-15 09:27:36,454 INFO L290 TraceCheckUtils]: 40: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-15 09:27:36,455 INFO L290 TraceCheckUtils]: 39: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-15 09:27:36,455 INFO L290 TraceCheckUtils]: 38: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-15 09:27:36,455 INFO L272 TraceCheckUtils]: 37: Hoare triple {25992#(or (and (or (and (or (= (+ (* (mod main_~B~0 4294967296) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod main_~p~0 2) 0)) (or (= (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (not (= (mod main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (* (mod main_~B~0 4294967296) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (= (mod main_~p~0 2) 0)) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {25513#true} is VALID [2022-04-15 09:27:36,455 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {25513#true} {25992#(or (and (or (and (or (= (+ (* (mod main_~B~0 4294967296) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod main_~p~0 2) 0)) (or (= (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (not (= (mod main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (* (mod main_~B~0 4294967296) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (= (mod main_~p~0 2) 0)) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))))} #82#return; {25992#(or (and (or (and (or (= (+ (* (mod main_~B~0 4294967296) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod main_~p~0 2) 0)) (or (= (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (not (= (mod main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (* (mod main_~B~0 4294967296) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (= (mod main_~p~0 2) 0)) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))))} is VALID [2022-04-15 09:27:36,455 INFO L290 TraceCheckUtils]: 35: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-15 09:27:36,456 INFO L290 TraceCheckUtils]: 34: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-15 09:27:36,456 INFO L290 TraceCheckUtils]: 33: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-15 09:27:36,456 INFO L272 TraceCheckUtils]: 32: Hoare triple {25992#(or (and (or (and (or (= (+ (* (mod main_~B~0 4294967296) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod main_~p~0 2) 0)) (or (= (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (not (= (mod main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (* (mod main_~B~0 4294967296) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (= (mod main_~p~0 2) 0)) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {25513#true} is VALID [2022-04-15 09:27:36,457 INFO L290 TraceCheckUtils]: 31: Hoare triple {25992#(or (and (or (and (or (= (+ (* (mod main_~B~0 4294967296) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod main_~p~0 2) 0)) (or (= (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (not (= (mod main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (* (mod main_~B~0 4294967296) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (= (mod main_~p~0 2) 0)) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))))} assume !!(#t~post6 < 20);havoc #t~post6; {25992#(or (and (or (and (or (= (+ (* (mod main_~B~0 4294967296) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod main_~p~0 2) 0)) (or (= (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (not (= (mod main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (* (mod main_~B~0 4294967296) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (= (mod main_~p~0 2) 0)) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))))} is VALID [2022-04-15 09:27:36,458 INFO L290 TraceCheckUtils]: 30: Hoare triple {25992#(or (and (or (and (or (= (+ (* (mod main_~B~0 4294967296) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod main_~p~0 2) 0)) (or (= (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (not (= (mod main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (* (mod main_~B~0 4294967296) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (= (mod main_~p~0 2) 0)) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25992#(or (and (or (and (or (= (+ (* (mod main_~B~0 4294967296) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod main_~p~0 2) 0)) (or (= (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (not (= (mod main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (* (mod main_~B~0 4294967296) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (= (mod main_~p~0 2) 0)) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))))} is VALID [2022-04-15 09:27:36,463 INFO L290 TraceCheckUtils]: 29: Hoare triple {26045#(or (= (+ (* (- 1) (div (* main_~d~0 2) 2)) (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (* main_~p~0 2) main_~q~0)) (* (- 2) main_~d~0) main_~r~0) (mod main_~A~0 4294967296)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {25992#(or (and (or (and (or (= (+ (* (mod main_~B~0 4294967296) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (= (mod main_~p~0 2) 0)) (or (= (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296)) (not (= (mod main_~p~0 2) 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (* (mod main_~B~0 4294967296) (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (= (mod main_~p~0 2) 0)) (or (= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 main_~p~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)))) (not (= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))))} is VALID [2022-04-15 09:27:36,463 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {25513#true} {26045#(or (= (+ (* (- 1) (div (* main_~d~0 2) 2)) (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (* main_~p~0 2) main_~q~0)) (* (- 2) main_~d~0) main_~r~0) (mod main_~A~0 4294967296)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))))} #86#return; {26045#(or (= (+ (* (- 1) (div (* main_~d~0 2) 2)) (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (* main_~p~0 2) main_~q~0)) (* (- 2) main_~d~0) main_~r~0) (mod main_~A~0 4294967296)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))))} is VALID [2022-04-15 09:27:36,464 INFO L290 TraceCheckUtils]: 27: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-15 09:27:36,464 INFO L290 TraceCheckUtils]: 26: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-15 09:27:36,464 INFO L290 TraceCheckUtils]: 25: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-15 09:27:36,464 INFO L272 TraceCheckUtils]: 24: Hoare triple {26045#(or (= (+ (* (- 1) (div (* main_~d~0 2) 2)) (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (* main_~p~0 2) main_~q~0)) (* (- 2) main_~d~0) main_~r~0) (mod main_~A~0 4294967296)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {25513#true} is VALID [2022-04-15 09:27:36,464 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {25513#true} {26045#(or (= (+ (* (- 1) (div (* main_~d~0 2) 2)) (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (* main_~p~0 2) main_~q~0)) (* (- 2) main_~d~0) main_~r~0) (mod main_~A~0 4294967296)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))))} #84#return; {26045#(or (= (+ (* (- 1) (div (* main_~d~0 2) 2)) (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (* main_~p~0 2) main_~q~0)) (* (- 2) main_~d~0) main_~r~0) (mod main_~A~0 4294967296)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))))} is VALID [2022-04-15 09:27:36,465 INFO L290 TraceCheckUtils]: 22: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-15 09:27:36,465 INFO L290 TraceCheckUtils]: 21: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-15 09:27:36,465 INFO L290 TraceCheckUtils]: 20: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-15 09:27:36,465 INFO L272 TraceCheckUtils]: 19: Hoare triple {26045#(or (= (+ (* (- 1) (div (* main_~d~0 2) 2)) (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (* main_~p~0 2) main_~q~0)) (* (- 2) main_~d~0) main_~r~0) (mod main_~A~0 4294967296)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {25513#true} is VALID [2022-04-15 09:27:36,465 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {25513#true} {26045#(or (= (+ (* (- 1) (div (* main_~d~0 2) 2)) (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (* main_~p~0 2) main_~q~0)) (* (- 2) main_~d~0) main_~r~0) (mod main_~A~0 4294967296)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))))} #82#return; {26045#(or (= (+ (* (- 1) (div (* main_~d~0 2) 2)) (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (* main_~p~0 2) main_~q~0)) (* (- 2) main_~d~0) main_~r~0) (mod main_~A~0 4294967296)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))))} is VALID [2022-04-15 09:27:36,466 INFO L290 TraceCheckUtils]: 17: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-15 09:27:36,466 INFO L290 TraceCheckUtils]: 16: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-15 09:27:36,466 INFO L290 TraceCheckUtils]: 15: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-15 09:27:36,466 INFO L272 TraceCheckUtils]: 14: Hoare triple {26045#(or (= (+ (* (- 1) (div (* main_~d~0 2) 2)) (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (* main_~p~0 2) main_~q~0)) (* (- 2) main_~d~0) main_~r~0) (mod main_~A~0 4294967296)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {25513#true} is VALID [2022-04-15 09:27:36,466 INFO L290 TraceCheckUtils]: 13: Hoare triple {26045#(or (= (+ (* (- 1) (div (* main_~d~0 2) 2)) (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (* main_~p~0 2) main_~q~0)) (* (- 2) main_~d~0) main_~r~0) (mod main_~A~0 4294967296)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))))} assume !!(#t~post6 < 20);havoc #t~post6; {26045#(or (= (+ (* (- 1) (div (* main_~d~0 2) 2)) (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (* main_~p~0 2) main_~q~0)) (* (- 2) main_~d~0) main_~r~0) (mod main_~A~0 4294967296)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))))} is VALID [2022-04-15 09:27:36,467 INFO L290 TraceCheckUtils]: 12: Hoare triple {26045#(or (= (+ (* (- 1) (div (* main_~d~0 2) 2)) (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (* main_~p~0 2) main_~q~0)) (* (- 2) main_~d~0) main_~r~0) (mod main_~A~0 4294967296)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26045#(or (= (+ (* (- 1) (div (* main_~d~0 2) 2)) (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (* main_~p~0 2) main_~q~0)) (* (- 2) main_~d~0) main_~r~0) (mod main_~A~0 4294967296)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))))} is VALID [2022-04-15 09:27:36,469 INFO L290 TraceCheckUtils]: 11: Hoare triple {25513#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {26045#(or (= (+ (* (- 1) (div (* main_~d~0 2) 2)) (* (mod main_~B~0 4294967296) (+ (div (* main_~p~0 2) 2) (* main_~p~0 2) main_~q~0)) (* (- 2) main_~d~0) main_~r~0) (mod main_~A~0 4294967296)) (not (= (* (* main_~p~0 2) (mod main_~B~0 4294967296)) (* main_~d~0 2))))} is VALID [2022-04-15 09:27:36,469 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {25513#true} {25513#true} #80#return; {25513#true} is VALID [2022-04-15 09:27:36,470 INFO L290 TraceCheckUtils]: 9: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-15 09:27:36,470 INFO L290 TraceCheckUtils]: 8: Hoare triple {25513#true} assume !(0 == ~cond); {25513#true} is VALID [2022-04-15 09:27:36,470 INFO L290 TraceCheckUtils]: 7: Hoare triple {25513#true} ~cond := #in~cond; {25513#true} is VALID [2022-04-15 09:27:36,470 INFO L272 TraceCheckUtils]: 6: Hoare triple {25513#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {25513#true} is VALID [2022-04-15 09:27:36,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {25513#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {25513#true} is VALID [2022-04-15 09:27:36,470 INFO L272 TraceCheckUtils]: 4: Hoare triple {25513#true} call #t~ret8 := main(); {25513#true} is VALID [2022-04-15 09:27:36,470 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25513#true} {25513#true} #96#return; {25513#true} is VALID [2022-04-15 09:27:36,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {25513#true} assume true; {25513#true} is VALID [2022-04-15 09:27:36,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {25513#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {25513#true} is VALID [2022-04-15 09:27:36,470 INFO L272 TraceCheckUtils]: 0: Hoare triple {25513#true} call ULTIMATE.init(); {25513#true} is VALID [2022-04-15 09:27:36,472 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 40 proven. 41 refuted. 11 times theorem prover too weak. 276 trivial. 0 not checked. [2022-04-15 09:27:36,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:27:36,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330087694] [2022-04-15 09:27:36,472 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:27:36,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683048730] [2022-04-15 09:27:36,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683048730] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:27:36,472 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:27:36,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 23 [2022-04-15 09:27:36,472 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:27:36,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [882063892] [2022-04-15 09:27:36,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [882063892] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:27:36,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:27:36,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 09:27:36,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008063325] [2022-04-15 09:27:36,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:27:36,473 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 13 states have internal predecessors, (35), 6 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) Word has length 100 [2022-04-15 09:27:36,473 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:27:36,473 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 13 states have internal predecessors, (35), 6 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-15 09:27:36,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:27:36,557 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 09:27:36,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:27:36,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 09:27:36,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=418, Unknown=4, NotChecked=0, Total=506 [2022-04-15 09:27:36,558 INFO L87 Difference]: Start difference. First operand 224 states and 252 transitions. Second operand has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 13 states have internal predecessors, (35), 6 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-15 09:27:45,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:27:45,563 INFO L93 Difference]: Finished difference Result 237 states and 264 transitions. [2022-04-15 09:27:45,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 09:27:45,563 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 13 states have internal predecessors, (35), 6 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) Word has length 100 [2022-04-15 09:27:45,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:27:45,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 13 states have internal predecessors, (35), 6 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-15 09:27:45,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 108 transitions. [2022-04-15 09:27:45,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 13 states have internal predecessors, (35), 6 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-15 09:27:45,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 108 transitions. [2022-04-15 09:27:45,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 108 transitions. [2022-04-15 09:27:45,737 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:27:45,740 INFO L225 Difference]: With dead ends: 237 [2022-04-15 09:27:45,740 INFO L226 Difference]: Without dead ends: 221 [2022-04-15 09:27:45,741 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 174 SyntacticMatches, 4 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 51.6s TimeCoverageRelationStatistics Valid=101, Invalid=544, Unknown=5, NotChecked=0, Total=650 [2022-04-15 09:27:45,742 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 43 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 329 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-15 09:27:45,742 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 329 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-15 09:27:45,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-04-15 09:27:45,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2022-04-15 09:27:45,965 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:27:45,965 INFO L82 GeneralOperation]: Start isEquivalent. First operand 221 states. Second operand has 221 states, 146 states have (on average 1.1164383561643836) internal successors, (163), 151 states have internal predecessors, (163), 44 states have call successors, (44), 32 states have call predecessors, (44), 30 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-15 09:27:45,965 INFO L74 IsIncluded]: Start isIncluded. First operand 221 states. Second operand has 221 states, 146 states have (on average 1.1164383561643836) internal successors, (163), 151 states have internal predecessors, (163), 44 states have call successors, (44), 32 states have call predecessors, (44), 30 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-15 09:27:45,965 INFO L87 Difference]: Start difference. First operand 221 states. Second operand has 221 states, 146 states have (on average 1.1164383561643836) internal successors, (163), 151 states have internal predecessors, (163), 44 states have call successors, (44), 32 states have call predecessors, (44), 30 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-15 09:27:45,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:27:45,968 INFO L93 Difference]: Finished difference Result 221 states and 247 transitions. [2022-04-15 09:27:45,968 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 247 transitions. [2022-04-15 09:27:45,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:27:45,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:27:45,969 INFO L74 IsIncluded]: Start isIncluded. First operand has 221 states, 146 states have (on average 1.1164383561643836) internal successors, (163), 151 states have internal predecessors, (163), 44 states have call successors, (44), 32 states have call predecessors, (44), 30 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) Second operand 221 states. [2022-04-15 09:27:45,969 INFO L87 Difference]: Start difference. First operand has 221 states, 146 states have (on average 1.1164383561643836) internal successors, (163), 151 states have internal predecessors, (163), 44 states have call successors, (44), 32 states have call predecessors, (44), 30 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) Second operand 221 states. [2022-04-15 09:27:45,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:27:45,973 INFO L93 Difference]: Finished difference Result 221 states and 247 transitions. [2022-04-15 09:27:45,973 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 247 transitions. [2022-04-15 09:27:45,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:27:45,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:27:45,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:27:45,973 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:27:45,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 146 states have (on average 1.1164383561643836) internal successors, (163), 151 states have internal predecessors, (163), 44 states have call successors, (44), 32 states have call predecessors, (44), 30 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-15 09:27:45,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 247 transitions. [2022-04-15 09:27:45,977 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 247 transitions. Word has length 100 [2022-04-15 09:27:45,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:27:45,977 INFO L478 AbstractCegarLoop]: Abstraction has 221 states and 247 transitions. [2022-04-15 09:27:45,977 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 13 states have internal predecessors, (35), 6 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (15), 6 states have call predecessors, (15), 5 states have call successors, (15) [2022-04-15 09:27:45,977 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 221 states and 247 transitions. [2022-04-15 09:27:48,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 247 edges. 246 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 09:27:48,427 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 247 transitions. [2022-04-15 09:27:48,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-04-15 09:27:48,428 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:27:48,428 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 14, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:27:48,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-15 09:27:48,638 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-04-15 09:27:48,639 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:27:48,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:27:48,639 INFO L85 PathProgramCache]: Analyzing trace with hash -391055071, now seen corresponding path program 13 times [2022-04-15 09:27:48,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:27:48,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1023723259] [2022-04-15 09:27:54,986 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:27:54,986 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:27:54,986 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:27:54,986 INFO L85 PathProgramCache]: Analyzing trace with hash -391055071, now seen corresponding path program 14 times [2022-04-15 09:27:54,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:27:54,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847057791] [2022-04-15 09:27:54,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:27:54,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:27:54,998 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:27:54,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [265873787] [2022-04-15 09:27:54,999 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:27:54,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:27:54,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:27:55,000 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:27:55,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-15 09:27:55,064 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:27:55,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:27:55,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-15 09:27:55,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:27:55,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:28:00,648 INFO L272 TraceCheckUtils]: 0: Hoare triple {27499#true} call ULTIMATE.init(); {27499#true} is VALID [2022-04-15 09:28:00,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {27499#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {27499#true} is VALID [2022-04-15 09:28:00,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-15 09:28:00,648 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27499#true} {27499#true} #96#return; {27499#true} is VALID [2022-04-15 09:28:00,648 INFO L272 TraceCheckUtils]: 4: Hoare triple {27499#true} call #t~ret8 := main(); {27499#true} is VALID [2022-04-15 09:28:00,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {27499#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {27499#true} is VALID [2022-04-15 09:28:00,648 INFO L272 TraceCheckUtils]: 6: Hoare triple {27499#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {27499#true} is VALID [2022-04-15 09:28:00,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {27499#true} ~cond := #in~cond; {27525#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 09:28:00,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {27525#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {27529#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 09:28:00,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {27529#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {27529#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 09:28:00,650 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {27529#(not (= |assume_abort_if_not_#in~cond| 0))} {27499#true} #80#return; {27536#(<= 1 (mod main_~B~0 4294967296))} is VALID [2022-04-15 09:28:00,650 INFO L290 TraceCheckUtils]: 11: Hoare triple {27536#(<= 1 (mod main_~B~0 4294967296))} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {27540#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 09:28:00,651 INFO L290 TraceCheckUtils]: 12: Hoare triple {27540#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27540#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 09:28:00,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {27540#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {27540#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 09:28:00,651 INFO L272 TraceCheckUtils]: 14: Hoare triple {27540#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27499#true} is VALID [2022-04-15 09:28:00,651 INFO L290 TraceCheckUtils]: 15: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-15 09:28:00,652 INFO L290 TraceCheckUtils]: 16: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-15 09:28:00,652 INFO L290 TraceCheckUtils]: 17: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-15 09:28:00,652 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {27499#true} {27540#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} #82#return; {27540#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 09:28:00,652 INFO L272 TraceCheckUtils]: 19: Hoare triple {27540#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {27499#true} is VALID [2022-04-15 09:28:00,652 INFO L290 TraceCheckUtils]: 20: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-15 09:28:00,652 INFO L290 TraceCheckUtils]: 21: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-15 09:28:00,653 INFO L290 TraceCheckUtils]: 22: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-15 09:28:00,653 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {27499#true} {27540#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} #84#return; {27540#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 09:28:00,653 INFO L272 TraceCheckUtils]: 24: Hoare triple {27540#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {27499#true} is VALID [2022-04-15 09:28:00,653 INFO L290 TraceCheckUtils]: 25: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-15 09:28:00,653 INFO L290 TraceCheckUtils]: 26: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-15 09:28:00,653 INFO L290 TraceCheckUtils]: 27: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-15 09:28:00,654 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {27499#true} {27540#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} #86#return; {27540#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 09:28:00,655 INFO L290 TraceCheckUtils]: 29: Hoare triple {27540#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {27595#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-15 09:28:00,656 INFO L290 TraceCheckUtils]: 30: Hoare triple {27595#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27595#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-15 09:28:00,656 INFO L290 TraceCheckUtils]: 31: Hoare triple {27595#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} assume !!(#t~post6 < 20);havoc #t~post6; {27595#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-15 09:28:00,656 INFO L272 TraceCheckUtils]: 32: Hoare triple {27595#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27499#true} is VALID [2022-04-15 09:28:00,656 INFO L290 TraceCheckUtils]: 33: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-15 09:28:00,656 INFO L290 TraceCheckUtils]: 34: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-15 09:28:00,657 INFO L290 TraceCheckUtils]: 35: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-15 09:28:00,657 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {27499#true} {27595#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} #82#return; {27595#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-15 09:28:00,657 INFO L272 TraceCheckUtils]: 37: Hoare triple {27595#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {27499#true} is VALID [2022-04-15 09:28:00,657 INFO L290 TraceCheckUtils]: 38: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-15 09:28:00,657 INFO L290 TraceCheckUtils]: 39: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-15 09:28:00,657 INFO L290 TraceCheckUtils]: 40: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-15 09:28:00,658 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {27499#true} {27595#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} #84#return; {27595#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-15 09:28:00,658 INFO L272 TraceCheckUtils]: 42: Hoare triple {27595#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {27499#true} is VALID [2022-04-15 09:28:00,658 INFO L290 TraceCheckUtils]: 43: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-15 09:28:00,658 INFO L290 TraceCheckUtils]: 44: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-15 09:28:00,658 INFO L290 TraceCheckUtils]: 45: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-15 09:28:00,659 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {27499#true} {27595#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} #86#return; {27595#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-15 09:28:00,660 INFO L290 TraceCheckUtils]: 47: Hoare triple {27595#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {27650#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-15 09:28:00,661 INFO L290 TraceCheckUtils]: 48: Hoare triple {27650#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27650#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-15 09:28:00,661 INFO L290 TraceCheckUtils]: 49: Hoare triple {27650#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} assume !!(#t~post6 < 20);havoc #t~post6; {27650#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-15 09:28:00,661 INFO L272 TraceCheckUtils]: 50: Hoare triple {27650#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27499#true} is VALID [2022-04-15 09:28:00,662 INFO L290 TraceCheckUtils]: 51: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-15 09:28:00,662 INFO L290 TraceCheckUtils]: 52: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-15 09:28:00,662 INFO L290 TraceCheckUtils]: 53: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-15 09:28:00,662 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {27499#true} {27650#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} #82#return; {27650#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-15 09:28:00,662 INFO L272 TraceCheckUtils]: 55: Hoare triple {27650#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {27499#true} is VALID [2022-04-15 09:28:00,662 INFO L290 TraceCheckUtils]: 56: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-15 09:28:00,663 INFO L290 TraceCheckUtils]: 57: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-15 09:28:00,663 INFO L290 TraceCheckUtils]: 58: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-15 09:28:00,663 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {27499#true} {27650#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} #84#return; {27650#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-15 09:28:00,663 INFO L272 TraceCheckUtils]: 60: Hoare triple {27650#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {27499#true} is VALID [2022-04-15 09:28:00,663 INFO L290 TraceCheckUtils]: 61: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-15 09:28:00,664 INFO L290 TraceCheckUtils]: 62: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-15 09:28:00,664 INFO L290 TraceCheckUtils]: 63: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-15 09:28:00,664 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {27499#true} {27650#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} #86#return; {27650#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-15 09:28:00,665 INFO L290 TraceCheckUtils]: 65: Hoare triple {27650#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {27705#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 8) (<= 1 (mod main_~B~0 4294967296)) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0) (<= (* (mod main_~B~0 4294967296) 4) main_~r~0))} is VALID [2022-04-15 09:28:00,666 INFO L290 TraceCheckUtils]: 66: Hoare triple {27705#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 8) (<= 1 (mod main_~B~0 4294967296)) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0) (<= (* (mod main_~B~0 4294967296) 4) main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27705#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 8) (<= 1 (mod main_~B~0 4294967296)) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0) (<= (* (mod main_~B~0 4294967296) 4) main_~r~0))} is VALID [2022-04-15 09:28:00,666 INFO L290 TraceCheckUtils]: 67: Hoare triple {27705#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 8) (<= 1 (mod main_~B~0 4294967296)) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0) (<= (* (mod main_~B~0 4294967296) 4) main_~r~0))} assume !!(#t~post6 < 20);havoc #t~post6; {27705#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 8) (<= 1 (mod main_~B~0 4294967296)) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0) (<= (* (mod main_~B~0 4294967296) 4) main_~r~0))} is VALID [2022-04-15 09:28:00,666 INFO L272 TraceCheckUtils]: 68: Hoare triple {27705#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 8) (<= 1 (mod main_~B~0 4294967296)) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0) (<= (* (mod main_~B~0 4294967296) 4) main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27499#true} is VALID [2022-04-15 09:28:00,666 INFO L290 TraceCheckUtils]: 69: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-15 09:28:00,667 INFO L290 TraceCheckUtils]: 70: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-15 09:28:00,667 INFO L290 TraceCheckUtils]: 71: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-15 09:28:00,667 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {27499#true} {27705#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 8) (<= 1 (mod main_~B~0 4294967296)) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0) (<= (* (mod main_~B~0 4294967296) 4) main_~r~0))} #82#return; {27705#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 8) (<= 1 (mod main_~B~0 4294967296)) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0) (<= (* (mod main_~B~0 4294967296) 4) main_~r~0))} is VALID [2022-04-15 09:28:00,667 INFO L272 TraceCheckUtils]: 73: Hoare triple {27705#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 8) (<= 1 (mod main_~B~0 4294967296)) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0) (<= (* (mod main_~B~0 4294967296) 4) main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {27499#true} is VALID [2022-04-15 09:28:00,667 INFO L290 TraceCheckUtils]: 74: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-15 09:28:00,667 INFO L290 TraceCheckUtils]: 75: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-15 09:28:00,668 INFO L290 TraceCheckUtils]: 76: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-15 09:28:00,668 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {27499#true} {27705#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 8) (<= 1 (mod main_~B~0 4294967296)) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0) (<= (* (mod main_~B~0 4294967296) 4) main_~r~0))} #84#return; {27705#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 8) (<= 1 (mod main_~B~0 4294967296)) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0) (<= (* (mod main_~B~0 4294967296) 4) main_~r~0))} is VALID [2022-04-15 09:28:00,668 INFO L272 TraceCheckUtils]: 78: Hoare triple {27705#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 8) (<= 1 (mod main_~B~0 4294967296)) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0) (<= (* (mod main_~B~0 4294967296) 4) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {27499#true} is VALID [2022-04-15 09:28:00,668 INFO L290 TraceCheckUtils]: 79: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-15 09:28:00,668 INFO L290 TraceCheckUtils]: 80: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-15 09:28:00,668 INFO L290 TraceCheckUtils]: 81: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-15 09:28:00,669 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {27499#true} {27705#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 8) (<= 1 (mod main_~B~0 4294967296)) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0) (<= (* (mod main_~B~0 4294967296) 4) main_~r~0))} #86#return; {27705#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 8) (<= 1 (mod main_~B~0 4294967296)) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0) (<= (* (mod main_~B~0 4294967296) 4) main_~r~0))} is VALID [2022-04-15 09:28:00,669 INFO L290 TraceCheckUtils]: 83: Hoare triple {27705#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 8) (<= 1 (mod main_~B~0 4294967296)) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0) (<= (* (mod main_~B~0 4294967296) 4) main_~r~0))} assume !(~r~0 >= ~d~0); {27760#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 main_~d~0) (= main_~p~0 8) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0) (<= (* (mod main_~B~0 4294967296) 4) main_~r~0))} is VALID [2022-04-15 09:28:00,670 INFO L290 TraceCheckUtils]: 84: Hoare triple {27760#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 main_~d~0) (= main_~p~0 8) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0) (<= (* (mod main_~B~0 4294967296) 4) main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {27760#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 main_~d~0) (= main_~p~0 8) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0) (<= (* (mod main_~B~0 4294967296) 4) main_~r~0))} is VALID [2022-04-15 09:28:00,670 INFO L290 TraceCheckUtils]: 85: Hoare triple {27760#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 main_~d~0) (= main_~p~0 8) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0) (<= (* (mod main_~B~0 4294967296) 4) main_~r~0))} assume !!(#t~post7 < 20);havoc #t~post7; {27760#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 main_~d~0) (= main_~p~0 8) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0) (<= (* (mod main_~B~0 4294967296) 4) main_~r~0))} is VALID [2022-04-15 09:28:00,671 INFO L272 TraceCheckUtils]: 86: Hoare triple {27760#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 main_~d~0) (= main_~p~0 8) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0) (<= (* (mod main_~B~0 4294967296) 4) main_~r~0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {27499#true} is VALID [2022-04-15 09:28:00,671 INFO L290 TraceCheckUtils]: 87: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-15 09:28:00,671 INFO L290 TraceCheckUtils]: 88: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-15 09:28:00,671 INFO L290 TraceCheckUtils]: 89: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-15 09:28:00,671 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {27499#true} {27760#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 main_~d~0) (= main_~p~0 8) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0) (<= (* (mod main_~B~0 4294967296) 4) main_~r~0))} #88#return; {27760#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 main_~d~0) (= main_~p~0 8) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0) (<= (* (mod main_~B~0 4294967296) 4) main_~r~0))} is VALID [2022-04-15 09:28:00,671 INFO L272 TraceCheckUtils]: 91: Hoare triple {27760#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 main_~d~0) (= main_~p~0 8) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0) (<= (* (mod main_~B~0 4294967296) 4) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {27499#true} is VALID [2022-04-15 09:28:00,672 INFO L290 TraceCheckUtils]: 92: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-15 09:28:00,672 INFO L290 TraceCheckUtils]: 93: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-15 09:28:00,672 INFO L290 TraceCheckUtils]: 94: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-15 09:28:00,672 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {27499#true} {27760#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 main_~d~0) (= main_~p~0 8) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0) (<= (* (mod main_~B~0 4294967296) 4) main_~r~0))} #90#return; {27760#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 main_~d~0) (= main_~p~0 8) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0) (<= (* (mod main_~B~0 4294967296) 4) main_~r~0))} is VALID [2022-04-15 09:28:00,674 INFO L290 TraceCheckUtils]: 96: Hoare triple {27760#(and (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 main_~d~0) (= main_~p~0 8) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0) (<= (* (mod main_~B~0 4294967296) 4) main_~r~0))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {27800#(and (= main_~d~0 (div (* 8 (mod main_~B~0 4294967296)) 2)) (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 (* 8 (mod main_~B~0 4294967296))) (= main_~q~0 0) (= main_~p~0 4) (<= (* (mod main_~B~0 4294967296) 4) main_~r~0))} is VALID [2022-04-15 09:28:00,675 INFO L290 TraceCheckUtils]: 97: Hoare triple {27800#(and (= main_~d~0 (div (* 8 (mod main_~B~0 4294967296)) 2)) (= (mod main_~A~0 4294967296) main_~r~0) (< main_~r~0 (* 8 (mod main_~B~0 4294967296))) (= main_~q~0 0) (= main_~p~0 4) (<= (* (mod main_~B~0 4294967296) 4) main_~r~0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {27804#(and (= main_~r~0 (+ (* (- 1) (div (* 8 (mod main_~B~0 4294967296)) 2)) (mod main_~A~0 4294967296))) (<= (* (mod main_~B~0 4294967296) 4) (mod main_~A~0 4294967296)) (= main_~q~0 4) (< (mod main_~A~0 4294967296) (* 8 (mod main_~B~0 4294967296))))} is VALID [2022-04-15 09:28:00,676 INFO L290 TraceCheckUtils]: 98: Hoare triple {27804#(and (= main_~r~0 (+ (* (- 1) (div (* 8 (mod main_~B~0 4294967296)) 2)) (mod main_~A~0 4294967296))) (<= (* (mod main_~B~0 4294967296) 4) (mod main_~A~0 4294967296)) (= main_~q~0 4) (< (mod main_~A~0 4294967296) (* 8 (mod main_~B~0 4294967296))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {27804#(and (= main_~r~0 (+ (* (- 1) (div (* 8 (mod main_~B~0 4294967296)) 2)) (mod main_~A~0 4294967296))) (<= (* (mod main_~B~0 4294967296) 4) (mod main_~A~0 4294967296)) (= main_~q~0 4) (< (mod main_~A~0 4294967296) (* 8 (mod main_~B~0 4294967296))))} is VALID [2022-04-15 09:28:00,676 INFO L290 TraceCheckUtils]: 99: Hoare triple {27804#(and (= main_~r~0 (+ (* (- 1) (div (* 8 (mod main_~B~0 4294967296)) 2)) (mod main_~A~0 4294967296))) (<= (* (mod main_~B~0 4294967296) 4) (mod main_~A~0 4294967296)) (= main_~q~0 4) (< (mod main_~A~0 4294967296) (* 8 (mod main_~B~0 4294967296))))} assume !!(#t~post7 < 20);havoc #t~post7; {27804#(and (= main_~r~0 (+ (* (- 1) (div (* 8 (mod main_~B~0 4294967296)) 2)) (mod main_~A~0 4294967296))) (<= (* (mod main_~B~0 4294967296) 4) (mod main_~A~0 4294967296)) (= main_~q~0 4) (< (mod main_~A~0 4294967296) (* 8 (mod main_~B~0 4294967296))))} is VALID [2022-04-15 09:28:00,677 INFO L272 TraceCheckUtils]: 100: Hoare triple {27804#(and (= main_~r~0 (+ (* (- 1) (div (* 8 (mod main_~B~0 4294967296)) 2)) (mod main_~A~0 4294967296))) (<= (* (mod main_~B~0 4294967296) 4) (mod main_~A~0 4294967296)) (= main_~q~0 4) (< (mod main_~A~0 4294967296) (* 8 (mod main_~B~0 4294967296))))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {27814#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 09:28:00,677 INFO L290 TraceCheckUtils]: 101: Hoare triple {27814#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {27818#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:28:00,678 INFO L290 TraceCheckUtils]: 102: Hoare triple {27818#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {27500#false} is VALID [2022-04-15 09:28:00,678 INFO L290 TraceCheckUtils]: 103: Hoare triple {27500#false} assume !false; {27500#false} is VALID [2022-04-15 09:28:00,678 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 28 proven. 39 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-04-15 09:28:00,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:28:14,870 INFO L290 TraceCheckUtils]: 103: Hoare triple {27500#false} assume !false; {27500#false} is VALID [2022-04-15 09:28:14,871 INFO L290 TraceCheckUtils]: 102: Hoare triple {27818#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {27500#false} is VALID [2022-04-15 09:28:14,871 INFO L290 TraceCheckUtils]: 101: Hoare triple {27814#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {27818#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:28:14,872 INFO L272 TraceCheckUtils]: 100: Hoare triple {27834#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {27814#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 09:28:14,872 INFO L290 TraceCheckUtils]: 99: Hoare triple {27834#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} assume !!(#t~post7 < 20);havoc #t~post7; {27834#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-15 09:28:14,873 INFO L290 TraceCheckUtils]: 98: Hoare triple {27834#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {27834#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-15 09:28:14,877 INFO L290 TraceCheckUtils]: 97: Hoare triple {27844#(= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) (* (+ main_~q~0 main_~p~0) (mod main_~B~0 4294967296)) main_~r~0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {27834#(= (+ main_~r~0 (* main_~q~0 (mod main_~B~0 4294967296))) (mod main_~A~0 4294967296))} is VALID [2022-04-15 09:28:14,887 INFO L290 TraceCheckUtils]: 96: Hoare triple {27848#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {27844#(= (mod main_~A~0 4294967296) (+ (* (- 1) main_~d~0) (* (+ main_~q~0 main_~p~0) (mod main_~B~0 4294967296)) main_~r~0))} is VALID [2022-04-15 09:28:14,888 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {27499#true} {27848#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} #90#return; {27848#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-15 09:28:14,888 INFO L290 TraceCheckUtils]: 94: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-15 09:28:14,888 INFO L290 TraceCheckUtils]: 93: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-15 09:28:14,888 INFO L290 TraceCheckUtils]: 92: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-15 09:28:14,888 INFO L272 TraceCheckUtils]: 91: Hoare triple {27848#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {27499#true} is VALID [2022-04-15 09:28:14,889 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {27499#true} {27848#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} #88#return; {27848#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-15 09:28:14,889 INFO L290 TraceCheckUtils]: 89: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-15 09:28:14,889 INFO L290 TraceCheckUtils]: 88: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-15 09:28:14,889 INFO L290 TraceCheckUtils]: 87: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-15 09:28:14,889 INFO L272 TraceCheckUtils]: 86: Hoare triple {27848#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {27499#true} is VALID [2022-04-15 09:28:14,890 INFO L290 TraceCheckUtils]: 85: Hoare triple {27848#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} assume !!(#t~post7 < 20);havoc #t~post7; {27848#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-15 09:28:14,892 INFO L290 TraceCheckUtils]: 84: Hoare triple {27848#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {27848#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-15 09:28:14,893 INFO L290 TraceCheckUtils]: 83: Hoare triple {27888#(or (and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (<= main_~d~0 main_~r~0))} assume !(~r~0 >= ~d~0); {27848#(and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-15 09:28:14,893 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {27499#true} {27888#(or (and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (<= main_~d~0 main_~r~0))} #86#return; {27888#(or (and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 09:28:14,893 INFO L290 TraceCheckUtils]: 81: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-15 09:28:14,893 INFO L290 TraceCheckUtils]: 80: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-15 09:28:14,894 INFO L290 TraceCheckUtils]: 79: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-15 09:28:14,894 INFO L272 TraceCheckUtils]: 78: Hoare triple {27888#(or (and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {27499#true} is VALID [2022-04-15 09:28:14,894 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {27499#true} {27888#(or (and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (<= main_~d~0 main_~r~0))} #84#return; {27888#(or (and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 09:28:14,894 INFO L290 TraceCheckUtils]: 76: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-15 09:28:14,894 INFO L290 TraceCheckUtils]: 75: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-15 09:28:14,895 INFO L290 TraceCheckUtils]: 74: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-15 09:28:14,895 INFO L272 TraceCheckUtils]: 73: Hoare triple {27888#(or (and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {27499#true} is VALID [2022-04-15 09:28:14,895 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {27499#true} {27888#(or (and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (<= main_~d~0 main_~r~0))} #82#return; {27888#(or (and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 09:28:14,895 INFO L290 TraceCheckUtils]: 71: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-15 09:28:14,895 INFO L290 TraceCheckUtils]: 70: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-15 09:28:14,896 INFO L290 TraceCheckUtils]: 69: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-15 09:28:14,896 INFO L272 TraceCheckUtils]: 68: Hoare triple {27888#(or (and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27499#true} is VALID [2022-04-15 09:28:14,897 INFO L290 TraceCheckUtils]: 67: Hoare triple {27888#(or (and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (<= main_~d~0 main_~r~0))} assume !!(#t~post6 < 20);havoc #t~post6; {27888#(or (and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 09:28:14,898 INFO L290 TraceCheckUtils]: 66: Hoare triple {27888#(or (and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (<= main_~d~0 main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27888#(or (and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 09:28:14,902 INFO L290 TraceCheckUtils]: 65: Hoare triple {27943#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {27888#(or (and (or (not (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~A~0 4294967296) (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (= (mod main_~p~0 2) 0))) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (= (+ main_~r~0 (* (+ main_~q~0 (div main_~p~0 2)) (mod main_~B~0 4294967296)) (* (- 1) (div main_~d~0 2))) (mod main_~A~0 4294967296)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (= (mod main_~A~0 4294967296) (+ main_~r~0 (* (- 1) (div main_~d~0 2)) (* (+ main_~q~0 (div main_~p~0 2) 1) (mod main_~B~0 4294967296)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))))) (<= main_~d~0 main_~r~0))} is VALID [2022-04-15 09:28:14,902 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {27499#true} {27943#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} #86#return; {27943#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} is VALID [2022-04-15 09:28:14,903 INFO L290 TraceCheckUtils]: 63: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-15 09:28:14,903 INFO L290 TraceCheckUtils]: 62: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-15 09:28:14,903 INFO L290 TraceCheckUtils]: 61: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-15 09:28:14,903 INFO L272 TraceCheckUtils]: 60: Hoare triple {27943#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {27499#true} is VALID [2022-04-15 09:28:14,903 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {27499#true} {27943#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} #84#return; {27943#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} is VALID [2022-04-15 09:28:14,904 INFO L290 TraceCheckUtils]: 58: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-15 09:28:14,904 INFO L290 TraceCheckUtils]: 57: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-15 09:28:14,904 INFO L290 TraceCheckUtils]: 56: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-15 09:28:14,904 INFO L272 TraceCheckUtils]: 55: Hoare triple {27943#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {27499#true} is VALID [2022-04-15 09:28:14,904 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {27499#true} {27943#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} #82#return; {27943#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} is VALID [2022-04-15 09:28:14,904 INFO L290 TraceCheckUtils]: 53: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-15 09:28:14,905 INFO L290 TraceCheckUtils]: 52: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-15 09:28:14,905 INFO L290 TraceCheckUtils]: 51: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-15 09:28:14,905 INFO L272 TraceCheckUtils]: 50: Hoare triple {27943#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27499#true} is VALID [2022-04-15 09:28:14,905 INFO L290 TraceCheckUtils]: 49: Hoare triple {27943#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} assume !!(#t~post6 < 20);havoc #t~post6; {27943#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} is VALID [2022-04-15 09:28:14,906 INFO L290 TraceCheckUtils]: 48: Hoare triple {27943#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27943#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} is VALID [2022-04-15 09:28:14,908 INFO L290 TraceCheckUtils]: 47: Hoare triple {27998#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 4) 2)) main_~r~0 (* (+ (div (* main_~p~0 4) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 4) main_~r~0) (not (<= (* main_~d~0 2) main_~r~0)))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {27943#(or (not (<= main_~d~0 main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 2) 2)) main_~r~0 (* (+ (div (* main_~p~0 2) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 2) main_~r~0))} is VALID [2022-04-15 09:28:14,909 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {27499#true} {27998#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 4) 2)) main_~r~0 (* (+ (div (* main_~p~0 4) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 4) main_~r~0) (not (<= (* main_~d~0 2) main_~r~0)))} #86#return; {27998#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 4) 2)) main_~r~0 (* (+ (div (* main_~p~0 4) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 4) main_~r~0) (not (<= (* main_~d~0 2) main_~r~0)))} is VALID [2022-04-15 09:28:14,909 INFO L290 TraceCheckUtils]: 45: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-15 09:28:14,910 INFO L290 TraceCheckUtils]: 44: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-15 09:28:14,910 INFO L290 TraceCheckUtils]: 43: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-15 09:28:14,910 INFO L272 TraceCheckUtils]: 42: Hoare triple {27998#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 4) 2)) main_~r~0 (* (+ (div (* main_~p~0 4) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 4) main_~r~0) (not (<= (* main_~d~0 2) main_~r~0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {27499#true} is VALID [2022-04-15 09:28:14,910 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {27499#true} {27998#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 4) 2)) main_~r~0 (* (+ (div (* main_~p~0 4) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 4) main_~r~0) (not (<= (* main_~d~0 2) main_~r~0)))} #84#return; {27998#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 4) 2)) main_~r~0 (* (+ (div (* main_~p~0 4) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 4) main_~r~0) (not (<= (* main_~d~0 2) main_~r~0)))} is VALID [2022-04-15 09:28:14,910 INFO L290 TraceCheckUtils]: 40: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-15 09:28:14,910 INFO L290 TraceCheckUtils]: 39: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-15 09:28:14,911 INFO L290 TraceCheckUtils]: 38: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-15 09:28:14,911 INFO L272 TraceCheckUtils]: 37: Hoare triple {27998#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 4) 2)) main_~r~0 (* (+ (div (* main_~p~0 4) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 4) main_~r~0) (not (<= (* main_~d~0 2) main_~r~0)))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {27499#true} is VALID [2022-04-15 09:28:14,911 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {27499#true} {27998#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 4) 2)) main_~r~0 (* (+ (div (* main_~p~0 4) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 4) main_~r~0) (not (<= (* main_~d~0 2) main_~r~0)))} #82#return; {27998#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 4) 2)) main_~r~0 (* (+ (div (* main_~p~0 4) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 4) main_~r~0) (not (<= (* main_~d~0 2) main_~r~0)))} is VALID [2022-04-15 09:28:14,911 INFO L290 TraceCheckUtils]: 35: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-15 09:28:14,911 INFO L290 TraceCheckUtils]: 34: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-15 09:28:14,912 INFO L290 TraceCheckUtils]: 33: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-15 09:28:14,912 INFO L272 TraceCheckUtils]: 32: Hoare triple {27998#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 4) 2)) main_~r~0 (* (+ (div (* main_~p~0 4) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 4) main_~r~0) (not (<= (* main_~d~0 2) main_~r~0)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27499#true} is VALID [2022-04-15 09:28:14,912 INFO L290 TraceCheckUtils]: 31: Hoare triple {27998#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 4) 2)) main_~r~0 (* (+ (div (* main_~p~0 4) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 4) main_~r~0) (not (<= (* main_~d~0 2) main_~r~0)))} assume !!(#t~post6 < 20);havoc #t~post6; {27998#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 4) 2)) main_~r~0 (* (+ (div (* main_~p~0 4) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 4) main_~r~0) (not (<= (* main_~d~0 2) main_~r~0)))} is VALID [2022-04-15 09:28:14,913 INFO L290 TraceCheckUtils]: 30: Hoare triple {27998#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 4) 2)) main_~r~0 (* (+ (div (* main_~p~0 4) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 4) main_~r~0) (not (<= (* main_~d~0 2) main_~r~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27998#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 4) 2)) main_~r~0 (* (+ (div (* main_~p~0 4) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 4) main_~r~0) (not (<= (* main_~d~0 2) main_~r~0)))} is VALID [2022-04-15 09:28:14,915 INFO L290 TraceCheckUtils]: 29: Hoare triple {28053#(or (<= (* main_~d~0 8) main_~r~0) (not (<= (* main_~d~0 4) main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 8) 2)) main_~r~0 (* (+ (div (* main_~p~0 8) 2) main_~q~0) (mod main_~B~0 4294967296)))))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {27998#(or (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 4) 2)) main_~r~0 (* (+ (div (* main_~p~0 4) 2) main_~q~0) (mod main_~B~0 4294967296)))) (<= (* main_~d~0 4) main_~r~0) (not (<= (* main_~d~0 2) main_~r~0)))} is VALID [2022-04-15 09:28:14,916 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {27499#true} {28053#(or (<= (* main_~d~0 8) main_~r~0) (not (<= (* main_~d~0 4) main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 8) 2)) main_~r~0 (* (+ (div (* main_~p~0 8) 2) main_~q~0) (mod main_~B~0 4294967296)))))} #86#return; {28053#(or (<= (* main_~d~0 8) main_~r~0) (not (<= (* main_~d~0 4) main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 8) 2)) main_~r~0 (* (+ (div (* main_~p~0 8) 2) main_~q~0) (mod main_~B~0 4294967296)))))} is VALID [2022-04-15 09:28:14,916 INFO L290 TraceCheckUtils]: 27: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-15 09:28:14,916 INFO L290 TraceCheckUtils]: 26: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-15 09:28:14,916 INFO L290 TraceCheckUtils]: 25: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-15 09:28:14,916 INFO L272 TraceCheckUtils]: 24: Hoare triple {28053#(or (<= (* main_~d~0 8) main_~r~0) (not (<= (* main_~d~0 4) main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 8) 2)) main_~r~0 (* (+ (div (* main_~p~0 8) 2) main_~q~0) (mod main_~B~0 4294967296)))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {27499#true} is VALID [2022-04-15 09:28:14,917 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {27499#true} {28053#(or (<= (* main_~d~0 8) main_~r~0) (not (<= (* main_~d~0 4) main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 8) 2)) main_~r~0 (* (+ (div (* main_~p~0 8) 2) main_~q~0) (mod main_~B~0 4294967296)))))} #84#return; {28053#(or (<= (* main_~d~0 8) main_~r~0) (not (<= (* main_~d~0 4) main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 8) 2)) main_~r~0 (* (+ (div (* main_~p~0 8) 2) main_~q~0) (mod main_~B~0 4294967296)))))} is VALID [2022-04-15 09:28:14,917 INFO L290 TraceCheckUtils]: 22: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-15 09:28:14,917 INFO L290 TraceCheckUtils]: 21: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-15 09:28:14,917 INFO L290 TraceCheckUtils]: 20: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-15 09:28:14,917 INFO L272 TraceCheckUtils]: 19: Hoare triple {28053#(or (<= (* main_~d~0 8) main_~r~0) (not (<= (* main_~d~0 4) main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 8) 2)) main_~r~0 (* (+ (div (* main_~p~0 8) 2) main_~q~0) (mod main_~B~0 4294967296)))))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {27499#true} is VALID [2022-04-15 09:28:14,918 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {27499#true} {28053#(or (<= (* main_~d~0 8) main_~r~0) (not (<= (* main_~d~0 4) main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 8) 2)) main_~r~0 (* (+ (div (* main_~p~0 8) 2) main_~q~0) (mod main_~B~0 4294967296)))))} #82#return; {28053#(or (<= (* main_~d~0 8) main_~r~0) (not (<= (* main_~d~0 4) main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 8) 2)) main_~r~0 (* (+ (div (* main_~p~0 8) 2) main_~q~0) (mod main_~B~0 4294967296)))))} is VALID [2022-04-15 09:28:14,918 INFO L290 TraceCheckUtils]: 17: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-15 09:28:14,918 INFO L290 TraceCheckUtils]: 16: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-15 09:28:14,918 INFO L290 TraceCheckUtils]: 15: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-15 09:28:14,918 INFO L272 TraceCheckUtils]: 14: Hoare triple {28053#(or (<= (* main_~d~0 8) main_~r~0) (not (<= (* main_~d~0 4) main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 8) 2)) main_~r~0 (* (+ (div (* main_~p~0 8) 2) main_~q~0) (mod main_~B~0 4294967296)))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {27499#true} is VALID [2022-04-15 09:28:14,919 INFO L290 TraceCheckUtils]: 13: Hoare triple {28053#(or (<= (* main_~d~0 8) main_~r~0) (not (<= (* main_~d~0 4) main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 8) 2)) main_~r~0 (* (+ (div (* main_~p~0 8) 2) main_~q~0) (mod main_~B~0 4294967296)))))} assume !!(#t~post6 < 20);havoc #t~post6; {28053#(or (<= (* main_~d~0 8) main_~r~0) (not (<= (* main_~d~0 4) main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 8) 2)) main_~r~0 (* (+ (div (* main_~p~0 8) 2) main_~q~0) (mod main_~B~0 4294967296)))))} is VALID [2022-04-15 09:28:14,919 INFO L290 TraceCheckUtils]: 12: Hoare triple {28053#(or (<= (* main_~d~0 8) main_~r~0) (not (<= (* main_~d~0 4) main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 8) 2)) main_~r~0 (* (+ (div (* main_~p~0 8) 2) main_~q~0) (mod main_~B~0 4294967296)))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {28053#(or (<= (* main_~d~0 8) main_~r~0) (not (<= (* main_~d~0 4) main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 8) 2)) main_~r~0 (* (+ (div (* main_~p~0 8) 2) main_~q~0) (mod main_~B~0 4294967296)))))} is VALID [2022-04-15 09:28:14,922 INFO L290 TraceCheckUtils]: 11: Hoare triple {27499#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {28053#(or (<= (* main_~d~0 8) main_~r~0) (not (<= (* main_~d~0 4) main_~r~0)) (= (mod main_~A~0 4294967296) (+ (* (- 1) (div (* main_~d~0 8) 2)) main_~r~0 (* (+ (div (* main_~p~0 8) 2) main_~q~0) (mod main_~B~0 4294967296)))))} is VALID [2022-04-15 09:28:14,923 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {27499#true} {27499#true} #80#return; {27499#true} is VALID [2022-04-15 09:28:14,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-15 09:28:14,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {27499#true} assume !(0 == ~cond); {27499#true} is VALID [2022-04-15 09:28:14,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {27499#true} ~cond := #in~cond; {27499#true} is VALID [2022-04-15 09:28:14,923 INFO L272 TraceCheckUtils]: 6: Hoare triple {27499#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {27499#true} is VALID [2022-04-15 09:28:14,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {27499#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {27499#true} is VALID [2022-04-15 09:28:14,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {27499#true} call #t~ret8 := main(); {27499#true} is VALID [2022-04-15 09:28:14,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27499#true} {27499#true} #96#return; {27499#true} is VALID [2022-04-15 09:28:14,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {27499#true} assume true; {27499#true} is VALID [2022-04-15 09:28:14,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {27499#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {27499#true} is VALID [2022-04-15 09:28:14,924 INFO L272 TraceCheckUtils]: 0: Hoare triple {27499#true} call ULTIMATE.init(); {27499#true} is VALID [2022-04-15 09:28:14,924 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 28 proven. 39 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-04-15 09:28:14,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:28:14,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847057791] [2022-04-15 09:28:14,925 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:28:14,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265873787] [2022-04-15 09:28:14,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265873787] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:28:14,925 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:28:14,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 21 [2022-04-15 09:28:14,925 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:28:14,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1023723259] [2022-04-15 09:28:14,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1023723259] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:28:14,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:28:14,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 09:28:14,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953024636] [2022-04-15 09:28:14,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:28:14,926 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 12 states have internal predecessors, (31), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) Word has length 104 [2022-04-15 09:28:14,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:28:14,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 12 states have internal predecessors, (31), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-15 09:28:15,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:28:15,055 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 09:28:15,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:28:15,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 09:28:15,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2022-04-15 09:28:15,056 INFO L87 Difference]: Start difference. First operand 221 states and 247 transitions. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 12 states have internal predecessors, (31), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-15 09:28:19,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:28:19,710 INFO L93 Difference]: Finished difference Result 280 states and 328 transitions. [2022-04-15 09:28:19,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 09:28:19,710 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 12 states have internal predecessors, (31), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) Word has length 104 [2022-04-15 09:28:19,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:28:19,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 12 states have internal predecessors, (31), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-15 09:28:19,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 135 transitions. [2022-04-15 09:28:19,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 12 states have internal predecessors, (31), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-15 09:28:19,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 135 transitions. [2022-04-15 09:28:19,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 135 transitions. [2022-04-15 09:28:19,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:28:19,888 INFO L225 Difference]: With dead ends: 280 [2022-04-15 09:28:19,888 INFO L226 Difference]: Without dead ends: 235 [2022-04-15 09:28:19,889 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 187 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2022-04-15 09:28:19,889 INFO L913 BasicCegarLoop]: 61 mSDtfsCounter, 39 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-15 09:28:19,889 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 371 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-15 09:28:19,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2022-04-15 09:28:20,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 232. [2022-04-15 09:28:20,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:28:20,270 INFO L82 GeneralOperation]: Start isEquivalent. First operand 235 states. Second operand has 232 states, 153 states have (on average 1.1241830065359477) internal successors, (172), 158 states have internal predecessors, (172), 46 states have call successors, (46), 33 states have call predecessors, (46), 32 states have return successors, (43), 40 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-15 09:28:20,271 INFO L74 IsIncluded]: Start isIncluded. First operand 235 states. Second operand has 232 states, 153 states have (on average 1.1241830065359477) internal successors, (172), 158 states have internal predecessors, (172), 46 states have call successors, (46), 33 states have call predecessors, (46), 32 states have return successors, (43), 40 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-15 09:28:20,271 INFO L87 Difference]: Start difference. First operand 235 states. Second operand has 232 states, 153 states have (on average 1.1241830065359477) internal successors, (172), 158 states have internal predecessors, (172), 46 states have call successors, (46), 33 states have call predecessors, (46), 32 states have return successors, (43), 40 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-15 09:28:20,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:28:20,276 INFO L93 Difference]: Finished difference Result 235 states and 266 transitions. [2022-04-15 09:28:20,276 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 266 transitions. [2022-04-15 09:28:20,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:28:20,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:28:20,277 INFO L74 IsIncluded]: Start isIncluded. First operand has 232 states, 153 states have (on average 1.1241830065359477) internal successors, (172), 158 states have internal predecessors, (172), 46 states have call successors, (46), 33 states have call predecessors, (46), 32 states have return successors, (43), 40 states have call predecessors, (43), 43 states have call successors, (43) Second operand 235 states. [2022-04-15 09:28:20,278 INFO L87 Difference]: Start difference. First operand has 232 states, 153 states have (on average 1.1241830065359477) internal successors, (172), 158 states have internal predecessors, (172), 46 states have call successors, (46), 33 states have call predecessors, (46), 32 states have return successors, (43), 40 states have call predecessors, (43), 43 states have call successors, (43) Second operand 235 states. [2022-04-15 09:28:20,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:28:20,282 INFO L93 Difference]: Finished difference Result 235 states and 266 transitions. [2022-04-15 09:28:20,282 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 266 transitions. [2022-04-15 09:28:20,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:28:20,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:28:20,283 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:28:20,283 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:28:20,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 153 states have (on average 1.1241830065359477) internal successors, (172), 158 states have internal predecessors, (172), 46 states have call successors, (46), 33 states have call predecessors, (46), 32 states have return successors, (43), 40 states have call predecessors, (43), 43 states have call successors, (43) [2022-04-15 09:28:20,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 261 transitions. [2022-04-15 09:28:20,289 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 261 transitions. Word has length 104 [2022-04-15 09:28:20,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:28:20,289 INFO L478 AbstractCegarLoop]: Abstraction has 232 states and 261 transitions. [2022-04-15 09:28:20,289 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 12 states have internal predecessors, (31), 7 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-04-15 09:28:20,290 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 232 states and 261 transitions. [2022-04-15 09:28:22,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 260 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 09:28:22,882 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 261 transitions. [2022-04-15 09:28:22,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-04-15 09:28:22,883 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:28:22,883 INFO L499 BasicCegarLoop]: trace histogram [16, 15, 15, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:28:22,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-04-15 09:28:23,083 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:28:23,084 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:28:23,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:28:23,084 INFO L85 PathProgramCache]: Analyzing trace with hash 979077220, now seen corresponding path program 15 times [2022-04-15 09:28:23,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:28:23,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [99422874] [2022-04-15 09:28:29,705 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:28:29,706 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:28:29,706 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:28:29,706 INFO L85 PathProgramCache]: Analyzing trace with hash 979077220, now seen corresponding path program 16 times [2022-04-15 09:28:29,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:28:29,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609895489] [2022-04-15 09:28:29,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:28:29,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:28:29,716 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:28:29,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [916145199] [2022-04-15 09:28:29,717 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 09:28:29,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:28:29,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:28:29,722 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:28:29,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-15 09:28:29,784 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 09:28:29,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:28:29,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 09:28:29,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:28:29,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:28:30,648 INFO L272 TraceCheckUtils]: 0: Hoare triple {29641#true} call ULTIMATE.init(); {29641#true} is VALID [2022-04-15 09:28:30,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {29641#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {29641#true} is VALID [2022-04-15 09:28:30,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-15 09:28:30,648 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29641#true} {29641#true} #96#return; {29641#true} is VALID [2022-04-15 09:28:30,648 INFO L272 TraceCheckUtils]: 4: Hoare triple {29641#true} call #t~ret8 := main(); {29641#true} is VALID [2022-04-15 09:28:30,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {29641#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {29641#true} is VALID [2022-04-15 09:28:30,649 INFO L272 TraceCheckUtils]: 6: Hoare triple {29641#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {29641#true} is VALID [2022-04-15 09:28:30,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-15 09:28:30,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-15 09:28:30,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-15 09:28:30,649 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29641#true} {29641#true} #80#return; {29641#true} is VALID [2022-04-15 09:28:30,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {29641#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {29679#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-15 09:28:30,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {29679#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29679#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-15 09:28:30,650 INFO L290 TraceCheckUtils]: 13: Hoare triple {29679#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {29679#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-15 09:28:30,650 INFO L272 TraceCheckUtils]: 14: Hoare triple {29679#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29641#true} is VALID [2022-04-15 09:28:30,650 INFO L290 TraceCheckUtils]: 15: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-15 09:28:30,650 INFO L290 TraceCheckUtils]: 16: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-15 09:28:30,650 INFO L290 TraceCheckUtils]: 17: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-15 09:28:30,651 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {29641#true} {29679#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #82#return; {29679#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-15 09:28:30,651 INFO L272 TraceCheckUtils]: 19: Hoare triple {29679#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {29641#true} is VALID [2022-04-15 09:28:30,651 INFO L290 TraceCheckUtils]: 20: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-15 09:28:30,651 INFO L290 TraceCheckUtils]: 21: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-15 09:28:30,651 INFO L290 TraceCheckUtils]: 22: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-15 09:28:30,653 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {29641#true} {29679#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #84#return; {29679#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-15 09:28:30,653 INFO L272 TraceCheckUtils]: 24: Hoare triple {29679#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {29641#true} is VALID [2022-04-15 09:28:30,653 INFO L290 TraceCheckUtils]: 25: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-15 09:28:30,653 INFO L290 TraceCheckUtils]: 26: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-15 09:28:30,653 INFO L290 TraceCheckUtils]: 27: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-15 09:28:30,653 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {29641#true} {29679#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} #86#return; {29679#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} is VALID [2022-04-15 09:28:30,655 INFO L290 TraceCheckUtils]: 29: Hoare triple {29679#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {29734#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2))} is VALID [2022-04-15 09:28:30,655 INFO L290 TraceCheckUtils]: 30: Hoare triple {29734#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29734#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2))} is VALID [2022-04-15 09:28:30,656 INFO L290 TraceCheckUtils]: 31: Hoare triple {29734#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2))} assume !!(#t~post6 < 20);havoc #t~post6; {29734#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2))} is VALID [2022-04-15 09:28:30,656 INFO L272 TraceCheckUtils]: 32: Hoare triple {29734#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29641#true} is VALID [2022-04-15 09:28:30,656 INFO L290 TraceCheckUtils]: 33: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-15 09:28:30,656 INFO L290 TraceCheckUtils]: 34: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-15 09:28:30,656 INFO L290 TraceCheckUtils]: 35: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-15 09:28:30,656 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {29641#true} {29734#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2))} #82#return; {29734#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2))} is VALID [2022-04-15 09:28:30,656 INFO L272 TraceCheckUtils]: 37: Hoare triple {29734#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {29641#true} is VALID [2022-04-15 09:28:30,657 INFO L290 TraceCheckUtils]: 38: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-15 09:28:30,657 INFO L290 TraceCheckUtils]: 39: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-15 09:28:30,657 INFO L290 TraceCheckUtils]: 40: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-15 09:28:30,657 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {29641#true} {29734#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2))} #84#return; {29734#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2))} is VALID [2022-04-15 09:28:30,657 INFO L272 TraceCheckUtils]: 42: Hoare triple {29734#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {29641#true} is VALID [2022-04-15 09:28:30,657 INFO L290 TraceCheckUtils]: 43: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-15 09:28:30,657 INFO L290 TraceCheckUtils]: 44: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-15 09:28:30,658 INFO L290 TraceCheckUtils]: 45: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-15 09:28:30,658 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {29641#true} {29734#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2))} #86#return; {29734#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2))} is VALID [2022-04-15 09:28:30,659 INFO L290 TraceCheckUtils]: 47: Hoare triple {29734#(and (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {29789#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~p~0 4))} is VALID [2022-04-15 09:28:30,659 INFO L290 TraceCheckUtils]: 48: Hoare triple {29789#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~p~0 4))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29789#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~p~0 4))} is VALID [2022-04-15 09:28:30,659 INFO L290 TraceCheckUtils]: 49: Hoare triple {29789#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~p~0 4))} assume !!(#t~post6 < 20);havoc #t~post6; {29789#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~p~0 4))} is VALID [2022-04-15 09:28:30,660 INFO L272 TraceCheckUtils]: 50: Hoare triple {29789#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~p~0 4))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29641#true} is VALID [2022-04-15 09:28:30,660 INFO L290 TraceCheckUtils]: 51: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-15 09:28:30,660 INFO L290 TraceCheckUtils]: 52: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-15 09:28:30,660 INFO L290 TraceCheckUtils]: 53: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-15 09:28:30,660 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {29641#true} {29789#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~p~0 4))} #82#return; {29789#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~p~0 4))} is VALID [2022-04-15 09:28:30,660 INFO L272 TraceCheckUtils]: 55: Hoare triple {29789#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~p~0 4))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {29641#true} is VALID [2022-04-15 09:28:30,660 INFO L290 TraceCheckUtils]: 56: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-15 09:28:30,660 INFO L290 TraceCheckUtils]: 57: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-15 09:28:30,661 INFO L290 TraceCheckUtils]: 58: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-15 09:28:30,661 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {29641#true} {29789#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~p~0 4))} #84#return; {29789#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~p~0 4))} is VALID [2022-04-15 09:28:30,661 INFO L272 TraceCheckUtils]: 60: Hoare triple {29789#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~p~0 4))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {29641#true} is VALID [2022-04-15 09:28:30,661 INFO L290 TraceCheckUtils]: 61: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-15 09:28:30,661 INFO L290 TraceCheckUtils]: 62: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-15 09:28:30,661 INFO L290 TraceCheckUtils]: 63: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-15 09:28:30,662 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {29641#true} {29789#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~p~0 4))} #86#return; {29789#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~p~0 4))} is VALID [2022-04-15 09:28:30,663 INFO L290 TraceCheckUtils]: 65: Hoare triple {29789#(and (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~p~0 4))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {29844#(and (= main_~p~0 8) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (<= (* (mod main_~B~0 4294967296) 4) main_~r~0))} is VALID [2022-04-15 09:28:30,663 INFO L290 TraceCheckUtils]: 66: Hoare triple {29844#(and (= main_~p~0 8) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (<= (* (mod main_~B~0 4294967296) 4) main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29844#(and (= main_~p~0 8) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (<= (* (mod main_~B~0 4294967296) 4) main_~r~0))} is VALID [2022-04-15 09:28:30,664 INFO L290 TraceCheckUtils]: 67: Hoare triple {29844#(and (= main_~p~0 8) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (<= (* (mod main_~B~0 4294967296) 4) main_~r~0))} assume !!(#t~post6 < 20);havoc #t~post6; {29844#(and (= main_~p~0 8) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (<= (* (mod main_~B~0 4294967296) 4) main_~r~0))} is VALID [2022-04-15 09:28:30,664 INFO L272 TraceCheckUtils]: 68: Hoare triple {29844#(and (= main_~p~0 8) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (<= (* (mod main_~B~0 4294967296) 4) main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29641#true} is VALID [2022-04-15 09:28:30,664 INFO L290 TraceCheckUtils]: 69: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-15 09:28:30,664 INFO L290 TraceCheckUtils]: 70: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-15 09:28:30,664 INFO L290 TraceCheckUtils]: 71: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-15 09:28:30,664 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {29641#true} {29844#(and (= main_~p~0 8) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (<= (* (mod main_~B~0 4294967296) 4) main_~r~0))} #82#return; {29844#(and (= main_~p~0 8) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (<= (* (mod main_~B~0 4294967296) 4) main_~r~0))} is VALID [2022-04-15 09:28:30,664 INFO L272 TraceCheckUtils]: 73: Hoare triple {29844#(and (= main_~p~0 8) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (<= (* (mod main_~B~0 4294967296) 4) main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {29641#true} is VALID [2022-04-15 09:28:30,665 INFO L290 TraceCheckUtils]: 74: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-15 09:28:30,665 INFO L290 TraceCheckUtils]: 75: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-15 09:28:30,665 INFO L290 TraceCheckUtils]: 76: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-15 09:28:30,665 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {29641#true} {29844#(and (= main_~p~0 8) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (<= (* (mod main_~B~0 4294967296) 4) main_~r~0))} #84#return; {29844#(and (= main_~p~0 8) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (<= (* (mod main_~B~0 4294967296) 4) main_~r~0))} is VALID [2022-04-15 09:28:30,665 INFO L272 TraceCheckUtils]: 78: Hoare triple {29844#(and (= main_~p~0 8) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (<= (* (mod main_~B~0 4294967296) 4) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {29641#true} is VALID [2022-04-15 09:28:30,665 INFO L290 TraceCheckUtils]: 79: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-15 09:28:30,665 INFO L290 TraceCheckUtils]: 80: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-15 09:28:30,666 INFO L290 TraceCheckUtils]: 81: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-15 09:28:30,666 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {29641#true} {29844#(and (= main_~p~0 8) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (<= (* (mod main_~B~0 4294967296) 4) main_~r~0))} #86#return; {29844#(and (= main_~p~0 8) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (<= (* (mod main_~B~0 4294967296) 4) main_~r~0))} is VALID [2022-04-15 09:28:30,667 INFO L290 TraceCheckUtils]: 83: Hoare triple {29844#(and (= main_~p~0 8) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (<= (* (mod main_~B~0 4294967296) 4) main_~r~0))} assume !(~r~0 >= ~d~0); {29899#(and (< (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~p~0 8) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0))} is VALID [2022-04-15 09:28:30,668 INFO L290 TraceCheckUtils]: 84: Hoare triple {29899#(and (< (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~p~0 8) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29899#(and (< (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~p~0 8) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0))} is VALID [2022-04-15 09:28:30,668 INFO L290 TraceCheckUtils]: 85: Hoare triple {29899#(and (< (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~p~0 8) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0))} assume !!(#t~post7 < 20);havoc #t~post7; {29899#(and (< (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~p~0 8) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0))} is VALID [2022-04-15 09:28:30,668 INFO L272 TraceCheckUtils]: 86: Hoare triple {29899#(and (< (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~p~0 8) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {29641#true} is VALID [2022-04-15 09:28:30,668 INFO L290 TraceCheckUtils]: 87: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-15 09:28:30,668 INFO L290 TraceCheckUtils]: 88: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-15 09:28:30,668 INFO L290 TraceCheckUtils]: 89: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-15 09:28:30,669 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {29641#true} {29899#(and (< (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~p~0 8) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0))} #88#return; {29899#(and (< (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~p~0 8) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0))} is VALID [2022-04-15 09:28:30,669 INFO L272 TraceCheckUtils]: 91: Hoare triple {29899#(and (< (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~p~0 8) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {29641#true} is VALID [2022-04-15 09:28:30,669 INFO L290 TraceCheckUtils]: 92: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-15 09:28:30,669 INFO L290 TraceCheckUtils]: 93: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-15 09:28:30,669 INFO L290 TraceCheckUtils]: 94: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-15 09:28:30,670 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {29641#true} {29899#(and (< (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~p~0 8) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0))} #90#return; {29899#(and (< (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~p~0 8) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0))} is VALID [2022-04-15 09:28:30,671 INFO L290 TraceCheckUtils]: 96: Hoare triple {29899#(and (< (* (mod main_~B~0 4294967296) 4) main_~d~0) (= main_~p~0 8) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {29939#(and (= main_~d~0 (div (* 8 (mod main_~B~0 4294967296)) 2)) (< 0 (* (mod main_~B~0 4294967296) 4)) (= main_~p~0 4))} is VALID [2022-04-15 09:28:30,671 INFO L290 TraceCheckUtils]: 97: Hoare triple {29939#(and (= main_~d~0 (div (* 8 (mod main_~B~0 4294967296)) 2)) (< 0 (* (mod main_~B~0 4294967296) 4)) (= main_~p~0 4))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {29939#(and (= main_~d~0 (div (* 8 (mod main_~B~0 4294967296)) 2)) (< 0 (* (mod main_~B~0 4294967296) 4)) (= main_~p~0 4))} is VALID [2022-04-15 09:28:30,672 INFO L290 TraceCheckUtils]: 98: Hoare triple {29939#(and (= main_~d~0 (div (* 8 (mod main_~B~0 4294967296)) 2)) (< 0 (* (mod main_~B~0 4294967296) 4)) (= main_~p~0 4))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29939#(and (= main_~d~0 (div (* 8 (mod main_~B~0 4294967296)) 2)) (< 0 (* (mod main_~B~0 4294967296) 4)) (= main_~p~0 4))} is VALID [2022-04-15 09:28:30,672 INFO L290 TraceCheckUtils]: 99: Hoare triple {29939#(and (= main_~d~0 (div (* 8 (mod main_~B~0 4294967296)) 2)) (< 0 (* (mod main_~B~0 4294967296) 4)) (= main_~p~0 4))} assume !!(#t~post7 < 20);havoc #t~post7; {29939#(and (= main_~d~0 (div (* 8 (mod main_~B~0 4294967296)) 2)) (< 0 (* (mod main_~B~0 4294967296) 4)) (= main_~p~0 4))} is VALID [2022-04-15 09:28:30,672 INFO L272 TraceCheckUtils]: 100: Hoare triple {29939#(and (= main_~d~0 (div (* 8 (mod main_~B~0 4294967296)) 2)) (< 0 (* (mod main_~B~0 4294967296) 4)) (= main_~p~0 4))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {29641#true} is VALID [2022-04-15 09:28:30,672 INFO L290 TraceCheckUtils]: 101: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-15 09:28:30,672 INFO L290 TraceCheckUtils]: 102: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-15 09:28:30,672 INFO L290 TraceCheckUtils]: 103: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-15 09:28:30,673 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {29641#true} {29939#(and (= main_~d~0 (div (* 8 (mod main_~B~0 4294967296)) 2)) (< 0 (* (mod main_~B~0 4294967296) 4)) (= main_~p~0 4))} #88#return; {29939#(and (= main_~d~0 (div (* 8 (mod main_~B~0 4294967296)) 2)) (< 0 (* (mod main_~B~0 4294967296) 4)) (= main_~p~0 4))} is VALID [2022-04-15 09:28:30,673 INFO L272 TraceCheckUtils]: 105: Hoare triple {29939#(and (= main_~d~0 (div (* 8 (mod main_~B~0 4294967296)) 2)) (< 0 (* (mod main_~B~0 4294967296) 4)) (= main_~p~0 4))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {29967#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 09:28:30,674 INFO L290 TraceCheckUtils]: 106: Hoare triple {29967#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {29971#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:28:30,674 INFO L290 TraceCheckUtils]: 107: Hoare triple {29971#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29642#false} is VALID [2022-04-15 09:28:30,674 INFO L290 TraceCheckUtils]: 108: Hoare triple {29642#false} assume !false; {29642#false} is VALID [2022-04-15 09:28:30,674 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 30 proven. 40 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2022-04-15 09:28:30,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:28:34,169 INFO L290 TraceCheckUtils]: 108: Hoare triple {29642#false} assume !false; {29642#false} is VALID [2022-04-15 09:28:34,169 INFO L290 TraceCheckUtils]: 107: Hoare triple {29971#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29642#false} is VALID [2022-04-15 09:28:34,170 INFO L290 TraceCheckUtils]: 106: Hoare triple {29967#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {29971#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:28:34,170 INFO L272 TraceCheckUtils]: 105: Hoare triple {29987#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {29967#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 09:28:34,171 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {29641#true} {29987#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #88#return; {29987#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 09:28:34,171 INFO L290 TraceCheckUtils]: 103: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-15 09:28:34,171 INFO L290 TraceCheckUtils]: 102: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-15 09:28:34,171 INFO L290 TraceCheckUtils]: 101: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-15 09:28:34,171 INFO L272 TraceCheckUtils]: 100: Hoare triple {29987#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {29641#true} is VALID [2022-04-15 09:28:34,172 INFO L290 TraceCheckUtils]: 99: Hoare triple {29987#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} assume !!(#t~post7 < 20);havoc #t~post7; {29987#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 09:28:34,172 INFO L290 TraceCheckUtils]: 98: Hoare triple {29987#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29987#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 09:28:34,172 INFO L290 TraceCheckUtils]: 97: Hoare triple {29987#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {29987#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 09:28:34,188 INFO L290 TraceCheckUtils]: 96: Hoare triple {30015#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0)))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {29987#(= main_~d~0 (* main_~p~0 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 09:28:34,189 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {29641#true} {30015#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0)))))} #90#return; {30015#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-15 09:28:34,189 INFO L290 TraceCheckUtils]: 94: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-15 09:28:34,189 INFO L290 TraceCheckUtils]: 93: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-15 09:28:34,189 INFO L290 TraceCheckUtils]: 92: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-15 09:28:34,189 INFO L272 TraceCheckUtils]: 91: Hoare triple {30015#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0)))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {29641#true} is VALID [2022-04-15 09:28:34,190 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {29641#true} {30015#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0)))))} #88#return; {30015#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-15 09:28:34,190 INFO L290 TraceCheckUtils]: 89: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-15 09:28:34,190 INFO L290 TraceCheckUtils]: 88: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-15 09:28:34,190 INFO L290 TraceCheckUtils]: 87: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-15 09:28:34,190 INFO L272 TraceCheckUtils]: 86: Hoare triple {30015#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0)))))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {29641#true} is VALID [2022-04-15 09:28:34,192 INFO L290 TraceCheckUtils]: 85: Hoare triple {30015#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0)))))} assume !!(#t~post7 < 20);havoc #t~post7; {30015#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-15 09:28:34,193 INFO L290 TraceCheckUtils]: 84: Hoare triple {30015#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0)))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {30015#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-15 09:28:34,194 INFO L290 TraceCheckUtils]: 83: Hoare triple {30055#(or (<= main_~d~0 main_~r~0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0))))))} assume !(~r~0 >= ~d~0); {30015#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-15 09:28:34,195 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {29641#true} {30055#(or (<= main_~d~0 main_~r~0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0))))))} #86#return; {30055#(or (<= main_~d~0 main_~r~0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0))))))} is VALID [2022-04-15 09:28:34,195 INFO L290 TraceCheckUtils]: 81: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-15 09:28:34,195 INFO L290 TraceCheckUtils]: 80: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-15 09:28:34,195 INFO L290 TraceCheckUtils]: 79: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-15 09:28:34,195 INFO L272 TraceCheckUtils]: 78: Hoare triple {30055#(or (<= main_~d~0 main_~r~0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0))))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {29641#true} is VALID [2022-04-15 09:28:34,196 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {29641#true} {30055#(or (<= main_~d~0 main_~r~0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0))))))} #84#return; {30055#(or (<= main_~d~0 main_~r~0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0))))))} is VALID [2022-04-15 09:28:34,196 INFO L290 TraceCheckUtils]: 76: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-15 09:28:34,196 INFO L290 TraceCheckUtils]: 75: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-15 09:28:34,196 INFO L290 TraceCheckUtils]: 74: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-15 09:28:34,196 INFO L272 TraceCheckUtils]: 73: Hoare triple {30055#(or (<= main_~d~0 main_~r~0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0))))))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {29641#true} is VALID [2022-04-15 09:28:34,197 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {29641#true} {30055#(or (<= main_~d~0 main_~r~0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0))))))} #82#return; {30055#(or (<= main_~d~0 main_~r~0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0))))))} is VALID [2022-04-15 09:28:34,197 INFO L290 TraceCheckUtils]: 71: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-15 09:28:34,197 INFO L290 TraceCheckUtils]: 70: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-15 09:28:34,197 INFO L290 TraceCheckUtils]: 69: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-15 09:28:34,197 INFO L272 TraceCheckUtils]: 68: Hoare triple {30055#(or (<= main_~d~0 main_~r~0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0))))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29641#true} is VALID [2022-04-15 09:28:34,198 INFO L290 TraceCheckUtils]: 67: Hoare triple {30055#(or (<= main_~d~0 main_~r~0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0))))))} assume !!(#t~post6 < 20);havoc #t~post6; {30055#(or (<= main_~d~0 main_~r~0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0))))))} is VALID [2022-04-15 09:28:34,200 INFO L290 TraceCheckUtils]: 66: Hoare triple {30055#(or (<= main_~d~0 main_~r~0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0))))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {30055#(or (<= main_~d~0 main_~r~0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0))))))} is VALID [2022-04-15 09:28:34,204 INFO L290 TraceCheckUtils]: 65: Hoare triple {30110#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {30055#(or (<= main_~d~0 main_~r~0) (and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (+ (div main_~d~0 2) 1)) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (+ (div main_~d~0 2) 1)) (= (mod main_~p~0 2) 0)))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (* (mod main_~B~0 4294967296) (div main_~p~0 2)) (div main_~d~0 2))) (or (not (< main_~p~0 0)) (= (* (+ (div main_~p~0 2) 1) (mod main_~B~0 4294967296)) (div main_~d~0 2)) (= (mod main_~p~0 2) 0))))))} is VALID [2022-04-15 09:28:34,205 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {29641#true} {30110#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} #86#return; {30110#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-15 09:28:34,205 INFO L290 TraceCheckUtils]: 63: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-15 09:28:34,205 INFO L290 TraceCheckUtils]: 62: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-15 09:28:34,205 INFO L290 TraceCheckUtils]: 61: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-15 09:28:34,205 INFO L272 TraceCheckUtils]: 60: Hoare triple {30110#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {29641#true} is VALID [2022-04-15 09:28:34,206 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {29641#true} {30110#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} #84#return; {30110#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-15 09:28:34,206 INFO L290 TraceCheckUtils]: 58: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-15 09:28:34,206 INFO L290 TraceCheckUtils]: 57: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-15 09:28:34,206 INFO L290 TraceCheckUtils]: 56: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-15 09:28:34,206 INFO L272 TraceCheckUtils]: 55: Hoare triple {30110#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {29641#true} is VALID [2022-04-15 09:28:34,207 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {29641#true} {30110#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} #82#return; {30110#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-15 09:28:34,207 INFO L290 TraceCheckUtils]: 53: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-15 09:28:34,207 INFO L290 TraceCheckUtils]: 52: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-15 09:28:34,207 INFO L290 TraceCheckUtils]: 51: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-15 09:28:34,207 INFO L272 TraceCheckUtils]: 50: Hoare triple {30110#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29641#true} is VALID [2022-04-15 09:28:34,208 INFO L290 TraceCheckUtils]: 49: Hoare triple {30110#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} assume !!(#t~post6 < 20);havoc #t~post6; {30110#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-15 09:28:34,208 INFO L290 TraceCheckUtils]: 48: Hoare triple {30110#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {30110#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-15 09:28:34,210 INFO L290 TraceCheckUtils]: 47: Hoare triple {30110#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {30110#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-15 09:28:34,211 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {29641#true} {30110#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} #86#return; {30110#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-15 09:28:34,211 INFO L290 TraceCheckUtils]: 45: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-15 09:28:34,211 INFO L290 TraceCheckUtils]: 44: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-15 09:28:34,211 INFO L290 TraceCheckUtils]: 43: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-15 09:28:34,211 INFO L272 TraceCheckUtils]: 42: Hoare triple {30110#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {29641#true} is VALID [2022-04-15 09:28:34,212 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {29641#true} {30110#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} #84#return; {30110#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-15 09:28:34,212 INFO L290 TraceCheckUtils]: 40: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-15 09:28:34,212 INFO L290 TraceCheckUtils]: 39: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-15 09:28:34,212 INFO L290 TraceCheckUtils]: 38: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-15 09:28:34,212 INFO L272 TraceCheckUtils]: 37: Hoare triple {30110#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {29641#true} is VALID [2022-04-15 09:28:34,213 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {29641#true} {30110#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} #82#return; {30110#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-15 09:28:34,213 INFO L290 TraceCheckUtils]: 35: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-15 09:28:34,213 INFO L290 TraceCheckUtils]: 34: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-15 09:28:34,213 INFO L290 TraceCheckUtils]: 33: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-15 09:28:34,213 INFO L272 TraceCheckUtils]: 32: Hoare triple {30110#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29641#true} is VALID [2022-04-15 09:28:34,213 INFO L290 TraceCheckUtils]: 31: Hoare triple {30110#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} assume !!(#t~post6 < 20);havoc #t~post6; {30110#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-15 09:28:34,214 INFO L290 TraceCheckUtils]: 30: Hoare triple {30110#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {30110#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-15 09:28:34,216 INFO L290 TraceCheckUtils]: 29: Hoare triple {30110#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {30110#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-15 09:28:34,216 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {29641#true} {30110#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} #86#return; {30110#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-15 09:28:34,217 INFO L290 TraceCheckUtils]: 27: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-15 09:28:34,217 INFO L290 TraceCheckUtils]: 26: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-15 09:28:34,217 INFO L290 TraceCheckUtils]: 25: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-15 09:28:34,217 INFO L272 TraceCheckUtils]: 24: Hoare triple {30110#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {29641#true} is VALID [2022-04-15 09:28:34,217 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {29641#true} {30110#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} #84#return; {30110#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-15 09:28:34,218 INFO L290 TraceCheckUtils]: 22: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-15 09:28:34,218 INFO L290 TraceCheckUtils]: 21: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-15 09:28:34,218 INFO L290 TraceCheckUtils]: 20: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-15 09:28:34,218 INFO L272 TraceCheckUtils]: 19: Hoare triple {30110#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {29641#true} is VALID [2022-04-15 09:28:34,218 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {29641#true} {30110#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} #82#return; {30110#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-15 09:28:34,218 INFO L290 TraceCheckUtils]: 17: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-15 09:28:34,219 INFO L290 TraceCheckUtils]: 16: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-15 09:28:34,219 INFO L290 TraceCheckUtils]: 15: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-15 09:28:34,219 INFO L272 TraceCheckUtils]: 14: Hoare triple {30110#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {29641#true} is VALID [2022-04-15 09:28:34,219 INFO L290 TraceCheckUtils]: 13: Hoare triple {30110#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} assume !!(#t~post6 < 20);havoc #t~post6; {30110#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-15 09:28:34,220 INFO L290 TraceCheckUtils]: 12: Hoare triple {30110#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {30110#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-15 09:28:34,220 INFO L290 TraceCheckUtils]: 11: Hoare triple {29641#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {30110#(or (<= main_~d~0 0) (= (div (* main_~d~0 2) 2) (* (div (* main_~p~0 2) 2) (mod main_~B~0 4294967296))))} is VALID [2022-04-15 09:28:34,220 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29641#true} {29641#true} #80#return; {29641#true} is VALID [2022-04-15 09:28:34,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-15 09:28:34,220 INFO L290 TraceCheckUtils]: 8: Hoare triple {29641#true} assume !(0 == ~cond); {29641#true} is VALID [2022-04-15 09:28:34,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {29641#true} ~cond := #in~cond; {29641#true} is VALID [2022-04-15 09:28:34,221 INFO L272 TraceCheckUtils]: 6: Hoare triple {29641#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {29641#true} is VALID [2022-04-15 09:28:34,221 INFO L290 TraceCheckUtils]: 5: Hoare triple {29641#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {29641#true} is VALID [2022-04-15 09:28:34,221 INFO L272 TraceCheckUtils]: 4: Hoare triple {29641#true} call #t~ret8 := main(); {29641#true} is VALID [2022-04-15 09:28:34,221 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29641#true} {29641#true} #96#return; {29641#true} is VALID [2022-04-15 09:28:34,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {29641#true} assume true; {29641#true} is VALID [2022-04-15 09:28:34,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {29641#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {29641#true} is VALID [2022-04-15 09:28:34,221 INFO L272 TraceCheckUtils]: 0: Hoare triple {29641#true} call ULTIMATE.init(); {29641#true} is VALID [2022-04-15 09:28:34,222 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 30 proven. 22 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2022-04-15 09:28:34,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:28:34,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609895489] [2022-04-15 09:28:34,222 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:28:34,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916145199] [2022-04-15 09:28:34,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916145199] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:28:34,222 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:28:34,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2022-04-15 09:28:34,223 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:28:34,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [99422874] [2022-04-15 09:28:34,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [99422874] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:28:34,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:28:34,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 09:28:34,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304824895] [2022-04-15 09:28:34,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:28:34,224 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 7 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 7 states have call predecessors, (17), 7 states have call successors, (17) Word has length 109 [2022-04-15 09:28:34,224 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:28:34,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 7 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 7 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-15 09:28:34,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:28:34,348 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 09:28:34,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:28:34,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 09:28:34,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-04-15 09:28:34,349 INFO L87 Difference]: Start difference. First operand 232 states and 261 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 7 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 7 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-15 09:28:38,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:28:38,483 INFO L93 Difference]: Finished difference Result 286 states and 340 transitions. [2022-04-15 09:28:38,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 09:28:38,483 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 7 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 7 states have call predecessors, (17), 7 states have call successors, (17) Word has length 109 [2022-04-15 09:28:38,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:28:38,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 7 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 7 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-15 09:28:38,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 154 transitions. [2022-04-15 09:28:38,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 7 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 7 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-15 09:28:38,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 154 transitions. [2022-04-15 09:28:38,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 154 transitions. [2022-04-15 09:28:38,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:28:38,781 INFO L225 Difference]: With dead ends: 286 [2022-04-15 09:28:38,781 INFO L226 Difference]: Without dead ends: 256 [2022-04-15 09:28:38,781 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 202 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2022-04-15 09:28:38,782 INFO L913 BasicCegarLoop]: 89 mSDtfsCounter, 23 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-15 09:28:38,782 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 487 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-15 09:28:38,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-04-15 09:28:39,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 250. [2022-04-15 09:28:39,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:28:39,235 INFO L82 GeneralOperation]: Start isEquivalent. First operand 256 states. Second operand has 250 states, 165 states have (on average 1.1333333333333333) internal successors, (187), 172 states have internal predecessors, (187), 51 states have call successors, (51), 34 states have call predecessors, (51), 33 states have return successors, (48), 43 states have call predecessors, (48), 48 states have call successors, (48) [2022-04-15 09:28:39,235 INFO L74 IsIncluded]: Start isIncluded. First operand 256 states. Second operand has 250 states, 165 states have (on average 1.1333333333333333) internal successors, (187), 172 states have internal predecessors, (187), 51 states have call successors, (51), 34 states have call predecessors, (51), 33 states have return successors, (48), 43 states have call predecessors, (48), 48 states have call successors, (48) [2022-04-15 09:28:39,235 INFO L87 Difference]: Start difference. First operand 256 states. Second operand has 250 states, 165 states have (on average 1.1333333333333333) internal successors, (187), 172 states have internal predecessors, (187), 51 states have call successors, (51), 34 states have call predecessors, (51), 33 states have return successors, (48), 43 states have call predecessors, (48), 48 states have call successors, (48) [2022-04-15 09:28:39,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:28:39,240 INFO L93 Difference]: Finished difference Result 256 states and 294 transitions. [2022-04-15 09:28:39,240 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 294 transitions. [2022-04-15 09:28:39,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:28:39,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:28:39,242 INFO L74 IsIncluded]: Start isIncluded. First operand has 250 states, 165 states have (on average 1.1333333333333333) internal successors, (187), 172 states have internal predecessors, (187), 51 states have call successors, (51), 34 states have call predecessors, (51), 33 states have return successors, (48), 43 states have call predecessors, (48), 48 states have call successors, (48) Second operand 256 states. [2022-04-15 09:28:39,242 INFO L87 Difference]: Start difference. First operand has 250 states, 165 states have (on average 1.1333333333333333) internal successors, (187), 172 states have internal predecessors, (187), 51 states have call successors, (51), 34 states have call predecessors, (51), 33 states have return successors, (48), 43 states have call predecessors, (48), 48 states have call successors, (48) Second operand 256 states. [2022-04-15 09:28:39,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:28:39,247 INFO L93 Difference]: Finished difference Result 256 states and 294 transitions. [2022-04-15 09:28:39,247 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 294 transitions. [2022-04-15 09:28:39,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:28:39,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:28:39,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:28:39,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:28:39,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 165 states have (on average 1.1333333333333333) internal successors, (187), 172 states have internal predecessors, (187), 51 states have call successors, (51), 34 states have call predecessors, (51), 33 states have return successors, (48), 43 states have call predecessors, (48), 48 states have call successors, (48) [2022-04-15 09:28:39,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 286 transitions. [2022-04-15 09:28:39,254 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 286 transitions. Word has length 109 [2022-04-15 09:28:39,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:28:39,255 INFO L478 AbstractCegarLoop]: Abstraction has 250 states and 286 transitions. [2022-04-15 09:28:39,255 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 9 states have internal predecessors, (31), 7 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 7 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-15 09:28:39,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 250 states and 286 transitions. [2022-04-15 09:28:41,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 286 edges. 285 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 09:28:41,806 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 286 transitions. [2022-04-15 09:28:41,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-15 09:28:41,807 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:28:41,807 INFO L499 BasicCegarLoop]: trace histogram [16, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:28:41,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-04-15 09:28:42,007 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:28:42,008 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:28:42,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:28:42,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1412827450, now seen corresponding path program 3 times [2022-04-15 09:28:42,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:28:42,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1206005235] [2022-04-15 09:28:49,348 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:28:49,348 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:28:49,348 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:28:49,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1412827450, now seen corresponding path program 4 times [2022-04-15 09:28:49,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:28:49,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421611638] [2022-04-15 09:28:49,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:28:49,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:28:49,357 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:28:49,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1793911608] [2022-04-15 09:28:49,358 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 09:28:49,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:28:49,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:28:49,359 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:28:49,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-15 09:28:49,424 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 09:28:49,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:28:49,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-15 09:28:49,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:28:49,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:29:01,367 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 09:29:01,574 INFO L272 TraceCheckUtils]: 0: Hoare triple {31896#true} call ULTIMATE.init(); {31896#true} is VALID [2022-04-15 09:29:01,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {31896#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {31896#true} is VALID [2022-04-15 09:29:01,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {31896#true} assume true; {31896#true} is VALID [2022-04-15 09:29:01,574 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31896#true} {31896#true} #96#return; {31896#true} is VALID [2022-04-15 09:29:01,574 INFO L272 TraceCheckUtils]: 4: Hoare triple {31896#true} call #t~ret8 := main(); {31896#true} is VALID [2022-04-15 09:29:01,574 INFO L290 TraceCheckUtils]: 5: Hoare triple {31896#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {31896#true} is VALID [2022-04-15 09:29:01,574 INFO L272 TraceCheckUtils]: 6: Hoare triple {31896#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {31896#true} is VALID [2022-04-15 09:29:01,575 INFO L290 TraceCheckUtils]: 7: Hoare triple {31896#true} ~cond := #in~cond; {31896#true} is VALID [2022-04-15 09:29:01,575 INFO L290 TraceCheckUtils]: 8: Hoare triple {31896#true} assume !(0 == ~cond); {31896#true} is VALID [2022-04-15 09:29:01,575 INFO L290 TraceCheckUtils]: 9: Hoare triple {31896#true} assume true; {31896#true} is VALID [2022-04-15 09:29:01,575 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31896#true} {31896#true} #80#return; {31896#true} is VALID [2022-04-15 09:29:01,575 INFO L290 TraceCheckUtils]: 11: Hoare triple {31896#true} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {31934#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 09:29:01,576 INFO L290 TraceCheckUtils]: 12: Hoare triple {31934#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31934#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 09:29:01,576 INFO L290 TraceCheckUtils]: 13: Hoare triple {31934#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {31934#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 09:29:01,576 INFO L272 TraceCheckUtils]: 14: Hoare triple {31934#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {31896#true} is VALID [2022-04-15 09:29:01,576 INFO L290 TraceCheckUtils]: 15: Hoare triple {31896#true} ~cond := #in~cond; {31896#true} is VALID [2022-04-15 09:29:01,577 INFO L290 TraceCheckUtils]: 16: Hoare triple {31896#true} assume !(0 == ~cond); {31896#true} is VALID [2022-04-15 09:29:01,577 INFO L290 TraceCheckUtils]: 17: Hoare triple {31896#true} assume true; {31896#true} is VALID [2022-04-15 09:29:01,577 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {31896#true} {31934#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} #82#return; {31934#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 09:29:01,577 INFO L272 TraceCheckUtils]: 19: Hoare triple {31934#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {31896#true} is VALID [2022-04-15 09:29:01,577 INFO L290 TraceCheckUtils]: 20: Hoare triple {31896#true} ~cond := #in~cond; {31896#true} is VALID [2022-04-15 09:29:01,577 INFO L290 TraceCheckUtils]: 21: Hoare triple {31896#true} assume !(0 == ~cond); {31896#true} is VALID [2022-04-15 09:29:01,578 INFO L290 TraceCheckUtils]: 22: Hoare triple {31896#true} assume true; {31896#true} is VALID [2022-04-15 09:29:01,578 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {31896#true} {31934#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} #84#return; {31934#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 09:29:01,578 INFO L272 TraceCheckUtils]: 24: Hoare triple {31934#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {31896#true} is VALID [2022-04-15 09:29:01,578 INFO L290 TraceCheckUtils]: 25: Hoare triple {31896#true} ~cond := #in~cond; {31896#true} is VALID [2022-04-15 09:29:01,578 INFO L290 TraceCheckUtils]: 26: Hoare triple {31896#true} assume !(0 == ~cond); {31896#true} is VALID [2022-04-15 09:29:01,578 INFO L290 TraceCheckUtils]: 27: Hoare triple {31896#true} assume true; {31896#true} is VALID [2022-04-15 09:29:01,579 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {31896#true} {31934#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} #86#return; {31934#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 09:29:01,581 INFO L290 TraceCheckUtils]: 29: Hoare triple {31934#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~q~0 0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {31989#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-15 09:29:01,582 INFO L290 TraceCheckUtils]: 30: Hoare triple {31989#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31989#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-15 09:29:01,582 INFO L290 TraceCheckUtils]: 31: Hoare triple {31989#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} assume !!(#t~post6 < 20);havoc #t~post6; {31989#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-15 09:29:01,583 INFO L272 TraceCheckUtils]: 32: Hoare triple {31989#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {31896#true} is VALID [2022-04-15 09:29:01,583 INFO L290 TraceCheckUtils]: 33: Hoare triple {31896#true} ~cond := #in~cond; {31896#true} is VALID [2022-04-15 09:29:01,583 INFO L290 TraceCheckUtils]: 34: Hoare triple {31896#true} assume !(0 == ~cond); {31896#true} is VALID [2022-04-15 09:29:01,583 INFO L290 TraceCheckUtils]: 35: Hoare triple {31896#true} assume true; {31896#true} is VALID [2022-04-15 09:29:01,583 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {31896#true} {31989#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} #82#return; {31989#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-15 09:29:01,584 INFO L272 TraceCheckUtils]: 37: Hoare triple {31989#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {31896#true} is VALID [2022-04-15 09:29:01,584 INFO L290 TraceCheckUtils]: 38: Hoare triple {31896#true} ~cond := #in~cond; {31896#true} is VALID [2022-04-15 09:29:01,584 INFO L290 TraceCheckUtils]: 39: Hoare triple {31896#true} assume !(0 == ~cond); {31896#true} is VALID [2022-04-15 09:29:01,584 INFO L290 TraceCheckUtils]: 40: Hoare triple {31896#true} assume true; {31896#true} is VALID [2022-04-15 09:29:01,584 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {31896#true} {31989#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} #84#return; {31989#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-15 09:29:01,584 INFO L272 TraceCheckUtils]: 42: Hoare triple {31989#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {31896#true} is VALID [2022-04-15 09:29:01,585 INFO L290 TraceCheckUtils]: 43: Hoare triple {31896#true} ~cond := #in~cond; {31896#true} is VALID [2022-04-15 09:29:01,585 INFO L290 TraceCheckUtils]: 44: Hoare triple {31896#true} assume !(0 == ~cond); {31896#true} is VALID [2022-04-15 09:29:01,585 INFO L290 TraceCheckUtils]: 45: Hoare triple {31896#true} assume true; {31896#true} is VALID [2022-04-15 09:29:01,585 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {31896#true} {31989#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} #86#return; {31989#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-15 09:29:01,588 INFO L290 TraceCheckUtils]: 47: Hoare triple {31989#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 2) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {32044#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-15 09:29:01,589 INFO L290 TraceCheckUtils]: 48: Hoare triple {32044#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32044#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-15 09:29:01,590 INFO L290 TraceCheckUtils]: 49: Hoare triple {32044#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} assume !!(#t~post6 < 20);havoc #t~post6; {32044#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-15 09:29:01,590 INFO L272 TraceCheckUtils]: 50: Hoare triple {32044#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {31896#true} is VALID [2022-04-15 09:29:01,590 INFO L290 TraceCheckUtils]: 51: Hoare triple {31896#true} ~cond := #in~cond; {31896#true} is VALID [2022-04-15 09:29:01,590 INFO L290 TraceCheckUtils]: 52: Hoare triple {31896#true} assume !(0 == ~cond); {31896#true} is VALID [2022-04-15 09:29:01,590 INFO L290 TraceCheckUtils]: 53: Hoare triple {31896#true} assume true; {31896#true} is VALID [2022-04-15 09:29:01,591 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {31896#true} {32044#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} #82#return; {32044#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-15 09:29:01,591 INFO L272 TraceCheckUtils]: 55: Hoare triple {32044#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {31896#true} is VALID [2022-04-15 09:29:01,591 INFO L290 TraceCheckUtils]: 56: Hoare triple {31896#true} ~cond := #in~cond; {31896#true} is VALID [2022-04-15 09:29:01,591 INFO L290 TraceCheckUtils]: 57: Hoare triple {31896#true} assume !(0 == ~cond); {31896#true} is VALID [2022-04-15 09:29:01,591 INFO L290 TraceCheckUtils]: 58: Hoare triple {31896#true} assume true; {31896#true} is VALID [2022-04-15 09:29:01,592 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {31896#true} {32044#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} #84#return; {32044#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-15 09:29:01,592 INFO L272 TraceCheckUtils]: 60: Hoare triple {32044#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {31896#true} is VALID [2022-04-15 09:29:01,592 INFO L290 TraceCheckUtils]: 61: Hoare triple {31896#true} ~cond := #in~cond; {31896#true} is VALID [2022-04-15 09:29:01,592 INFO L290 TraceCheckUtils]: 62: Hoare triple {31896#true} assume !(0 == ~cond); {31896#true} is VALID [2022-04-15 09:29:01,593 INFO L290 TraceCheckUtils]: 63: Hoare triple {31896#true} assume true; {31896#true} is VALID [2022-04-15 09:29:01,593 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {31896#true} {32044#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} #86#return; {32044#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-15 09:29:01,594 INFO L290 TraceCheckUtils]: 65: Hoare triple {32044#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} assume !(~r~0 >= ~d~0); {32099#(and (= (mod main_~A~0 4294967296) main_~r~0) (not (<= main_~d~0 main_~r~0)) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-15 09:29:01,595 INFO L290 TraceCheckUtils]: 66: Hoare triple {32099#(and (= (mod main_~A~0 4294967296) main_~r~0) (not (<= main_~d~0 main_~r~0)) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32099#(and (= (mod main_~A~0 4294967296) main_~r~0) (not (<= main_~d~0 main_~r~0)) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-15 09:29:01,595 INFO L290 TraceCheckUtils]: 67: Hoare triple {32099#(and (= (mod main_~A~0 4294967296) main_~r~0) (not (<= main_~d~0 main_~r~0)) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} assume !!(#t~post7 < 20);havoc #t~post7; {32099#(and (= (mod main_~A~0 4294967296) main_~r~0) (not (<= main_~d~0 main_~r~0)) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-15 09:29:01,595 INFO L272 TraceCheckUtils]: 68: Hoare triple {32099#(and (= (mod main_~A~0 4294967296) main_~r~0) (not (<= main_~d~0 main_~r~0)) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {31896#true} is VALID [2022-04-15 09:29:01,595 INFO L290 TraceCheckUtils]: 69: Hoare triple {31896#true} ~cond := #in~cond; {31896#true} is VALID [2022-04-15 09:29:01,596 INFO L290 TraceCheckUtils]: 70: Hoare triple {31896#true} assume !(0 == ~cond); {31896#true} is VALID [2022-04-15 09:29:01,596 INFO L290 TraceCheckUtils]: 71: Hoare triple {31896#true} assume true; {31896#true} is VALID [2022-04-15 09:29:01,596 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {31896#true} {32099#(and (= (mod main_~A~0 4294967296) main_~r~0) (not (<= main_~d~0 main_~r~0)) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} #88#return; {32099#(and (= (mod main_~A~0 4294967296) main_~r~0) (not (<= main_~d~0 main_~r~0)) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-15 09:29:01,597 INFO L272 TraceCheckUtils]: 73: Hoare triple {32099#(and (= (mod main_~A~0 4294967296) main_~r~0) (not (<= main_~d~0 main_~r~0)) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {31896#true} is VALID [2022-04-15 09:29:01,597 INFO L290 TraceCheckUtils]: 74: Hoare triple {31896#true} ~cond := #in~cond; {31896#true} is VALID [2022-04-15 09:29:01,597 INFO L290 TraceCheckUtils]: 75: Hoare triple {31896#true} assume !(0 == ~cond); {31896#true} is VALID [2022-04-15 09:29:01,597 INFO L290 TraceCheckUtils]: 76: Hoare triple {31896#true} assume true; {31896#true} is VALID [2022-04-15 09:29:01,597 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {31896#true} {32099#(and (= (mod main_~A~0 4294967296) main_~r~0) (not (<= main_~d~0 main_~r~0)) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} #90#return; {32099#(and (= (mod main_~A~0 4294967296) main_~r~0) (not (<= main_~d~0 main_~r~0)) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} is VALID [2022-04-15 09:29:01,600 INFO L290 TraceCheckUtils]: 78: Hoare triple {32099#(and (= (mod main_~A~0 4294967296) main_~r~0) (not (<= main_~d~0 main_~r~0)) (= (mod (div (- main_~d~0) (- 2)) 2) 0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (<= (div (* (- 1) main_~d~0) (- 2)) main_~r~0))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {32139#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div (* (- 2) main_~d~0) (- 2)) 2) 0) (< main_~r~0 (* main_~d~0 2)) (= main_~q~0 0) (<= main_~d~0 main_~r~0) (<= main_~p~0 2))} is VALID [2022-04-15 09:29:01,605 INFO L290 TraceCheckUtils]: 79: Hoare triple {32139#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (mod (div (* (- 2) main_~d~0) (- 2)) 2) 0) (< main_~r~0 (* main_~d~0 2)) (= main_~q~0 0) (<= main_~d~0 main_~r~0) (<= main_~p~0 2))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32143#(and (= main_~q~0 main_~p~0) (<= main_~d~0 (mod main_~A~0 4294967296)) (< (mod main_~A~0 4294967296) (* main_~d~0 2)) (= (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296)) main_~r~0) (= (mod (div (* (- 2) main_~d~0) (- 2)) 2) 0) (<= main_~p~0 2))} is VALID [2022-04-15 09:29:01,606 INFO L290 TraceCheckUtils]: 80: Hoare triple {32143#(and (= main_~q~0 main_~p~0) (<= main_~d~0 (mod main_~A~0 4294967296)) (< (mod main_~A~0 4294967296) (* main_~d~0 2)) (= (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296)) main_~r~0) (= (mod (div (* (- 2) main_~d~0) (- 2)) 2) 0) (<= main_~p~0 2))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32143#(and (= main_~q~0 main_~p~0) (<= main_~d~0 (mod main_~A~0 4294967296)) (< (mod main_~A~0 4294967296) (* main_~d~0 2)) (= (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296)) main_~r~0) (= (mod (div (* (- 2) main_~d~0) (- 2)) 2) 0) (<= main_~p~0 2))} is VALID [2022-04-15 09:29:01,607 INFO L290 TraceCheckUtils]: 81: Hoare triple {32143#(and (= main_~q~0 main_~p~0) (<= main_~d~0 (mod main_~A~0 4294967296)) (< (mod main_~A~0 4294967296) (* main_~d~0 2)) (= (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296)) main_~r~0) (= (mod (div (* (- 2) main_~d~0) (- 2)) 2) 0) (<= main_~p~0 2))} assume !!(#t~post7 < 20);havoc #t~post7; {32143#(and (= main_~q~0 main_~p~0) (<= main_~d~0 (mod main_~A~0 4294967296)) (< (mod main_~A~0 4294967296) (* main_~d~0 2)) (= (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296)) main_~r~0) (= (mod (div (* (- 2) main_~d~0) (- 2)) 2) 0) (<= main_~p~0 2))} is VALID [2022-04-15 09:29:01,607 INFO L272 TraceCheckUtils]: 82: Hoare triple {32143#(and (= main_~q~0 main_~p~0) (<= main_~d~0 (mod main_~A~0 4294967296)) (< (mod main_~A~0 4294967296) (* main_~d~0 2)) (= (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296)) main_~r~0) (= (mod (div (* (- 2) main_~d~0) (- 2)) 2) 0) (<= main_~p~0 2))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {31896#true} is VALID [2022-04-15 09:29:01,607 INFO L290 TraceCheckUtils]: 83: Hoare triple {31896#true} ~cond := #in~cond; {31896#true} is VALID [2022-04-15 09:29:01,607 INFO L290 TraceCheckUtils]: 84: Hoare triple {31896#true} assume !(0 == ~cond); {31896#true} is VALID [2022-04-15 09:29:01,607 INFO L290 TraceCheckUtils]: 85: Hoare triple {31896#true} assume true; {31896#true} is VALID [2022-04-15 09:29:01,608 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {31896#true} {32143#(and (= main_~q~0 main_~p~0) (<= main_~d~0 (mod main_~A~0 4294967296)) (< (mod main_~A~0 4294967296) (* main_~d~0 2)) (= (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296)) main_~r~0) (= (mod (div (* (- 2) main_~d~0) (- 2)) 2) 0) (<= main_~p~0 2))} #88#return; {32143#(and (= main_~q~0 main_~p~0) (<= main_~d~0 (mod main_~A~0 4294967296)) (< (mod main_~A~0 4294967296) (* main_~d~0 2)) (= (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296)) main_~r~0) (= (mod (div (* (- 2) main_~d~0) (- 2)) 2) 0) (<= main_~p~0 2))} is VALID [2022-04-15 09:29:01,608 INFO L272 TraceCheckUtils]: 87: Hoare triple {32143#(and (= main_~q~0 main_~p~0) (<= main_~d~0 (mod main_~A~0 4294967296)) (< (mod main_~A~0 4294967296) (* main_~d~0 2)) (= (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296)) main_~r~0) (= (mod (div (* (- 2) main_~d~0) (- 2)) 2) 0) (<= main_~p~0 2))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {31896#true} is VALID [2022-04-15 09:29:01,608 INFO L290 TraceCheckUtils]: 88: Hoare triple {31896#true} ~cond := #in~cond; {31896#true} is VALID [2022-04-15 09:29:01,608 INFO L290 TraceCheckUtils]: 89: Hoare triple {31896#true} assume !(0 == ~cond); {31896#true} is VALID [2022-04-15 09:29:01,608 INFO L290 TraceCheckUtils]: 90: Hoare triple {31896#true} assume true; {31896#true} is VALID [2022-04-15 09:29:01,609 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {31896#true} {32143#(and (= main_~q~0 main_~p~0) (<= main_~d~0 (mod main_~A~0 4294967296)) (< (mod main_~A~0 4294967296) (* main_~d~0 2)) (= (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296)) main_~r~0) (= (mod (div (* (- 2) main_~d~0) (- 2)) 2) 0) (<= main_~p~0 2))} #90#return; {32143#(and (= main_~q~0 main_~p~0) (<= main_~d~0 (mod main_~A~0 4294967296)) (< (mod main_~A~0 4294967296) (* main_~d~0 2)) (= (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296)) main_~r~0) (= (mod (div (* (- 2) main_~d~0) (- 2)) 2) 0) (<= main_~p~0 2))} is VALID [2022-04-15 09:29:01,617 INFO L290 TraceCheckUtils]: 92: Hoare triple {32143#(and (= main_~q~0 main_~p~0) (<= main_~d~0 (mod main_~A~0 4294967296)) (< (mod main_~A~0 4294967296) (* main_~d~0 2)) (= (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296)) main_~r~0) (= (mod (div (* (- 2) main_~d~0) (- 2)) 2) 0) (<= main_~p~0 2))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {32183#(and (= (mod (div (+ (* (- 2) (mod main_~A~0 4294967296)) (* main_~r~0 2)) (- 2)) 2) 0) (<= main_~q~0 2) (<= 0 main_~r~0) (= main_~d~0 (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2)) (not (= main_~q~0 1)) (or (and (not (= (mod main_~q~0 2) 0)) (= main_~p~0 (+ (div main_~q~0 2) 1))) (and (= main_~p~0 (div main_~q~0 2)) (= (mod main_~q~0 2) 0))) (< (* main_~r~0 2) (mod main_~A~0 4294967296)))} is VALID [2022-04-15 09:29:01,624 INFO L290 TraceCheckUtils]: 93: Hoare triple {32183#(and (= (mod (div (+ (* (- 2) (mod main_~A~0 4294967296)) (* main_~r~0 2)) (- 2)) 2) 0) (<= main_~q~0 2) (<= 0 main_~r~0) (= main_~d~0 (div (+ (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2)) (not (= main_~q~0 1)) (or (and (not (= (mod main_~q~0 2) 0)) (= main_~p~0 (+ (div main_~q~0 2) 1))) (and (= main_~p~0 (div main_~q~0 2)) (= (mod main_~q~0 2) 0))) (< (* main_~r~0 2) (mod main_~A~0 4294967296)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {32187#(and (< (+ (* main_~r~0 2) (* main_~d~0 2)) (mod main_~A~0 4294967296)) (= (mod (div (+ (* (- 2) (mod main_~A~0 4294967296)) (* main_~r~0 2) (* main_~d~0 2)) (- 2)) 2) 0) (or (and (= main_~p~0 (div (+ main_~q~0 (* (- 1) main_~p~0)) 2)) (= (mod (+ main_~q~0 main_~p~0) 2) 0)) (and (not (= (mod (+ main_~q~0 main_~p~0) 2) 0)) (= (+ (div (+ main_~q~0 (* (- 1) main_~p~0)) 2) 1) main_~p~0))) (not (= main_~q~0 (+ main_~p~0 1))) (<= 0 main_~r~0) (= main_~d~0 (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2)) (<= main_~q~0 (+ main_~p~0 2)))} is VALID [2022-04-15 09:29:01,627 INFO L290 TraceCheckUtils]: 94: Hoare triple {32187#(and (< (+ (* main_~r~0 2) (* main_~d~0 2)) (mod main_~A~0 4294967296)) (= (mod (div (+ (* (- 2) (mod main_~A~0 4294967296)) (* main_~r~0 2) (* main_~d~0 2)) (- 2)) 2) 0) (or (and (= main_~p~0 (div (+ main_~q~0 (* (- 1) main_~p~0)) 2)) (= (mod (+ main_~q~0 main_~p~0) 2) 0)) (and (not (= (mod (+ main_~q~0 main_~p~0) 2) 0)) (= (+ (div (+ main_~q~0 (* (- 1) main_~p~0)) 2) 1) main_~p~0))) (not (= main_~q~0 (+ main_~p~0 1))) (<= 0 main_~r~0) (= main_~d~0 (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2)) (<= main_~q~0 (+ main_~p~0 2)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32187#(and (< (+ (* main_~r~0 2) (* main_~d~0 2)) (mod main_~A~0 4294967296)) (= (mod (div (+ (* (- 2) (mod main_~A~0 4294967296)) (* main_~r~0 2) (* main_~d~0 2)) (- 2)) 2) 0) (or (and (= main_~p~0 (div (+ main_~q~0 (* (- 1) main_~p~0)) 2)) (= (mod (+ main_~q~0 main_~p~0) 2) 0)) (and (not (= (mod (+ main_~q~0 main_~p~0) 2) 0)) (= (+ (div (+ main_~q~0 (* (- 1) main_~p~0)) 2) 1) main_~p~0))) (not (= main_~q~0 (+ main_~p~0 1))) (<= 0 main_~r~0) (= main_~d~0 (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2)) (<= main_~q~0 (+ main_~p~0 2)))} is VALID [2022-04-15 09:29:01,629 INFO L290 TraceCheckUtils]: 95: Hoare triple {32187#(and (< (+ (* main_~r~0 2) (* main_~d~0 2)) (mod main_~A~0 4294967296)) (= (mod (div (+ (* (- 2) (mod main_~A~0 4294967296)) (* main_~r~0 2) (* main_~d~0 2)) (- 2)) 2) 0) (or (and (= main_~p~0 (div (+ main_~q~0 (* (- 1) main_~p~0)) 2)) (= (mod (+ main_~q~0 main_~p~0) 2) 0)) (and (not (= (mod (+ main_~q~0 main_~p~0) 2) 0)) (= (+ (div (+ main_~q~0 (* (- 1) main_~p~0)) 2) 1) main_~p~0))) (not (= main_~q~0 (+ main_~p~0 1))) (<= 0 main_~r~0) (= main_~d~0 (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2)) (<= main_~q~0 (+ main_~p~0 2)))} assume !!(#t~post7 < 20);havoc #t~post7; {32187#(and (< (+ (* main_~r~0 2) (* main_~d~0 2)) (mod main_~A~0 4294967296)) (= (mod (div (+ (* (- 2) (mod main_~A~0 4294967296)) (* main_~r~0 2) (* main_~d~0 2)) (- 2)) 2) 0) (or (and (= main_~p~0 (div (+ main_~q~0 (* (- 1) main_~p~0)) 2)) (= (mod (+ main_~q~0 main_~p~0) 2) 0)) (and (not (= (mod (+ main_~q~0 main_~p~0) 2) 0)) (= (+ (div (+ main_~q~0 (* (- 1) main_~p~0)) 2) 1) main_~p~0))) (not (= main_~q~0 (+ main_~p~0 1))) (<= 0 main_~r~0) (= main_~d~0 (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2)) (<= main_~q~0 (+ main_~p~0 2)))} is VALID [2022-04-15 09:29:01,629 INFO L272 TraceCheckUtils]: 96: Hoare triple {32187#(and (< (+ (* main_~r~0 2) (* main_~d~0 2)) (mod main_~A~0 4294967296)) (= (mod (div (+ (* (- 2) (mod main_~A~0 4294967296)) (* main_~r~0 2) (* main_~d~0 2)) (- 2)) 2) 0) (or (and (= main_~p~0 (div (+ main_~q~0 (* (- 1) main_~p~0)) 2)) (= (mod (+ main_~q~0 main_~p~0) 2) 0)) (and (not (= (mod (+ main_~q~0 main_~p~0) 2) 0)) (= (+ (div (+ main_~q~0 (* (- 1) main_~p~0)) 2) 1) main_~p~0))) (not (= main_~q~0 (+ main_~p~0 1))) (<= 0 main_~r~0) (= main_~d~0 (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2)) (<= main_~q~0 (+ main_~p~0 2)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {31896#true} is VALID [2022-04-15 09:29:01,629 INFO L290 TraceCheckUtils]: 97: Hoare triple {31896#true} ~cond := #in~cond; {31896#true} is VALID [2022-04-15 09:29:01,629 INFO L290 TraceCheckUtils]: 98: Hoare triple {31896#true} assume !(0 == ~cond); {31896#true} is VALID [2022-04-15 09:29:01,629 INFO L290 TraceCheckUtils]: 99: Hoare triple {31896#true} assume true; {31896#true} is VALID [2022-04-15 09:29:01,630 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {31896#true} {32187#(and (< (+ (* main_~r~0 2) (* main_~d~0 2)) (mod main_~A~0 4294967296)) (= (mod (div (+ (* (- 2) (mod main_~A~0 4294967296)) (* main_~r~0 2) (* main_~d~0 2)) (- 2)) 2) 0) (or (and (= main_~p~0 (div (+ main_~q~0 (* (- 1) main_~p~0)) 2)) (= (mod (+ main_~q~0 main_~p~0) 2) 0)) (and (not (= (mod (+ main_~q~0 main_~p~0) 2) 0)) (= (+ (div (+ main_~q~0 (* (- 1) main_~p~0)) 2) 1) main_~p~0))) (not (= main_~q~0 (+ main_~p~0 1))) (<= 0 main_~r~0) (= main_~d~0 (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2)) (<= main_~q~0 (+ main_~p~0 2)))} #88#return; {32187#(and (< (+ (* main_~r~0 2) (* main_~d~0 2)) (mod main_~A~0 4294967296)) (= (mod (div (+ (* (- 2) (mod main_~A~0 4294967296)) (* main_~r~0 2) (* main_~d~0 2)) (- 2)) 2) 0) (or (and (= main_~p~0 (div (+ main_~q~0 (* (- 1) main_~p~0)) 2)) (= (mod (+ main_~q~0 main_~p~0) 2) 0)) (and (not (= (mod (+ main_~q~0 main_~p~0) 2) 0)) (= (+ (div (+ main_~q~0 (* (- 1) main_~p~0)) 2) 1) main_~p~0))) (not (= main_~q~0 (+ main_~p~0 1))) (<= 0 main_~r~0) (= main_~d~0 (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2)) (<= main_~q~0 (+ main_~p~0 2)))} is VALID [2022-04-15 09:29:01,630 INFO L272 TraceCheckUtils]: 101: Hoare triple {32187#(and (< (+ (* main_~r~0 2) (* main_~d~0 2)) (mod main_~A~0 4294967296)) (= (mod (div (+ (* (- 2) (mod main_~A~0 4294967296)) (* main_~r~0 2) (* main_~d~0 2)) (- 2)) 2) 0) (or (and (= main_~p~0 (div (+ main_~q~0 (* (- 1) main_~p~0)) 2)) (= (mod (+ main_~q~0 main_~p~0) 2) 0)) (and (not (= (mod (+ main_~q~0 main_~p~0) 2) 0)) (= (+ (div (+ main_~q~0 (* (- 1) main_~p~0)) 2) 1) main_~p~0))) (not (= main_~q~0 (+ main_~p~0 1))) (<= 0 main_~r~0) (= main_~d~0 (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2)) (<= main_~q~0 (+ main_~p~0 2)))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {31896#true} is VALID [2022-04-15 09:29:01,630 INFO L290 TraceCheckUtils]: 102: Hoare triple {31896#true} ~cond := #in~cond; {31896#true} is VALID [2022-04-15 09:29:01,630 INFO L290 TraceCheckUtils]: 103: Hoare triple {31896#true} assume !(0 == ~cond); {31896#true} is VALID [2022-04-15 09:29:01,630 INFO L290 TraceCheckUtils]: 104: Hoare triple {31896#true} assume true; {31896#true} is VALID [2022-04-15 09:29:01,631 INFO L284 TraceCheckUtils]: 105: Hoare quadruple {31896#true} {32187#(and (< (+ (* main_~r~0 2) (* main_~d~0 2)) (mod main_~A~0 4294967296)) (= (mod (div (+ (* (- 2) (mod main_~A~0 4294967296)) (* main_~r~0 2) (* main_~d~0 2)) (- 2)) 2) 0) (or (and (= main_~p~0 (div (+ main_~q~0 (* (- 1) main_~p~0)) 2)) (= (mod (+ main_~q~0 main_~p~0) 2) 0)) (and (not (= (mod (+ main_~q~0 main_~p~0) 2) 0)) (= (+ (div (+ main_~q~0 (* (- 1) main_~p~0)) 2) 1) main_~p~0))) (not (= main_~q~0 (+ main_~p~0 1))) (<= 0 main_~r~0) (= main_~d~0 (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2)) (<= main_~q~0 (+ main_~p~0 2)))} #90#return; {32187#(and (< (+ (* main_~r~0 2) (* main_~d~0 2)) (mod main_~A~0 4294967296)) (= (mod (div (+ (* (- 2) (mod main_~A~0 4294967296)) (* main_~r~0 2) (* main_~d~0 2)) (- 2)) 2) 0) (or (and (= main_~p~0 (div (+ main_~q~0 (* (- 1) main_~p~0)) 2)) (= (mod (+ main_~q~0 main_~p~0) 2) 0)) (and (not (= (mod (+ main_~q~0 main_~p~0) 2) 0)) (= (+ (div (+ main_~q~0 (* (- 1) main_~p~0)) 2) 1) main_~p~0))) (not (= main_~q~0 (+ main_~p~0 1))) (<= 0 main_~r~0) (= main_~d~0 (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2)) (<= main_~q~0 (+ main_~p~0 2)))} is VALID [2022-04-15 09:29:01,635 INFO L290 TraceCheckUtils]: 106: Hoare triple {32187#(and (< (+ (* main_~r~0 2) (* main_~d~0 2)) (mod main_~A~0 4294967296)) (= (mod (div (+ (* (- 2) (mod main_~A~0 4294967296)) (* main_~r~0 2) (* main_~d~0 2)) (- 2)) 2) 0) (or (and (= main_~p~0 (div (+ main_~q~0 (* (- 1) main_~p~0)) 2)) (= (mod (+ main_~q~0 main_~p~0) 2) 0)) (and (not (= (mod (+ main_~q~0 main_~p~0) 2) 0)) (= (+ (div (+ main_~q~0 (* (- 1) main_~p~0)) 2) 1) main_~p~0))) (not (= main_~q~0 (+ main_~p~0 1))) (<= 0 main_~r~0) (= main_~d~0 (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2)) (<= main_~q~0 (+ main_~p~0 2)))} assume !(1 != ~p~0); {32227#(and (< (+ (* main_~r~0 2) (* main_~d~0 2)) (mod main_~A~0 4294967296)) (= (mod (div (+ (* (- 2) (mod main_~A~0 4294967296)) (* main_~r~0 2) (* main_~d~0 2)) (- 2)) 2) 0) (<= 0 main_~r~0) (= (div (+ (- 1) main_~q~0) 2) 1) (= main_~d~0 (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2)) (= (mod (+ main_~q~0 1) 2) 0))} is VALID [2022-04-15 09:29:01,673 INFO L272 TraceCheckUtils]: 107: Hoare triple {32227#(and (< (+ (* main_~r~0 2) (* main_~d~0 2)) (mod main_~A~0 4294967296)) (= (mod (div (+ (* (- 2) (mod main_~A~0 4294967296)) (* main_~r~0 2) (* main_~d~0 2)) (- 2)) 2) 0) (<= 0 main_~r~0) (= (div (+ (- 1) main_~q~0) 2) 1) (= main_~d~0 (div (+ (* (- 1) main_~d~0) (mod main_~A~0 4294967296) (* (- 1) main_~r~0)) 2)) (= (mod (+ main_~q~0 1) 2) 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {32231#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 09:29:01,674 INFO L290 TraceCheckUtils]: 108: Hoare triple {32231#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {32235#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:29:01,674 INFO L290 TraceCheckUtils]: 109: Hoare triple {32235#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {31897#false} is VALID [2022-04-15 09:29:01,675 INFO L290 TraceCheckUtils]: 110: Hoare triple {31897#false} assume !false; {31897#false} is VALID [2022-04-15 09:29:01,675 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 30 proven. 34 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2022-04-15 09:29:01,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:29:43,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:29:43,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421611638] [2022-04-15 09:29:43,436 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:29:43,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793911608] [2022-04-15 09:29:43,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793911608] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 09:29:43,436 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 09:29:43,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-15 09:29:43,436 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:29:43,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1206005235] [2022-04-15 09:29:43,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1206005235] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:29:43,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:29:43,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 09:29:43,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214881029] [2022-04-15 09:29:43,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:29:43,437 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 8 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 7 states have call predecessors, (17), 7 states have call successors, (17) Word has length 111 [2022-04-15 09:29:43,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:29:43,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 8 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 7 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-15 09:29:43,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:29:43,647 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 09:29:43,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:29:43,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 09:29:43,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2022-04-15 09:29:43,648 INFO L87 Difference]: Start difference. First operand 250 states and 286 transitions. Second operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 8 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 7 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-15 09:29:51,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:29:51,058 INFO L93 Difference]: Finished difference Result 258 states and 293 transitions. [2022-04-15 09:29:51,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 09:29:51,058 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 8 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 7 states have call predecessors, (17), 7 states have call successors, (17) Word has length 111 [2022-04-15 09:29:51,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:29:51,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 8 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 7 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-15 09:29:51,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 99 transitions. [2022-04-15 09:29:51,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 8 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 7 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-15 09:29:51,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 99 transitions. [2022-04-15 09:29:51,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 99 transitions. [2022-04-15 09:29:51,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:29:51,361 INFO L225 Difference]: With dead ends: 258 [2022-04-15 09:29:51,361 INFO L226 Difference]: Without dead ends: 210 [2022-04-15 09:29:51,361 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2022-04-15 09:29:51,361 INFO L913 BasicCegarLoop]: 62 mSDtfsCounter, 9 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-15 09:29:51,362 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 437 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-04-15 09:29:51,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-04-15 09:29:51,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2022-04-15 09:29:51,644 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:29:51,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 210 states. Second operand has 210 states, 137 states have (on average 1.1532846715328466) internal successors, (158), 143 states have internal predecessors, (158), 45 states have call successors, (45), 28 states have call predecessors, (45), 27 states have return successors, (42), 38 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-15 09:29:51,645 INFO L74 IsIncluded]: Start isIncluded. First operand 210 states. Second operand has 210 states, 137 states have (on average 1.1532846715328466) internal successors, (158), 143 states have internal predecessors, (158), 45 states have call successors, (45), 28 states have call predecessors, (45), 27 states have return successors, (42), 38 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-15 09:29:51,645 INFO L87 Difference]: Start difference. First operand 210 states. Second operand has 210 states, 137 states have (on average 1.1532846715328466) internal successors, (158), 143 states have internal predecessors, (158), 45 states have call successors, (45), 28 states have call predecessors, (45), 27 states have return successors, (42), 38 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-15 09:29:51,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:29:51,648 INFO L93 Difference]: Finished difference Result 210 states and 245 transitions. [2022-04-15 09:29:51,648 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 245 transitions. [2022-04-15 09:29:51,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:29:51,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:29:51,648 INFO L74 IsIncluded]: Start isIncluded. First operand has 210 states, 137 states have (on average 1.1532846715328466) internal successors, (158), 143 states have internal predecessors, (158), 45 states have call successors, (45), 28 states have call predecessors, (45), 27 states have return successors, (42), 38 states have call predecessors, (42), 42 states have call successors, (42) Second operand 210 states. [2022-04-15 09:29:51,649 INFO L87 Difference]: Start difference. First operand has 210 states, 137 states have (on average 1.1532846715328466) internal successors, (158), 143 states have internal predecessors, (158), 45 states have call successors, (45), 28 states have call predecessors, (45), 27 states have return successors, (42), 38 states have call predecessors, (42), 42 states have call successors, (42) Second operand 210 states. [2022-04-15 09:29:51,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:29:51,651 INFO L93 Difference]: Finished difference Result 210 states and 245 transitions. [2022-04-15 09:29:51,651 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 245 transitions. [2022-04-15 09:29:51,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:29:51,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:29:51,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:29:51,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:29:51,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 137 states have (on average 1.1532846715328466) internal successors, (158), 143 states have internal predecessors, (158), 45 states have call successors, (45), 28 states have call predecessors, (45), 27 states have return successors, (42), 38 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-15 09:29:51,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 245 transitions. [2022-04-15 09:29:51,655 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 245 transitions. Word has length 111 [2022-04-15 09:29:51,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:29:51,655 INFO L478 AbstractCegarLoop]: Abstraction has 210 states and 245 transitions. [2022-04-15 09:29:51,655 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 8 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 7 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-15 09:29:51,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 210 states and 245 transitions. [2022-04-15 09:29:54,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 245 edges. 244 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 09:29:54,074 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 245 transitions. [2022-04-15 09:29:54,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-04-15 09:29:54,075 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:29:54,075 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 16, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:29:54,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-15 09:29:54,275 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-15 09:29:54,276 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:29:54,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:29:54,276 INFO L85 PathProgramCache]: Analyzing trace with hash 898486511, now seen corresponding path program 9 times [2022-04-15 09:29:54,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:29:54,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1211540188] [2022-04-15 09:30:01,368 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:30:01,369 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:30:01,369 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:30:01,369 INFO L85 PathProgramCache]: Analyzing trace with hash 898486511, now seen corresponding path program 10 times [2022-04-15 09:30:01,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:30:01,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797356479] [2022-04-15 09:30:01,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:30:01,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:30:01,378 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:30:01,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [466850728] [2022-04-15 09:30:01,378 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 09:30:01,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:30:01,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:30:01,395 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:30:01,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-15 09:30:01,449 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 09:30:01,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:30:01,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 09:30:01,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:30:01,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:30:01,933 INFO L272 TraceCheckUtils]: 0: Hoare triple {33711#true} call ULTIMATE.init(); {33711#true} is VALID [2022-04-15 09:30:01,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {33711#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {33719#(<= ~counter~0 0)} is VALID [2022-04-15 09:30:01,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {33719#(<= ~counter~0 0)} assume true; {33719#(<= ~counter~0 0)} is VALID [2022-04-15 09:30:01,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33719#(<= ~counter~0 0)} {33711#true} #96#return; {33719#(<= ~counter~0 0)} is VALID [2022-04-15 09:30:01,935 INFO L272 TraceCheckUtils]: 4: Hoare triple {33719#(<= ~counter~0 0)} call #t~ret8 := main(); {33719#(<= ~counter~0 0)} is VALID [2022-04-15 09:30:01,935 INFO L290 TraceCheckUtils]: 5: Hoare triple {33719#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {33719#(<= ~counter~0 0)} is VALID [2022-04-15 09:30:01,935 INFO L272 TraceCheckUtils]: 6: Hoare triple {33719#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {33719#(<= ~counter~0 0)} is VALID [2022-04-15 09:30:01,936 INFO L290 TraceCheckUtils]: 7: Hoare triple {33719#(<= ~counter~0 0)} ~cond := #in~cond; {33719#(<= ~counter~0 0)} is VALID [2022-04-15 09:30:01,936 INFO L290 TraceCheckUtils]: 8: Hoare triple {33719#(<= ~counter~0 0)} assume !(0 == ~cond); {33719#(<= ~counter~0 0)} is VALID [2022-04-15 09:30:01,936 INFO L290 TraceCheckUtils]: 9: Hoare triple {33719#(<= ~counter~0 0)} assume true; {33719#(<= ~counter~0 0)} is VALID [2022-04-15 09:30:01,937 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33719#(<= ~counter~0 0)} {33719#(<= ~counter~0 0)} #80#return; {33719#(<= ~counter~0 0)} is VALID [2022-04-15 09:30:01,937 INFO L290 TraceCheckUtils]: 11: Hoare triple {33719#(<= ~counter~0 0)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {33719#(<= ~counter~0 0)} is VALID [2022-04-15 09:30:01,938 INFO L290 TraceCheckUtils]: 12: Hoare triple {33719#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {33753#(<= ~counter~0 1)} is VALID [2022-04-15 09:30:01,938 INFO L290 TraceCheckUtils]: 13: Hoare triple {33753#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {33753#(<= ~counter~0 1)} is VALID [2022-04-15 09:30:01,939 INFO L272 TraceCheckUtils]: 14: Hoare triple {33753#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {33753#(<= ~counter~0 1)} is VALID [2022-04-15 09:30:01,939 INFO L290 TraceCheckUtils]: 15: Hoare triple {33753#(<= ~counter~0 1)} ~cond := #in~cond; {33753#(<= ~counter~0 1)} is VALID [2022-04-15 09:30:01,939 INFO L290 TraceCheckUtils]: 16: Hoare triple {33753#(<= ~counter~0 1)} assume !(0 == ~cond); {33753#(<= ~counter~0 1)} is VALID [2022-04-15 09:30:01,940 INFO L290 TraceCheckUtils]: 17: Hoare triple {33753#(<= ~counter~0 1)} assume true; {33753#(<= ~counter~0 1)} is VALID [2022-04-15 09:30:01,940 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {33753#(<= ~counter~0 1)} {33753#(<= ~counter~0 1)} #82#return; {33753#(<= ~counter~0 1)} is VALID [2022-04-15 09:30:01,940 INFO L272 TraceCheckUtils]: 19: Hoare triple {33753#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {33753#(<= ~counter~0 1)} is VALID [2022-04-15 09:30:01,941 INFO L290 TraceCheckUtils]: 20: Hoare triple {33753#(<= ~counter~0 1)} ~cond := #in~cond; {33753#(<= ~counter~0 1)} is VALID [2022-04-15 09:30:01,941 INFO L290 TraceCheckUtils]: 21: Hoare triple {33753#(<= ~counter~0 1)} assume !(0 == ~cond); {33753#(<= ~counter~0 1)} is VALID [2022-04-15 09:30:01,941 INFO L290 TraceCheckUtils]: 22: Hoare triple {33753#(<= ~counter~0 1)} assume true; {33753#(<= ~counter~0 1)} is VALID [2022-04-15 09:30:01,942 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {33753#(<= ~counter~0 1)} {33753#(<= ~counter~0 1)} #84#return; {33753#(<= ~counter~0 1)} is VALID [2022-04-15 09:30:01,942 INFO L272 TraceCheckUtils]: 24: Hoare triple {33753#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {33753#(<= ~counter~0 1)} is VALID [2022-04-15 09:30:01,943 INFO L290 TraceCheckUtils]: 25: Hoare triple {33753#(<= ~counter~0 1)} ~cond := #in~cond; {33753#(<= ~counter~0 1)} is VALID [2022-04-15 09:30:01,943 INFO L290 TraceCheckUtils]: 26: Hoare triple {33753#(<= ~counter~0 1)} assume !(0 == ~cond); {33753#(<= ~counter~0 1)} is VALID [2022-04-15 09:30:01,943 INFO L290 TraceCheckUtils]: 27: Hoare triple {33753#(<= ~counter~0 1)} assume true; {33753#(<= ~counter~0 1)} is VALID [2022-04-15 09:30:01,944 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {33753#(<= ~counter~0 1)} {33753#(<= ~counter~0 1)} #86#return; {33753#(<= ~counter~0 1)} is VALID [2022-04-15 09:30:01,944 INFO L290 TraceCheckUtils]: 29: Hoare triple {33753#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {33753#(<= ~counter~0 1)} is VALID [2022-04-15 09:30:01,945 INFO L290 TraceCheckUtils]: 30: Hoare triple {33753#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {33808#(<= ~counter~0 2)} is VALID [2022-04-15 09:30:01,945 INFO L290 TraceCheckUtils]: 31: Hoare triple {33808#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {33808#(<= ~counter~0 2)} is VALID [2022-04-15 09:30:01,945 INFO L272 TraceCheckUtils]: 32: Hoare triple {33808#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {33808#(<= ~counter~0 2)} is VALID [2022-04-15 09:30:01,946 INFO L290 TraceCheckUtils]: 33: Hoare triple {33808#(<= ~counter~0 2)} ~cond := #in~cond; {33808#(<= ~counter~0 2)} is VALID [2022-04-15 09:30:01,946 INFO L290 TraceCheckUtils]: 34: Hoare triple {33808#(<= ~counter~0 2)} assume !(0 == ~cond); {33808#(<= ~counter~0 2)} is VALID [2022-04-15 09:30:01,946 INFO L290 TraceCheckUtils]: 35: Hoare triple {33808#(<= ~counter~0 2)} assume true; {33808#(<= ~counter~0 2)} is VALID [2022-04-15 09:30:01,947 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {33808#(<= ~counter~0 2)} {33808#(<= ~counter~0 2)} #82#return; {33808#(<= ~counter~0 2)} is VALID [2022-04-15 09:30:01,947 INFO L272 TraceCheckUtils]: 37: Hoare triple {33808#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {33808#(<= ~counter~0 2)} is VALID [2022-04-15 09:30:01,947 INFO L290 TraceCheckUtils]: 38: Hoare triple {33808#(<= ~counter~0 2)} ~cond := #in~cond; {33808#(<= ~counter~0 2)} is VALID [2022-04-15 09:30:01,948 INFO L290 TraceCheckUtils]: 39: Hoare triple {33808#(<= ~counter~0 2)} assume !(0 == ~cond); {33808#(<= ~counter~0 2)} is VALID [2022-04-15 09:30:01,948 INFO L290 TraceCheckUtils]: 40: Hoare triple {33808#(<= ~counter~0 2)} assume true; {33808#(<= ~counter~0 2)} is VALID [2022-04-15 09:30:01,948 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {33808#(<= ~counter~0 2)} {33808#(<= ~counter~0 2)} #84#return; {33808#(<= ~counter~0 2)} is VALID [2022-04-15 09:30:01,949 INFO L272 TraceCheckUtils]: 42: Hoare triple {33808#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {33808#(<= ~counter~0 2)} is VALID [2022-04-15 09:30:01,949 INFO L290 TraceCheckUtils]: 43: Hoare triple {33808#(<= ~counter~0 2)} ~cond := #in~cond; {33808#(<= ~counter~0 2)} is VALID [2022-04-15 09:30:01,949 INFO L290 TraceCheckUtils]: 44: Hoare triple {33808#(<= ~counter~0 2)} assume !(0 == ~cond); {33808#(<= ~counter~0 2)} is VALID [2022-04-15 09:30:01,950 INFO L290 TraceCheckUtils]: 45: Hoare triple {33808#(<= ~counter~0 2)} assume true; {33808#(<= ~counter~0 2)} is VALID [2022-04-15 09:30:01,950 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {33808#(<= ~counter~0 2)} {33808#(<= ~counter~0 2)} #86#return; {33808#(<= ~counter~0 2)} is VALID [2022-04-15 09:30:01,951 INFO L290 TraceCheckUtils]: 47: Hoare triple {33808#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {33808#(<= ~counter~0 2)} is VALID [2022-04-15 09:30:01,951 INFO L290 TraceCheckUtils]: 48: Hoare triple {33808#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {33863#(<= ~counter~0 3)} is VALID [2022-04-15 09:30:01,951 INFO L290 TraceCheckUtils]: 49: Hoare triple {33863#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {33863#(<= ~counter~0 3)} is VALID [2022-04-15 09:30:01,952 INFO L272 TraceCheckUtils]: 50: Hoare triple {33863#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {33863#(<= ~counter~0 3)} is VALID [2022-04-15 09:30:01,952 INFO L290 TraceCheckUtils]: 51: Hoare triple {33863#(<= ~counter~0 3)} ~cond := #in~cond; {33863#(<= ~counter~0 3)} is VALID [2022-04-15 09:30:01,952 INFO L290 TraceCheckUtils]: 52: Hoare triple {33863#(<= ~counter~0 3)} assume !(0 == ~cond); {33863#(<= ~counter~0 3)} is VALID [2022-04-15 09:30:01,953 INFO L290 TraceCheckUtils]: 53: Hoare triple {33863#(<= ~counter~0 3)} assume true; {33863#(<= ~counter~0 3)} is VALID [2022-04-15 09:30:01,953 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {33863#(<= ~counter~0 3)} {33863#(<= ~counter~0 3)} #82#return; {33863#(<= ~counter~0 3)} is VALID [2022-04-15 09:30:01,954 INFO L272 TraceCheckUtils]: 55: Hoare triple {33863#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {33863#(<= ~counter~0 3)} is VALID [2022-04-15 09:30:01,954 INFO L290 TraceCheckUtils]: 56: Hoare triple {33863#(<= ~counter~0 3)} ~cond := #in~cond; {33863#(<= ~counter~0 3)} is VALID [2022-04-15 09:30:01,954 INFO L290 TraceCheckUtils]: 57: Hoare triple {33863#(<= ~counter~0 3)} assume !(0 == ~cond); {33863#(<= ~counter~0 3)} is VALID [2022-04-15 09:30:01,955 INFO L290 TraceCheckUtils]: 58: Hoare triple {33863#(<= ~counter~0 3)} assume true; {33863#(<= ~counter~0 3)} is VALID [2022-04-15 09:30:01,955 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {33863#(<= ~counter~0 3)} {33863#(<= ~counter~0 3)} #84#return; {33863#(<= ~counter~0 3)} is VALID [2022-04-15 09:30:01,955 INFO L272 TraceCheckUtils]: 60: Hoare triple {33863#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {33863#(<= ~counter~0 3)} is VALID [2022-04-15 09:30:01,956 INFO L290 TraceCheckUtils]: 61: Hoare triple {33863#(<= ~counter~0 3)} ~cond := #in~cond; {33863#(<= ~counter~0 3)} is VALID [2022-04-15 09:30:01,956 INFO L290 TraceCheckUtils]: 62: Hoare triple {33863#(<= ~counter~0 3)} assume !(0 == ~cond); {33863#(<= ~counter~0 3)} is VALID [2022-04-15 09:30:01,956 INFO L290 TraceCheckUtils]: 63: Hoare triple {33863#(<= ~counter~0 3)} assume true; {33863#(<= ~counter~0 3)} is VALID [2022-04-15 09:30:01,957 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {33863#(<= ~counter~0 3)} {33863#(<= ~counter~0 3)} #86#return; {33863#(<= ~counter~0 3)} is VALID [2022-04-15 09:30:01,957 INFO L290 TraceCheckUtils]: 65: Hoare triple {33863#(<= ~counter~0 3)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {33863#(<= ~counter~0 3)} is VALID [2022-04-15 09:30:01,958 INFO L290 TraceCheckUtils]: 66: Hoare triple {33863#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {33918#(<= ~counter~0 4)} is VALID [2022-04-15 09:30:01,958 INFO L290 TraceCheckUtils]: 67: Hoare triple {33918#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {33918#(<= ~counter~0 4)} is VALID [2022-04-15 09:30:01,958 INFO L272 TraceCheckUtils]: 68: Hoare triple {33918#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {33918#(<= ~counter~0 4)} is VALID [2022-04-15 09:30:01,959 INFO L290 TraceCheckUtils]: 69: Hoare triple {33918#(<= ~counter~0 4)} ~cond := #in~cond; {33918#(<= ~counter~0 4)} is VALID [2022-04-15 09:30:01,959 INFO L290 TraceCheckUtils]: 70: Hoare triple {33918#(<= ~counter~0 4)} assume !(0 == ~cond); {33918#(<= ~counter~0 4)} is VALID [2022-04-15 09:30:01,959 INFO L290 TraceCheckUtils]: 71: Hoare triple {33918#(<= ~counter~0 4)} assume true; {33918#(<= ~counter~0 4)} is VALID [2022-04-15 09:30:01,960 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {33918#(<= ~counter~0 4)} {33918#(<= ~counter~0 4)} #82#return; {33918#(<= ~counter~0 4)} is VALID [2022-04-15 09:30:01,960 INFO L272 TraceCheckUtils]: 73: Hoare triple {33918#(<= ~counter~0 4)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {33918#(<= ~counter~0 4)} is VALID [2022-04-15 09:30:01,961 INFO L290 TraceCheckUtils]: 74: Hoare triple {33918#(<= ~counter~0 4)} ~cond := #in~cond; {33918#(<= ~counter~0 4)} is VALID [2022-04-15 09:30:01,961 INFO L290 TraceCheckUtils]: 75: Hoare triple {33918#(<= ~counter~0 4)} assume !(0 == ~cond); {33918#(<= ~counter~0 4)} is VALID [2022-04-15 09:30:01,961 INFO L290 TraceCheckUtils]: 76: Hoare triple {33918#(<= ~counter~0 4)} assume true; {33918#(<= ~counter~0 4)} is VALID [2022-04-15 09:30:01,962 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {33918#(<= ~counter~0 4)} {33918#(<= ~counter~0 4)} #84#return; {33918#(<= ~counter~0 4)} is VALID [2022-04-15 09:30:01,962 INFO L272 TraceCheckUtils]: 78: Hoare triple {33918#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {33918#(<= ~counter~0 4)} is VALID [2022-04-15 09:30:01,962 INFO L290 TraceCheckUtils]: 79: Hoare triple {33918#(<= ~counter~0 4)} ~cond := #in~cond; {33918#(<= ~counter~0 4)} is VALID [2022-04-15 09:30:01,963 INFO L290 TraceCheckUtils]: 80: Hoare triple {33918#(<= ~counter~0 4)} assume !(0 == ~cond); {33918#(<= ~counter~0 4)} is VALID [2022-04-15 09:30:01,963 INFO L290 TraceCheckUtils]: 81: Hoare triple {33918#(<= ~counter~0 4)} assume true; {33918#(<= ~counter~0 4)} is VALID [2022-04-15 09:30:01,963 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {33918#(<= ~counter~0 4)} {33918#(<= ~counter~0 4)} #86#return; {33918#(<= ~counter~0 4)} is VALID [2022-04-15 09:30:01,964 INFO L290 TraceCheckUtils]: 83: Hoare triple {33918#(<= ~counter~0 4)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {33918#(<= ~counter~0 4)} is VALID [2022-04-15 09:30:01,964 INFO L290 TraceCheckUtils]: 84: Hoare triple {33918#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {33973#(<= ~counter~0 5)} is VALID [2022-04-15 09:30:01,965 INFO L290 TraceCheckUtils]: 85: Hoare triple {33973#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {33973#(<= ~counter~0 5)} is VALID [2022-04-15 09:30:01,965 INFO L272 TraceCheckUtils]: 86: Hoare triple {33973#(<= ~counter~0 5)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {33973#(<= ~counter~0 5)} is VALID [2022-04-15 09:30:01,965 INFO L290 TraceCheckUtils]: 87: Hoare triple {33973#(<= ~counter~0 5)} ~cond := #in~cond; {33973#(<= ~counter~0 5)} is VALID [2022-04-15 09:30:01,966 INFO L290 TraceCheckUtils]: 88: Hoare triple {33973#(<= ~counter~0 5)} assume !(0 == ~cond); {33973#(<= ~counter~0 5)} is VALID [2022-04-15 09:30:01,966 INFO L290 TraceCheckUtils]: 89: Hoare triple {33973#(<= ~counter~0 5)} assume true; {33973#(<= ~counter~0 5)} is VALID [2022-04-15 09:30:01,966 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {33973#(<= ~counter~0 5)} {33973#(<= ~counter~0 5)} #82#return; {33973#(<= ~counter~0 5)} is VALID [2022-04-15 09:30:01,967 INFO L272 TraceCheckUtils]: 91: Hoare triple {33973#(<= ~counter~0 5)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {33973#(<= ~counter~0 5)} is VALID [2022-04-15 09:30:01,967 INFO L290 TraceCheckUtils]: 92: Hoare triple {33973#(<= ~counter~0 5)} ~cond := #in~cond; {33973#(<= ~counter~0 5)} is VALID [2022-04-15 09:30:01,967 INFO L290 TraceCheckUtils]: 93: Hoare triple {33973#(<= ~counter~0 5)} assume !(0 == ~cond); {33973#(<= ~counter~0 5)} is VALID [2022-04-15 09:30:01,968 INFO L290 TraceCheckUtils]: 94: Hoare triple {33973#(<= ~counter~0 5)} assume true; {33973#(<= ~counter~0 5)} is VALID [2022-04-15 09:30:01,968 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {33973#(<= ~counter~0 5)} {33973#(<= ~counter~0 5)} #84#return; {33973#(<= ~counter~0 5)} is VALID [2022-04-15 09:30:01,969 INFO L272 TraceCheckUtils]: 96: Hoare triple {33973#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {33973#(<= ~counter~0 5)} is VALID [2022-04-15 09:30:01,969 INFO L290 TraceCheckUtils]: 97: Hoare triple {33973#(<= ~counter~0 5)} ~cond := #in~cond; {33973#(<= ~counter~0 5)} is VALID [2022-04-15 09:30:01,969 INFO L290 TraceCheckUtils]: 98: Hoare triple {33973#(<= ~counter~0 5)} assume !(0 == ~cond); {33973#(<= ~counter~0 5)} is VALID [2022-04-15 09:30:01,970 INFO L290 TraceCheckUtils]: 99: Hoare triple {33973#(<= ~counter~0 5)} assume true; {33973#(<= ~counter~0 5)} is VALID [2022-04-15 09:30:01,970 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {33973#(<= ~counter~0 5)} {33973#(<= ~counter~0 5)} #86#return; {33973#(<= ~counter~0 5)} is VALID [2022-04-15 09:30:01,970 INFO L290 TraceCheckUtils]: 101: Hoare triple {33973#(<= ~counter~0 5)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {33973#(<= ~counter~0 5)} is VALID [2022-04-15 09:30:01,971 INFO L290 TraceCheckUtils]: 102: Hoare triple {33973#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34028#(<= |main_#t~post6| 5)} is VALID [2022-04-15 09:30:01,971 INFO L290 TraceCheckUtils]: 103: Hoare triple {34028#(<= |main_#t~post6| 5)} assume !(#t~post6 < 20);havoc #t~post6; {33712#false} is VALID [2022-04-15 09:30:01,971 INFO L290 TraceCheckUtils]: 104: Hoare triple {33712#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {33712#false} is VALID [2022-04-15 09:30:01,971 INFO L290 TraceCheckUtils]: 105: Hoare triple {33712#false} assume !(#t~post7 < 20);havoc #t~post7; {33712#false} is VALID [2022-04-15 09:30:01,971 INFO L272 TraceCheckUtils]: 106: Hoare triple {33712#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {33712#false} is VALID [2022-04-15 09:30:01,971 INFO L290 TraceCheckUtils]: 107: Hoare triple {33712#false} ~cond := #in~cond; {33712#false} is VALID [2022-04-15 09:30:01,972 INFO L290 TraceCheckUtils]: 108: Hoare triple {33712#false} assume !(0 == ~cond); {33712#false} is VALID [2022-04-15 09:30:01,972 INFO L290 TraceCheckUtils]: 109: Hoare triple {33712#false} assume true; {33712#false} is VALID [2022-04-15 09:30:01,972 INFO L284 TraceCheckUtils]: 110: Hoare quadruple {33712#false} {33712#false} #92#return; {33712#false} is VALID [2022-04-15 09:30:01,972 INFO L272 TraceCheckUtils]: 111: Hoare triple {33712#false} call __VERIFIER_assert((if ~B~0 % 4294967296 == ~d~0 then 1 else 0)); {33712#false} is VALID [2022-04-15 09:30:01,972 INFO L290 TraceCheckUtils]: 112: Hoare triple {33712#false} ~cond := #in~cond; {33712#false} is VALID [2022-04-15 09:30:01,972 INFO L290 TraceCheckUtils]: 113: Hoare triple {33712#false} assume 0 == ~cond; {33712#false} is VALID [2022-04-15 09:30:01,972 INFO L290 TraceCheckUtils]: 114: Hoare triple {33712#false} assume !false; {33712#false} is VALID [2022-04-15 09:30:01,973 INFO L134 CoverageAnalysis]: Checked inductivity of 582 backedges. 90 proven. 430 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2022-04-15 09:30:01,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:30:02,424 INFO L290 TraceCheckUtils]: 114: Hoare triple {33712#false} assume !false; {33712#false} is VALID [2022-04-15 09:30:02,424 INFO L290 TraceCheckUtils]: 113: Hoare triple {33712#false} assume 0 == ~cond; {33712#false} is VALID [2022-04-15 09:30:02,425 INFO L290 TraceCheckUtils]: 112: Hoare triple {33712#false} ~cond := #in~cond; {33712#false} is VALID [2022-04-15 09:30:02,425 INFO L272 TraceCheckUtils]: 111: Hoare triple {33712#false} call __VERIFIER_assert((if ~B~0 % 4294967296 == ~d~0 then 1 else 0)); {33712#false} is VALID [2022-04-15 09:30:02,425 INFO L284 TraceCheckUtils]: 110: Hoare quadruple {33711#true} {33712#false} #92#return; {33712#false} is VALID [2022-04-15 09:30:02,425 INFO L290 TraceCheckUtils]: 109: Hoare triple {33711#true} assume true; {33711#true} is VALID [2022-04-15 09:30:02,425 INFO L290 TraceCheckUtils]: 108: Hoare triple {33711#true} assume !(0 == ~cond); {33711#true} is VALID [2022-04-15 09:30:02,425 INFO L290 TraceCheckUtils]: 107: Hoare triple {33711#true} ~cond := #in~cond; {33711#true} is VALID [2022-04-15 09:30:02,425 INFO L272 TraceCheckUtils]: 106: Hoare triple {33712#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {33711#true} is VALID [2022-04-15 09:30:02,425 INFO L290 TraceCheckUtils]: 105: Hoare triple {33712#false} assume !(#t~post7 < 20);havoc #t~post7; {33712#false} is VALID [2022-04-15 09:30:02,425 INFO L290 TraceCheckUtils]: 104: Hoare triple {33712#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {33712#false} is VALID [2022-04-15 09:30:02,426 INFO L290 TraceCheckUtils]: 103: Hoare triple {34098#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {33712#false} is VALID [2022-04-15 09:30:02,426 INFO L290 TraceCheckUtils]: 102: Hoare triple {34102#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34098#(< |main_#t~post6| 20)} is VALID [2022-04-15 09:30:02,426 INFO L290 TraceCheckUtils]: 101: Hoare triple {34102#(< ~counter~0 20)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {34102#(< ~counter~0 20)} is VALID [2022-04-15 09:30:02,427 INFO L284 TraceCheckUtils]: 100: Hoare quadruple {33711#true} {34102#(< ~counter~0 20)} #86#return; {34102#(< ~counter~0 20)} is VALID [2022-04-15 09:30:02,427 INFO L290 TraceCheckUtils]: 99: Hoare triple {33711#true} assume true; {33711#true} is VALID [2022-04-15 09:30:02,427 INFO L290 TraceCheckUtils]: 98: Hoare triple {33711#true} assume !(0 == ~cond); {33711#true} is VALID [2022-04-15 09:30:02,427 INFO L290 TraceCheckUtils]: 97: Hoare triple {33711#true} ~cond := #in~cond; {33711#true} is VALID [2022-04-15 09:30:02,427 INFO L272 TraceCheckUtils]: 96: Hoare triple {34102#(< ~counter~0 20)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {33711#true} is VALID [2022-04-15 09:30:02,428 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {33711#true} {34102#(< ~counter~0 20)} #84#return; {34102#(< ~counter~0 20)} is VALID [2022-04-15 09:30:02,428 INFO L290 TraceCheckUtils]: 94: Hoare triple {33711#true} assume true; {33711#true} is VALID [2022-04-15 09:30:02,428 INFO L290 TraceCheckUtils]: 93: Hoare triple {33711#true} assume !(0 == ~cond); {33711#true} is VALID [2022-04-15 09:30:02,428 INFO L290 TraceCheckUtils]: 92: Hoare triple {33711#true} ~cond := #in~cond; {33711#true} is VALID [2022-04-15 09:30:02,428 INFO L272 TraceCheckUtils]: 91: Hoare triple {34102#(< ~counter~0 20)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {33711#true} is VALID [2022-04-15 09:30:02,429 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {33711#true} {34102#(< ~counter~0 20)} #82#return; {34102#(< ~counter~0 20)} is VALID [2022-04-15 09:30:02,429 INFO L290 TraceCheckUtils]: 89: Hoare triple {33711#true} assume true; {33711#true} is VALID [2022-04-15 09:30:02,429 INFO L290 TraceCheckUtils]: 88: Hoare triple {33711#true} assume !(0 == ~cond); {33711#true} is VALID [2022-04-15 09:30:02,429 INFO L290 TraceCheckUtils]: 87: Hoare triple {33711#true} ~cond := #in~cond; {33711#true} is VALID [2022-04-15 09:30:02,429 INFO L272 TraceCheckUtils]: 86: Hoare triple {34102#(< ~counter~0 20)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {33711#true} is VALID [2022-04-15 09:30:02,429 INFO L290 TraceCheckUtils]: 85: Hoare triple {34102#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {34102#(< ~counter~0 20)} is VALID [2022-04-15 09:30:02,430 INFO L290 TraceCheckUtils]: 84: Hoare triple {34157#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34102#(< ~counter~0 20)} is VALID [2022-04-15 09:30:02,431 INFO L290 TraceCheckUtils]: 83: Hoare triple {34157#(< ~counter~0 19)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {34157#(< ~counter~0 19)} is VALID [2022-04-15 09:30:02,431 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {33711#true} {34157#(< ~counter~0 19)} #86#return; {34157#(< ~counter~0 19)} is VALID [2022-04-15 09:30:02,431 INFO L290 TraceCheckUtils]: 81: Hoare triple {33711#true} assume true; {33711#true} is VALID [2022-04-15 09:30:02,431 INFO L290 TraceCheckUtils]: 80: Hoare triple {33711#true} assume !(0 == ~cond); {33711#true} is VALID [2022-04-15 09:30:02,431 INFO L290 TraceCheckUtils]: 79: Hoare triple {33711#true} ~cond := #in~cond; {33711#true} is VALID [2022-04-15 09:30:02,431 INFO L272 TraceCheckUtils]: 78: Hoare triple {34157#(< ~counter~0 19)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {33711#true} is VALID [2022-04-15 09:30:02,432 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {33711#true} {34157#(< ~counter~0 19)} #84#return; {34157#(< ~counter~0 19)} is VALID [2022-04-15 09:30:02,432 INFO L290 TraceCheckUtils]: 76: Hoare triple {33711#true} assume true; {33711#true} is VALID [2022-04-15 09:30:02,432 INFO L290 TraceCheckUtils]: 75: Hoare triple {33711#true} assume !(0 == ~cond); {33711#true} is VALID [2022-04-15 09:30:02,432 INFO L290 TraceCheckUtils]: 74: Hoare triple {33711#true} ~cond := #in~cond; {33711#true} is VALID [2022-04-15 09:30:02,432 INFO L272 TraceCheckUtils]: 73: Hoare triple {34157#(< ~counter~0 19)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {33711#true} is VALID [2022-04-15 09:30:02,433 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {33711#true} {34157#(< ~counter~0 19)} #82#return; {34157#(< ~counter~0 19)} is VALID [2022-04-15 09:30:02,433 INFO L290 TraceCheckUtils]: 71: Hoare triple {33711#true} assume true; {33711#true} is VALID [2022-04-15 09:30:02,433 INFO L290 TraceCheckUtils]: 70: Hoare triple {33711#true} assume !(0 == ~cond); {33711#true} is VALID [2022-04-15 09:30:02,433 INFO L290 TraceCheckUtils]: 69: Hoare triple {33711#true} ~cond := #in~cond; {33711#true} is VALID [2022-04-15 09:30:02,433 INFO L272 TraceCheckUtils]: 68: Hoare triple {34157#(< ~counter~0 19)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {33711#true} is VALID [2022-04-15 09:30:02,433 INFO L290 TraceCheckUtils]: 67: Hoare triple {34157#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {34157#(< ~counter~0 19)} is VALID [2022-04-15 09:30:02,434 INFO L290 TraceCheckUtils]: 66: Hoare triple {34212#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34157#(< ~counter~0 19)} is VALID [2022-04-15 09:30:02,434 INFO L290 TraceCheckUtils]: 65: Hoare triple {34212#(< ~counter~0 18)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {34212#(< ~counter~0 18)} is VALID [2022-04-15 09:30:02,435 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {33711#true} {34212#(< ~counter~0 18)} #86#return; {34212#(< ~counter~0 18)} is VALID [2022-04-15 09:30:02,435 INFO L290 TraceCheckUtils]: 63: Hoare triple {33711#true} assume true; {33711#true} is VALID [2022-04-15 09:30:02,435 INFO L290 TraceCheckUtils]: 62: Hoare triple {33711#true} assume !(0 == ~cond); {33711#true} is VALID [2022-04-15 09:30:02,435 INFO L290 TraceCheckUtils]: 61: Hoare triple {33711#true} ~cond := #in~cond; {33711#true} is VALID [2022-04-15 09:30:02,435 INFO L272 TraceCheckUtils]: 60: Hoare triple {34212#(< ~counter~0 18)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {33711#true} is VALID [2022-04-15 09:30:02,436 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {33711#true} {34212#(< ~counter~0 18)} #84#return; {34212#(< ~counter~0 18)} is VALID [2022-04-15 09:30:02,436 INFO L290 TraceCheckUtils]: 58: Hoare triple {33711#true} assume true; {33711#true} is VALID [2022-04-15 09:30:02,436 INFO L290 TraceCheckUtils]: 57: Hoare triple {33711#true} assume !(0 == ~cond); {33711#true} is VALID [2022-04-15 09:30:02,436 INFO L290 TraceCheckUtils]: 56: Hoare triple {33711#true} ~cond := #in~cond; {33711#true} is VALID [2022-04-15 09:30:02,436 INFO L272 TraceCheckUtils]: 55: Hoare triple {34212#(< ~counter~0 18)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {33711#true} is VALID [2022-04-15 09:30:02,436 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {33711#true} {34212#(< ~counter~0 18)} #82#return; {34212#(< ~counter~0 18)} is VALID [2022-04-15 09:30:02,437 INFO L290 TraceCheckUtils]: 53: Hoare triple {33711#true} assume true; {33711#true} is VALID [2022-04-15 09:30:02,437 INFO L290 TraceCheckUtils]: 52: Hoare triple {33711#true} assume !(0 == ~cond); {33711#true} is VALID [2022-04-15 09:30:02,437 INFO L290 TraceCheckUtils]: 51: Hoare triple {33711#true} ~cond := #in~cond; {33711#true} is VALID [2022-04-15 09:30:02,437 INFO L272 TraceCheckUtils]: 50: Hoare triple {34212#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {33711#true} is VALID [2022-04-15 09:30:02,437 INFO L290 TraceCheckUtils]: 49: Hoare triple {34212#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {34212#(< ~counter~0 18)} is VALID [2022-04-15 09:30:02,438 INFO L290 TraceCheckUtils]: 48: Hoare triple {34267#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34212#(< ~counter~0 18)} is VALID [2022-04-15 09:30:02,438 INFO L290 TraceCheckUtils]: 47: Hoare triple {34267#(< ~counter~0 17)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {34267#(< ~counter~0 17)} is VALID [2022-04-15 09:30:02,439 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {33711#true} {34267#(< ~counter~0 17)} #86#return; {34267#(< ~counter~0 17)} is VALID [2022-04-15 09:30:02,439 INFO L290 TraceCheckUtils]: 45: Hoare triple {33711#true} assume true; {33711#true} is VALID [2022-04-15 09:30:02,439 INFO L290 TraceCheckUtils]: 44: Hoare triple {33711#true} assume !(0 == ~cond); {33711#true} is VALID [2022-04-15 09:30:02,439 INFO L290 TraceCheckUtils]: 43: Hoare triple {33711#true} ~cond := #in~cond; {33711#true} is VALID [2022-04-15 09:30:02,439 INFO L272 TraceCheckUtils]: 42: Hoare triple {34267#(< ~counter~0 17)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {33711#true} is VALID [2022-04-15 09:30:02,439 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {33711#true} {34267#(< ~counter~0 17)} #84#return; {34267#(< ~counter~0 17)} is VALID [2022-04-15 09:30:02,440 INFO L290 TraceCheckUtils]: 40: Hoare triple {33711#true} assume true; {33711#true} is VALID [2022-04-15 09:30:02,440 INFO L290 TraceCheckUtils]: 39: Hoare triple {33711#true} assume !(0 == ~cond); {33711#true} is VALID [2022-04-15 09:30:02,440 INFO L290 TraceCheckUtils]: 38: Hoare triple {33711#true} ~cond := #in~cond; {33711#true} is VALID [2022-04-15 09:30:02,440 INFO L272 TraceCheckUtils]: 37: Hoare triple {34267#(< ~counter~0 17)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {33711#true} is VALID [2022-04-15 09:30:02,440 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {33711#true} {34267#(< ~counter~0 17)} #82#return; {34267#(< ~counter~0 17)} is VALID [2022-04-15 09:30:02,440 INFO L290 TraceCheckUtils]: 35: Hoare triple {33711#true} assume true; {33711#true} is VALID [2022-04-15 09:30:02,440 INFO L290 TraceCheckUtils]: 34: Hoare triple {33711#true} assume !(0 == ~cond); {33711#true} is VALID [2022-04-15 09:30:02,441 INFO L290 TraceCheckUtils]: 33: Hoare triple {33711#true} ~cond := #in~cond; {33711#true} is VALID [2022-04-15 09:30:02,441 INFO L272 TraceCheckUtils]: 32: Hoare triple {34267#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {33711#true} is VALID [2022-04-15 09:30:02,441 INFO L290 TraceCheckUtils]: 31: Hoare triple {34267#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {34267#(< ~counter~0 17)} is VALID [2022-04-15 09:30:02,441 INFO L290 TraceCheckUtils]: 30: Hoare triple {34322#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34267#(< ~counter~0 17)} is VALID [2022-04-15 09:30:02,442 INFO L290 TraceCheckUtils]: 29: Hoare triple {34322#(< ~counter~0 16)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {34322#(< ~counter~0 16)} is VALID [2022-04-15 09:30:02,442 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {33711#true} {34322#(< ~counter~0 16)} #86#return; {34322#(< ~counter~0 16)} is VALID [2022-04-15 09:30:02,442 INFO L290 TraceCheckUtils]: 27: Hoare triple {33711#true} assume true; {33711#true} is VALID [2022-04-15 09:30:02,442 INFO L290 TraceCheckUtils]: 26: Hoare triple {33711#true} assume !(0 == ~cond); {33711#true} is VALID [2022-04-15 09:30:02,443 INFO L290 TraceCheckUtils]: 25: Hoare triple {33711#true} ~cond := #in~cond; {33711#true} is VALID [2022-04-15 09:30:02,443 INFO L272 TraceCheckUtils]: 24: Hoare triple {34322#(< ~counter~0 16)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {33711#true} is VALID [2022-04-15 09:30:02,443 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {33711#true} {34322#(< ~counter~0 16)} #84#return; {34322#(< ~counter~0 16)} is VALID [2022-04-15 09:30:02,443 INFO L290 TraceCheckUtils]: 22: Hoare triple {33711#true} assume true; {33711#true} is VALID [2022-04-15 09:30:02,443 INFO L290 TraceCheckUtils]: 21: Hoare triple {33711#true} assume !(0 == ~cond); {33711#true} is VALID [2022-04-15 09:30:02,443 INFO L290 TraceCheckUtils]: 20: Hoare triple {33711#true} ~cond := #in~cond; {33711#true} is VALID [2022-04-15 09:30:02,444 INFO L272 TraceCheckUtils]: 19: Hoare triple {34322#(< ~counter~0 16)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {33711#true} is VALID [2022-04-15 09:30:02,444 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {33711#true} {34322#(< ~counter~0 16)} #82#return; {34322#(< ~counter~0 16)} is VALID [2022-04-15 09:30:02,444 INFO L290 TraceCheckUtils]: 17: Hoare triple {33711#true} assume true; {33711#true} is VALID [2022-04-15 09:30:02,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {33711#true} assume !(0 == ~cond); {33711#true} is VALID [2022-04-15 09:30:02,444 INFO L290 TraceCheckUtils]: 15: Hoare triple {33711#true} ~cond := #in~cond; {33711#true} is VALID [2022-04-15 09:30:02,444 INFO L272 TraceCheckUtils]: 14: Hoare triple {34322#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {33711#true} is VALID [2022-04-15 09:30:02,445 INFO L290 TraceCheckUtils]: 13: Hoare triple {34322#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {34322#(< ~counter~0 16)} is VALID [2022-04-15 09:30:02,445 INFO L290 TraceCheckUtils]: 12: Hoare triple {34377#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34322#(< ~counter~0 16)} is VALID [2022-04-15 09:30:02,446 INFO L290 TraceCheckUtils]: 11: Hoare triple {34377#(< ~counter~0 15)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {34377#(< ~counter~0 15)} is VALID [2022-04-15 09:30:02,446 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33711#true} {34377#(< ~counter~0 15)} #80#return; {34377#(< ~counter~0 15)} is VALID [2022-04-15 09:30:02,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {33711#true} assume true; {33711#true} is VALID [2022-04-15 09:30:02,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {33711#true} assume !(0 == ~cond); {33711#true} is VALID [2022-04-15 09:30:02,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {33711#true} ~cond := #in~cond; {33711#true} is VALID [2022-04-15 09:30:02,446 INFO L272 TraceCheckUtils]: 6: Hoare triple {34377#(< ~counter~0 15)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {33711#true} is VALID [2022-04-15 09:30:02,447 INFO L290 TraceCheckUtils]: 5: Hoare triple {34377#(< ~counter~0 15)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {34377#(< ~counter~0 15)} is VALID [2022-04-15 09:30:02,447 INFO L272 TraceCheckUtils]: 4: Hoare triple {34377#(< ~counter~0 15)} call #t~ret8 := main(); {34377#(< ~counter~0 15)} is VALID [2022-04-15 09:30:02,447 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34377#(< ~counter~0 15)} {33711#true} #96#return; {34377#(< ~counter~0 15)} is VALID [2022-04-15 09:30:02,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {34377#(< ~counter~0 15)} assume true; {34377#(< ~counter~0 15)} is VALID [2022-04-15 09:30:02,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {33711#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34377#(< ~counter~0 15)} is VALID [2022-04-15 09:30:02,448 INFO L272 TraceCheckUtils]: 0: Hoare triple {33711#true} call ULTIMATE.init(); {33711#true} is VALID [2022-04-15 09:30:02,449 INFO L134 CoverageAnalysis]: Checked inductivity of 582 backedges. 32 proven. 70 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-15 09:30:02,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:30:02,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797356479] [2022-04-15 09:30:02,449 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:30:02,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466850728] [2022-04-15 09:30:02,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466850728] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:30:02,449 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:30:02,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-15 09:30:02,449 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:30:02,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1211540188] [2022-04-15 09:30:02,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1211540188] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:30:02,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:30:02,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 09:30:02,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654991794] [2022-04-15 09:30:02,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:30:02,450 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 7 states have call predecessors, (18), 8 states have call successors, (18) Word has length 115 [2022-04-15 09:30:02,450 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:30:02,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 7 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-15 09:30:02,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:30:02,532 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 09:30:02,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:30:02,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 09:30:02,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-15 09:30:02,533 INFO L87 Difference]: Start difference. First operand 210 states and 245 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 7 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-15 09:30:03,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:30:03,356 INFO L93 Difference]: Finished difference Result 255 states and 307 transitions. [2022-04-15 09:30:03,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 09:30:03,356 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 7 states have call predecessors, (18), 8 states have call successors, (18) Word has length 115 [2022-04-15 09:30:03,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:30:03,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 7 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-15 09:30:03,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 135 transitions. [2022-04-15 09:30:03,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 7 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-15 09:30:03,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 135 transitions. [2022-04-15 09:30:03,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 135 transitions. [2022-04-15 09:30:03,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:30:03,490 INFO L225 Difference]: With dead ends: 255 [2022-04-15 09:30:03,490 INFO L226 Difference]: Without dead ends: 212 [2022-04-15 09:30:03,491 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=249, Unknown=0, NotChecked=0, Total=420 [2022-04-15 09:30:03,491 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 15 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 09:30:03,491 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 235 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 09:30:03,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-04-15 09:30:03,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2022-04-15 09:30:03,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:30:03,765 INFO L82 GeneralOperation]: Start isEquivalent. First operand 212 states. Second operand has 212 states, 139 states have (on average 1.1510791366906474) internal successors, (160), 145 states have internal predecessors, (160), 45 states have call successors, (45), 28 states have call predecessors, (45), 27 states have return successors, (42), 38 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-15 09:30:03,765 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand has 212 states, 139 states have (on average 1.1510791366906474) internal successors, (160), 145 states have internal predecessors, (160), 45 states have call successors, (45), 28 states have call predecessors, (45), 27 states have return successors, (42), 38 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-15 09:30:03,765 INFO L87 Difference]: Start difference. First operand 212 states. Second operand has 212 states, 139 states have (on average 1.1510791366906474) internal successors, (160), 145 states have internal predecessors, (160), 45 states have call successors, (45), 28 states have call predecessors, (45), 27 states have return successors, (42), 38 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-15 09:30:03,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:30:03,768 INFO L93 Difference]: Finished difference Result 212 states and 247 transitions. [2022-04-15 09:30:03,768 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 247 transitions. [2022-04-15 09:30:03,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:30:03,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:30:03,769 INFO L74 IsIncluded]: Start isIncluded. First operand has 212 states, 139 states have (on average 1.1510791366906474) internal successors, (160), 145 states have internal predecessors, (160), 45 states have call successors, (45), 28 states have call predecessors, (45), 27 states have return successors, (42), 38 states have call predecessors, (42), 42 states have call successors, (42) Second operand 212 states. [2022-04-15 09:30:03,769 INFO L87 Difference]: Start difference. First operand has 212 states, 139 states have (on average 1.1510791366906474) internal successors, (160), 145 states have internal predecessors, (160), 45 states have call successors, (45), 28 states have call predecessors, (45), 27 states have return successors, (42), 38 states have call predecessors, (42), 42 states have call successors, (42) Second operand 212 states. [2022-04-15 09:30:03,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:30:03,772 INFO L93 Difference]: Finished difference Result 212 states and 247 transitions. [2022-04-15 09:30:03,772 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 247 transitions. [2022-04-15 09:30:03,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:30:03,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:30:03,772 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:30:03,772 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:30:03,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 139 states have (on average 1.1510791366906474) internal successors, (160), 145 states have internal predecessors, (160), 45 states have call successors, (45), 28 states have call predecessors, (45), 27 states have return successors, (42), 38 states have call predecessors, (42), 42 states have call successors, (42) [2022-04-15 09:30:03,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 247 transitions. [2022-04-15 09:30:03,776 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 247 transitions. Word has length 115 [2022-04-15 09:30:03,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:30:03,776 INFO L478 AbstractCegarLoop]: Abstraction has 212 states and 247 transitions. [2022-04-15 09:30:03,776 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 8 states have call successors, (20), 8 states have call predecessors, (20), 7 states have return successors, (18), 7 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-15 09:30:03,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 212 states and 247 transitions. [2022-04-15 09:30:06,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 247 edges. 246 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 09:30:06,204 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 247 transitions. [2022-04-15 09:30:06,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-15 09:30:06,204 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:30:06,205 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 16, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:30:06,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-15 09:30:06,405 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-15 09:30:06,405 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:30:06,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:30:06,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1562534599, now seen corresponding path program 7 times [2022-04-15 09:30:06,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:30:06,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [490528746] [2022-04-15 09:30:12,551 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:30:12,551 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:30:12,551 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:30:12,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1562534599, now seen corresponding path program 8 times [2022-04-15 09:30:12,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:30:12,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142652924] [2022-04-15 09:30:12,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:30:12,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:30:12,560 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:30:12,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1544296408] [2022-04-15 09:30:12,561 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:30:12,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:30:12,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:30:12,562 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:30:12,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-15 09:30:12,618 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:30:12,619 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:30:12,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 09:30:12,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:30:12,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:30:13,290 INFO L272 TraceCheckUtils]: 0: Hoare triple {35784#true} call ULTIMATE.init(); {35784#true} is VALID [2022-04-15 09:30:13,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {35784#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {35792#(<= ~counter~0 0)} is VALID [2022-04-15 09:30:13,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {35792#(<= ~counter~0 0)} assume true; {35792#(<= ~counter~0 0)} is VALID [2022-04-15 09:30:13,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35792#(<= ~counter~0 0)} {35784#true} #96#return; {35792#(<= ~counter~0 0)} is VALID [2022-04-15 09:30:13,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {35792#(<= ~counter~0 0)} call #t~ret8 := main(); {35792#(<= ~counter~0 0)} is VALID [2022-04-15 09:30:13,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {35792#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {35792#(<= ~counter~0 0)} is VALID [2022-04-15 09:30:13,296 INFO L272 TraceCheckUtils]: 6: Hoare triple {35792#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {35792#(<= ~counter~0 0)} is VALID [2022-04-15 09:30:13,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {35792#(<= ~counter~0 0)} ~cond := #in~cond; {35792#(<= ~counter~0 0)} is VALID [2022-04-15 09:30:13,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {35792#(<= ~counter~0 0)} assume !(0 == ~cond); {35792#(<= ~counter~0 0)} is VALID [2022-04-15 09:30:13,297 INFO L290 TraceCheckUtils]: 9: Hoare triple {35792#(<= ~counter~0 0)} assume true; {35792#(<= ~counter~0 0)} is VALID [2022-04-15 09:30:13,297 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35792#(<= ~counter~0 0)} {35792#(<= ~counter~0 0)} #80#return; {35792#(<= ~counter~0 0)} is VALID [2022-04-15 09:30:13,297 INFO L290 TraceCheckUtils]: 11: Hoare triple {35792#(<= ~counter~0 0)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {35792#(<= ~counter~0 0)} is VALID [2022-04-15 09:30:13,300 INFO L290 TraceCheckUtils]: 12: Hoare triple {35792#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35826#(<= ~counter~0 1)} is VALID [2022-04-15 09:30:13,301 INFO L290 TraceCheckUtils]: 13: Hoare triple {35826#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {35826#(<= ~counter~0 1)} is VALID [2022-04-15 09:30:13,301 INFO L272 TraceCheckUtils]: 14: Hoare triple {35826#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35826#(<= ~counter~0 1)} is VALID [2022-04-15 09:30:13,301 INFO L290 TraceCheckUtils]: 15: Hoare triple {35826#(<= ~counter~0 1)} ~cond := #in~cond; {35826#(<= ~counter~0 1)} is VALID [2022-04-15 09:30:13,302 INFO L290 TraceCheckUtils]: 16: Hoare triple {35826#(<= ~counter~0 1)} assume !(0 == ~cond); {35826#(<= ~counter~0 1)} is VALID [2022-04-15 09:30:13,302 INFO L290 TraceCheckUtils]: 17: Hoare triple {35826#(<= ~counter~0 1)} assume true; {35826#(<= ~counter~0 1)} is VALID [2022-04-15 09:30:13,304 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {35826#(<= ~counter~0 1)} {35826#(<= ~counter~0 1)} #82#return; {35826#(<= ~counter~0 1)} is VALID [2022-04-15 09:30:13,305 INFO L272 TraceCheckUtils]: 19: Hoare triple {35826#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {35826#(<= ~counter~0 1)} is VALID [2022-04-15 09:30:13,306 INFO L290 TraceCheckUtils]: 20: Hoare triple {35826#(<= ~counter~0 1)} ~cond := #in~cond; {35826#(<= ~counter~0 1)} is VALID [2022-04-15 09:30:13,306 INFO L290 TraceCheckUtils]: 21: Hoare triple {35826#(<= ~counter~0 1)} assume !(0 == ~cond); {35826#(<= ~counter~0 1)} is VALID [2022-04-15 09:30:13,306 INFO L290 TraceCheckUtils]: 22: Hoare triple {35826#(<= ~counter~0 1)} assume true; {35826#(<= ~counter~0 1)} is VALID [2022-04-15 09:30:13,308 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {35826#(<= ~counter~0 1)} {35826#(<= ~counter~0 1)} #84#return; {35826#(<= ~counter~0 1)} is VALID [2022-04-15 09:30:13,308 INFO L272 TraceCheckUtils]: 24: Hoare triple {35826#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {35826#(<= ~counter~0 1)} is VALID [2022-04-15 09:30:13,309 INFO L290 TraceCheckUtils]: 25: Hoare triple {35826#(<= ~counter~0 1)} ~cond := #in~cond; {35826#(<= ~counter~0 1)} is VALID [2022-04-15 09:30:13,309 INFO L290 TraceCheckUtils]: 26: Hoare triple {35826#(<= ~counter~0 1)} assume !(0 == ~cond); {35826#(<= ~counter~0 1)} is VALID [2022-04-15 09:30:13,309 INFO L290 TraceCheckUtils]: 27: Hoare triple {35826#(<= ~counter~0 1)} assume true; {35826#(<= ~counter~0 1)} is VALID [2022-04-15 09:30:13,310 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {35826#(<= ~counter~0 1)} {35826#(<= ~counter~0 1)} #86#return; {35826#(<= ~counter~0 1)} is VALID [2022-04-15 09:30:13,310 INFO L290 TraceCheckUtils]: 29: Hoare triple {35826#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {35826#(<= ~counter~0 1)} is VALID [2022-04-15 09:30:13,311 INFO L290 TraceCheckUtils]: 30: Hoare triple {35826#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35881#(<= ~counter~0 2)} is VALID [2022-04-15 09:30:13,311 INFO L290 TraceCheckUtils]: 31: Hoare triple {35881#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {35881#(<= ~counter~0 2)} is VALID [2022-04-15 09:30:13,311 INFO L272 TraceCheckUtils]: 32: Hoare triple {35881#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35881#(<= ~counter~0 2)} is VALID [2022-04-15 09:30:13,311 INFO L290 TraceCheckUtils]: 33: Hoare triple {35881#(<= ~counter~0 2)} ~cond := #in~cond; {35881#(<= ~counter~0 2)} is VALID [2022-04-15 09:30:13,312 INFO L290 TraceCheckUtils]: 34: Hoare triple {35881#(<= ~counter~0 2)} assume !(0 == ~cond); {35881#(<= ~counter~0 2)} is VALID [2022-04-15 09:30:13,312 INFO L290 TraceCheckUtils]: 35: Hoare triple {35881#(<= ~counter~0 2)} assume true; {35881#(<= ~counter~0 2)} is VALID [2022-04-15 09:30:13,312 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {35881#(<= ~counter~0 2)} {35881#(<= ~counter~0 2)} #82#return; {35881#(<= ~counter~0 2)} is VALID [2022-04-15 09:30:13,313 INFO L272 TraceCheckUtils]: 37: Hoare triple {35881#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {35881#(<= ~counter~0 2)} is VALID [2022-04-15 09:30:13,313 INFO L290 TraceCheckUtils]: 38: Hoare triple {35881#(<= ~counter~0 2)} ~cond := #in~cond; {35881#(<= ~counter~0 2)} is VALID [2022-04-15 09:30:13,313 INFO L290 TraceCheckUtils]: 39: Hoare triple {35881#(<= ~counter~0 2)} assume !(0 == ~cond); {35881#(<= ~counter~0 2)} is VALID [2022-04-15 09:30:13,313 INFO L290 TraceCheckUtils]: 40: Hoare triple {35881#(<= ~counter~0 2)} assume true; {35881#(<= ~counter~0 2)} is VALID [2022-04-15 09:30:13,314 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {35881#(<= ~counter~0 2)} {35881#(<= ~counter~0 2)} #84#return; {35881#(<= ~counter~0 2)} is VALID [2022-04-15 09:30:13,314 INFO L272 TraceCheckUtils]: 42: Hoare triple {35881#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {35881#(<= ~counter~0 2)} is VALID [2022-04-15 09:30:13,315 INFO L290 TraceCheckUtils]: 43: Hoare triple {35881#(<= ~counter~0 2)} ~cond := #in~cond; {35881#(<= ~counter~0 2)} is VALID [2022-04-15 09:30:13,315 INFO L290 TraceCheckUtils]: 44: Hoare triple {35881#(<= ~counter~0 2)} assume !(0 == ~cond); {35881#(<= ~counter~0 2)} is VALID [2022-04-15 09:30:13,315 INFO L290 TraceCheckUtils]: 45: Hoare triple {35881#(<= ~counter~0 2)} assume true; {35881#(<= ~counter~0 2)} is VALID [2022-04-15 09:30:13,315 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {35881#(<= ~counter~0 2)} {35881#(<= ~counter~0 2)} #86#return; {35881#(<= ~counter~0 2)} is VALID [2022-04-15 09:30:13,316 INFO L290 TraceCheckUtils]: 47: Hoare triple {35881#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {35881#(<= ~counter~0 2)} is VALID [2022-04-15 09:30:13,316 INFO L290 TraceCheckUtils]: 48: Hoare triple {35881#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35936#(<= ~counter~0 3)} is VALID [2022-04-15 09:30:13,317 INFO L290 TraceCheckUtils]: 49: Hoare triple {35936#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {35936#(<= ~counter~0 3)} is VALID [2022-04-15 09:30:13,317 INFO L272 TraceCheckUtils]: 50: Hoare triple {35936#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35936#(<= ~counter~0 3)} is VALID [2022-04-15 09:30:13,317 INFO L290 TraceCheckUtils]: 51: Hoare triple {35936#(<= ~counter~0 3)} ~cond := #in~cond; {35936#(<= ~counter~0 3)} is VALID [2022-04-15 09:30:13,317 INFO L290 TraceCheckUtils]: 52: Hoare triple {35936#(<= ~counter~0 3)} assume !(0 == ~cond); {35936#(<= ~counter~0 3)} is VALID [2022-04-15 09:30:13,318 INFO L290 TraceCheckUtils]: 53: Hoare triple {35936#(<= ~counter~0 3)} assume true; {35936#(<= ~counter~0 3)} is VALID [2022-04-15 09:30:13,318 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {35936#(<= ~counter~0 3)} {35936#(<= ~counter~0 3)} #82#return; {35936#(<= ~counter~0 3)} is VALID [2022-04-15 09:30:13,318 INFO L272 TraceCheckUtils]: 55: Hoare triple {35936#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {35936#(<= ~counter~0 3)} is VALID [2022-04-15 09:30:13,319 INFO L290 TraceCheckUtils]: 56: Hoare triple {35936#(<= ~counter~0 3)} ~cond := #in~cond; {35936#(<= ~counter~0 3)} is VALID [2022-04-15 09:30:13,319 INFO L290 TraceCheckUtils]: 57: Hoare triple {35936#(<= ~counter~0 3)} assume !(0 == ~cond); {35936#(<= ~counter~0 3)} is VALID [2022-04-15 09:30:13,319 INFO L290 TraceCheckUtils]: 58: Hoare triple {35936#(<= ~counter~0 3)} assume true; {35936#(<= ~counter~0 3)} is VALID [2022-04-15 09:30:13,320 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {35936#(<= ~counter~0 3)} {35936#(<= ~counter~0 3)} #84#return; {35936#(<= ~counter~0 3)} is VALID [2022-04-15 09:30:13,320 INFO L272 TraceCheckUtils]: 60: Hoare triple {35936#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {35936#(<= ~counter~0 3)} is VALID [2022-04-15 09:30:13,321 INFO L290 TraceCheckUtils]: 61: Hoare triple {35936#(<= ~counter~0 3)} ~cond := #in~cond; {35936#(<= ~counter~0 3)} is VALID [2022-04-15 09:30:13,321 INFO L290 TraceCheckUtils]: 62: Hoare triple {35936#(<= ~counter~0 3)} assume !(0 == ~cond); {35936#(<= ~counter~0 3)} is VALID [2022-04-15 09:30:13,321 INFO L290 TraceCheckUtils]: 63: Hoare triple {35936#(<= ~counter~0 3)} assume true; {35936#(<= ~counter~0 3)} is VALID [2022-04-15 09:30:13,321 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {35936#(<= ~counter~0 3)} {35936#(<= ~counter~0 3)} #86#return; {35936#(<= ~counter~0 3)} is VALID [2022-04-15 09:30:13,322 INFO L290 TraceCheckUtils]: 65: Hoare triple {35936#(<= ~counter~0 3)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {35936#(<= ~counter~0 3)} is VALID [2022-04-15 09:30:13,322 INFO L290 TraceCheckUtils]: 66: Hoare triple {35936#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35991#(<= ~counter~0 4)} is VALID [2022-04-15 09:30:13,323 INFO L290 TraceCheckUtils]: 67: Hoare triple {35991#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {35991#(<= ~counter~0 4)} is VALID [2022-04-15 09:30:13,323 INFO L272 TraceCheckUtils]: 68: Hoare triple {35991#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35991#(<= ~counter~0 4)} is VALID [2022-04-15 09:30:13,323 INFO L290 TraceCheckUtils]: 69: Hoare triple {35991#(<= ~counter~0 4)} ~cond := #in~cond; {35991#(<= ~counter~0 4)} is VALID [2022-04-15 09:30:13,323 INFO L290 TraceCheckUtils]: 70: Hoare triple {35991#(<= ~counter~0 4)} assume !(0 == ~cond); {35991#(<= ~counter~0 4)} is VALID [2022-04-15 09:30:13,324 INFO L290 TraceCheckUtils]: 71: Hoare triple {35991#(<= ~counter~0 4)} assume true; {35991#(<= ~counter~0 4)} is VALID [2022-04-15 09:30:13,324 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {35991#(<= ~counter~0 4)} {35991#(<= ~counter~0 4)} #82#return; {35991#(<= ~counter~0 4)} is VALID [2022-04-15 09:30:13,324 INFO L272 TraceCheckUtils]: 73: Hoare triple {35991#(<= ~counter~0 4)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {35991#(<= ~counter~0 4)} is VALID [2022-04-15 09:30:13,325 INFO L290 TraceCheckUtils]: 74: Hoare triple {35991#(<= ~counter~0 4)} ~cond := #in~cond; {35991#(<= ~counter~0 4)} is VALID [2022-04-15 09:30:13,325 INFO L290 TraceCheckUtils]: 75: Hoare triple {35991#(<= ~counter~0 4)} assume !(0 == ~cond); {35991#(<= ~counter~0 4)} is VALID [2022-04-15 09:30:13,325 INFO L290 TraceCheckUtils]: 76: Hoare triple {35991#(<= ~counter~0 4)} assume true; {35991#(<= ~counter~0 4)} is VALID [2022-04-15 09:30:13,326 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {35991#(<= ~counter~0 4)} {35991#(<= ~counter~0 4)} #84#return; {35991#(<= ~counter~0 4)} is VALID [2022-04-15 09:30:13,326 INFO L272 TraceCheckUtils]: 78: Hoare triple {35991#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {35991#(<= ~counter~0 4)} is VALID [2022-04-15 09:30:13,326 INFO L290 TraceCheckUtils]: 79: Hoare triple {35991#(<= ~counter~0 4)} ~cond := #in~cond; {35991#(<= ~counter~0 4)} is VALID [2022-04-15 09:30:13,326 INFO L290 TraceCheckUtils]: 80: Hoare triple {35991#(<= ~counter~0 4)} assume !(0 == ~cond); {35991#(<= ~counter~0 4)} is VALID [2022-04-15 09:30:13,327 INFO L290 TraceCheckUtils]: 81: Hoare triple {35991#(<= ~counter~0 4)} assume true; {35991#(<= ~counter~0 4)} is VALID [2022-04-15 09:30:13,327 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {35991#(<= ~counter~0 4)} {35991#(<= ~counter~0 4)} #86#return; {35991#(<= ~counter~0 4)} is VALID [2022-04-15 09:30:13,327 INFO L290 TraceCheckUtils]: 83: Hoare triple {35991#(<= ~counter~0 4)} assume !(~r~0 >= ~d~0); {35991#(<= ~counter~0 4)} is VALID [2022-04-15 09:30:13,328 INFO L290 TraceCheckUtils]: 84: Hoare triple {35991#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36046#(<= ~counter~0 5)} is VALID [2022-04-15 09:30:13,328 INFO L290 TraceCheckUtils]: 85: Hoare triple {36046#(<= ~counter~0 5)} assume !!(#t~post7 < 20);havoc #t~post7; {36046#(<= ~counter~0 5)} is VALID [2022-04-15 09:30:13,329 INFO L272 TraceCheckUtils]: 86: Hoare triple {36046#(<= ~counter~0 5)} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {36046#(<= ~counter~0 5)} is VALID [2022-04-15 09:30:13,329 INFO L290 TraceCheckUtils]: 87: Hoare triple {36046#(<= ~counter~0 5)} ~cond := #in~cond; {36046#(<= ~counter~0 5)} is VALID [2022-04-15 09:30:13,329 INFO L290 TraceCheckUtils]: 88: Hoare triple {36046#(<= ~counter~0 5)} assume !(0 == ~cond); {36046#(<= ~counter~0 5)} is VALID [2022-04-15 09:30:13,330 INFO L290 TraceCheckUtils]: 89: Hoare triple {36046#(<= ~counter~0 5)} assume true; {36046#(<= ~counter~0 5)} is VALID [2022-04-15 09:30:13,330 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {36046#(<= ~counter~0 5)} {36046#(<= ~counter~0 5)} #88#return; {36046#(<= ~counter~0 5)} is VALID [2022-04-15 09:30:13,330 INFO L272 TraceCheckUtils]: 91: Hoare triple {36046#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {36046#(<= ~counter~0 5)} is VALID [2022-04-15 09:30:13,331 INFO L290 TraceCheckUtils]: 92: Hoare triple {36046#(<= ~counter~0 5)} ~cond := #in~cond; {36046#(<= ~counter~0 5)} is VALID [2022-04-15 09:30:13,331 INFO L290 TraceCheckUtils]: 93: Hoare triple {36046#(<= ~counter~0 5)} assume !(0 == ~cond); {36046#(<= ~counter~0 5)} is VALID [2022-04-15 09:30:13,331 INFO L290 TraceCheckUtils]: 94: Hoare triple {36046#(<= ~counter~0 5)} assume true; {36046#(<= ~counter~0 5)} is VALID [2022-04-15 09:30:13,332 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {36046#(<= ~counter~0 5)} {36046#(<= ~counter~0 5)} #90#return; {36046#(<= ~counter~0 5)} is VALID [2022-04-15 09:30:13,332 INFO L290 TraceCheckUtils]: 96: Hoare triple {36046#(<= ~counter~0 5)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {36046#(<= ~counter~0 5)} is VALID [2022-04-15 09:30:13,332 INFO L290 TraceCheckUtils]: 97: Hoare triple {36046#(<= ~counter~0 5)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {36046#(<= ~counter~0 5)} is VALID [2022-04-15 09:30:13,333 INFO L290 TraceCheckUtils]: 98: Hoare triple {36046#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36089#(<= ~counter~0 6)} is VALID [2022-04-15 09:30:13,333 INFO L290 TraceCheckUtils]: 99: Hoare triple {36089#(<= ~counter~0 6)} assume !!(#t~post7 < 20);havoc #t~post7; {36089#(<= ~counter~0 6)} is VALID [2022-04-15 09:30:13,333 INFO L272 TraceCheckUtils]: 100: Hoare triple {36089#(<= ~counter~0 6)} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {36089#(<= ~counter~0 6)} is VALID [2022-04-15 09:30:13,334 INFO L290 TraceCheckUtils]: 101: Hoare triple {36089#(<= ~counter~0 6)} ~cond := #in~cond; {36089#(<= ~counter~0 6)} is VALID [2022-04-15 09:30:13,334 INFO L290 TraceCheckUtils]: 102: Hoare triple {36089#(<= ~counter~0 6)} assume !(0 == ~cond); {36089#(<= ~counter~0 6)} is VALID [2022-04-15 09:30:13,334 INFO L290 TraceCheckUtils]: 103: Hoare triple {36089#(<= ~counter~0 6)} assume true; {36089#(<= ~counter~0 6)} is VALID [2022-04-15 09:30:13,335 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {36089#(<= ~counter~0 6)} {36089#(<= ~counter~0 6)} #88#return; {36089#(<= ~counter~0 6)} is VALID [2022-04-15 09:30:13,335 INFO L272 TraceCheckUtils]: 105: Hoare triple {36089#(<= ~counter~0 6)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {36089#(<= ~counter~0 6)} is VALID [2022-04-15 09:30:13,335 INFO L290 TraceCheckUtils]: 106: Hoare triple {36089#(<= ~counter~0 6)} ~cond := #in~cond; {36089#(<= ~counter~0 6)} is VALID [2022-04-15 09:30:13,336 INFO L290 TraceCheckUtils]: 107: Hoare triple {36089#(<= ~counter~0 6)} assume !(0 == ~cond); {36089#(<= ~counter~0 6)} is VALID [2022-04-15 09:30:13,336 INFO L290 TraceCheckUtils]: 108: Hoare triple {36089#(<= ~counter~0 6)} assume true; {36089#(<= ~counter~0 6)} is VALID [2022-04-15 09:30:13,336 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {36089#(<= ~counter~0 6)} {36089#(<= ~counter~0 6)} #90#return; {36089#(<= ~counter~0 6)} is VALID [2022-04-15 09:30:13,337 INFO L290 TraceCheckUtils]: 110: Hoare triple {36089#(<= ~counter~0 6)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {36089#(<= ~counter~0 6)} is VALID [2022-04-15 09:30:13,337 INFO L290 TraceCheckUtils]: 111: Hoare triple {36089#(<= ~counter~0 6)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {36089#(<= ~counter~0 6)} is VALID [2022-04-15 09:30:13,337 INFO L290 TraceCheckUtils]: 112: Hoare triple {36089#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36132#(<= |main_#t~post7| 6)} is VALID [2022-04-15 09:30:13,337 INFO L290 TraceCheckUtils]: 113: Hoare triple {36132#(<= |main_#t~post7| 6)} assume !(#t~post7 < 20);havoc #t~post7; {35785#false} is VALID [2022-04-15 09:30:13,338 INFO L272 TraceCheckUtils]: 114: Hoare triple {35785#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {35785#false} is VALID [2022-04-15 09:30:13,338 INFO L290 TraceCheckUtils]: 115: Hoare triple {35785#false} ~cond := #in~cond; {35785#false} is VALID [2022-04-15 09:30:13,338 INFO L290 TraceCheckUtils]: 116: Hoare triple {35785#false} assume 0 == ~cond; {35785#false} is VALID [2022-04-15 09:30:13,338 INFO L290 TraceCheckUtils]: 117: Hoare triple {35785#false} assume !false; {35785#false} is VALID [2022-04-15 09:30:13,338 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 32 proven. 470 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-04-15 09:30:13,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:30:13,849 INFO L290 TraceCheckUtils]: 117: Hoare triple {35785#false} assume !false; {35785#false} is VALID [2022-04-15 09:30:13,849 INFO L290 TraceCheckUtils]: 116: Hoare triple {35785#false} assume 0 == ~cond; {35785#false} is VALID [2022-04-15 09:30:13,849 INFO L290 TraceCheckUtils]: 115: Hoare triple {35785#false} ~cond := #in~cond; {35785#false} is VALID [2022-04-15 09:30:13,849 INFO L272 TraceCheckUtils]: 114: Hoare triple {35785#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {35785#false} is VALID [2022-04-15 09:30:13,850 INFO L290 TraceCheckUtils]: 113: Hoare triple {36160#(< |main_#t~post7| 20)} assume !(#t~post7 < 20);havoc #t~post7; {35785#false} is VALID [2022-04-15 09:30:13,850 INFO L290 TraceCheckUtils]: 112: Hoare triple {36164#(< ~counter~0 20)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36160#(< |main_#t~post7| 20)} is VALID [2022-04-15 09:30:13,850 INFO L290 TraceCheckUtils]: 111: Hoare triple {36164#(< ~counter~0 20)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {36164#(< ~counter~0 20)} is VALID [2022-04-15 09:30:13,851 INFO L290 TraceCheckUtils]: 110: Hoare triple {36164#(< ~counter~0 20)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {36164#(< ~counter~0 20)} is VALID [2022-04-15 09:30:13,851 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {35784#true} {36164#(< ~counter~0 20)} #90#return; {36164#(< ~counter~0 20)} is VALID [2022-04-15 09:30:13,851 INFO L290 TraceCheckUtils]: 108: Hoare triple {35784#true} assume true; {35784#true} is VALID [2022-04-15 09:30:13,851 INFO L290 TraceCheckUtils]: 107: Hoare triple {35784#true} assume !(0 == ~cond); {35784#true} is VALID [2022-04-15 09:30:13,851 INFO L290 TraceCheckUtils]: 106: Hoare triple {35784#true} ~cond := #in~cond; {35784#true} is VALID [2022-04-15 09:30:13,852 INFO L272 TraceCheckUtils]: 105: Hoare triple {36164#(< ~counter~0 20)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {35784#true} is VALID [2022-04-15 09:30:13,852 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {35784#true} {36164#(< ~counter~0 20)} #88#return; {36164#(< ~counter~0 20)} is VALID [2022-04-15 09:30:13,852 INFO L290 TraceCheckUtils]: 103: Hoare triple {35784#true} assume true; {35784#true} is VALID [2022-04-15 09:30:13,852 INFO L290 TraceCheckUtils]: 102: Hoare triple {35784#true} assume !(0 == ~cond); {35784#true} is VALID [2022-04-15 09:30:13,852 INFO L290 TraceCheckUtils]: 101: Hoare triple {35784#true} ~cond := #in~cond; {35784#true} is VALID [2022-04-15 09:30:13,853 INFO L272 TraceCheckUtils]: 100: Hoare triple {36164#(< ~counter~0 20)} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {35784#true} is VALID [2022-04-15 09:30:13,853 INFO L290 TraceCheckUtils]: 99: Hoare triple {36164#(< ~counter~0 20)} assume !!(#t~post7 < 20);havoc #t~post7; {36164#(< ~counter~0 20)} is VALID [2022-04-15 09:30:13,854 INFO L290 TraceCheckUtils]: 98: Hoare triple {36207#(< ~counter~0 19)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36164#(< ~counter~0 20)} is VALID [2022-04-15 09:30:13,854 INFO L290 TraceCheckUtils]: 97: Hoare triple {36207#(< ~counter~0 19)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {36207#(< ~counter~0 19)} is VALID [2022-04-15 09:30:13,854 INFO L290 TraceCheckUtils]: 96: Hoare triple {36207#(< ~counter~0 19)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {36207#(< ~counter~0 19)} is VALID [2022-04-15 09:30:13,855 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {35784#true} {36207#(< ~counter~0 19)} #90#return; {36207#(< ~counter~0 19)} is VALID [2022-04-15 09:30:13,855 INFO L290 TraceCheckUtils]: 94: Hoare triple {35784#true} assume true; {35784#true} is VALID [2022-04-15 09:30:13,855 INFO L290 TraceCheckUtils]: 93: Hoare triple {35784#true} assume !(0 == ~cond); {35784#true} is VALID [2022-04-15 09:30:13,855 INFO L290 TraceCheckUtils]: 92: Hoare triple {35784#true} ~cond := #in~cond; {35784#true} is VALID [2022-04-15 09:30:13,855 INFO L272 TraceCheckUtils]: 91: Hoare triple {36207#(< ~counter~0 19)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {35784#true} is VALID [2022-04-15 09:30:13,856 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {35784#true} {36207#(< ~counter~0 19)} #88#return; {36207#(< ~counter~0 19)} is VALID [2022-04-15 09:30:13,856 INFO L290 TraceCheckUtils]: 89: Hoare triple {35784#true} assume true; {35784#true} is VALID [2022-04-15 09:30:13,856 INFO L290 TraceCheckUtils]: 88: Hoare triple {35784#true} assume !(0 == ~cond); {35784#true} is VALID [2022-04-15 09:30:13,856 INFO L290 TraceCheckUtils]: 87: Hoare triple {35784#true} ~cond := #in~cond; {35784#true} is VALID [2022-04-15 09:30:13,856 INFO L272 TraceCheckUtils]: 86: Hoare triple {36207#(< ~counter~0 19)} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {35784#true} is VALID [2022-04-15 09:30:13,857 INFO L290 TraceCheckUtils]: 85: Hoare triple {36207#(< ~counter~0 19)} assume !!(#t~post7 < 20);havoc #t~post7; {36207#(< ~counter~0 19)} is VALID [2022-04-15 09:30:13,857 INFO L290 TraceCheckUtils]: 84: Hoare triple {36250#(< ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {36207#(< ~counter~0 19)} is VALID [2022-04-15 09:30:13,858 INFO L290 TraceCheckUtils]: 83: Hoare triple {36250#(< ~counter~0 18)} assume !(~r~0 >= ~d~0); {36250#(< ~counter~0 18)} is VALID [2022-04-15 09:30:13,858 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {35784#true} {36250#(< ~counter~0 18)} #86#return; {36250#(< ~counter~0 18)} is VALID [2022-04-15 09:30:13,858 INFO L290 TraceCheckUtils]: 81: Hoare triple {35784#true} assume true; {35784#true} is VALID [2022-04-15 09:30:13,858 INFO L290 TraceCheckUtils]: 80: Hoare triple {35784#true} assume !(0 == ~cond); {35784#true} is VALID [2022-04-15 09:30:13,858 INFO L290 TraceCheckUtils]: 79: Hoare triple {35784#true} ~cond := #in~cond; {35784#true} is VALID [2022-04-15 09:30:13,858 INFO L272 TraceCheckUtils]: 78: Hoare triple {36250#(< ~counter~0 18)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {35784#true} is VALID [2022-04-15 09:30:13,859 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {35784#true} {36250#(< ~counter~0 18)} #84#return; {36250#(< ~counter~0 18)} is VALID [2022-04-15 09:30:13,859 INFO L290 TraceCheckUtils]: 76: Hoare triple {35784#true} assume true; {35784#true} is VALID [2022-04-15 09:30:13,859 INFO L290 TraceCheckUtils]: 75: Hoare triple {35784#true} assume !(0 == ~cond); {35784#true} is VALID [2022-04-15 09:30:13,859 INFO L290 TraceCheckUtils]: 74: Hoare triple {35784#true} ~cond := #in~cond; {35784#true} is VALID [2022-04-15 09:30:13,859 INFO L272 TraceCheckUtils]: 73: Hoare triple {36250#(< ~counter~0 18)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {35784#true} is VALID [2022-04-15 09:30:13,860 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {35784#true} {36250#(< ~counter~0 18)} #82#return; {36250#(< ~counter~0 18)} is VALID [2022-04-15 09:30:13,860 INFO L290 TraceCheckUtils]: 71: Hoare triple {35784#true} assume true; {35784#true} is VALID [2022-04-15 09:30:13,860 INFO L290 TraceCheckUtils]: 70: Hoare triple {35784#true} assume !(0 == ~cond); {35784#true} is VALID [2022-04-15 09:30:13,860 INFO L290 TraceCheckUtils]: 69: Hoare triple {35784#true} ~cond := #in~cond; {35784#true} is VALID [2022-04-15 09:30:13,860 INFO L272 TraceCheckUtils]: 68: Hoare triple {36250#(< ~counter~0 18)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35784#true} is VALID [2022-04-15 09:30:13,860 INFO L290 TraceCheckUtils]: 67: Hoare triple {36250#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {36250#(< ~counter~0 18)} is VALID [2022-04-15 09:30:13,861 INFO L290 TraceCheckUtils]: 66: Hoare triple {36305#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36250#(< ~counter~0 18)} is VALID [2022-04-15 09:30:13,861 INFO L290 TraceCheckUtils]: 65: Hoare triple {36305#(< ~counter~0 17)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {36305#(< ~counter~0 17)} is VALID [2022-04-15 09:30:13,862 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {35784#true} {36305#(< ~counter~0 17)} #86#return; {36305#(< ~counter~0 17)} is VALID [2022-04-15 09:30:13,862 INFO L290 TraceCheckUtils]: 63: Hoare triple {35784#true} assume true; {35784#true} is VALID [2022-04-15 09:30:13,862 INFO L290 TraceCheckUtils]: 62: Hoare triple {35784#true} assume !(0 == ~cond); {35784#true} is VALID [2022-04-15 09:30:13,862 INFO L290 TraceCheckUtils]: 61: Hoare triple {35784#true} ~cond := #in~cond; {35784#true} is VALID [2022-04-15 09:30:13,862 INFO L272 TraceCheckUtils]: 60: Hoare triple {36305#(< ~counter~0 17)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {35784#true} is VALID [2022-04-15 09:30:13,863 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {35784#true} {36305#(< ~counter~0 17)} #84#return; {36305#(< ~counter~0 17)} is VALID [2022-04-15 09:30:13,863 INFO L290 TraceCheckUtils]: 58: Hoare triple {35784#true} assume true; {35784#true} is VALID [2022-04-15 09:30:13,863 INFO L290 TraceCheckUtils]: 57: Hoare triple {35784#true} assume !(0 == ~cond); {35784#true} is VALID [2022-04-15 09:30:13,863 INFO L290 TraceCheckUtils]: 56: Hoare triple {35784#true} ~cond := #in~cond; {35784#true} is VALID [2022-04-15 09:30:13,863 INFO L272 TraceCheckUtils]: 55: Hoare triple {36305#(< ~counter~0 17)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {35784#true} is VALID [2022-04-15 09:30:13,863 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {35784#true} {36305#(< ~counter~0 17)} #82#return; {36305#(< ~counter~0 17)} is VALID [2022-04-15 09:30:13,864 INFO L290 TraceCheckUtils]: 53: Hoare triple {35784#true} assume true; {35784#true} is VALID [2022-04-15 09:30:13,864 INFO L290 TraceCheckUtils]: 52: Hoare triple {35784#true} assume !(0 == ~cond); {35784#true} is VALID [2022-04-15 09:30:13,864 INFO L290 TraceCheckUtils]: 51: Hoare triple {35784#true} ~cond := #in~cond; {35784#true} is VALID [2022-04-15 09:30:13,864 INFO L272 TraceCheckUtils]: 50: Hoare triple {36305#(< ~counter~0 17)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35784#true} is VALID [2022-04-15 09:30:13,864 INFO L290 TraceCheckUtils]: 49: Hoare triple {36305#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {36305#(< ~counter~0 17)} is VALID [2022-04-15 09:30:13,865 INFO L290 TraceCheckUtils]: 48: Hoare triple {36360#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36305#(< ~counter~0 17)} is VALID [2022-04-15 09:30:13,865 INFO L290 TraceCheckUtils]: 47: Hoare triple {36360#(< ~counter~0 16)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {36360#(< ~counter~0 16)} is VALID [2022-04-15 09:30:13,866 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {35784#true} {36360#(< ~counter~0 16)} #86#return; {36360#(< ~counter~0 16)} is VALID [2022-04-15 09:30:13,866 INFO L290 TraceCheckUtils]: 45: Hoare triple {35784#true} assume true; {35784#true} is VALID [2022-04-15 09:30:13,866 INFO L290 TraceCheckUtils]: 44: Hoare triple {35784#true} assume !(0 == ~cond); {35784#true} is VALID [2022-04-15 09:30:13,866 INFO L290 TraceCheckUtils]: 43: Hoare triple {35784#true} ~cond := #in~cond; {35784#true} is VALID [2022-04-15 09:30:13,866 INFO L272 TraceCheckUtils]: 42: Hoare triple {36360#(< ~counter~0 16)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {35784#true} is VALID [2022-04-15 09:30:13,866 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {35784#true} {36360#(< ~counter~0 16)} #84#return; {36360#(< ~counter~0 16)} is VALID [2022-04-15 09:30:13,867 INFO L290 TraceCheckUtils]: 40: Hoare triple {35784#true} assume true; {35784#true} is VALID [2022-04-15 09:30:13,867 INFO L290 TraceCheckUtils]: 39: Hoare triple {35784#true} assume !(0 == ~cond); {35784#true} is VALID [2022-04-15 09:30:13,867 INFO L290 TraceCheckUtils]: 38: Hoare triple {35784#true} ~cond := #in~cond; {35784#true} is VALID [2022-04-15 09:30:13,867 INFO L272 TraceCheckUtils]: 37: Hoare triple {36360#(< ~counter~0 16)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {35784#true} is VALID [2022-04-15 09:30:13,867 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {35784#true} {36360#(< ~counter~0 16)} #82#return; {36360#(< ~counter~0 16)} is VALID [2022-04-15 09:30:13,867 INFO L290 TraceCheckUtils]: 35: Hoare triple {35784#true} assume true; {35784#true} is VALID [2022-04-15 09:30:13,867 INFO L290 TraceCheckUtils]: 34: Hoare triple {35784#true} assume !(0 == ~cond); {35784#true} is VALID [2022-04-15 09:30:13,868 INFO L290 TraceCheckUtils]: 33: Hoare triple {35784#true} ~cond := #in~cond; {35784#true} is VALID [2022-04-15 09:30:13,868 INFO L272 TraceCheckUtils]: 32: Hoare triple {36360#(< ~counter~0 16)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35784#true} is VALID [2022-04-15 09:30:13,868 INFO L290 TraceCheckUtils]: 31: Hoare triple {36360#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {36360#(< ~counter~0 16)} is VALID [2022-04-15 09:30:13,869 INFO L290 TraceCheckUtils]: 30: Hoare triple {36415#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36360#(< ~counter~0 16)} is VALID [2022-04-15 09:30:13,869 INFO L290 TraceCheckUtils]: 29: Hoare triple {36415#(< ~counter~0 15)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {36415#(< ~counter~0 15)} is VALID [2022-04-15 09:30:13,869 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {35784#true} {36415#(< ~counter~0 15)} #86#return; {36415#(< ~counter~0 15)} is VALID [2022-04-15 09:30:13,870 INFO L290 TraceCheckUtils]: 27: Hoare triple {35784#true} assume true; {35784#true} is VALID [2022-04-15 09:30:13,870 INFO L290 TraceCheckUtils]: 26: Hoare triple {35784#true} assume !(0 == ~cond); {35784#true} is VALID [2022-04-15 09:30:13,870 INFO L290 TraceCheckUtils]: 25: Hoare triple {35784#true} ~cond := #in~cond; {35784#true} is VALID [2022-04-15 09:30:13,870 INFO L272 TraceCheckUtils]: 24: Hoare triple {36415#(< ~counter~0 15)} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {35784#true} is VALID [2022-04-15 09:30:13,870 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {35784#true} {36415#(< ~counter~0 15)} #84#return; {36415#(< ~counter~0 15)} is VALID [2022-04-15 09:30:13,870 INFO L290 TraceCheckUtils]: 22: Hoare triple {35784#true} assume true; {35784#true} is VALID [2022-04-15 09:30:13,870 INFO L290 TraceCheckUtils]: 21: Hoare triple {35784#true} assume !(0 == ~cond); {35784#true} is VALID [2022-04-15 09:30:13,871 INFO L290 TraceCheckUtils]: 20: Hoare triple {35784#true} ~cond := #in~cond; {35784#true} is VALID [2022-04-15 09:30:13,871 INFO L272 TraceCheckUtils]: 19: Hoare triple {36415#(< ~counter~0 15)} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {35784#true} is VALID [2022-04-15 09:30:13,871 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {35784#true} {36415#(< ~counter~0 15)} #82#return; {36415#(< ~counter~0 15)} is VALID [2022-04-15 09:30:13,871 INFO L290 TraceCheckUtils]: 17: Hoare triple {35784#true} assume true; {35784#true} is VALID [2022-04-15 09:30:13,871 INFO L290 TraceCheckUtils]: 16: Hoare triple {35784#true} assume !(0 == ~cond); {35784#true} is VALID [2022-04-15 09:30:13,871 INFO L290 TraceCheckUtils]: 15: Hoare triple {35784#true} ~cond := #in~cond; {35784#true} is VALID [2022-04-15 09:30:13,871 INFO L272 TraceCheckUtils]: 14: Hoare triple {36415#(< ~counter~0 15)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {35784#true} is VALID [2022-04-15 09:30:13,872 INFO L290 TraceCheckUtils]: 13: Hoare triple {36415#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {36415#(< ~counter~0 15)} is VALID [2022-04-15 09:30:13,872 INFO L290 TraceCheckUtils]: 12: Hoare triple {36470#(< ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36415#(< ~counter~0 15)} is VALID [2022-04-15 09:30:13,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {36470#(< ~counter~0 14)} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {36470#(< ~counter~0 14)} is VALID [2022-04-15 09:30:13,873 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35784#true} {36470#(< ~counter~0 14)} #80#return; {36470#(< ~counter~0 14)} is VALID [2022-04-15 09:30:13,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {35784#true} assume true; {35784#true} is VALID [2022-04-15 09:30:13,873 INFO L290 TraceCheckUtils]: 8: Hoare triple {35784#true} assume !(0 == ~cond); {35784#true} is VALID [2022-04-15 09:30:13,873 INFO L290 TraceCheckUtils]: 7: Hoare triple {35784#true} ~cond := #in~cond; {35784#true} is VALID [2022-04-15 09:30:13,874 INFO L272 TraceCheckUtils]: 6: Hoare triple {36470#(< ~counter~0 14)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {35784#true} is VALID [2022-04-15 09:30:13,874 INFO L290 TraceCheckUtils]: 5: Hoare triple {36470#(< ~counter~0 14)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {36470#(< ~counter~0 14)} is VALID [2022-04-15 09:30:13,874 INFO L272 TraceCheckUtils]: 4: Hoare triple {36470#(< ~counter~0 14)} call #t~ret8 := main(); {36470#(< ~counter~0 14)} is VALID [2022-04-15 09:30:13,875 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36470#(< ~counter~0 14)} {35784#true} #96#return; {36470#(< ~counter~0 14)} is VALID [2022-04-15 09:30:13,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {36470#(< ~counter~0 14)} assume true; {36470#(< ~counter~0 14)} is VALID [2022-04-15 09:30:13,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {35784#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {36470#(< ~counter~0 14)} is VALID [2022-04-15 09:30:13,875 INFO L272 TraceCheckUtils]: 0: Hoare triple {35784#true} call ULTIMATE.init(); {35784#true} is VALID [2022-04-15 09:30:13,876 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 32 proven. 46 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-15 09:30:13,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:30:13,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142652924] [2022-04-15 09:30:13,876 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:30:13,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544296408] [2022-04-15 09:30:13,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544296408] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:30:13,876 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:30:13,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-15 09:30:13,877 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:30:13,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [490528746] [2022-04-15 09:30:13,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [490528746] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:30:13,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:30:13,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 09:30:13,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822452715] [2022-04-15 09:30:13,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:30:13,878 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (20), 9 states have call predecessors, (20), 7 states have return successors, (18), 7 states have call predecessors, (18), 8 states have call successors, (18) Word has length 118 [2022-04-15 09:30:13,878 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:30:13,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (20), 9 states have call predecessors, (20), 7 states have return successors, (18), 7 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-15 09:30:13,981 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:30:13,981 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 09:30:13,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:30:13,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 09:30:13,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-15 09:30:13,982 INFO L87 Difference]: Start difference. First operand 212 states and 247 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (20), 9 states have call predecessors, (20), 7 states have return successors, (18), 7 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-15 09:30:15,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:30:15,019 INFO L93 Difference]: Finished difference Result 272 states and 312 transitions. [2022-04-15 09:30:15,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 09:30:15,019 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (20), 9 states have call predecessors, (20), 7 states have return successors, (18), 7 states have call predecessors, (18), 8 states have call successors, (18) Word has length 118 [2022-04-15 09:30:15,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:30:15,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (20), 9 states have call predecessors, (20), 7 states have return successors, (18), 7 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-15 09:30:15,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 152 transitions. [2022-04-15 09:30:15,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (20), 9 states have call predecessors, (20), 7 states have return successors, (18), 7 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-15 09:30:15,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 152 transitions. [2022-04-15 09:30:15,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 152 transitions. [2022-04-15 09:30:15,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:30:15,245 INFO L225 Difference]: With dead ends: 272 [2022-04-15 09:30:15,245 INFO L226 Difference]: Without dead ends: 257 [2022-04-15 09:30:15,245 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=151, Invalid=229, Unknown=0, NotChecked=0, Total=380 [2022-04-15 09:30:15,245 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 50 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 09:30:15,246 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 225 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 09:30:15,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-04-15 09:30:15,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 254. [2022-04-15 09:30:15,552 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:30:15,552 INFO L82 GeneralOperation]: Start isEquivalent. First operand 257 states. Second operand has 254 states, 168 states have (on average 1.130952380952381) internal successors, (190), 174 states have internal predecessors, (190), 52 states have call successors, (52), 35 states have call predecessors, (52), 33 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) [2022-04-15 09:30:15,552 INFO L74 IsIncluded]: Start isIncluded. First operand 257 states. Second operand has 254 states, 168 states have (on average 1.130952380952381) internal successors, (190), 174 states have internal predecessors, (190), 52 states have call successors, (52), 35 states have call predecessors, (52), 33 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) [2022-04-15 09:30:15,553 INFO L87 Difference]: Start difference. First operand 257 states. Second operand has 254 states, 168 states have (on average 1.130952380952381) internal successors, (190), 174 states have internal predecessors, (190), 52 states have call successors, (52), 35 states have call predecessors, (52), 33 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) [2022-04-15 09:30:15,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:30:15,556 INFO L93 Difference]: Finished difference Result 257 states and 292 transitions. [2022-04-15 09:30:15,556 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 292 transitions. [2022-04-15 09:30:15,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:30:15,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:30:15,557 INFO L74 IsIncluded]: Start isIncluded. First operand has 254 states, 168 states have (on average 1.130952380952381) internal successors, (190), 174 states have internal predecessors, (190), 52 states have call successors, (52), 35 states have call predecessors, (52), 33 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) Second operand 257 states. [2022-04-15 09:30:15,557 INFO L87 Difference]: Start difference. First operand has 254 states, 168 states have (on average 1.130952380952381) internal successors, (190), 174 states have internal predecessors, (190), 52 states have call successors, (52), 35 states have call predecessors, (52), 33 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) Second operand 257 states. [2022-04-15 09:30:15,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:30:15,560 INFO L93 Difference]: Finished difference Result 257 states and 292 transitions. [2022-04-15 09:30:15,560 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 292 transitions. [2022-04-15 09:30:15,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:30:15,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:30:15,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:30:15,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:30:15,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 168 states have (on average 1.130952380952381) internal successors, (190), 174 states have internal predecessors, (190), 52 states have call successors, (52), 35 states have call predecessors, (52), 33 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) [2022-04-15 09:30:15,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 290 transitions. [2022-04-15 09:30:15,564 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 290 transitions. Word has length 118 [2022-04-15 09:30:15,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:30:15,565 INFO L478 AbstractCegarLoop]: Abstraction has 254 states and 290 transitions. [2022-04-15 09:30:15,565 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 9 states have call successors, (20), 9 states have call predecessors, (20), 7 states have return successors, (18), 7 states have call predecessors, (18), 8 states have call successors, (18) [2022-04-15 09:30:15,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 254 states and 290 transitions. [2022-04-15 09:30:18,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 290 edges. 289 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 09:30:18,229 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 290 transitions. [2022-04-15 09:30:18,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-15 09:30:18,230 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:30:18,230 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 16, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:30:18,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-15 09:30:18,446 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-15 09:30:18,446 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:30:18,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:30:18,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1564262477, now seen corresponding path program 17 times [2022-04-15 09:30:18,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:30:18,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1052875269] [2022-04-15 09:30:26,414 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:30:26,414 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2022-04-15 09:30:26,414 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:30:26,414 INFO L85 PathProgramCache]: Analyzing trace with hash 1564262477, now seen corresponding path program 18 times [2022-04-15 09:30:26,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:30:26,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877341308] [2022-04-15 09:30:26,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:30:26,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:30:26,430 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:30:26,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1004643109] [2022-04-15 09:30:26,430 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 09:30:26,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:30:26,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:30:26,440 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 09:30:26,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-15 09:30:26,748 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 09:30:26,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:30:26,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 49 conjunts are in the unsatisfiable core [2022-04-15 09:30:26,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:30:26,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:30:29,762 INFO L272 TraceCheckUtils]: 0: Hoare triple {38079#true} call ULTIMATE.init(); {38079#true} is VALID [2022-04-15 09:30:29,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {38079#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {38079#true} is VALID [2022-04-15 09:30:29,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-15 09:30:29,763 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38079#true} {38079#true} #96#return; {38079#true} is VALID [2022-04-15 09:30:29,763 INFO L272 TraceCheckUtils]: 4: Hoare triple {38079#true} call #t~ret8 := main(); {38079#true} is VALID [2022-04-15 09:30:29,763 INFO L290 TraceCheckUtils]: 5: Hoare triple {38079#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {38079#true} is VALID [2022-04-15 09:30:29,763 INFO L272 TraceCheckUtils]: 6: Hoare triple {38079#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {38079#true} is VALID [2022-04-15 09:30:29,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {38079#true} ~cond := #in~cond; {38105#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 09:30:29,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {38105#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {38109#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 09:30:29,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {38109#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {38109#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 09:30:29,764 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {38109#(not (= |assume_abort_if_not_#in~cond| 0))} {38079#true} #80#return; {38116#(<= 1 (mod main_~B~0 4294967296))} is VALID [2022-04-15 09:30:29,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {38116#(<= 1 (mod main_~B~0 4294967296))} ~r~0 := ~A~0 % 4294967296;~d~0 := ~B~0 % 4294967296;~p~0 := 1;~q~0 := 0; {38120#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 09:30:29,765 INFO L290 TraceCheckUtils]: 12: Hoare triple {38120#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38120#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 09:30:29,766 INFO L290 TraceCheckUtils]: 13: Hoare triple {38120#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {38120#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 09:30:29,766 INFO L272 TraceCheckUtils]: 14: Hoare triple {38120#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {38079#true} is VALID [2022-04-15 09:30:29,766 INFO L290 TraceCheckUtils]: 15: Hoare triple {38079#true} ~cond := #in~cond; {38079#true} is VALID [2022-04-15 09:30:29,766 INFO L290 TraceCheckUtils]: 16: Hoare triple {38079#true} assume !(0 == ~cond); {38079#true} is VALID [2022-04-15 09:30:29,766 INFO L290 TraceCheckUtils]: 17: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-15 09:30:29,766 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {38079#true} {38120#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} #82#return; {38120#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 09:30:29,767 INFO L272 TraceCheckUtils]: 19: Hoare triple {38120#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {38079#true} is VALID [2022-04-15 09:30:29,767 INFO L290 TraceCheckUtils]: 20: Hoare triple {38079#true} ~cond := #in~cond; {38079#true} is VALID [2022-04-15 09:30:29,767 INFO L290 TraceCheckUtils]: 21: Hoare triple {38079#true} assume !(0 == ~cond); {38079#true} is VALID [2022-04-15 09:30:29,767 INFO L290 TraceCheckUtils]: 22: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-15 09:30:29,768 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {38079#true} {38120#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} #84#return; {38120#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 09:30:29,768 INFO L272 TraceCheckUtils]: 24: Hoare triple {38120#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {38079#true} is VALID [2022-04-15 09:30:29,768 INFO L290 TraceCheckUtils]: 25: Hoare triple {38079#true} ~cond := #in~cond; {38079#true} is VALID [2022-04-15 09:30:29,768 INFO L290 TraceCheckUtils]: 26: Hoare triple {38079#true} assume !(0 == ~cond); {38079#true} is VALID [2022-04-15 09:30:29,768 INFO L290 TraceCheckUtils]: 27: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-15 09:30:29,768 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {38079#true} {38120#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} #86#return; {38120#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-15 09:30:29,770 INFO L290 TraceCheckUtils]: 29: Hoare triple {38120#(and (= main_~d~0 (mod main_~B~0 4294967296)) (= (mod main_~A~0 4294967296) main_~r~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {38175#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-15 09:30:29,771 INFO L290 TraceCheckUtils]: 30: Hoare triple {38175#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38175#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-15 09:30:29,771 INFO L290 TraceCheckUtils]: 31: Hoare triple {38175#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} assume !!(#t~post6 < 20);havoc #t~post6; {38175#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-15 09:30:29,771 INFO L272 TraceCheckUtils]: 32: Hoare triple {38175#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {38079#true} is VALID [2022-04-15 09:30:29,771 INFO L290 TraceCheckUtils]: 33: Hoare triple {38079#true} ~cond := #in~cond; {38079#true} is VALID [2022-04-15 09:30:29,771 INFO L290 TraceCheckUtils]: 34: Hoare triple {38079#true} assume !(0 == ~cond); {38079#true} is VALID [2022-04-15 09:30:29,771 INFO L290 TraceCheckUtils]: 35: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-15 09:30:29,772 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {38079#true} {38175#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} #82#return; {38175#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-15 09:30:29,772 INFO L272 TraceCheckUtils]: 37: Hoare triple {38175#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {38079#true} is VALID [2022-04-15 09:30:29,772 INFO L290 TraceCheckUtils]: 38: Hoare triple {38079#true} ~cond := #in~cond; {38079#true} is VALID [2022-04-15 09:30:29,772 INFO L290 TraceCheckUtils]: 39: Hoare triple {38079#true} assume !(0 == ~cond); {38079#true} is VALID [2022-04-15 09:30:29,772 INFO L290 TraceCheckUtils]: 40: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-15 09:30:29,773 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {38079#true} {38175#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} #84#return; {38175#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-15 09:30:29,773 INFO L272 TraceCheckUtils]: 42: Hoare triple {38175#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {38079#true} is VALID [2022-04-15 09:30:29,773 INFO L290 TraceCheckUtils]: 43: Hoare triple {38079#true} ~cond := #in~cond; {38079#true} is VALID [2022-04-15 09:30:29,773 INFO L290 TraceCheckUtils]: 44: Hoare triple {38079#true} assume !(0 == ~cond); {38079#true} is VALID [2022-04-15 09:30:29,773 INFO L290 TraceCheckUtils]: 45: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-15 09:30:29,774 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {38079#true} {38175#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} #86#return; {38175#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-15 09:30:29,776 INFO L290 TraceCheckUtils]: 47: Hoare triple {38175#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~d~0 (* 2 (mod main_~B~0 4294967296))) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {38230#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-15 09:30:29,776 INFO L290 TraceCheckUtils]: 48: Hoare triple {38230#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38230#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-15 09:30:29,777 INFO L290 TraceCheckUtils]: 49: Hoare triple {38230#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} assume !!(#t~post6 < 20);havoc #t~post6; {38230#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-15 09:30:29,777 INFO L272 TraceCheckUtils]: 50: Hoare triple {38230#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {38079#true} is VALID [2022-04-15 09:30:29,777 INFO L290 TraceCheckUtils]: 51: Hoare triple {38079#true} ~cond := #in~cond; {38079#true} is VALID [2022-04-15 09:30:29,777 INFO L290 TraceCheckUtils]: 52: Hoare triple {38079#true} assume !(0 == ~cond); {38079#true} is VALID [2022-04-15 09:30:29,777 INFO L290 TraceCheckUtils]: 53: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-15 09:30:29,778 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {38079#true} {38230#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} #82#return; {38230#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-15 09:30:29,778 INFO L272 TraceCheckUtils]: 55: Hoare triple {38230#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {38079#true} is VALID [2022-04-15 09:30:29,778 INFO L290 TraceCheckUtils]: 56: Hoare triple {38079#true} ~cond := #in~cond; {38079#true} is VALID [2022-04-15 09:30:29,778 INFO L290 TraceCheckUtils]: 57: Hoare triple {38079#true} assume !(0 == ~cond); {38079#true} is VALID [2022-04-15 09:30:29,778 INFO L290 TraceCheckUtils]: 58: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-15 09:30:29,779 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {38079#true} {38230#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} #84#return; {38230#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-15 09:30:29,779 INFO L272 TraceCheckUtils]: 60: Hoare triple {38230#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {38079#true} is VALID [2022-04-15 09:30:29,779 INFO L290 TraceCheckUtils]: 61: Hoare triple {38079#true} ~cond := #in~cond; {38079#true} is VALID [2022-04-15 09:30:29,779 INFO L290 TraceCheckUtils]: 62: Hoare triple {38079#true} assume !(0 == ~cond); {38079#true} is VALID [2022-04-15 09:30:29,779 INFO L290 TraceCheckUtils]: 63: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-15 09:30:29,780 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {38079#true} {38230#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} #86#return; {38230#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-15 09:30:29,782 INFO L290 TraceCheckUtils]: 65: Hoare triple {38230#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {38285#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 8) (<= 1 (mod main_~B~0 4294967296)) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0))} is VALID [2022-04-15 09:30:29,782 INFO L290 TraceCheckUtils]: 66: Hoare triple {38285#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 8) (<= 1 (mod main_~B~0 4294967296)) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38285#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 8) (<= 1 (mod main_~B~0 4294967296)) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0))} is VALID [2022-04-15 09:30:29,782 INFO L290 TraceCheckUtils]: 67: Hoare triple {38285#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 8) (<= 1 (mod main_~B~0 4294967296)) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0))} assume !!(#t~post6 < 20);havoc #t~post6; {38285#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 8) (<= 1 (mod main_~B~0 4294967296)) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0))} is VALID [2022-04-15 09:30:29,783 INFO L272 TraceCheckUtils]: 68: Hoare triple {38285#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 8) (<= 1 (mod main_~B~0 4294967296)) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {38079#true} is VALID [2022-04-15 09:30:29,783 INFO L290 TraceCheckUtils]: 69: Hoare triple {38079#true} ~cond := #in~cond; {38079#true} is VALID [2022-04-15 09:30:29,783 INFO L290 TraceCheckUtils]: 70: Hoare triple {38079#true} assume !(0 == ~cond); {38079#true} is VALID [2022-04-15 09:30:29,783 INFO L290 TraceCheckUtils]: 71: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-15 09:30:29,783 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {38079#true} {38285#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 8) (<= 1 (mod main_~B~0 4294967296)) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0))} #82#return; {38285#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 8) (<= 1 (mod main_~B~0 4294967296)) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0))} is VALID [2022-04-15 09:30:29,784 INFO L272 TraceCheckUtils]: 73: Hoare triple {38285#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 8) (<= 1 (mod main_~B~0 4294967296)) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 % 4294967296 then 1 else 0)); {38079#true} is VALID [2022-04-15 09:30:29,784 INFO L290 TraceCheckUtils]: 74: Hoare triple {38079#true} ~cond := #in~cond; {38079#true} is VALID [2022-04-15 09:30:29,784 INFO L290 TraceCheckUtils]: 75: Hoare triple {38079#true} assume !(0 == ~cond); {38079#true} is VALID [2022-04-15 09:30:29,784 INFO L290 TraceCheckUtils]: 76: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-15 09:30:29,784 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {38079#true} {38285#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 8) (<= 1 (mod main_~B~0 4294967296)) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0))} #84#return; {38285#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 8) (<= 1 (mod main_~B~0 4294967296)) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0))} is VALID [2022-04-15 09:30:29,784 INFO L272 TraceCheckUtils]: 78: Hoare triple {38285#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 8) (<= 1 (mod main_~B~0 4294967296)) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {38079#true} is VALID [2022-04-15 09:30:29,785 INFO L290 TraceCheckUtils]: 79: Hoare triple {38079#true} ~cond := #in~cond; {38079#true} is VALID [2022-04-15 09:30:29,785 INFO L290 TraceCheckUtils]: 80: Hoare triple {38079#true} assume !(0 == ~cond); {38079#true} is VALID [2022-04-15 09:30:29,785 INFO L290 TraceCheckUtils]: 81: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-15 09:30:29,785 INFO L284 TraceCheckUtils]: 82: Hoare quadruple {38079#true} {38285#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 8) (<= 1 (mod main_~B~0 4294967296)) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0))} #86#return; {38285#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 8) (<= 1 (mod main_~B~0 4294967296)) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0))} is VALID [2022-04-15 09:30:29,786 INFO L290 TraceCheckUtils]: 83: Hoare triple {38285#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 8) (<= 1 (mod main_~B~0 4294967296)) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0))} assume !(~r~0 >= ~d~0); {38285#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 8) (<= 1 (mod main_~B~0 4294967296)) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0))} is VALID [2022-04-15 09:30:29,786 INFO L290 TraceCheckUtils]: 84: Hoare triple {38285#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 8) (<= 1 (mod main_~B~0 4294967296)) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38285#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 8) (<= 1 (mod main_~B~0 4294967296)) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0))} is VALID [2022-04-15 09:30:29,787 INFO L290 TraceCheckUtils]: 85: Hoare triple {38285#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 8) (<= 1 (mod main_~B~0 4294967296)) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0))} assume !!(#t~post7 < 20);havoc #t~post7; {38285#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 8) (<= 1 (mod main_~B~0 4294967296)) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0))} is VALID [2022-04-15 09:30:29,787 INFO L272 TraceCheckUtils]: 86: Hoare triple {38285#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 8) (<= 1 (mod main_~B~0 4294967296)) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {38079#true} is VALID [2022-04-15 09:30:29,787 INFO L290 TraceCheckUtils]: 87: Hoare triple {38079#true} ~cond := #in~cond; {38079#true} is VALID [2022-04-15 09:30:29,787 INFO L290 TraceCheckUtils]: 88: Hoare triple {38079#true} assume !(0 == ~cond); {38079#true} is VALID [2022-04-15 09:30:29,787 INFO L290 TraceCheckUtils]: 89: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-15 09:30:29,788 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {38079#true} {38285#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 8) (<= 1 (mod main_~B~0 4294967296)) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0))} #88#return; {38285#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 8) (<= 1 (mod main_~B~0 4294967296)) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0))} is VALID [2022-04-15 09:30:29,788 INFO L272 TraceCheckUtils]: 91: Hoare triple {38285#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 8) (<= 1 (mod main_~B~0 4294967296)) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {38079#true} is VALID [2022-04-15 09:30:29,788 INFO L290 TraceCheckUtils]: 92: Hoare triple {38079#true} ~cond := #in~cond; {38079#true} is VALID [2022-04-15 09:30:29,788 INFO L290 TraceCheckUtils]: 93: Hoare triple {38079#true} assume !(0 == ~cond); {38079#true} is VALID [2022-04-15 09:30:29,788 INFO L290 TraceCheckUtils]: 94: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-15 09:30:29,789 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {38079#true} {38285#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 8) (<= 1 (mod main_~B~0 4294967296)) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0))} #90#return; {38285#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 8) (<= 1 (mod main_~B~0 4294967296)) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0))} is VALID [2022-04-15 09:30:29,791 INFO L290 TraceCheckUtils]: 96: Hoare triple {38285#(and (= (mod main_~A~0 4294967296) main_~r~0) (= main_~p~0 8) (<= 1 (mod main_~B~0 4294967296)) (= (* 8 (mod main_~B~0 4294967296)) main_~d~0) (= main_~q~0 0))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {38230#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} is VALID [2022-04-15 09:30:29,793 INFO L290 TraceCheckUtils]: 97: Hoare triple {38230#(and (= (mod main_~A~0 4294967296) main_~r~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 0) (= main_~p~0 4))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {38382#(and (= main_~q~0 main_~p~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} is VALID [2022-04-15 09:30:29,794 INFO L290 TraceCheckUtils]: 98: Hoare triple {38382#(and (= main_~q~0 main_~p~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38382#(and (= main_~q~0 main_~p~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} is VALID [2022-04-15 09:30:29,794 INFO L290 TraceCheckUtils]: 99: Hoare triple {38382#(and (= main_~q~0 main_~p~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} assume !!(#t~post7 < 20);havoc #t~post7; {38382#(and (= main_~q~0 main_~p~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} is VALID [2022-04-15 09:30:29,795 INFO L272 TraceCheckUtils]: 100: Hoare triple {38382#(and (= main_~q~0 main_~p~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {38079#true} is VALID [2022-04-15 09:30:29,795 INFO L290 TraceCheckUtils]: 101: Hoare triple {38079#true} ~cond := #in~cond; {38079#true} is VALID [2022-04-15 09:30:29,795 INFO L290 TraceCheckUtils]: 102: Hoare triple {38079#true} assume !(0 == ~cond); {38079#true} is VALID [2022-04-15 09:30:29,795 INFO L290 TraceCheckUtils]: 103: Hoare triple {38079#true} assume true; {38079#true} is VALID [2022-04-15 09:30:29,795 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {38079#true} {38382#(and (= main_~q~0 main_~p~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} #88#return; {38382#(and (= main_~q~0 main_~p~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} is VALID [2022-04-15 09:30:29,795 INFO L272 TraceCheckUtils]: 105: Hoare triple {38382#(and (= main_~q~0 main_~p~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} call __VERIFIER_assert((if ~d~0 == ~B~0 % 4294967296 * ~p~0 then 1 else 0)); {38079#true} is VALID [2022-04-15 09:30:29,796 INFO L290 TraceCheckUtils]: 106: Hoare triple {38079#true} ~cond := #in~cond; {38410#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:30:29,796 INFO L290 TraceCheckUtils]: 107: Hoare triple {38410#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {38414#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:30:29,796 INFO L290 TraceCheckUtils]: 108: Hoare triple {38414#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {38414#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:30:29,797 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {38414#(not (= |__VERIFIER_assert_#in~cond| 0))} {38382#(and (= main_~q~0 main_~p~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} #90#return; {38382#(and (= main_~q~0 main_~p~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} is VALID [2022-04-15 09:30:29,798 INFO L290 TraceCheckUtils]: 110: Hoare triple {38382#(and (= main_~q~0 main_~p~0) (= (* (mod main_~B~0 4294967296) 4) main_~d~0) (= (+ main_~d~0 main_~r~0) (mod main_~A~0 4294967296)) (<= 1 (mod main_~B~0 4294967296)) (= main_~p~0 4))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {38424#(and (= (mod main_~A~0 4294967296) (+ (* (mod main_~B~0 4294967296) 4) main_~r~0)) (= main_~d~0 (div (* (mod main_~B~0 4294967296) 4) 2)) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 4))} is VALID [2022-04-15 09:30:29,800 INFO L290 TraceCheckUtils]: 111: Hoare triple {38424#(and (= (mod main_~A~0 4294967296) (+ (* (mod main_~B~0 4294967296) 4) main_~r~0)) (= main_~d~0 (div (* (mod main_~B~0 4294967296) 4) 2)) (= main_~p~0 2) (<= 1 (mod main_~B~0 4294967296)) (= main_~q~0 4))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {38428#(and (= (+ (mod main_~A~0 4294967296) (* (- 4) (mod main_~B~0 4294967296)) (* (- 1) main_~r~0)) (div (* (mod main_~B~0 4294967296) 4) 2)) (= 2 (+ main_~q~0 (- 4))) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 09:30:29,800 INFO L290 TraceCheckUtils]: 112: Hoare triple {38428#(and (= (+ (mod main_~A~0 4294967296) (* (- 4) (mod main_~B~0 4294967296)) (* (- 1) main_~r~0)) (div (* (mod main_~B~0 4294967296) 4) 2)) (= 2 (+ main_~q~0 (- 4))) (<= 1 (mod main_~B~0 4294967296)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38428#(and (= (+ (mod main_~A~0 4294967296) (* (- 4) (mod main_~B~0 4294967296)) (* (- 1) main_~r~0)) (div (* (mod main_~B~0 4294967296) 4) 2)) (= 2 (+ main_~q~0 (- 4))) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 09:30:29,801 INFO L290 TraceCheckUtils]: 113: Hoare triple {38428#(and (= (+ (mod main_~A~0 4294967296) (* (- 4) (mod main_~B~0 4294967296)) (* (- 1) main_~r~0)) (div (* (mod main_~B~0 4294967296) 4) 2)) (= 2 (+ main_~q~0 (- 4))) (<= 1 (mod main_~B~0 4294967296)))} assume !!(#t~post7 < 20);havoc #t~post7; {38428#(and (= (+ (mod main_~A~0 4294967296) (* (- 4) (mod main_~B~0 4294967296)) (* (- 1) main_~r~0)) (div (* (mod main_~B~0 4294967296) 4) 2)) (= 2 (+ main_~q~0 (- 4))) (<= 1 (mod main_~B~0 4294967296)))} is VALID [2022-04-15 09:30:29,802 INFO L272 TraceCheckUtils]: 114: Hoare triple {38428#(and (= (+ (mod main_~A~0 4294967296) (* (- 4) (mod main_~B~0 4294967296)) (* (- 1) main_~r~0)) (div (* (mod main_~B~0 4294967296) 4) 2)) (= 2 (+ main_~q~0 (- 4))) (<= 1 (mod main_~B~0 4294967296)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == ~q~0 * (~B~0 % 4294967296) + ~r~0 then 1 else 0)); {38438#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 09:30:29,802 INFO L290 TraceCheckUtils]: 115: Hoare triple {38438#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {38442#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:30:29,802 INFO L290 TraceCheckUtils]: 116: Hoare triple {38442#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {38080#false} is VALID [2022-04-15 09:30:29,802 INFO L290 TraceCheckUtils]: 117: Hoare triple {38080#false} assume !false; {38080#false} is VALID [2022-04-15 09:30:29,803 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 76 proven. 49 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2022-04-15 09:30:29,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:31:32,386 WARN L232 SmtUtils]: Spent 34.22s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)